| Publication | Date of Publication | Type |
|---|
| Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | 2026-04-21 | Paper |
Diametral path graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Finding and counting small induced subgraphs efficiently
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Rankings of graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Dominoes
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Approximating the bandwidth for asteroidal triple-free graphs
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
Journal of Computer and System Sciences | 2021-10-28 | Paper |
| scientific article; zbMATH DE number 7378605 (Why is no real title available?) | 2021-08-04 | Paper |
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
Discrete Applied Mathematics | 2020-06-29 | Paper |
Enumeration of minimal connected dominating sets for chordal graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
Enumeration and maximum number of minimal dominating sets for chordal graphs
Theoretical Computer Science | 2019-08-13 | Paper |
Enumeration and maximum number of maximal irredundant sets for chordal graphs
Discrete Applied Mathematics | 2019-07-17 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Algorithmica | 2019-05-21 | Paper |
Treewidth and pathwidth of permutation graphs
Automata, Languages and Programming | 2019-03-29 | Paper |
Space-efficient biconnected components and recognition of outerplanar graphs
Algorithmica | 2019-03-11 | Paper |
Enumeration of maximal irredundant sets for claw-free graphs
Theoretical Computer Science | 2018-12-04 | Paper |
Computing square roots of graphs with low maximum degree
Discrete Applied Mathematics | 2018-09-17 | Paper |
Computing square roots of graphs with low maximum degree
Discrete Applied Mathematics | 2018-09-17 | Paper |
Exact algorithms for weak Roman domination
Discrete Applied Mathematics | 2018-09-17 | Paper |
Finding cactus roots in polynomial time
Theory of Computing Systems | 2018-08-03 | Paper |
Independent sets in asteroidal triple-free graphs
Automata, Languages and Programming | 2018-07-04 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Algorithmica | 2018-04-06 | Paper |
Space-efficient biconnected components and recognition of outerplanar graphs
(available as arXiv preprint) | 2018-03-21 | Paper |
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Enumeration and maximum number of maximal irredundant sets for chordal graphs
Graph-Theoretic Concepts in Computer Science | 2018-01-04 | Paper |
Enumeration and maximum number of minimal connected vertex covers in graphs
European Journal of Combinatorics | 2017-11-14 | Paper |
| A linear kernel for finding square roots of almost planar graphs | 2017-10-17 | Paper |
| Enumerating minimal connected dominating sets in graphs of bounded chordality | 2017-09-29 | Paper |
A linear kernel for finding square roots of almost planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
A linear kernel for finding square roots of almost planar graphs
Theoretical Computer Science | 2017-09-07 | Paper |
Enumeration of maximal irredundant sets for claw-free graphs
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Exact exponential algorithms to find tropical connected sets of minimum size
Theoretical Computer Science | 2017-05-11 | Paper |
Enumerating Minimal Tropical Connected Sets
SOFSEM 2017: Theory and Practice of Computer Science | 2017-04-04 | Paper |
| Squares of low clique number | 2017-02-14 | Paper |
Minimal dominating sets in interval graphs and trees
Discrete Applied Mathematics | 2016-11-24 | Paper |
Finding cactus roots in polynomial time
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Finding shortest paths between graph colourings
Algorithmica | 2016-09-07 | Paper |
| On treewidth approximations | 2016-07-01 | Paper |
Finding and counting small induced subgraphs efficiently
Information Processing Letters | 2016-06-16 | Paper |
Bandwidth of chain graphs
Information Processing Letters | 2016-06-09 | Paper |
An approximation algorithm for clustering graphs with dominating diametral path
Information Processing Letters | 2016-06-01 | Paper |
Total domination and transformation
Information Processing Letters | 2016-05-26 | Paper |
Faster Algorithms to Enumerate Hypergraph Transversals
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Enumerating minimal connected dominating sets in graphs of bounded chordality
Theoretical Computer Science | 2016-05-02 | Paper |
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Parameterized algorithms for finding square roots
Algorithmica | 2016-03-29 | Paper |
Parameterized algorithms for finding square roots
Algorithmica | 2016-03-29 | Paper |
Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
Lecture Notes in Computer Science | 2016-01-11 | Paper |
Enumerating minimal dominating sets in chordal bipartite graphs
Discrete Applied Mathematics | 2015-12-10 | Paper |
Algorithms solving the matching cut problem
Theoretical Computer Science | 2015-12-08 | Paper |
A measure \& conquer approach for the analysis of exact algorithms
Journal of the ACM | 2015-11-11 | Paper |
End-vertices of graph search algorithms
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Algorithms Solving the Matching Cut Problem
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Finding shortest paths between graph colourings
Parameterized and Exact Computation | 2015-09-15 | Paper |
Exact exponential algorithms to find a tropical connected set of minimum size
Parameterized and Exact Computation | 2015-09-15 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Algorithmica | 2015-09-02 | Paper |
List coloring in the absence of a linear forest
Algorithmica | 2015-03-02 | Paper |
Exact algorithms to clique-colour graphs
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
On exact algorithms for treewidth
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Exact algorithms for Kayles
Theoretical Computer Science | 2014-12-02 | Paper |
Enumerating minimal subset feedback vertex sets
Algorithmica | 2014-11-19 | Paper |
Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Finding clubs in graph classes
Discrete Applied Mathematics | 2014-08-22 | Paper |
Subset feedback vertex sets in chordal graphs
Journal of Discrete Algorithms | 2014-04-28 | Paper |
Exact Algorithms for Weak Roman Domination
Lecture Notes in Computer Science | 2014-01-17 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization
Information and Computation | 2014-01-16 | Paper |
Detecting induced minors in AT-free graphs
Theoretical Computer Science | 2014-01-09 | Paper |
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Theoretical Computer Science | 2013-12-11 | Paper |
The jump number problem: exact and parameterized
Parameterized and Exact Computation | 2013-12-10 | Paper |
Sparse square roots
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Automata, Languages, and Programming | 2013-08-06 | Paper |
Computing optimal Steiner trees in polynomial space
Algorithmica | 2013-08-05 | Paper |
Colorings with few colors: counting, enumeration and combinatorial bounds
Theory of Computing Systems | 2013-08-01 | Paper |
Cliques and clubs
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Detecting induced minors in AT-free graphs
Algorithms and Computation | 2013-03-21 | Paper |
Fully decomposable split graphs
European Journal of Combinatorics | 2013-01-24 | Paper |
An exact algorithm for subset feedback vertex set on chordal graphs
Parameterized and Exact Computation | 2013-01-07 | Paper |
A note on exact algorithms for vertex ordering problems on graphs
Theory of Computing Systems | 2012-12-06 | Paper |
Colouring AT-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Bicolored independent sets and bicliques
Information Processing Letters | 2012-07-20 | Paper |
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
On independent sets and bicliques in graphs
Algorithmica | 2012-04-26 | Paper |
Parameterized algorithm for eternal vertex cover
Information Processing Letters | 2012-03-19 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Theoretical Computer Science | 2012-01-09 | Paper |
Exact algorithms for Kayles
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
List coloring in the absence of a linear forest
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Bandwidth on AT-free graphs
Theoretical Computer Science | 2011-12-07 | Paper |
Branch and recharge: exact algorithms for generalized domination
Algorithmica | 2011-09-20 | Paper |
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Enumerating minimal subset feedback vertex sets
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Exact algorithms for \(L(2,1)\)-labeling of graphs
Algorithmica | 2011-03-02 | Paper |
Exact exponential algorithms.
Texts in Theoretical Computer Science. An EATCS Series | 2010-11-18 | Paper |
Colorings with few colors: counting, enumeration and combinatorial bounds
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Sort and Search: exact algorithms for generalized domination
Information Processing Letters | 2010-08-20 | Paper |
Measure and conquer
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing
Lecture Notes in Computer Science | 2010-06-22 | Paper |
A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Iterative compression and exact algorithms
Theoretical Computer Science | 2010-03-09 | Paper |
An exact algorithm for the maximum leaf spanning tree problem
Parameterized and Exact Computation | 2010-01-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Bandwidth on AT-free graphs
Algorithms and Computation | 2009-12-17 | Paper |
Fully decomposable split graphs
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Bandwidth of bipartite permutation graphs in polynomial time
Journal of Discrete Algorithms | 2009-12-10 | Paper |
| scientific article; zbMATH DE number 5605070 (Why is no real title available?) | 2009-09-19 | Paper |
Convex Recoloring Revisited: Complexity and Exact Algorithms
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Exact Algorithms for Treewidth and Minimum Fill-In
SIAM Journal on Computing | 2009-06-22 | Paper |
On a property of minimal triangulations
Discrete Mathematics | 2009-06-17 | Paper |
Branch and Recharge: Exact Algorithms for Generalized Domination
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Iterative Compression and Exact Algorithms
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
| Linear-time certifying recognition algorithms and forbidden induced subgraphs | 2009-01-15 | Paper |
Solving connected dominating set faster than \(2^n\)
Algorithmica | 2008-12-02 | Paper |
Faster Steiner Tree Computation in Polynomial-Space
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Exact Algorithms for L(2,1)-Labeling of Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Feedback vertex set on AT-free graphs
Discrete Applied Mathematics | 2008-09-10 | Paper |
A new characterization of HH-free graphs
Discrete Mathematics | 2008-09-04 | Paper |
An Exact Algorithm for the Minimum Dominating Clique Problem
Parameterized and Exact Computation | 2008-06-03 | Paper |
Solving Connected Dominating Set Faster Than 2 n
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Bandwidth of Bipartite Permutation Graphs in Polynomial Time
Lecture Notes in Computer Science | 2008-04-15 | Paper |
On Exact Algorithms for Treewidth
Lecture Notes in Computer Science | 2008-03-11 | Paper |
An exact algorithm for the minimum dominating clique problem
Theoretical Computer Science | 2007-10-18 | Paper |
Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Exact algorithms for graph homomorphisms
Theory of Computing Systems | 2007-09-06 | Paper |
Optimal Linear Arrangement of Interval Graphs
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
SIAM Journal on Computing | 2007-05-03 | Paper |
Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>)
SIAM Journal on Computing | 2007-05-03 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Improved bottleneck domination algorithms
Discrete Applied Mathematics | 2006-08-14 | Paper |
Minimal fill in O(\(n^{2.69}\)) time
Discrete Mathematics | 2006-03-29 | Paper |
On algorithms for (P₅, gem)-free graphs
Theoretical Computer Science | 2006-03-20 | 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 |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
On the structure of (\(P_{5}\),\,gem)-free graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2079335 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079402 (Why is no real title available?) | 2004-07-28 | Paper |
On treewidth approximations.
Discrete Applied Mathematics | 2004-03-14 | Paper |
Algorithms for graphs with small octopus
Discrete Applied Mathematics | 2004-01-26 | Paper |
Additive Tree Spanners
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
On the domination search number
Discrete Applied Mathematics | 2003-06-10 | Paper |
Approximating minimum cocolorings.
Information Processing Letters | 2003-01-21 | Paper |
Approximating Bandwidth by Mixing Layouts of Interval Graphs
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Dominating Pair Graphs
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1839437 (Why is no real title available?) | 2002-12-02 | Paper |
Kayles and Nimbers
Journal of Algorithms | 2002-09-30 | Paper |
On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1696531 (Why is no real title available?) | 2002-07-14 | Paper |
On the structure of graphs with bounded asteroidal number
Graphs and Combinatorics | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1696538 (Why is no real title available?) | 2002-07-09 | Paper |
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
Algorithmica | 2002-05-21 | Paper |
| On the structure of graphs with bounded asteroidal number | 2001-09-23 | Paper |
| Approximating bandwidth by mixing layouts of interval graphs | 2001-09-23 | Paper |
Efficient algorithms for graphs with few \(P_4\)'s
Discrete Mathematics | 2001-07-18 | Paper |
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
Journal of Algorithms | 2000-12-18 | Paper |
Tree-visibility orders
Discrete Mathematics | 2000-11-02 | Paper |
Domination and total domination on asteroidal triple-free graphs
Discrete Applied Mathematics | 2000-08-30 | Paper |
| scientific article; zbMATH DE number 1420922 (Why is no real title available?) | 2000-08-03 | Paper |
| scientific article; zbMATH DE number 1420489 (Why is no real title available?) | 2000-06-27 | Paper |
| scientific article; zbMATH DE number 1304325 (Why is no real title available?) | 2000-04-10 | Paper |
| scientific article; zbMATH DE number 1414315 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1414319 (Why is no real title available?) | 2000-03-16 | Paper |
Chordality and 2-factors in tough graphs
Discrete Applied Mathematics | 2000-01-30 | Paper |
On the vertex ranking problem for trapezoid, circular-arc and other graphs
Discrete Applied Mathematics | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1346509 (Why is no real title available?) | 1999-10-03 | Paper |
Independent Sets in Asteroidal Triple-Free Graphs
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
| scientific article; zbMATH DE number 1262790 (Why is no real title available?) | 1999-04-26 | Paper |
| scientific article; zbMATH DE number 1222606 (Why is no real title available?) | 1999-03-02 | Paper |
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
Journal of Graph Algorithms and Applications | 1998-10-28 | Paper |
| scientific article; zbMATH DE number 1107735 (Why is no real title available?) | 1998-10-19 | Paper |
On treewidth and minimum fill-in of asteroidal triple-free graphs
Theoretical Computer Science | 1998-07-23 | Paper |
Rankings of Graphs
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
Listing all Minimal Separators of a Graph
SIAM Journal on Computing | 1998-05-10 | Paper |
| scientific article; zbMATH DE number 1124601 (Why is no real title available?) | 1998-03-31 | Paper |
Measuring the vulnerability for classes of intersection graphs
Discrete Applied Mathematics | 1998-02-16 | Paper |
Width two posets are reconstructible
Discrete Mathematics | 1997-11-05 | Paper |
1-tough cocomparability graphs are hamiltonian
Discrete Mathematics | 1997-08-10 | Paper |
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
Information Processing Letters | 1997-02-28 | Paper |
Toughness, hamiltonicity and split graphs
Discrete Mathematics | 1997-01-26 | Paper |
| Minimal non-neighborhood-perfect graphs | 1996-07-14 | Paper |
Treewidth of Chordal Bipartite Graphs
Journal of Algorithms | 1996-05-28 | Paper |
Treewidth and Pathwidth of Permutation Graphs
SIAM Journal on Discrete Mathematics | 1996-02-20 | Paper |
Towards the reconstruction of posets
Order | 1995-08-24 | Paper |
On the complexity of graph reconstruction
Mathematical Systems Theory | 1995-02-14 | Paper |
A counterexample about poset reconstruction
Order | 1994-11-27 | Paper |
Dominating cliques in chordal graphs
Discrete Mathematics | 1994-09-15 | Paper |
On cocolourings and cochromatic numbers of graphs
Discrete Applied Mathematics | 1994-08-29 | Paper |
| scientific article; zbMATH DE number 512817 (Why is no real title available?) | 1994-03-10 | Paper |
Domination on Cocomparability Graphs
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
The complexity of coloring games on perfect graphs
Theoretical Computer Science | 1993-04-22 | Paper |
Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
Order | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 48751 (Why is no real title available?) | 1992-09-17 | Paper |
Some extremal results in cochromatic and dichromatic theory
Journal of Graph Theory | 1992-06-27 | Paper |
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
Discrete Mathematics | 1990-01-01 | Paper |
Domination in convex and chordal bipartite graphs
Information Processing Letters | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4031746 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4045183 (Why is no real title available?) | 1987-01-01 | Paper |
Finding the minimum bandwidth of an interval graph
Information and Computation | 1987-01-01 | Paper |
On domination problems for permutation and other graphs
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3997796 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3974992 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3919840 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3943870 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3880704 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3900817 (Why is no real title available?) | 1984-01-01 | Paper |
