Login / Signup
Konrad Dabrowski
ORCID
Publication Activity (10 Years)
Years Active: 2010-2017
Publications (10 Years): 12
Top Topics
Bipartite Graph
Independent Set
Maximum Weight
Graph Mining
</>
Publications
</>
Alexandre Blanché
,
Konrad K. Dabrowski
,
Matthew Johnson
,
Vadim V. Lozin
,
Daniël Paulusma
,
Victor Zamaraev
Clique-Width for Graph Classes Closed under Complementation.
CoRR
(2017)
Konrad K. Dabrowski
,
Daniël Paulusma
, H)-Free Graphs.
CoRR
(2017)
Konrad K. Dabrowski
,
François Dross
,
Daniël Paulusma
Colouring Diamond-free Graphs.
SWAT
(2016)
Andreas Brandstädt
,
Konrad K. Dabrowski
,
Shenwei Huang
,
Daniël Paulusma
Bounding the clique-width of H-free split graphs.
Discret. Appl. Math.
211 (2016)
Konrad K. Dabrowski
,
Daniël Paulusma
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
Comput. J.
59 (5) (2016)
Konrad K. Dabrowski
,
Vadim V. Lozin
,
Daniël Paulusma
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.
IWOCA
(2016)
Konrad K. Dabrowski
,
Petr A. Golovach
,
Pim van 't Hof
,
Daniël Paulusma
,
Dimitrios M. Thilikos
Editing to a Planar Graph of Given Degrees.
CoRR
(2015)
Konrad K. Dabrowski
,
Vadim V. Lozin
,
Juraj Stacho
Stable-iΠ partitions of graphs.
Discret. Appl. Math.
182 (2015)
Andreas Brandstädt
,
Konrad K. Dabrowski
,
Shenwei Huang
,
Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs.
MFCS (2)
(2015)
Andreas Brandstädt
,
Konrad K. Dabrowski
,
Shenwei Huang
,
Daniël Paulusma
Bounding the Clique-Width of $H$-free Split Graphs.
CoRR
(2015)
Konrad K. Dabrowski
,
Daniël Paulusma
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
CIAC
(2015)
Andreas Brandstädt
,
Konrad K. Dabrowski
,
Shenwei Huang
,
Daniël Paulusma
Bounding the Clique-Width of H-free Chordal Graphs.
CoRR
(2015)
Konrad K. Dabrowski
,
Daniël Paulusma
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
CoRR
(2014)
Konrad K. Dabrowski
,
Petr A. Golovach
,
Pim van 't Hof
,
Daniël Paulusma
Editing to Eulerian Graphs.
CoRR
(2014)
Konrad K. Dabrowski
,
Dominique de Werra
,
Vadim V. Lozin
,
Victor Zamaraev
Combinatorics and algorithms for augmenting graphs.
CoRR
(2014)
Konrad K. Dabrowski
,
Petr A. Golovach
,
Daniël Paulusma
Colouring of graphs with Ramsey-type forbidden subgraphs.
Theor. Comput. Sci.
522 (2014)
Konrad K. Dabrowski
,
Shenwei Huang
,
Daniël Paulusma
Bounding Clique-Width via Perfect Graphs.
CoRR
(2014)
Konrad K. Dabrowski
,
Daniël Paulusma
Classifying the Clique-Width of $H$-Free Bipartite Graphs.
CoRR
(2014)
Konrad K. Dabrowski
,
Marc Demange
,
Vadim V. Lozin
New results on maximum induced matchings in bipartite graphs and beyond.
Theor. Comput. Sci.
478 (2013)
Nicolas Bourgeois
,
Konrad K. Dabrowski
,
Marc Demange
,
Vangelis Th. Paschos
Playing with Parameters: Cross-parameterization in Graphs.
CoRR
(2013)
Konrad K. Dabrowski
,
Petr A. Golovach
,
Daniël Paulusma
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs.
WG
(2013)
Konrad K. Dabrowski
,
Vadim V. Lozin
,
Haiko Müller
,
Dieter Rautenbach
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.
J. Discrete Algorithms
14 (2012)
Konrad K. Dabrowski
,
Vadim V. Lozin
,
Rajiv Raman
,
Bernard Ries
Colouring vertices of triangle-free graphs without forests.
Discret. Math.
312 (7) (2012)
Konrad K. Dabrowski
,
Vadim V. Lozin
,
Victor Zamaraev
On factorial properties of chordal bipartite graphs.
Discret. Math.
312 (16) (2012)
Konrad K. Dabrowski
,
Vadim V. Lozin
,
Haiko Müller
,
Dieter Rautenbach
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.
IWOCA
(2010)
Konrad K. Dabrowski
,
Vadim V. Lozin
,
Rajiv Raman
,
Bernard Ries
Colouring Vertices of Triangle-Free Graphs.
WG
(2010)