Konrad K. Dabrowski

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 63

Top Topics

Bipartite Graph

Independent Set

Top Venues

J. Graph Theory

Publications

Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. 117 (2024)
Konrad K. Dabrowski, Eduard Eiben, Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider
Learning Small Decision Trees for Data of Low Rank-Width. AAAI (2024)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. SIAM J. Discret. Math. 38 (2) (2024)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Algorithms and Complexity of Difference Logic. CoRR (2024)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-width: Harnessing the power of atoms. J. Graph Theory 104 (4) (2023)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing pivot-minors. CoRR (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. IPEC (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. CoRR (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. SODA (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving infinite-domain CSPs using the patchwork property. Artif. Intell. 317 (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. AAAI (2022)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. WG (2022)
Laurent Bulteau, Konrad K. Dabrowski, Noleen Köhler, Sebastian Ordyniak, Daniël Paulusma
An Algorithmic Framework for Locally Constrained Homomorphisms. CoRR (2022)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Magnus Wahlström
Almost Consistent Systems of Linear Equations. CoRR (2022)
Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83 (3) (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Disjunctive Temporal Problems under Structural Restrictions. AAAI (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving Infinite-Domain CSPs Using the Patchwork Property. AAAI (2021)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Solving Infinite-Domain CSPs Using the Patchwork Property. CoRR (2021)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. 35 (4) (2021)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98 (1) (2021)
Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
Preface. BCC (2021)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108 (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. CoRR (2020)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov
Fine-Grained Complexity of Temporal Problems. KR (2020)
Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski
Clique-Width: Harnessing the Power of Atoms. WG (2020)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. 34 (2) (2020)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree pivot-minors and linear rank-width. CoRR (2020)
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82 (10) (2020)
Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
Finding a Small Number of Colourful Components. CPM (2019)
Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104 (2019)
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR (2019)
Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
)-Free Graphs: An Almost Complete Dichotomy. WADS (2019)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
-Free Graphs. Algorithmica 81 (4) (2019)
Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory 92 (4) (2019)
Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
Clique-Width for Hereditary Graph Classes. CoRR (2019)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
Hereditary graph classes: When the complexities of coloring and clique cover coincide. J. Graph Theory 91 (3) (2019)
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR (2019)
Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
Clique-width for hereditary graph classes. BCC (2019)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order 35 (2) (2018)
Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
Finding a Small Number of Colourful Components. CoRR (2018)
Konrad K. Dabrowski, Daniël Paulusma
)-free graphs. Inf. Process. Lett. 134 (2018)
Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
)-free Graphs: An Almost Complete Dichotomy. CoRR (2018)
Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
)-graph. Theor. Comput. Sci. 746 (2018)
Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS (2018)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing Small Pivot-Minors. WG (2018)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131 (2018)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing Graphs Close to Bipartite Graphs. MFCS (2017)
Konrad K. Dabrowski, Daniël Paulusma
Contracting Bipartite Graphs to Paths and Cycles. Electron. Notes Discret. Math. 61 (2017)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. CoRR (2017)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR (2017)
Konrad K. Dabrowski, Daniël Paulusma
Contracting bipartite graphs to paths and cycles. Inf. Process. Lett. 127 (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR (2017)
Konrad K. Dabrowski, François Dross, Daniël Paulusma
Colouring diamond-free graphs. J. Comput. Syst. Sci. 89 (2017)
Konrad K. Dabrowski, Daniël Paulusma
, H)-Free Graphs. CoRR (2017)
Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
Clique-Width for Graph Classes Closed under Complementation. MFCS (2017)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. CoRR (2017)
Konrad K. Dabrowski, François Dross, Daniël Paulusma
Colouring Diamond-free Graphs. SWAT (2016)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the clique-width of H-free split graphs. Discret. Appl. Math. 211 (2016)
Konrad K. Dabrowski, Daniël Paulusma
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. Comput. J. 59 (5) (2016)
Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. IWOCA (2016)
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
Editing to a Planar Graph of Given Degrees. CoRR (2015)
Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho
Stable-iΠ partitions of graphs. Discret. Appl. Math. 182 (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of $H$-free Split Graphs. CoRR (2015)
Konrad K. Dabrowski, Daniël Paulusma
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CIAC (2015)
Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs. CoRR (2015)
Konrad K. Dabrowski, Daniël Paulusma
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CoRR (2014)
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
Editing to Eulerian Graphs. CoRR (2014)
Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin, Victor Zamaraev
Combinatorics and algorithms for augmenting graphs. CoRR (2014)
Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
Colouring of graphs with Ramsey-type forbidden subgraphs. Theor. Comput. Sci. 522 (2014)
Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma
Bounding Clique-Width via Perfect Graphs. CoRR (2014)
Konrad K. Dabrowski, Daniël Paulusma
Classifying the Clique-Width of $H$-Free Bipartite Graphs. CoRR (2014)
Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin
New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478 (2013)
Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos
Playing with Parameters: Cross-parameterization in Graphs. CoRR (2013)
Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. WG (2013)
Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. J. Discrete Algorithms 14 (2012)
Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
Colouring vertices of triangle-free graphs without forests. Discret. Math. 312 (7) (2012)
Konrad K. Dabrowski, Vadim V. Lozin, Victor Zamaraev
On factorial properties of chordal bipartite graphs. Discret. Math. 312 (16) (2012)
Konrad K. Dabrowski, Vadim V. Lozin, Haiko Müller, Dieter Rautenbach
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. IWOCA (2010)
Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
Colouring Vertices of Triangle-Free Graphs. WG (2010)