Konrad K. Dabrowski

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