Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDKonrad K. Dabrowski
Konrad Kazimierz Dabrowski
Person information
- affiliation: Durham University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j29]Marthe Bonamy
, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83(3): 822-852 (2021)- 2020
- [j28]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82(10): 2841-2866 (2020) - [j27]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-width and well-quasi-ordering of triangle-free graph classes. J. Comput. Syst. Sci. 108: 64-91 (2020) - [j26]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. 34(2): 1107-1147 (2020) - [c23]Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov:
Fine-Grained Complexity of Temporal Problems. KR 2020: 284-293 - [c22]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. WG 2020: 119-133 - [i28]Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-Width: Harnessing the Power of Atoms. CoRR abs/2006.03578 (2020) - [i27]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Tree pivot-minors and linear rank-width. CoRR abs/2008.00561 (2020)
2010 – 2019
- 2019
- [j25]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P5-Free Graphs. Algorithmica 81(4): 1342-1369 (2019) - [j24]Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding clique-width via perfect graphs. J. Comput. Syst. Sci. 104: 202-215 (2019) - [j23]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Hereditary graph classes: When the complexities of coloring and clique cover coincide. J. Graph Theory 91(3): 267-289 (2019) - [j22]Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory 92(4): 377-393 (2019) - [c21]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CPM 2019: 20:1-20:14 - [c20]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. WADS 2019: 181-195 - [i26]Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Clique-Width for Hereditary Graph Classes. CoRR abs/1901.00335 (2019) - [i25]Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski:
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR abs/1908.00491 (2019) - [i24]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev:
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR abs/1910.05254 (2019) - 2018
- [j21]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131: 26-32 (2018) - [j20]Konrad K. Dabrowski, Daniël Paulusma:
On colouring (2P2, H)-free and (P5, H)-free graphs. Inf. Process. Lett. 134: 35-41 (2018) - [j19]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. Order 35(2): 253-274 (2018) - [j18]Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. Theor. Comput. Sci. 746: 36-48 (2018) - [c19]Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev:
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS 2018: 63:1-63:15 - [c18]Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma:
Computing Small Pivot-Minors. WG 2018: 125-138 - [i23]Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. CoRR abs/1808.03561 (2018) - [i22]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy. CoRR abs/1811.12252 (2018) - 2017
- [j17]Konrad K. Dabrowski, Daniël Paulusma:
Contracting Bipartite Graphs to Paths and Cycles. Electron. Notes Discret. Math. 61: 309-315 (2017) - [j16]Konrad K. Dabrowski, Daniël Paulusma:
Contracting bipartite graphs to paths and cycles. Inf. Process. Lett. 127: 37-42 (2017) - [j15]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: 168-182 (2017) - [j14]Konrad K. Dabrowski, François Dross, Daniël Paulusma:
Colouring diamond-free graphs. J. Comput. Syst. Sci. 89: 410-431 (2017) - [j13]Andreas Brandstädt, Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-Free Chordal Graphs. J. Graph Theory 86(1): 42-77 (2017) - [c17]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC 2017: 16:1-16:12 - [c16]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs. MFCS 2017: 70:1-70:14 - [c15]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. MFCS 2017: 73:1-73:14 - [c14]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-Width and Well-Quasi-Ordering of Triangle-Free Graph Classes. WG 2017: 220-233 - [i21]Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev:
Clique-Width for Graph Classes Closed under Complementation. CoRR abs/1705.07681 (2017) - [i20]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 abs/1705.09177 (2017) - [i19]Konrad Kazimierz Dabrowski, Daniël Paulusma:
Contracting Bipartite Graphs to Paths and Cycles. CoRR abs/1706.03750 (2017) - [i18]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR abs/1707.09383 (2017) - [i17]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR abs/1707.09402 (2017) - [i16]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR abs/1707.09817 (2017) - [i15]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes. CoRR abs/1711.08837 (2017) - [i14]Konrad K. Dabrowski, Daniël Paulusma:
On Colouring (2P2, H)-Free and (P5, H)-Free Graphs. CoRR abs/1712.02447 (2017) - 2016
- [j12]Konrad K. Dabrowski, Daniël Paulusma:
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. Comput. J. 59(5): 650-666 (2016) - [j11]Konrad Kazimierz Dabrowski, Daniël Paulusma:
Classifying the clique-width of H-free bipartite graphs. Discret. Appl. Math. 200: 43-51 (2016) - [j10]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the clique-width of H-free split graphs. Discret. Appl. Math. 211: 30-39 (2016) - [j9]Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev:
Combinatorics and Algorithms for Augmenting Graphs. Graphs Comb. 32(4): 1339-1352 (2016) - [j8]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian graphs. J. Comput. Syst. Sci. 82(2): 213-228 (2016) - [c13]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: 423-437 - [c12]Konrad K. Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. IWOCA 2016: 253-265 - [c11]Konrad K. Dabrowski, François Dross, Daniël Paulusma:
Colouring Diamond-free Graphs. SWAT 2016: 16:1-16:14 - [i13]Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma:
Colouring on Hereditary Graph Classes Closed under Complementation. CoRR abs/1607.06757 (2016) - [i12]Konrad Kazimierz Dabrowski, Vadim V. Lozin, Daniël Paulusma:
Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes. CoRR abs/1611.03671 (2016) - 2015
- [j7]Konrad K. Dabrowski, Vadim V. Lozin, Juraj Stacho:
Stable-iΠ partitions of graphs. Discret. Appl. Math. 182: 104-114 (2015) - [j6]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: 497-503 (2015) - [c10]Konrad K. Dabrowski, Daniël Paulusma:
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CIAC 2015: 167-181 - [c9]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: 143-156 - [c8]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA 2015: 100-111 - [c7]Konrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. LATA 2015: 676-688 - [c6]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. MFCS (2) 2015: 139-150 - [i11]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of H-free Chordal Graphs. CoRR abs/1502.06948 (2015) - [i10]Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. CoRR abs/1506.06564 (2015) - [i9]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 abs/1508.02773 (2015) - [i8]Andreas Brandstädt, Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding the Clique-Width of $H$-free Split Graphs. CoRR abs/1509.04273 (2015) - [i7]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 abs/1512.07849 (2015) - 2014
- [j5]Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of graphs with Ramsey-type forbidden subgraphs. Theor. Comput. Sci. 522: 34-43 (2014) - [c5]Konrad Kazimierz Dabrowski, Daniël Paulusma:
Classifying the Clique-Width of H-Free Bipartite Graphs. COCOON 2014: 489-500 - [c4]Konrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. FSTTCS 2014: 97-108 - [i6]Konrad K. Dabrowski, Daniël Paulusma:
Classifying the Clique-Width of $H$-Free Bipartite Graphs. CoRR abs/1402.7060 (2014) - [i5]Konrad K. Dabrowski, Daniël Paulusma:
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs. CoRR abs/1405.7092 (2014) - [i4]Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma:
Bounding Clique-Width via Perfect Graphs. CoRR abs/1406.6298 (2014) - [i3]Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma:
Editing to Eulerian Graphs. CoRR abs/1410.6863 (2014) - [i2]Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin, Victor Zamaraev:
Combinatorics and algorithms for augmenting graphs. CoRR abs/1410.8774 (2014) - 2013
- [j4]Konrad K. Dabrowski, Marc Demange, Vadim V. Lozin:
New results on maximum induced matchings in bipartite graphs and beyond. Theor. Comput. Sci. 478: 33-40 (2013) - [c3]Konrad K. Dabrowski, Petr A. Golovach, Daniël Paulusma:
Colouring of Graphs with Ramsey-Type Forbidden Subgraphs. WG 2013: 201-212 - [i1]Nicolas Bourgeois, Konrad K. Dabrowski, Marc Demange, Vangelis Th. Paschos:
Playing with Parameters: Cross-parameterization in Graphs. CoRR abs/1309.6144 (2013) - 2012
- [j3]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring vertices of triangle-free graphs without forests. Discret. Math. 312(7): 1372-1385 (2012) - [j2]Konrad K. Dabrowski, Vadim V. Lozin, Victor Zamaraev:
On factorial properties of chordal bipartite graphs. Discret. Math. 312(16): 2457-2465 (2012) - [j1]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: 207-213 (2012) - 2010
- [c2]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: 1-9 - [c1]Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries:
Colouring Vertices of Triangle-Free Graphs. WG 2010: 184-195
Coauthor Index
[j29] [j28] [j27] [j26] [c22] [i28] [i27] [j25] [j24] [j23] [j22] [c21] [c20] [i26] [i25] [i24] [j21] [j20] [j19] [c19] [c18] [i23] [i22] [j17] [j16] [j15] [j14] [j13] [c17] [c16] [c15] [c14] [i21] [i19] [i18] [i17] [i16] [i15] [i14] [j12] [j11] [j10] [j8] [c12] [c11] [i13] [i12] [j6] [c10] [c9] [c8] [c7] [c6] [i11] [i10] [i9] [i8] [i7] [j5] [c5] [c4] [i6] [i5] [i4] [i3] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-04-09 00:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
