Papers

Manuscripts

[1] The Importance of Rank in Trick-Taking Card Games
with Abdallah Saffidine.
[2] Designing RNA secondary structures is NP-hard
with Paweł Rzążewski and Florian Sikora.
[3] Optimality Program in Segment and String graphs
with Paweł Rzążewski.
[4] Orthogonal Terrain Guarding is NP-complete
with Panos Giannopoulos.

International Conferences

[21] On the Parameterized Complexity of Red-Blue Points Separation
with Panos Giannopoulos and Michael Lampis. IPEC, 2017.
[20] Generalized feedback vertex set problems on bounded-treewidth graphs
with Nick Brettell, O-joung Kwon, and Dániel Marx. IPEC, 2017.
[19] The Parameterized Complexity of Positional Games
with Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, and Abdallah Saffidine. ICALP, 2017.
[18] Approximation Algorithm of the Art Gallery Problem
with Tillmann Miltzow. SoCG, 2017.
[17] Fine-grained complexity of coloring unit disks and balls
with Csaba Biró, Dániel Marx, Tillmann Miltzow, and Paweł Rzążewski. SoCG, 2017.
[16] Complexity of Token Swapping and its Variants
with Tillmann Miltzow and Paweł Rzążewski. STACS, 2017.
[15] Parameterized Hardness of Art Gallery Problems
with Tillmann Miltzow. ESA, 2016.
[14] Fixed-parameter Approximability of Boolean MinCSPs
with László Egri, and Dániel Marx. ESA, 2016.
[13] Parameterized vertex deletion problems for hereditary graph classes with a block property
with Nick Brettell, O-joung Kwon, and Dániel Marx. WG, 2016.
[12] The Complexity of Playing Durak
IJCAI, 2016.
[11] Time-Approximation Trade-offs for Inapproximable Problems
with Michael Lampis and Vangelis Th. Paschos. STACS, 2016.
[10] A 0.821-ratio purely combinatorial algorithm for maximum k-vertex cover in bipartite graphs
with Bruno Escoffier, Vangelis Th. Paschos, and Georgios Stamoulis. LATIN, 2016.
[9] The Graph Motif problem parameterized by the structure of the input graph
with Florian Sikora. IPEC, 2015.
[8] Complexity of grundy coloring and its variants
with Florent Foucaud, Eun Jung Kim, and Florian Sikora. COCOON, 2015.
[7] Draws, Zugzwangs, and PSPACE-completeness in the Slither Connection Game
with Florian Jamain and Abdallah Saffidine. ACG, 2015.
[6] On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
with Faisal N. Abu-Khzam and Florian Sikora. IWOCA, 2014.
[5] On the Complexity of General Game Playing
with Abdallah Saffidine. CGW, 2014.
[4] Multi-parameter complexity analysis for constrained size graph problems
with Bruno Escoffier, Vangelis Th. Paschos, and Émeric Tourniaire. IPEC, 2013.
[3] On subexponential and fpt-time inapproximability
with Bruno Escoffier, Eun Jung Kim, and Vangelis Th. Paschos. IPEC, 2013.
[2] On the complexity of trick-taking card games
with Florian Jamain and Abdallah Saffidine. IJCAI, 2013.
[1] Havannah and twixt are pspace-complete
with Florian Jamain and Abdallah Saffidine. CG, 2013.

International Journals

[13] Complexity of Token Swapping and its Variants
with Tillmann Miltzow and Paweł Rzążewski. Algorithmica, 2017.
[12] Time-Approximation Trade-offs for Inapproximable Problems
with Michael Lampis and Vangelis Th. Paschos. JCSS, 2017.
[11] Purely Combinatorial Approximation Algorithms for Maximum k-Vertex Cover in Bipartite Graphs
with Bruno Escoffier, Vangelis Th. Paschos, and Georgios Stamoulis. Discrete Optimization, 2017.
[10] On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
with Faisal N. Abu-Khzam and Florian Sikora. TCS, 2017.
[9] The Graph Motif problem parameterized by the structure of the input graph
with Florian Sikora. Discrete Applied Mathematics, 2017.
[8] Sparsification and subexponential approximation
with Vangelis Th. Paschos. Acta Informatica, 2017.
[7] Dual parameterization and parameterized approximability of subset graph problems
with Vangelis Th. Paschos. RAIRO, 2017.
[6] Multiparameterizations for max k-set cover and related satisfiability problems
with Vangelis Th. Paschos and Florian Sikora. RAIRO, 2016.
[5] On the Complexity of Connection Games
with Florian Jamain and Abdallah Saffidine. TCS, 2016.
[4] A Note on Edge Isoperimetric Numbers and Regular Graphs
with Florian Sikora. IJFCS, 2016.
[3] Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization
with Bruno Escoffier, Vangelis Th. Paschos, and Émeric Tourniaire. Algorithmica, 2015.
[2] On subexponential and fpt-time inapproximability
with Bruno Escoffier, Eun Jung Kim, and Vangelis Th. Paschos. Algorithmica, 2015.
[1] Parameterized (in)approximability of subset problems
with Vangelis Th. Paschos. Operations Research Letters, 2014.

Workshops and other contributions

[7] Fine-grained complexity of coloring unit disks and balls
with Csaba Biró, Dániel Marx, Tillmann Miltzow, and Paweł Rzążewski. EuroCG, 2017.
[6] Parameterized Hardness of Art Gallery Problems
with Tillmann Miltzow. EuroCG, 2016.
[5] An Approximation Algorithm for the Art Gallery Problem.
with Tillmann Miltzow. EuroCG, 2016.
[4] Flip Distance to a Non-crossing Perfect Matching
with Tillmann Miltzow. EuroCG, 2016.
[3] Complexité des Jeux (in french)
with Abdallah Saffidine. Invited article in Bulletin de la ROADEF, 2014.
[2] Using greediness for parameterization
ECCO, 2013.
[1] Balance between time complexity and approximation ratio.
ROADEF, 2013.

Last modified: 2017-10-13