| Publication | Date of Publication | Type |
|---|
Using contracted solution graphs for solving reconfiguration problems
Acta Informatica | 2019-10-17 | Paper |
Using contracted solution graphs for solving reconfiguration problems
| 2018-03-21 | Paper |
Rerouting shortest paths in planar graphs
Discrete Applied Mathematics | 2017-09-12 | Paper |
Tight lower and upper bounds for the complexity of canonical colour refinement
Theory of Computing Systems | 2017-08-15 | Paper |
A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
Algorithmica | 2017-03-03 | Paper |
Rerouting shortest paths in planar graphs
| 2017-01-26 | Paper |
Independent set reconfiguration in cographs and their generalizations
Journal of Graph Theory | 2016-10-13 | Paper |
The complexity of bounded length graph recoloring and CSP reconfiguration
Parameterized and Exact Computation | 2015-09-15 | Paper |
Independent set reconfiguration in cographs
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Tight bounds and a fast FPT algorithm for directed MAX-leaf spanning tree
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Reconfiguring independent sets in claw-free graphs
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
A constant factor approximation algorithm for unsplittable flow on paths
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
A constant-factor approximation algorithm for unsplittable flow on paths
SIAM Journal on Computing | 2014-07-30 | Paper |
The complexity of rerouting shortest paths
Theoretical Computer Science | 2014-01-13 | Paper |
The Fine Details of Fast Dynamic Programming over Tree Decompositions
Parameterized and Exact Computation | 2013-12-10 | Paper |
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
Lecture Notes in Computer Science | 2013-09-17 | Paper |
The complexity of rerouting shortest paths
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
The complexity of finding uniform sparsest cuts in various graph classes
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Surface split decompositions and subgraph isomorphism in graphs on surfaces
| 2012-08-23 | Paper |
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Counting hexagonal patches and independent sets in circle graphs
Algorithmica | 2012-04-26 | Paper |
Improved bounds for spanning trees with many leaves
Discrete Mathematics | 2012-04-13 | Paper |
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Extremal graphs having no matching cuts
Journal of Graph Theory | 2012-02-08 | Paper |
Feedback vertex set in mixed graphs
Lecture Notes in Computer Science | 2011-08-12 | Paper |
The complexity status of problems related to sparsest cuts
Lecture Notes in Computer Science | 2011-05-19 | Paper |
A characterization of extremal graphs with no matching-cut
| 2010-07-30 | Paper |
Most balanced minimum cuts
Discrete Applied Mathematics | 2010-05-05 | Paper |
Counting hexagonal patches and independent sets in circle graphs
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
The complexity of the matching-cut problem for planar graphs and other graph classes (extended abstract)
Lecture Notes in Computer Science | 2010-01-12 | Paper |
The complexity of the matching-cut problem for planar graphs and other graph classes
Journal of Graph Theory | 2009-12-18 | Paper |
Finding fullerene patches in polynomial time
Algorithms and Computation | 2009-12-17 | Paper |
Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
Theoretical Computer Science | 2009-11-06 | Paper |
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Finding Paths between Graph Colourings: Computational Complexity and Possible Distances
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Linear time algorithms for finding sparsest cuts in various graph classes
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Complexity results on restricted instances of a paint shop problem for words
Discrete Applied Mathematics | 2006-06-09 | Paper |
scientific article; zbMATH DE number 2230235 (Why is no real title available?)
| 2005-11-18 | Paper |
Sparsest cuts and concurrent flows in product graphs.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Edge-cuts leaving components of order at least three
Discrete Mathematics | 2002-12-02 | Paper |
