Konrad Kazimierz Dabrowski

Publication Activity (10 Years)

Years Active: 2014-2017
Publications (10 Years): 10

Top Topics

Graph Theoretic

Bipartite Graph

Top Venues

J. Comput. Syst. Sci.

Publications

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