Konrad K. Dabrowski

Orcid: 0000-0001-9515-6945

Affiliations:
  • Durham University, UK


According to our database1, Konrad K. Dabrowski authored at least 56 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal.
Eur. J. Comb., March, 2024

An Algorithmic Framework for Locally Constrained Homomorphisms.
SIAM J. Discret. Math., 2024

Algorithms and Complexity of Difference Logic.
CoRR, 2024

Learning Small Decision Trees for Data of Low Rank-Width.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Clique-width: Harnessing the power of atoms.
J. Graph Theory, December, 2023

Solving infinite-domain CSPs using the patchwork property.
Artif. Intell., April, 2023

Computing pivot-minors.
CoRR, 2023

Almost Consistent Systems of Linear Equations.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Parameterized Complexity Classification for Interval Constraints.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

2022
Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Tree Pivot-Minors and Linear Rank-Width.
SIAM J. Discret. Math., 2021

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.
J. Graph Theory, 2021

Graph Isomorphism for (H<sub>1, H<sub>2)</sub></sub>-Free Graphs: An Almost Complete Dichotomy.
Algorithmica, 2021


Disjunctive Temporal Problems under Structural Restrictions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Clique-Width for Graph Classes Closed under Complementation.
SIAM J. Discret. Math., 2020

Clique-width and well-quasi-ordering of triangle-free graph classes.
J. Comput. Syst. Sci., 2020

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.
Algorithmica, 2020

Fine-Grained Complexity of Temporal Problems.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

2019
Filling the complexity gaps for colouring planar and bounded degree graphs.
J. Graph Theory, 2019

Hereditary graph classes: When the complexities of coloring and clique cover coincide.
J. Graph Theory, 2019

Bounding clique-width via perfect graphs.
J. Comput. Syst. Sci., 2019

Independent Feedback Vertex Set for P<sub>5</sub>-Free Graphs.
Algorithmica, 2019

Graph Isomorphism for (H<sub>1</sub>, H<sub>2</sub>)-Free Graphs: An Almost Complete Dichotomy.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Finding a Small Number of Colourful Components.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

Clique-width for hereditary graph classes.
Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018
On the (parameterized) complexity of recognizing well-covered (<i>r</i>, <i>ℓ</i>)-graph.
Theor. Comput. Sci., 2018

Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes.
Order, 2018

On colouring (2<i>P</i><sub>2</sub>, <i>H</i>)-free and (<i>P</i><sub>5</sub>, <i>H</i>)-free graphs.
Inf. Process. Lett., 2018

Independent feedback vertex sets for graphs of bounded diameter.
Inf. Process. Lett., 2018

Computing Small Pivot-Minors.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017
Bounding the Clique-Width of <i>H</i>-Free Chordal Graphs.
J. Graph Theory, 2017

Editing to a planar graph of given degrees.
J. Comput. Syst. Sci., 2017

Colouring diamond-free graphs.
J. Comput. Syst. Sci., 2017

Contracting bipartite graphs to paths and cycles.
Inf. Process. Lett., 2017

On Colouring (2P<sub>2</sub>, H)-Free and (P<sub>5</sub>, H)-Free Graphs.
CoRR, 2017

Recognizing Graphs Close to Bipartite Graphs.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Editing to Eulerian graphs.
J. Comput. Syst. Sci., 2016

Combinatorics and Algorithms for Augmenting Graphs.
Graphs Comb., 2016

Classifying the clique-width of H-free bipartite graphs.
Discret. Appl. Math., 2016

Bounding the clique-width of H-free split graphs.
Discret. Appl. Math., 2016

Colouring on Hereditary Graph Classes Closed under Complementation.
CoRR, 2016

Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
Comput. J., 2016

On the (Parameterized) Complexity of Recognizing Well-Covered (r, l)-graphs.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Stable-iΠ partitions of graphs.
Discret. Appl. Math., 2015

Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs.
CoRR, 2015

Bounding the Clique-Width of H-free Chordal Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
Colouring of graphs with Ramsey-type forbidden subgraphs.
Theor. Comput. Sci., 2014

2013
New results on maximum induced matchings in bipartite graphs and beyond.
Theor. Comput. Sci., 2013

Playing with Parameters: Cross-parameterization in Graphs.
CoRR, 2013

2012
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number.
J. Discrete Algorithms, 2012

On factorial properties of chordal bipartite graphs.
Discret. Math., 2012

Colouring vertices of triangle-free graphs without forests.
Discret. Math., 2012

2010
Colouring Vertices of Triangle-Free Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010


  Loading...