| Publication | Date of Publication | Type |
|---|
Complexity of vertex switching on edge-bicolored graphs
| 2020-02-06 | Paper |
Two edge-disjoint paths with length constraints
Theoretical Computer Science | 2019-10-18 | Paper |
Finding two edge-disjoint paths with length constraints
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Computing the optimal bridge between two convex polygons
Information Processing Letters | 2016-06-16 | Paper |
Parameterized complexity of finding connected induced subgraphs
Theoretical Computer Science | 2015-12-08 | Paper |
Obtaining split graphs by edge contraction
Theoretical Computer Science | 2015-12-08 | Paper |
Parameterized complexity of connected induced subgraph problems
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Obtaining split graphs by edge contraction
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Incompressibility of \(H\)-free edge modification problems
Algorithmica | 2015-05-04 | Paper |
Dual connectedness of edge-bicolored graphs and beyond
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Contracting few edges to remove forbidden induced subgraphs
Parameterized and Exact Computation | 2013-12-10 | Paper |
Incompressibility of \(H\)-free edge modification
Parameterized and Exact Computation | 2013-12-10 | Paper |
Parameterized complexity of even/odd subgraph problems
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Surviving rates of graphs with bounded treewidth for the firefighter problem
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
Algorithmica | 2011-03-30 | Paper |
Choosability of toroidal graphs without short cycles
Journal of Graph Theory | 2010-11-10 | Paper |
Parameterized complexity of even/odd subgraph problems
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
Algorithms and Computation | 2009-01-29 | Paper |
Labelling planar graphs without 4-cycles with a condition on distance two
Discrete Applied Mathematics | 2008-09-29 | Paper |
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
Parameterized and Exact Computation | 2008-06-03 | Paper |
The complexity of the locally connected spanning tree problem
Discrete Applied Mathematics | 2003-09-25 | Paper |
Parameterized complexity of vertex colouring
Discrete Applied Mathematics | 2003-06-10 | Paper |
Game chromatic index of \(k\)-degenerate graphs
Journal of Graph Theory | 2001-08-12 | Paper |
Stable 2-pairs and \((X,Y)\)-intersection graphs
Discrete Mathematics | 2001-07-05 | Paper |
On spanning 2-trees in a graph
Discrete Applied Mathematics | 1998-03-16 | Paper |
Computing Visibility Information in an Inaccurate Simple Polygon
International Journal of Computational Geometry & Applications | 1998-02-08 | Paper |
A linear-time algorithm for computing the intersection of all odd cycles in a graph
Discrete Applied Mathematics | 1997-08-03 | Paper |
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters | 1997-02-27 | Paper |
A generalization of perfect graphs?i-perfect graphs
| 1996-12-15 | Paper |
A generalization of line graphs: (X, Y)-intersection graphs
| 1996-08-13 | Paper |
Path decompositions of multigraphs
Journal of Graph Theory | 1996-03-10 | Paper |
Isomorphic tree spanner problems
Algorithmica | 1995-10-09 | Paper |
Tree Spanners
SIAM Journal on Discrete Mathematics | 1995-09-20 | Paper |
Spanners in graphs of bounded degree
Networks | 1995-09-19 | Paper |
scientific article; zbMATH DE number 434687 (Why is no real title available?)
| 1994-05-19 | Paper |
NP-completeness of minimum spanner problems
Discrete Applied Mathematics | 1994-03-10 | Paper |
On the SPANNING \(k\)-TREE problem
Discrete Applied Mathematics | 1993-11-30 | Paper |
The recognition of union trees
Information Processing Letters | 1993-06-29 | Paper |
On cycle double covers of line graphs
Discrete Mathematics | 1992-09-27 | Paper |
Edge colouring line graphs of unicyclic graphs
Discrete Applied Mathematics | 1992-06-28 | Paper |
NP-completeness of edge-colouring some restricted graphs
Discrete Applied Mathematics | 1992-06-25 | Paper |
