Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes. - Konrad K. Dabrowski; Vadim V. Lozin; Haiko Müller; Dieter Rautenbach (IWOCA, 2010)

Colouring Vertices of Triangle-Free Graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (WG, 2010)

Colouring vertices of triangle-free graphs without forests. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (Discret. Math., 2012)

On factorial properties of chordal bipartite graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Victor Zamaraev (Discret. Math., 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)

Playing with Parameters: Cross-parameterization in Graphs. - Nicolas Bourgeois; Konrad K. Dabrowski; Marc Demange; Vangelis Th. Paschos (CoRR, 2013)

New results on maximum induced matchings in bipartite graphs and beyond. - Konrad K. Dabrowski; Marc Demange; Vadim V. Lozin (Theor. Comput. Sci., 2013)

Colouring of graphs with Ramsey-type forbidden subgraphs. - Konrad K. Dabrowski; Petr A. Golovach; Daniël Paulusma (Theor. Comput. Sci., 2014)

Bounding the Clique-Width of H-free Chordal Graphs. - Andreas Brandstädt; Konrad K. Dabrowski; Shenwei Huang; Daniël Paulusma (MFCS (2), 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)

Stable-iΠ partitions of graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Juraj Stacho (Discret. Appl. Math., 2015)

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 (COCOA, 2016)

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. - Konrad K. Dabrowski; Daniël Paulusma (Comput. J., 2016)

Colouring on Hereditary Graph Classes Closed under Complementation. - Alexandre Blanché; Konrad Kazimierz Dabrowski; Matthew Johnson 002; Daniël Paulusma (CoRR, 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)

Classifying the clique-width of H-free bipartite graphs. - Konrad Kazimierz Dabrowski; Daniël Paulusma (Discret. Appl. Math., 2016)

Combinatorics and Algorithms for Augmenting Graphs. - Konrad Kazimierz Dabrowski; Vadim V. Lozin; Dominique de Werra; Victor Zamaraev (Graphs Comb., 2016)

Editing to Eulerian graphs. - Konrad Kazimierz Dabrowski; Petr A. Golovach; Pim van 't Hof; Daniël Paulusma (J. Comput. Syst. Sci., 2016)

Independent Feedback Vertex Set for P_5-free Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (ISAAC, 2017)

Recognizing Graphs Close to Bipartite Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (MFCS, 2017)

On Colouring (2P2, H)-Free and (P5, H)-Free Graphs. - Konrad K. Dabrowski; Daniël Paulusma (CoRR, 2017)

Contracting bipartite graphs to paths and cycles. - Konrad K. Dabrowski; Daniël Paulusma (Inf. Process. Lett., 2017)

Colouring diamond-free graphs. - Konrad K. Dabrowski; François Dross; Daniël Paulusma (J. Comput. Syst. Sci., 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)

Bounding the Clique-Width of H-Free Chordal Graphs. - Andreas Brandstädt; Konrad Kazimierz Dabrowski; Shenwei Huang; Daniël Paulusma (J. Graph Theory, 2017)

Computing Small Pivot-Minors. - Konrad K. Dabrowski; François Dross; Jisu Jeong; Mamadou Moustapha Kanté; O-joung Kwon; Sang-il Oum; Daniël Paulusma (WG, 2018)

Independent feedback vertex sets for graphs of bounded diameter. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Inf. Process. Lett., 2018)

On colouring (2P2, H)-free and (P5, H)-free graphs. - Konrad K. Dabrowski; Daniël Paulusma (Inf. Process. Lett., 2018)

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. - Konrad K. Dabrowski; Vadim V. Lozin; Daniël Paulusma (Order, 2018)

On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. - Sancrey Rodrigues Alves; Konrad K. Dabrowski; Luérbio Faria; Sulamita Klein; Ignasi Sau; Uéverton S. Souza (Theor. Comput. Sci., 2018)

Clique-width for hereditary graph classes. - Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma (BCC, 2019)

Finding a Small Number of Colourful Components. - Laurent Bulteau; Konrad K. Dabrowski; Guillaume Fertin; Matthew Johnson 002; Daniël Paulusma; Stéphane Vialette (CPM, 2019)

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. - Marthe Bonamy; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma (WADS, 2019)

Independent Feedback Vertex Set for P5-Free Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Algorithmica, 2019)

Bounding clique-width via perfect graphs. - Konrad K. Dabrowski; Shenwei Huang; Daniël Paulusma (J. Comput. Syst. Sci., 2019)

Hereditary graph classes: When the complexities of coloring and clique cover coincide. - Alexandre Blanché; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2019)

Filling the complexity gaps for colouring planar and bounded degree graphs. - Konrad K. Dabrowski; François Dross; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2019)

Fine-Grained Complexity of Temporal Problems. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (KR, 2020)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (Algorithmica, 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)

Clique-Width for Graph Classes Closed under Complementation. - Alexandre Blanché; Konrad K. Dabrowski; Matthew Johnson 002; Vadim V. Lozin; Daniël Paulusma; Viktor Zamaraev (SIAM J. Discret. Math., 2020)

Disjunctive Temporal Problems under Structural Restrictions. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (AAAI, 2021)

Preface. - Konrad K. Dabrowski; Maximilien Gadouleau; Nicholas Georgiou; Matthew Johnson 002; George B. Mertzios; Daniël Paulusma (BCC, 2021)

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. - Marthe Bonamy; Nicolas Bousquet 001; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma; Théo Pierron (Algorithmica, 2021)

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 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)

Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (AAAI, 2022)

Parameterized Complexity Classification for Interval Constraints. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Marcin Pilipczuk; Roohani Sharma (IPEC, 2023)

Almost Consistent Systems of Linear Equations. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Magnus Wahlström (SODA, 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)

Solving infinite-domain CSPs using the patchwork property. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (Artif. Intell., 2023)

Clique-width: Harnessing the power of atoms. - Konrad K. Dabrowski; Tomás Masarík; Jana Novotná 001; Daniël Paulusma; Pawel Rzazewski (J. Graph Theory, 2023)

Learning Small Decision Trees for Data of Low Rank-Width. - Konrad K. Dabrowski; Eduard Eiben; Sebastian Ordyniak; Giacomo Paesani; Stefan Szeider (AAAI, 2024)

Algorithms and Complexity of Difference Logic. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov (CoRR, 2024)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Magnus Wahlström (CoRR, 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)

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. - Konrad K. Dabrowski; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Viktor Zamaraev (Eur. J. Comb., 2024)

Atoms Versus Avoiding Simplicial Vertices. - Karl Boddy; Konrad K. Dabrowski; Daniël Paulusma (CIAC (2), 2025)

Bounding Width on Graph Classes of Constant Diameter. - Konrad K. Dabrowski; Tala Eagling-Vose; Noleen Köhler; Sebastian Ordyniak; Daniël Paulusma (CoRR, 2025)

Finding d-Cuts in Probe H-Free Graphs. - Konrad K. Dabrowski; Tala Eagling-Vose; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (CoRR, 2025)