Konrad K. Dabrowski

According to our database, Konrad K. Dabrowski authored at least 56 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev

Eur. J. Comb., March, 2024

An Algorithmic Framework for Locally Constrained Homomorphisms.

Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma

SIAM J. Discret. Math., 2024

Algorithms and Complexity of Difference Logic.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

CoRR, 2024

Learning Small Decision Trees for Data of Low Rank-Width.

Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Clique-width: Harnessing the power of atoms.

Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski

J. Graph Theory, December, 2023

Solving infinite-domain CSPs using the patchwork property.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Artif. Intell., April, 2023

Computing pivot-minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

CoRR, 2023

Almost Consistent Systems of Linear Equations.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Complexity Classification for Interval Constraints.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022

Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Tree Pivot-Minors and Linear Rank-Width.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

SIAM J. Discret. Math., 2021

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

J. Graph Theory, 2021

Graph Isomorphism for (H_{1, H₂₎}-Free Graphs: An Almost Complete Dichotomy.

Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron

Algorithmica, 2021

Preface.

Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma

Proceedings of the Surveys in Combinatorics, 2021

Disjunctive Temporal Problems under Structural Restrictions.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Clique-Width for Graph Classes Closed under Complementation.

Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev

SIAM J. Discret. Math., 2020

Clique-width and well-quasi-ordering of triangle-free graph classes.

Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma

J. Comput. Syst. Sci., 2020

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.

Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski

Algorithmica, 2020

Fine-Grained Complexity of Temporal Problems.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019

Filling the complexity gaps for colouring planar and bounded degree graphs.

Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma

J. Graph Theory, 2019

Hereditary graph classes: When the complexities of coloring and clique cover coincide.

Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma

J. Graph Theory, 2019

Bounding clique-width via perfect graphs.

Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

J. Comput. Syst. Sci., 2019

Independent Feedback Vertex Set for P₅-Free Graphs.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Algorithmica, 2019

Graph Isomorphism for (H₁, H₂)-Free Graphs: An Almost Complete Dichotomy.

Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Finding a Small Number of Colourful Components.

Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Clique-width for hereditary graph classes.

Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma

Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018

On the (parameterized) complexity of recognizing well-covered (<i>r</i>, <i>ℓ</i>)-graph.

Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza

Theor. Comput. Sci., 2018

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.

Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma

Order, 2018

On colouring (2<i>P</i>₂, <i>H</i>)-free and (<i>P</i>₅, <i>H</i>)-free graphs.

Konrad K. Dabrowski, Daniël Paulusma

Inf. Process. Lett., 2018

Independent feedback vertex sets for graphs of bounded diameter.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Inf. Process. Lett., 2018

Computing Small Pivot-Minors.

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Bounding the Clique-Width of <i>H</i>-Free Chordal Graphs.

Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma

J. Graph Theory, 2017

Editing to a planar graph of given degrees.

Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos

J. Comput. Syst. Sci., 2017

Colouring diamond-free graphs.

Konrad K. Dabrowski, François Dross, Daniël Paulusma

J. Comput. Syst. Sci., 2017

Contracting bipartite graphs to paths and cycles.

Konrad K. Dabrowski, Daniël Paulusma

Inf. Process. Lett., 2017

On Colouring (2P₂, H)-Free and (P₅, H)-Free Graphs.

Konrad K. Dabrowski, Daniël Paulusma

CoRR, 2017

Recognizing Graphs Close to Bipartite Graphs.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.

Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Editing to Eulerian graphs.

Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

J. Comput. Syst. Sci., 2016

Combinatorics and Algorithms for Augmenting Graphs.

Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev

Graphs Comb., 2016

Classifying the clique-width of H-free bipartite graphs.

Konrad Kazimierz Dabrowski, Daniël Paulusma

Discret. Appl. Math., 2016

Bounding the clique-width of H-free split graphs.

Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

Discret. Appl. Math., 2016

Colouring on Hereditary Graph Classes Closed under Complementation.

Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma

CoRR, 2016

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.

Konrad K. Dabrowski, Daniël Paulusma

Comput. J., 2016

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.

Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Stable-iΠ partitions of graphs.

Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho

Discret. Appl. Math., 2015

Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs.

Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma

CoRR, 2015

Bounding the Clique-Width of H-free Chordal Graphs.

Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014

Colouring of graphs with Ramsey-type forbidden subgraphs.

Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma

Theor. Comput. Sci., 2014

2013

New results on maximum induced matchings in bipartite graphs and beyond.

Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin

Theor. Comput. Sci., 2013

Playing with Parameters: Cross-parameterization in Graphs.

Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos

CoRR, 2013

2012

Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.

Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach

J. Discrete Algorithms, 2012

On factorial properties of chordal bipartite graphs.

Konrad K. Dabrowski, Vadim V. Lozin, Victor Zamaraev

Discret. Math., 2012

Colouring vertices of triangle-free graphs without forests.

Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries

Discret. Math., 2012

2010

Colouring Vertices of Triangle-Free Graphs.

Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.

Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010