| Publication | Date of Publication | Type |
|---|
Complexity framework for forbidden subgraphs III: when problems are tractable on subcubic graphs
| 2024-12-03 | Paper |
Independent transversals versus transversals
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
European Journal of Combinatorics | 2024-01-23 | Paper |
The complexity of matching games: a survey
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
Journal of Graph Theory | 2023-10-04 | Paper |
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
| 2023-05-02 | Paper |
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs
| 2023-05-01 | Paper |
Computing subset transversals in \(H\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Complexity Framework For Forbidden Subgraphs I: The Framework
| 2022-11-23 | Paper |
Steiner trees for hereditary graph classes
| 2022-10-13 | Paper |
Finding a small number of colourful components
| 2022-07-18 | Paper |
Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
Journal of Computer and System Sciences | 2022-05-16 | Paper |
Computing weighted subset transversals in \(H\)-free graphs
| 2022-03-25 | Paper |
What Graphs are 2-Dot Product Graphs?
International Journal of Computational Geometry & Applications | 2022-02-01 | Paper |
Computing subset transversals in \(H\)-free graphs
Theoretical Computer Science | 2022-01-18 | Paper |
scientific article; zbMATH DE number 7378380 (Why is no real title available?)
| 2021-08-04 | Paper |
Steiner trees for hereditary graph classes: a treewidth perspective
Theoretical Computer Science | 2021-04-15 | Paper |
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
Algorithmica | 2021-04-08 | Paper |
Clique-width for hereditary graph classes
Surveys in Combinatorics 2019 | 2021-02-06 | Paper |
Independent Feedback Vertex Set for P_5-free Graphs
| 2020-11-25 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Algorithmica | 2020-10-12 | Paper |
Computing Weighted Subset Transversals in $H$-Free Graphs
| 2020-07-28 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Journal of Graph Theory | 2020-07-17 | Paper |
Clique-width for graph classes closed under complementation
SIAM Journal on Discrete Mathematics | 2020-06-09 | Paper |
Computing Subset Transversals in $H$-Free Graphs
| 2020-05-28 | Paper |
Recognizing Graphs Close to Bipartite Graphs
| 2020-05-26 | Paper |
scientific article; zbMATH DE number 7204407 (Why is no real title available?)
| 2020-05-26 | Paper |
On cycle transversals and their connected variants in the absence of a small linear forest
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Algorithmica | 2020-01-16 | Paper |
Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy
| 2020-01-16 | Paper |
Surjective \(H\)-colouring: new hardness results
Computability | 2019-10-28 | Paper |
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
| 2019-10-11 | Paper |
Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide
Journal of Graph Theory | 2019-08-15 | Paper |
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
| 2019-08-01 | Paper |
Independent feedback vertex set for \(P_5\)-free graphs
Algorithmica | 2019-04-25 | Paper |
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy
| 2018-11-29 | Paper |
Connected vertex cover for \((sP_1+P_5)\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Enclosings of decompositions of complete multigraphs in 2-factorizations
Journal of Combinatorial Designs | 2018-10-05 | Paper |
Independent feedback vertex sets for graphs of bounded diameter
Information Processing Letters | 2017-12-13 | Paper |
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
Theoretical Computer Science | 2017-11-16 | Paper |
Obtaining online ecological colourings by generalizing first-fit
Theory of Computing Systems | 2017-11-07 | Paper |
Surjective \(H\)-colouring: new hardness results
| 2017-08-04 | Paper |
A survey on the computational complexity of coloring graphs with forbidden subgraphs
Journal of Graph Theory | 2017-04-21 | Paper |
A reconfigurations analogue of Brooks' theorem and its consequences
Journal of Graph Theory | 2016-11-17 | Paper |
What graphs are 2-dot product graphs?
| 2016-10-14 | Paper |
Kempe equivalence of colourings of cubic graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
Kempe equivalence of colourings of cubic graphs
European Journal of Combinatorics | 2016-10-12 | Paper |
Finding shortest paths between graph colourings
Algorithmica | 2016-09-07 | Paper |
The price of connectivity for cycle transversals
European Journal of Combinatorics | 2016-08-16 | Paper |
Filling the complexity gaps for colouring planar and bounded degree graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
The price of connectivity for cycle transversals
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Knocking out \(P_k\)-free graphs
Discrete Applied Mathematics | 2015-07-06 | Paper |
Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
A reconfigurations analogue of Brooks' theorem
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Knocking out \(P _{k }\)-free graphs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
Algorithms to measure diversity and clustering in social networks through dot product graphs
Algorithms and Computation | 2014-01-14 | Paper |
On the diameter of reconfiguration graphs for vertex colourings
| 2013-11-01 | Paper |
Finding paths between 3-colourings
| 2011-12-19 | Paper |
Path factors and parallel knock-out schemes of almost claw-free graphs
| 2011-12-19 | Paper |
Finding paths between 3-colorings
Journal of Graph Theory | 2011-05-11 | Paper |
Obtaining online ecological colourings by generalizing first-fit
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Path factors and parallel knock-out schemes of almost claw-free graphs
Discrete Mathematics | 2010-05-05 | Paper |
Mixing 3-colourings in bipartite graphs
European Journal of Combinatorics | 2009-11-30 | Paper |
Upper bounds and algorithms for parallel knock-out numbers
Theoretical Computer Science | 2009-03-30 | Paper |
The Computational Complexity of the Parallel Knock-Out Problem
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Mixing 3-Colourings in Bipartite Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
The computational complexity of the parallel knock-out problem
Theoretical Computer Science | 2008-04-15 | Paper |
Transversals of subtree hypergraphs and the source location problem in digraphs
Networks | 2008-03-12 | Paper |
Connectedness of the graph of vertex-colourings
Discrete Mathematics | 2008-02-14 | Paper |
Upper Bounds and Algorithms for Parallel Knock-Out Numbers
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Cycle decompositions of the complete graph.
| 2007-09-21 | Paper |
Amalgamations of factorizations of complete graphs
Journal of Combinatorial Theory. Series B | 2007-06-08 | Paper |
Amalgamations of factorizations of complete equipartite graphs
Discrete Mathematics | 2004-08-20 | Paper |
Characterization of graphs with hall number 2
Journal of Graph Theory | 2004-03-15 | Paper |
Amalgamations of connected \(k\)-factorizations.
Journal of Combinatorial Theory. Series B | 2003-08-17 | Paper |
An algorithm for finding factorizations of complete graphs
Journal of Graph Theory | 2003-06-25 | Paper |
Defining sets for Latin squares given that they are based on groups
European Journal of Combinatorics | 2003-04-09 | Paper |
SOME RESULTS ON THE OBERWOLFACH PROBLEM
Journal of the London Mathematical Society | 2002-10-22 | Paper |
Weak critical sets in cyclic Latin squares
The Australasian Journal of Combinatorics | 2001-07-17 | Paper |
Weak Uniquely Completable Sets for Finite Groups
Bulletin of the London Mathematical Society | 2000-06-22 | Paper |
