Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Dabrowski, Konrad"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Colouring of graphs with Ramsey-type forbidden subgraphs
Konrad K. Dabrowski
,
Petr A. Golovach
,
Daniel Paulusma
Theoretical Computer Science
522
, 2014, pp. 34-43
Editing to Eulerian graphs
Konrad K. Dabrowski
,
Petr A. Golovach
,
Pim van 't Hof
,
Daniel Paulusma
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 97-108
Classifying the clique-width of
H
-free bipartite graphs
Konrad Kazimierz Dabrowski
,
Daniël Paulusma
Lecture Notes in Computer Science
8591
, 2014, pp. 489-500
New results on maximum induced matchings in bipartite graphs and beyond
Konrad K. Dabrowski
,
Marc Demange
,
Vadim V. Lozin
Theoretical Computer Science
478
, 2013, pp. 33-40
Colouring of graphs with ramsey-type forbidden subgraphs
Konrad K. Dabrowski
,
Petr A. Golovach
,
Daniël Paulusma
Lecture Notes in Computer Science
8165
, 2013, pp. 201-212
Colouring vertices of triangle-free graphs
Konrad Dabrowski
,
Vadim Lozin
,
Rajiv Raman
,
Bernard Ries
Lecture Notes in Computer Science
6410
, 2010, pp. 184-195