| Publication | Date of Publication | Type |
|---|
| LexBFS-orderings and powers of graphs | 2024-06-05 | Paper |
Homogeneously orderable graphs and the Steiner tree problem
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Finding dominating induced matchings in \(P_{10}\)-free graphs in polynomial time
Theoretical Computer Science | 2024-02-20 | Paper |
Dually chordal graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Short disjoint cycles in graphs with degree constraints
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Combining decomposition approaches for the maximum weight stable set problem
Theoretical Computer Science | 2023-05-19 | Paper |
| Leaf powers | 2022-12-21 | Paper |
| Dually and strongly chordal graphs | 2022-12-21 | Paper |
Finding dominating induced matchings in \(P_9\)-free graphs in polynomial time
Discussiones Mathematicae Graph Theory | 2022-07-26 | Paper |
| Distance approximating trees for chordal and dually chordal graphs (extended abstract) | 2021-12-20 | Paper |
Maximum weight independent sets for (\(S_{1,2,4}\), triangle)-free graphs in polynomial time
Theoretical Computer Science | 2021-07-22 | Paper |
Efficient domination for classes of \(P_6\)-free graphs
Discrete Applied Mathematics | 2021-06-07 | Paper |
Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
Discrete Applied Mathematics | 2020-07-07 | Paper |
Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
Discrete Applied Mathematics | 2020-06-29 | Paper |
On efficient domination for some classes of \(H\)-free chordal graphs
Discrete Applied Mathematics | 2020-05-29 | Paper |
Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
Discrete Applied Mathematics | 2020-04-21 | Paper |
On efficient domination for some classes of \(H\)-free bipartite graphs
Discrete Applied Mathematics | 2019-11-06 | Paper |
A dichotomy for weighted efficient dominating sets with bounded degree vertices
Information Processing Letters | 2018-12-05 | Paper |
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs
Discrete Applied Mathematics | 2018-10-26 | Paper |
| Efficient domination and efficient edge domination: a brief survey | 2018-06-05 | Paper |
| Tree-structured graphs | 2018-04-23 | Paper |
On efficient domination for some classes of \(H\)-free chordal graphs
Electronic Notes in Discrete Mathematics | 2018-04-09 | Paper |
Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
Discrete Applied Mathematics | 2018-02-22 | Paper |
Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
Discrete Applied Mathematics | 2018-01-11 | Paper |
Bounding the Clique‐Width of H‐Free Chordal Graphs
Journal of Graph Theory | 2017-09-26 | Paper |
Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
Algorithmica | 2017-05-02 | Paper |
Weighted efficient domination for \(P_5\)-free and \(P_6\)-free graphs
SIAM Journal on Discrete Mathematics | 2017-01-04 | Paper |
Weighted efficient domination for \(P_6\)-free and for \(P_5\)-free graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Discrete Applied Mathematics | 2016-11-02 | Paper |
Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Bounding the clique-width of \(H\)-free split graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
| Bounded Clique-Width of ($S_{1,2,2}$,Triangle)-Free Graphs | 2016-08-05 | Paper |
Clique cycle-transversals in distance-hereditary graphs
Discrete Applied Mathematics | 2016-06-22 | Paper |
Weighted efficient domination in two subclasses of \(P_6\)-free graphs
Discrete Applied Mathematics | 2016-02-04 | Paper |
Maximum weight independent sets in odd-hole-free graphs without dart or without bull
Graphs and Combinatorics | 2015-09-24 | Paper |
The Dilworth number of auto-chordal bipartite graphs
Graphs and Combinatorics | 2015-09-24 | Paper |
Bounding the clique-width of \(H\)-free chordal graphs
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Discrete Applied Mathematics | 2015-04-28 | Paper |
| Weighted Efficient Domination in Classes of $P_6$-free Graphs | 2015-03-20 | Paper |
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
Information Processing Letters | 2014-12-09 | Paper |
Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
Information Processing Letters | 2014-12-09 | Paper |
Dominating induced matchings for \(P_7\)-free graphs in linear time
Algorithmica | 2014-12-02 | Paper |
A note on efficient domination in a superclass of \(P_5\)-free graphs
Information Processing Letters | 2014-04-17 | Paper |
Corrigendum to ``Cycle transversals in perfect graphs and cographs
Theoretical Computer Science | 2013-12-11 | Paper |
New polynomial cases of the weighted efficient domination problem
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Efficient dominating and edge dominating sets for graphs and hypergraphs
Algorithms and Computation | 2013-03-21 | Paper |
Cycle transversals in perfect graphs and cographs
Theoretical Computer Science | 2013-02-19 | Paper |
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics | 2012-05-04 | Paper |
Maximum weight independent sets in hole- and co-chair-free graphs
Information Processing Letters | 2012-03-09 | Paper |
Path-bicolorable graphs
Graphs and Combinatorics | 2012-01-24 | Paper |
Dominating induced matchings for \(P _{7}\)-free graphs in linear time
Algorithms and Computation | 2011-12-16 | Paper |
On distance-3 matchings and induced matchings
Discrete Applied Mathematics | 2011-04-19 | Paper |
Independent sets of maximum weight in apple-free graphs
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Exact leaf powers
Theoretical Computer Science | 2010-07-07 | Paper |
Characterising \((k,\ell )\)-leaf powers
Discrete Applied Mathematics | 2010-05-05 | Paper |
Efficient edge domination on hole-free graphs in polynomial time
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Rooted directed path graphs are leaf powers
Discrete Mathematics | 2010-04-27 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On independent vertex sets in subclasses of apple-free graphs
Algorithmica | 2010-02-23 | Paper |
Structure and linear time recognition of 3-leaf powers
Information Processing Letters | 2010-01-18 | Paper |
Tree spanners for bipartite graphs and probe interval graphs.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Path-bicolorable graphs. (Extended abstract)
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
On distance-3 matchings and induced matchings
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers
Discrete Mathematics | 2009-12-09 | Paper |
The complete inclusion structure of leaf power classes
Theoretical Computer Science | 2009-11-25 | Paper |
Simplicial powers of graphs
Theoretical Computer Science | 2009-11-25 | Paper |
Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
Information Processing Letters | 2009-07-09 | Paper |
Maximum induced matchings for chordal graphs in linear time
Algorithmica | 2009-05-13 | Paper |
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters | 2009-03-23 | Paper |
Independent Sets of Maximum Weight in Apple-Free Graphs
Algorithms and Computation | 2009-01-29 | Paper |
Simplicial Powers of Graphs
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On k- Versus (k + 1)-Leaf Powers
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
On (k,ℓ)-Leaf Powers
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
| scientific article; zbMATH DE number 5279372 (Why is no real title available?) | 2008-05-27 | Paper |
Ptolemaic Graphs and Interval Graphs Are Leaf Powers
Lecture Notes in Computer Science | 2008-04-15 | Paper |
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science | 2008-01-07 | Paper |
Generalized Powers of Graphs and Their Algorithmic Use
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
The induced matching and chain subgraph cover problems for convex bipartite graphs
Theoretical Computer Science | 2007-09-03 | Paper |
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Distance-Hereditary 5-Leaf Powers
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Tree spanners for bipartite graphs and probe interval graphs
Algorithmica | 2007-03-05 | Paper |
New applications of clique separator decomposition for the maximum weight stable set problem
Theoretical Computer Science | 2007-02-26 | Paper |
Clique-width for 4-vertex forbidden subgraphs
Theory of Computing Systems | 2006-10-25 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
On algorithms for (\(P_5\), gem)-free graphs
Theoretical Computer Science | 2006-03-20 | Paper |
New graph classes of bounded clique-width
Theory of Computing Systems | 2006-02-08 | Paper |
GEM- AND CO-GEM-FREE GRAPHS HAVE BOUNDED CLIQUE-WIDTH
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Bisplit graphs
Discrete Mathematics | 2005-10-10 | Paper |
| scientific article; zbMATH DE number 2191997 (Why is no real title available?) | 2005-08-04 | Paper |
Split-Perfect Graphs: Characterizations and Algorithmic Use
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
On the structure of (\(P_{5}\),\,gem)-free graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics | 2005-02-22 | Paper |
On minimal prime extensions of a four-vertex graph in a prime graph
Discrete Mathematics | 2005-01-13 | Paper |
Tree spanners on chordal graphs: complexity and algorithms
Theoretical Computer Science | 2004-10-27 | Paper |
(\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
Discrete Applied Mathematics | 2004-03-29 | Paper |
On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
Discrete Applied Mathematics | 2003-12-04 | Paper |
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics | 2003-09-25 | Paper |
| scientific article; zbMATH DE number 1979496 (Why is no real title available?) | 2003-09-14 | Paper |
On variations of \(P_{4}\)-sparse graphs
Discrete Applied Mathematics | 2003-09-09 | Paper |
On linear and circular structure of (claw, net)-free graphs
Discrete Applied Mathematics | 2003-09-09 | Paper |
| scientific article; zbMATH DE number 1953082 (Why is no real title available?) | 2003-07-25 | Paper |
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
Information Processing Letters | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1839471 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1753165 (Why is no real title available?) | 2002-09-26 | Paper |
| A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs | 2002-07-21 | Paper |
| scientific article; zbMATH DE number 1696523 (Why is no real title available?) | 2002-07-14 | Paper |
On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
Information Processing Letters | 2002-07-14 | Paper |
A note on \(\alpha\)-redundant vertices in graphs
Discrete Applied Mathematics | 2001-09-03 | Paper |
On stable cutsets in graphs
Discrete Applied Mathematics | 2001-06-13 | Paper |
Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs
SIAM Journal on Computing | 2001-03-19 | Paper |
Recognizing the \(P_4\)-structure of block graphs
Discrete Applied Mathematics | 2000-07-16 | Paper |
| scientific article; zbMATH DE number 1420921 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1414320 (Why is no real title available?) | 2000-03-16 | Paper |
Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles
Graphs and Combinatorics | 2000-01-01 | Paper |
Powers of hhd-free graphs∗
International Journal of Computer Mathematics | 1999-10-27 | Paper |
Tree- and forest-perfect graphs
Discrete Applied Mathematics | 1999-09-22 | Paper |
On the stability number of claw-free \(P_5\)-free and more general graphs
Discrete Applied Mathematics | 1999-09-22 | Paper |
Recognizing the \(P_4\)-structure of bipartite graphs
Discrete Applied Mathematics | 1999-08-02 | Paper |
Convexity and HHD-Free Graphs
SIAM Journal on Discrete Mathematics | 1999-06-27 | Paper |
| Graph Classes: A Survey | 1999-05-24 | Paper |
The complexity of some problems related to GRAPH 3-COLORABILITY
Discrete Applied Mathematics | 1999-03-22 | Paper |
Distance Approximating Trees for Chordal and Dually Chordal Graphs
Journal of Algorithms | 1999-02-02 | Paper |
Dually Chordal Graphs
SIAM Journal on Discrete Mathematics | 1998-09-21 | Paper |
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Discrete Applied Mathematics | 1998-08-02 | Paper |
Homogeneously orderable graphs
Theoretical Computer Science | 1998-07-23 | Paper |
Duchet-type theorems for powers of HHD-free graphs
Discrete Mathematics | 1998-04-28 | Paper |
LexBFS-orderings and powers of chordal graphs
Discrete Mathematics | 1998-01-19 | Paper |
\(r\)-dominating cliques in graphs with hypertree structure
Discrete Mathematics | 1997-07-07 | Paper |
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
SIAM Journal on Discrete Mathematics | 1997-05-20 | Paper |
Partitions of graphs into one or two independent sets and cliques
Discrete Mathematics | 1996-12-12 | Paper |
Perfect elimination orderings of chordal powers of graphs
Discrete Mathematics | 1996-11-07 | Paper |
Short disjoint cycles in graphs with degree constraints
Discrete Applied Mathematics | 1996-07-07 | Paper |
| scientific article; zbMATH DE number 777378 (Why is no real title available?) | 1995-07-23 | Paper |
| scientific article; zbMATH DE number 512913 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 219252 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 17532 (Why is no real title available?) | 1992-06-26 | Paper |
Classes of bipartite graphs related to chordal graphs
Discrete Applied Mathematics | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4202309 (Why is no real title available?) | 1990-01-01 | Paper |
Uniform simulations of nondeterministic real time multitape turing machines
Mathematical Systems Theory | 1987-01-01 | Paper |
Bipartite permutation graphs
Discrete Applied Mathematics | 1987-01-01 | Paper |
On domination problems for permutation and other graphs
Theoretical Computer Science | 1987-01-01 | Paper |
The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4063153 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3970804 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4053621 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3963856 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3997796 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3898942 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3963195 (Why is no real title available?) | 1985-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 3900817 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3872703 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3880704 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3845055 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3808971 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3814971 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3980489 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3754044 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3767044 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3727634 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3754069 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3733281 (Why is no real title available?) | 1981-01-01 | Paper |
On a Property of Homogeneous Gaussian L-Fields
Theory of Probability & Its Applications | 1980-01-01 | Paper |
A relation between space, return and dual return complexities
Theoretical Computer Science | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3635231 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3649989 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3633719 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3597880 (Why is no real title available?) | 1977-01-01 | Paper |
