Manuscripts

Computing Maximum Matchings in Temporal Graphs
(with Mertzios G.B., Molter H., Niedermeier R., Zschoche P.)

Deleting edges to restrict the size of an epidemic in temporal networks
(with Enright J., Meeks K., Mertzios G.B.)

Distributed minimum vertex coloring and maximum independent set in chordal graphs
(with Konrad C.)

Graph classes with linear Ramsey numbers
(with Alecu B., Atminas A., Lozin V.V.)

How fast can we reach a target vertex in stochastic temporal graphs?
(with Akrida E.C., Mertzios G.B., Nikoletseas S., Raptopoulos C., Spirakis P.G.)

Linear Programming complementation and its application to fractional graph theory
(with Gadouleau M., Mertzios G.B.)

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
(with Dabrowski K., Johnson M., Paesani G., Paulusma D.)

Sliding Window Temporal Graph Coloring
(with Mertzios G.B., Molter H.)
Journal Publications

Cliquewidth for graph classes closed under complementation
SIAM Journal on Discrete Mathematics. (accepted) (with Blanché A., Dabrowski K., Johnson M., Lozin V.V., Paulusma D.)

Independent domination versus weighted independent domination
Information Processing Letters. 2020. Vol. 156. (with Lozin V.V., Malyshev D.S., Mosca R.)

Letter graphs and geometric grid classes of permutations: characterization and recognition
Discrete Applied Mathematics. (accepted) (with Alecu B., Lozin V.V., de Werra D.)

Temporal vertex cover with a sliding time window
Journal of Computer and System Sciences. 2020. Vol. 107. P. 108–123 (with Akrida E.C., Mertzios G.B., Spirakis P.G.)

Dominating induced matchings in graphs containing no long claw
Journal of Graph Theory. 2018. Vol. 88. No. 1. P. 18–39. (with Hertz A., Lozin V.V., Ries B., de Werra D.)

Infinitely many minimal classes of graphs of unbounded cliquewidth
Discrete Applied Mathematics. 2018. Vol. 248. P. 145–152. (with Collins A., Foniok J., Korpelainen N., Lozin V.V.)

Linear readonce and related Boolean functions
Discrete Applied Mathematics. 2018. Vol. 250. P. 16–27. (with Lozin V.V., Razgon I., Zamaraeva E., Zolotykh N.Yu.)

On forbidden induced subgraphs for unit disk graphs
Discrete & Computational Geometry. 2018. Vol. 60. No. 1. P. 57–97. (with Atminas A.)

Upper Domination: towards a dichotomy through boundary properties
Algorithmica. 2018. Vol. 80. No. 10. P. 2799–2817. (with AbouEisha H., Hussain S., Lozin V.V., Monnot J., Ries B.)

Wellquasiordering versus cliquewidth
Journal of Combinatorial Theory, Series B. 2018. Vol. 130. P. 1–18. (with Lozin V.V., Razgon I.)

More results on weighted independent domination
Theoretical Computer Science. 2017. Vol. 700. P. 63–74. (with Lozin V.V., Malyshev D.S., Mosca R.)

The structure and the number of P_{7}free bipartite graphs
European Journal of Combinatorics. 2017. Vol. 65. P. 143–153. (with Lozin V.V.)

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.)

A tolerancebased 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.)

Boundary properties of factorial classes of graphs
Journal of Graph Theory. 2015. Vol. 78. No. 3. P. 207–218. (with Lozin V.V.)

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.)

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.)

On factorial subclasses of clawfree graphs
Discrete Anal. Oper. Res.. 2013. Vol. 20. No. 6. P. 30–39. (In Russian)

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.)

On factorial properties of chordal bipartite graphs
Discrete Mathematics. 2012. Vol. 312. No. 16. P. 2457–2465. (with Dabrowski K., Lozin V.V.)

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.)

Almost all factorial subclasses of quasiline graphs with respect to one forbidden subgraph
Moscow Journal of Combinatorics and Number Theory. 2011. Vol. 1. No. 3. P. 277–286.

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

Computing Maximum Matchings in Temporal Graphs
STACS 2020 (with Mertzios G.B., Molter H., Niedermeier R., Zschoche P.)

Deleting edges to restrict the size of an epidemic in temporal networks
MFCS 2019 (with Enright J., Meeks K., Mertzios G.B.)

Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs
MFCS 2019 (with Konrad C.)

How fast can we reach a target vertex in stochastic temporal graphs?
ICALP 2019 (with Akrida E.C., Mertzios G.B., Nikoletseas S., Raptopoulos C., Spirakis P.G.)

Independent Transversals versus Transversals
EuroComb 2019 (with Dabrowski K., Johnson M., Paesani G., Paulusma D.)

Sliding window temporal graph coloring
AAAI 2019 (with Mertzios G.B., Molter H.)

Brief Ann.: Distributed Minimum Vertex Coloring and Maximum Independent Set in chordal graphs
PODC 2018 (with 2018)

Linear Ramsey numbers
IWOCA 2018 (with Atminas A., Lozin V.V.)

Linear cliquewidth of bicomplement reducible graphs
IWOCA 2018 (with Alecu B., Lozin V.V.)

On the price of independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
MFCS 2018 (with Dabrowski K., Johnson M., Paesani G., Paulusma D.)

Temporal vertex cover with a sliding time window
ICALP 2018 (with Akrida E.C., Mertzios G.B., Spirakis P.G.)

Cliquewidth for graph classes closed under complementation
MFCS 2017 (with Blanché A., Dabrowski K., Johnson M., Lozin V.V., Paulusma D.)

Letter graphs and geometric grid classes of permutations: characterization and recognition
IWOCA 2017 (with Alecu B., Lozin V.V., de Werra D.)

New Results on Weighted Independent Domination
WG 2017 (with Lozin V.V., Malyshev D.S., Mosca R.)

Specifying a positive threshold function via extremal points
ALT 2017 (with Lozin V.V., Razgon I., Zamaraeva E., Zolotykh N.Yu.)

The structure and the number of P_{7}free bipartite graphs
EuroComb 2017 (with Lozin V.V.)

A boundary property for upper domination
IWOCA 2016 (with AbouEisha H., Hussain S., Lozin V.V., Monnot J., Ries B.)

Wellquasiordering does not imply bounded cliquewidth
WG 2015 (with Lozin V.V., Razgon I.)