| Publication | Date of Publication | Type |
|---|
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 |
Counting independent sets in graphs with bounded bipartite pathwidth
Random Structures & Algorithms | 2023-10-12 | Paper |
Approximating the bandwidth for asteroidal triple-free graphs
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
Combinatorics, Probability and Computing | 2023-03-30 | Paper |
| Vertex ranking of asteroidal triple-free graphs | 2023-01-25 | Paper |
Counting weighted independent sets beyond the permanent
SIAM Journal on Discrete Mathematics | 2021-06-28 | Paper |
| Counting independent sets in graphs with bounded bipartite pathwidth | 2020-02-24 | Paper |
Counting independent sets in graphs with bounded bipartite pathwidth
(available as arXiv preprint) | 2020-02-24 | Paper |
Quasimonotone graphs
Discrete Applied Mathematics | 2019-11-27 | Paper |
Counting perfect matchings and the switch chain
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
Counting independent sets in cocomparability graphs
Information Processing Letters | 2019-02-13 | Paper |
Counting independent sets in cocomparability graphs
Information Processing Letters | 2019-02-13 | Paper |
Counting independent sets in graphs with bounded bipartite pathwidth
(available as arXiv preprint) | 2018-12-07 | Paper |
On rank-width of (diamond, even-hole)-free graphs
(available as arXiv preprint) | 2018-11-30 | Paper |
| On rank-width of (diamond, even-hole)-free graphs | 2018-11-30 | Paper |
Quasimonotone graphs
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
On the switch Markov chain for perfect matchings
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Independent sets in asteroidal triple-free graphs
Automata, Languages and Programming | 2018-07-04 | Paper |
On the switch Markov chain for perfect matchings
Journal of the ACM | 2018-05-17 | Paper |
| On treewidth approximations | 2016-07-01 | Paper |
Finding and counting small induced subgraphs efficiently
Information Processing Letters | 2016-06-16 | Paper |
Vertex ranking of asteroidal triple-free graphs
Information Processing Letters | 2016-06-09 | Paper |
Bandwidth of chain graphs
Information Processing Letters | 2016-06-09 | Paper |
Graph classes and the switch Markov chain for matchings
Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI | 2016-02-19 | Paper |
Partitioning a graph into disjoint cliques and a triangle-free graph
Discrete Applied Mathematics | 2015-07-06 | Paper |
An FPT certifying algorithm for the vertex-deletion problem
Lecture Notes in Computer Science | 2014-01-17 | Paper |
On the stable degree of graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Colouring AT-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Parameterized algorithms for the independent set problem in some hereditary graph classes
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On a disparity between relative cliquewidth and relative NLC-width
Discrete Applied Mathematics | 2010-05-25 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
On a property of minimal triangulations
Discrete Mathematics | 2009-06-17 | Paper |
Random walks on the vertices of transportation polytopes with constant number of sources
Random Structures & Algorithms | 2009-03-04 | Paper |
Feedback vertex set on AT-free graphs
Discrete Applied Mathematics | 2008-09-10 | Paper |
On stable cutsets in claw-free graphs and planar graphs
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Computing the branchwidth of interval graphs
Discrete Applied Mathematics | 2005-02-22 | Paper |
| scientific article; zbMATH DE number 2079356 (Why is no real title available?) | 2004-07-28 | Paper |
On treewidth approximations.
Discrete Applied Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2044920 (Why is no real title available?) | 2004-02-18 | 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 |
Splitting a graph into disjoint induced paths or cycles.
Discrete Applied Mathematics | 2003-09-25 | Paper |
On the domination search number
Discrete Applied Mathematics | 2003-06-10 | Paper |
On the structure of graphs with bounded asteroidal number
Graphs and Combinatorics | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1696531 (Why is no real title available?) | 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 |
Partial orders on weak orders convex subsets
Order | 2001-07-22 | 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 |
| scientific article; zbMATH DE number 1492078 (Why is no real title available?) | 2000-08-16 | Paper |
| scientific article; zbMATH DE number 1420489 (Why is no real title available?) | 2000-06-27 | Paper |
| scientific article; zbMATH DE number 1414315 (Why is no real title available?) | 2000-03-16 | 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 1304318 (Why is no real title available?) | 1999-11-02 | 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 |
Recognizing interval digraphs and interval bigraphs in polynomial time
Discrete Applied Mathematics | 1998-06-23 | Paper |
Rankings of Graphs
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
Measuring the vulnerability for classes of intersection graphs
Discrete Applied Mathematics | 1998-02-16 | Paper |
Partial orders and their convex subsets
Discrete Mathematics | 1997-06-10 | Paper |
The minimum broadcast time problem for several processor networks
Theoretical Computer Science | 1997-02-28 | Paper |
Toughness, hamiltonicity and split graphs
Discrete Mathematics | 1997-01-26 | Paper |
HAMILTONian circuits in chordal bipartite graphs
Discrete Mathematics | 1996-11-13 | Paper |
On edge perfectness and classes of bipartite graphs
Discrete Mathematics | 1996-03-25 | Paper |
Alternating cycle-free matchings
Order | 1994-05-15 | Paper |
Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
Information Processing Letters | 1993-12-15 | Paper |
A note on balanced immunity
Mathematical Systems Theory | 1993-05-17 | Paper |
Domination in convex and chordal bipartite graphs
Information Processing Letters | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4045182 (Why is no real title available?) | 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 3963856 (Why is no real title available?) | 1986-01-01 | Paper |
Thick Forests
(available as arXiv preprint) | N/A | Paper |
