| Publication | Date of Publication | Type |
|---|
| Recognizing \(H\)-graphs -- beyond circular-arc graphs | 2024-12-03 | Paper |
Computational complexity of covering disconnected multigraphs
Discrete Applied Mathematics | 2024-11-06 | Paper |
| The parametrized complexity of the segment number | 2024-10-14 | Paper |
| Three edge-disjoint plane spanning paths in a point set | 2024-06-21 | Paper |
| Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) | 2024-05-03 | Paper |
List covering of regular multigraphs with semi-edges
Algorithmica | 2024-03-25 | Paper |
Complexity of graph covering problems
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Drawing Simultaneously Embedded Graphs with Few Bends
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
The Rique-number of graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Computational Complexity of Covering Disconnected Multigraphs
(available as arXiv preprint) | 2023-06-10 | Paper |
List covering of regular multigraphs
(available as arXiv preprint) | 2022-08-30 | Paper |
| Computational complexity of covering disconnected multigraphs | 2022-05-20 | Paper |
List covering of regular multigraphs with semi-edges
(available as arXiv preprint) | 2022-04-08 | Paper |
Cops, a fast robber and defensive domination on interval graphs
Theoretical Computer Science | 2019-10-16 | Paper |
On vertex- and empty-ply proximity drawings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Testing Planarity of Partially Embedded Graphs
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Parameterized complexity of distance labeling and uniform channel assignment problems
Discrete Applied Mathematics | 2018-09-17 | Paper |
Homothetic polygons and beyond: maximal cliques in intersection graphs
Discrete Applied Mathematics | 2018-09-06 | Paper |
3-connected reduction for regular graph covers
European Journal of Combinatorics | 2018-08-24 | Paper |
Cops and robbers on intersection graphs
European Journal of Combinatorics | 2018-06-28 | Paper |
| Bounded stub resolution for some maximal 1-planar graphs | 2018-06-05 | Paper |
Completion of the mixed unit interval graphs hierarchy
Journal of Graph Theory | 2018-04-27 | Paper |
Extending partial representations of interval graphs
Algorithmica | 2017-10-09 | Paper |
MSOL restricted contractibility to planar graphs
Theoretical Computer Science | 2017-05-11 | Paper |
Extending partial representations of proper and unit interval graphs
Algorithmica | 2017-05-02 | Paper |
Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Simultaneous orthogonal planarity
Lecture Notes in Computer Science | 2017-02-21 | Paper |
2-layer fan-planarity: from caterpillar to stegosaurus
Lecture Notes in Computer Science | 2017-02-10 | Paper |
| Algorithmic Aspects of Regular Graph Covers | 2016-09-10 | Paper |
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems
Lecture Notes in Computer Science | 2016-09-02 | Paper |
On the hardness of switching to a small number of edges
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Cops and Robbers on String Graphs
Algorithms and Computation | 2016-01-11 | Paper |
Computational complexity of covering three-vertex multigraphs
Theoretical Computer Science | 2015-12-08 | Paper |
Completion of the mixed unit interval graphs hierarchy
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Planar embeddings with small and uniform faces
Algorithms and Computation | 2015-09-11 | Paper |
Contact representations of planar graphs: extending a partial representation is hard
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Extending partial representations of subclasses of chordal graphs
Theoretical Computer Science | 2015-05-18 | Paper |
Mod-2 independence and domination in graphs
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Drawing simultaneously embedded graphs with few bends
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Firefighting on square, hexagonal, and triangular grids
Discrete Mathematics | 2014-10-31 | Paper |
Computational complexity of covering three-vertex multigraphs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Locally constrained graph homomorphisms -- structure, complexity, and applications
Computer Science Review | 2014-10-07 | Paper |
Extending partial representations of proper and unit interval graphs
Lecture Notes in Computer Science | 2014-09-02 | Paper |
Locally injective \(k\)-colourings of planar graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
Algorithmic aspects of regular graph covers with applications to planar graphs
Automata, Languages, and Programming | 2014-07-01 | Paper |
| Testing planarity of partially embedded graphs | 2014-05-22 | Paper |
On Switching to H‐Free Graphs
Journal of Graph Theory | 2014-05-22 | Paper |
Determining the \(L(2,1)\)-span in polynomial space
Discrete Applied Mathematics | 2014-04-22 | Paper |
Guest editors' foreword
Discrete Applied Mathematics | 2014-04-02 | Paper |
| Parameterized problems related to Seidel's switching | 2014-03-25 | Paper |
Can they cross? and how? (the hitchhiker's guide to the universe of geometric intersection graphs)
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
A Kuratowski-type theorem for planarity of partially embedded graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry | 2014-03-24 | Paper |
Fast exact algorithm for \(L(2,1)\)-labeling of graphs
Theoretical Computer Science | 2014-01-16 | Paper |
Cops and robbers on intersection graphs
Lecture Notes in Computer Science | 2014-01-14 | Paper |
The planar slope number of planar partial 3-trees of bounded degree
Graphs and Combinatorics | 2013-07-19 | Paper |
Intersection graphs of homothetic polygons
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Non-crossing connectors in the plane
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Extending Partial Representations of Subclasses of Chordal Graphs
Algorithms and Computation | 2013-03-21 | Paper |
Beyond homothetic polygons: recognition and maximum clique
Algorithms and Computation | 2013-03-21 | Paper |
A Kuratowski-type theorem for planarity of partially embedded graphs
Computational Geometry | 2013-03-07 | Paper |
MSOL restricted contractibility to planar graphs
Parameterized and Exact Computation | 2013-01-07 | Paper |
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Determining the \(L(2,1)\)-span in polynomial space
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Cluster vertex deletion: a parameterization between vertex cover and clique-width
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Extending partial representations of function graphs and permutation graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Segment representation of a subclass of co-planar graphs
Discrete Mathematics | 2012-05-30 | Paper |
Distance three labelings of trees
Discrete Applied Mathematics | 2012-05-11 | Paper |
Parameterized complexity of generalized domination problems
Discrete Applied Mathematics | 2012-05-11 | Paper |
On the complexity of reconstructing H-free graphs from their Star Systems
Journal of Graph Theory | 2011-10-12 | Paper |
Branch and recharge: exact algorithms for generalized domination
Algorithmica | 2011-09-20 | Paper |
Fast exact algorithm for \(L(2,1)\)-labeling of graphs
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Extending partial representations of interval graphs
Lecture Notes in Computer Science | 2011-07-01 | Paper |
On the computational complexity of degenerate unit distance representations of graphs
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Parameterized complexity of coloring problems: treewidth versus vertex cover
Theoretical Computer Science | 2011-05-18 | Paper |
Exact algorithms for \(L(2,1)\)-labeling of graphs
Algorithmica | 2011-03-02 | Paper |
Sort and Search: exact algorithms for generalized domination
Information Processing Letters | 2010-08-20 | Paper |
Max-tolerance graphs as intersection graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
Graph Drawing | 2010-04-27 | Paper |
Faithful representations of graphs by islands in the extended grid
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Pursuing a fast robber on a graph
Theoretical Computer Science | 2010-03-09 | Paper |
Clustered planarity: small clusters in cycles and Eulerian graphs
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Parameterized Complexity of Generalized Domination Problems
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Complexity of hypergraph coloring and Seidel's switching.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
The capture time of a graph
Discrete Mathematics | 2009-12-15 | Paper |
On the computation of the hull number of a graph
Discrete Mathematics | 2009-12-15 | Paper |
Untangling a planar graph
Discrete & Computational Geometry | 2009-12-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Geometric Intersection Graphs: Do Short Cycles Help?
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
Graph Drawing | 2009-03-03 | Paper |
Branch and Recharge: Exact Algorithms for Generalized Domination
Lecture Notes in Computer Science | 2009-02-17 | Paper |
On Switching to H-Free Graphs
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Exact Algorithms for L(2,1)-Labeling of Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
Parameterized and Exact Computation | 2008-06-03 | Paper |
| On the complexity of the balanced vertex ordering problem | 2008-05-27 | Paper |
Generalized Domination in Degenerate Graphs: A Complete Dichotomy of Computational Complexity
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Distance Constrained Labelings of Trees
Lecture Notes in Computer Science | 2008-05-27 | Paper |
On the computational complexity of partial covers of theta graphs
Discrete Applied Mathematics | 2008-04-16 | Paper |
On the Complexity of Reconstructing H-free Graphs from Their Star Systems
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Moving Vertices to Make Drawings Plane
Graph Drawing | 2008-03-25 | Paper |
Clustered Planarity: Small Clusters in Eulerian Graphs
Graph Drawing | 2008-03-25 | Paper |
| scientific article; zbMATH DE number 5158488 (Why is no real title available?) | 2007-05-29 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
Algorithmica | 2006-08-16 | Paper |
| Edge decompositions of multigraphs into multi-2-paths | 2006-08-09 | Paper |
Coloring mixed hypertrees
Discrete Applied Mathematics | 2006-04-28 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Systems of distant representatives
Discrete Applied Mathematics | 2005-02-22 | Paper |
Computing the branchwidth of interval graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
Mixed hypercacti
Discrete Mathematics | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2089219 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2081019 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2044943 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 2044507 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1974112 (Why is no real title available?) | 2003-09-03 | Paper |
Partial covers of graphs
Discussiones Mathematicae Graph Theory | 2003-08-21 | Paper |
Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1953103 (Why is no real title available?) | 2003-07-25 | Paper |
On the complexity of bicoloring clique hypergraphs of graphs
Journal of Algorithms | 2003-05-14 | Paper |
On the injective chromatic number of graphs
Discrete Mathematics | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1834670 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1696541 (Why is no real title available?) | 2002-07-09 | Paper |
Fixed-parameter complexity of \(\lambda\)-labelings
Discrete Applied Mathematics | 2002-03-29 | Paper |
Representing graphs by disks and balls (a survey of recognition-complexity results)
Discrete Mathematics | 2001-10-07 | Paper |
Efficient algorithms for graphs with few \(P_4\)'s
Discrete Mathematics | 2001-07-18 | Paper |
Hom-properties are uniquely factorizable into irreducible factors
Discrete Mathematics | 2000-11-29 | Paper |
Complexity of choosing subsets from color sets
Discrete Mathematics | 2000-11-02 | Paper |
| scientific article; zbMATH DE number 1445283 (Why is no real title available?) | 2000-10-16 | Paper |
| scientific article; zbMATH DE number 1420920 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1420902 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1223713 (Why is no real title available?) | 2000-06-04 | Paper |
Independent sets with domination constraints
Discrete Applied Mathematics | 2000-03-20 | Paper |
| scientific article; zbMATH DE number 1229626 (Why is no real title available?) | 2000-02-09 | Paper |
| scientific article; zbMATH DE number 1341914 (Why is no real title available?) | 2000-01-03 | Paper |
Rankings of Directed Graphs
SIAM Journal on Discrete Mathematics | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1304318 (Why is no real title available?) | 1999-11-02 | Paper |
| scientific article; zbMATH DE number 1303524 (Why is no real title available?) | 1999-08-16 | Paper |
| scientific article; zbMATH DE number 1236360 (Why is no real title available?) | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1262792 (Why is no real title available?) | 1999-03-15 | Paper |
On the computational complexity of (O,P)-partition problems
Discussiones Mathematicae Graph Theory | 1998-11-08 | Paper |
On intersection representations of co-planar graphs
Discrete Mathematics | 1998-10-19 | Paper |
| scientific article; zbMATH DE number 1154597 (Why is no real title available?) | 1998-10-19 | Paper |
Graphs maximal with respect to hom-properties
Discussiones Mathematicae Graph Theory | 1998-09-28 | Paper |
| Brooks-type theorems for choosability with separation | 1998-09-07 | Paper |
Covering regular graphs
Journal of Combinatorial Theory. Series B | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1107736 (Why is no real title available?) | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1107734 (Why is no real title available?) | 1998-06-11 | Paper |
| scientific article; zbMATH DE number 1033812 (Why is no real title available?) | 1997-11-25 | Paper |
Transversal partitioning in balanced hypergraphs
Discrete Applied Mathematics | 1997-11-18 | Paper |
Covering and coloring polygon-circle graphs
Discrete Mathematics | 1997-09-24 | Paper |
| scientific article; zbMATH DE number 921905 (Why is no real title available?) | 1996-10-13 | Paper |
| scientific article; zbMATH DE number 811560 (Why is no real title available?) | 1996-07-17 | Paper |
| scientific article; zbMATH DE number 794265 (Why is no real title available?) | 1995-09-10 | Paper |
The complexity of induced minors and related problems
Algorithmica | 1995-07-19 | Paper |
| scientific article; zbMATH DE number 772747 (Why is no real title available?) | 1995-07-12 | Paper |
| scientific article; zbMATH DE number 772747 (Why is no real title available?) | 1995-07-12 | Paper |
Intersection graphs of segments
Journal of Combinatorial Theory. Series B | 1995-01-05 | Paper |
Regular codes in regular graphs are difficult
Discrete Mathematics | 1994-11-03 | Paper |
A special planar satisfiability problem and a consequence of its NP- completeness
Discrete Applied Mathematics | 1994-09-27 | Paper |
Intersection dimensions of graph classes
Graphs and Combinatorics | 1994-09-26 | Paper |
Algorithmic complexity of list colorings
Discrete Applied Mathematics | 1994-07-18 | Paper |
Satisfiability of co-nested formulas
Acta Informatica | 1994-06-02 | Paper |
| scientific article; zbMATH DE number 475588 (Why is no real title available?) | 1994-01-06 | Paper |
One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
SIAM Journal on Computing | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 125469 (Why is no real title available?) | 1993-02-21 | Paper |
Thresholds for classes of intersection graphs
Discrete Mathematics | 1993-01-17 | Paper |
Compatible 2-factors
Discrete Applied Mathematics | 1992-09-27 | Paper |
Proportional graphs
Random Structures & Algorithms | 1992-06-25 | Paper |
String graphs. II: Recognizing string graphs is NP-hard
Journal of Combinatorial Theory. Series B | 1991-01-01 | Paper |
String graphs requiring exponential representations
Journal of Combinatorial Theory. Series B | 1991-01-01 | Paper |
Noncrossing Subgraphs in Topological Layouts
SIAM Journal on Discrete Mathematics | 1991-01-01 | Paper |
String graphs. I: The number of critical nonstring graphs is infinite
Journal of Combinatorial Theory. Series B | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4200260 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4210053 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4142090 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4134101 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4168533 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4128763 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4070305 (Why is no real title available?) | 1988-01-01 | Paper |
On Restricted Two-Factors
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
On the number of Hamiltonian cycles in triangulations
Journal of Graph Theory | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4065032 (Why is no real title available?) | 1987-01-01 | Paper |
Perfect codes over graphs
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3981198 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3922532 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3897238 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3838075 (Why is no real title available?) | 1983-01-01 | Paper |
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
(available as arXiv preprint) | N/A | Paper |
On a Combinatorial Problem Arising in Machine Teaching
(available as arXiv preprint) | N/A | Paper |
On the Structure of Hamiltonian Graphs with Small Independence Number
(available as arXiv preprint) | N/A | Paper |
