Konrad Kazimierz Dabrowski

18 papers C 3Misc 2Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
Bounding the Clique-Width of
J. Graph Theory
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2017 J jnl
Contracting Bipartite Graphs to Paths and Cycles.
CoRR
Konrad Kazimierz Dabrowski, Daniël Paulusma
2017 J jnl
Editing to a planar graph of given degrees.
J. Comput. Syst. Sci.
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2017 J jnl
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs.
CoRR
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza
2016 J jnl
Classifying the clique-width of H-free bipartite graphs.
Discret. Appl. Math.
Konrad Kazimierz Dabrowski, Daniël Paulusma
2016 J jnl
Colouring on Hereditary Graph Classes Closed under Complementation.
CoRR
Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma
2016 J jnl
Combinatorics and Algorithms for Augmenting Graphs.
Graphs Comb.
Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev
2016 J jnl
Editing to Eulerian graphs.
J. Comput. Syst. Sci.
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma
2016 C conf
On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.
COCOA
Sancrey Rodrigues Alves, Konrad Kazimierz Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton dos Santos Souza
2016 J jnl
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.
CoRR
Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma
2015 C conf
Bounding Clique-Width via Perfect Graphs.
LATA
Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2015 J jnl
Bounding the Clique-Width of H-free Split Graphs.
Electron. Notes Discret. Math.
Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma
2015 Misc conf
Editing to a Planar Graph of Given Degrees.
CSR
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos
2015 C conf
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
IWOCA
Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2015 J jnl
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs.
CoRR
Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2015 J jnl
Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs.
CoRR
Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma
2014 Misc conf
Classifying the Clique-Width of H-Free Bipartite Graphs.
COCOON
Konrad Kazimierz Dabrowski, Daniël Paulusma
2014 — conf
Editing to Eulerian Graphs.
FSTTCS
Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma