Manuscripts
1. Clique-width for graph classes closed under complementation
(with Blanché A., Dabrowski K., Johnson M., Lozin V.V., Paulusma D.)
Accepted
18. Dominating induced matchings in graphs containing no long claw
Journal of Graph Theory (with Hertz A., Lozin V.V., Ries B., de Werra D.)
17. On forbidden induced subgraphs for unit disk graphs
Discrete & Computational Geometry (with Atminas A.)
16. Well-quasi-ordering versus clique-width
Journal of Combinatorial Theory, Series B (with Lozin V.V., Razgon I.)
15. In finitely many minimal classes of graphs of unbounded clique-width
Discrete Applied Mathematics (with Collins A., Foniok J., Korpelainen N., Lozin V.V.)
14. Upper Domination: towards a dichotomy through boundary properties
Algorithmica (with AbouEisha H., Hussain S., Lozin V.V., Monnot J., Ries B.)
Journal Publications
13. More results on weighted independent domination
Theoretical Computer Science. 2017. Vol. 700. P. 63–74 (with Lozin V.V., Malyshev D.S., Mosca R.)
12. The structure and the number of P7-free bipartite graphs
European Journal of Combinatorics. 2017. Vol. 65. P. 143–153. (with Lozin V.V.)
11. Combinatorics and algorithms for augmenting graphs
Graphs and Combinatorics. 2016. Vol. 32. No. 4, P. 1339–1352. (with Dabrowski K., Lozin V.V., de Werra D.)
10. A tolerance-based heuristic approach for the weighted independent set problem
Journal of Combinatorial Optimization. 2015. Vol. 29. No. 2. P. 433–450. (with Malyshev D.S., Pardalos P.M., et al.)
9. Boundary properties of factorial classes of graphs
Journal of Graph Theory. 2015. Vol. 78. No. 3. P. 207–218. (with Lozin V.V.)
8. Implicit representations and factorial properties of graphs
Discrete Mathematics. 2015. Vol. 338. No. 2. P. 164–179. (with Atminas A., Collins A., Lozin V.V.)
7. Measures of uncertainty in market network analysis
Physica A: Statistical Mechanics and its Applications. 2014. Vol. 413. No. 1. P. 59–70. (with Kalyagin V.A., Koldanov A.P., Koldanov P.A., Pardalos P.M.)
6. On factorial subclasses of claw-free graphs
Discrete Anal. Oper. Res.. 2013. Vol. 20. No. 6. P. 30–39. (In Russian)
5. Locally bounded coverings and factorial properties of graphs
European Journal of Combinatorics. 2012. Vol. 33. No. 4. P. 534–543. (with Lozin V.V., Mayhill C.)
4. On factorial properties of chordal bipartite graphs
Discrete Mathematics. 2012. Vol. 312. No. 16. P. 2457–2465. (with Dabrowski K., Lozin V.V.)
3. A note on the speed of hereditary graph properties
Electronic Journal of Combinatorics. 2011. Vol. 18. No. 1. P. 1–14. (with Lozin V.V., Mayhill C.)
2. Almost all factorial subclasses of quasi-line graphs with respect to one forbidden subgraph
Moscow Journal of Combinatorics and Number Theory. 2011. Vol. 1. No. 3. P. 277–286.
1. On estimation of the number of graphs in some hereditary classes
Diskretn. Mat.. 2011. Vol. 23. No. 3. P. 57–62. (In Russian)
Conference Publications
7. Clique-width for graph classes closed under complementation
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
LIPIcs. 2076. Vol. 83. P. 73:1–73:14. (with Blanché A., Dabrowski K., Johnson M., Lozin V.V., Paulusma D.)
6. Letter graphs and geometric grid classes of permutations: characterization and recognition
Proceedings of the 28th International Workshop on Combinatorial Algorithms (IWOCA 2017)
To appear. (with Alecu B., Lozin V.V., de Werra D.)
5. New Results on Weighted Independent Domination
Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2017)
LNCS. 2017. Vol. 10520. P. 399–411. (with Lozin V.V., Malyshev D.S., Mosca R.)
4. Specifying a positive threshold function via extremal points
Proceedings of the 28th International Conference on Algorithmic Learning Theory (ALT 2017)
PMLR. 2017. Vol. 76. P. 208–222 (with Lozin V.V., Razgon I., Zamaraeva E., Zolotykh N.Yu.)
3. The structure and the number of P7-free bipartite graphs
Proceedings of the 9th European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2017)
ENDM. 2017. Vol. 61. P. 827–833 (with Lozin V.V.)
2. A boundary property for upper domination
Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
LNCS. 2016. Vol. 9843. P. 229–240. (with AbouEisha H., Hussain S., Lozin V.V., Monnot J., Ries B.)
1. Well-quasi-ordering does not imply bounded clique-width
Proceedings of the 41th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015)
LNCS. 2016. Vol. 9224. P. 351–359. (with Lozin V.V., Razgon I.)