( en | de | ru )

 

Disambiguation of "Dabrowski, Konrad Kazimierz"

Author of the publication

copydeleteadd this publication to your clipboard
On the (parameterized) complexity of recognizing well-covered (r, l)-graphs.

, , , , , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Marylena Dabrowski

Karl Dabrowski

Kazimierz Pellech

Kazimierz Schalla

Erwin Dabrowski

 

Other publications of authors with the same name

Classifying the Clique-Width of H-Free Bipartite Graphs., and . COCOON, volume 8591 of Lecture Notes in Computer Science, page 489-500. Springer, (2014)Editing to a planar graph of given degrees., , , , and . J. Comput. Syst. Sci., (2017)Colouring on Hereditary Graph Classes Closed under Complementation., , , and . CoRR, (2016)Classifying the clique-width of H-free bipartite graphs., and . Discret. Appl. Math., (2016)Bounding Clique-Width via Perfect Graphs., , and . LATA, volume 8977 of Lecture Notes in Computer Science, page 676-688. Springer, (2015)Combinatorics and Algorithms for Augmenting Graphs., , , and . Graphs Comb., 32 (4): 1339-1352 (2016)Editing to a Planar Graph of Given Degrees., , , , and . CSR, volume 9139 of Lecture Notes in Computer Science, page 143-156. Springer, (2015)On the (parameterized) complexity of recognizing well-covered (r, l)-graphs., , , , , and . CoRR, (2017)Editing to Eulerian graphs., , , and . J. Comput. Syst. Sci., 82 (2): 213-228 (2016)Editing to Eulerian Graphs., , , and . FSTTCS, volume 29 of LIPIcs, page 97-108. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)