| Publication | Date of Publication | Type |
|---|
| Classes of intersection digraphs with good algorithmic properties | 2024-04-23 | Paper |
Classes of intersection digraphs with good algorithmic properties
Journal of Graph Theory | 2024-03-25 | Paper |
Complexity of graph covering problems
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Recognition of linear and star variants of leaf powers is in P
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Typical sequences revisited -- computing width parameters of graphs
Theory of Computing Systems | 2023-04-27 | Paper |
scientific article; zbMATH DE number 7650942 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Practical algorithms on partial k-trees with an application to domination-like problems
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Memory requirements for table computations in partial k-tree algorithms
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
The perfect matching cut problem revisited
Theoretical Computer Science | 2022-09-01 | Paper |
scientific article; zbMATH DE number 7559418 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
The perfect matching cut problem revisited
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
(available as arXiv preprint) | 2022-05-20 | Paper |
Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
Algorithmica | 2022-05-03 | Paper |
Generalized distance domination problems and their complexity on graphs of bounded mim-width
(available as arXiv preprint) | 2021-08-04 | Paper |
Hierarchical Clusterings of Unweighted Graphs
(available as arXiv preprint) | 2020-08-07 | Paper |
A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
(available as arXiv preprint) | 2020-08-05 | Paper |
Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width
(available as arXiv preprint) | 2020-05-27 | Paper |
Mim-width. I. Induced path problems
Discrete Applied Mathematics | 2020-04-21 | Paper |
Linear MIM-width of trees
(available as arXiv preprint) | 2020-02-24 | Paper |
Mim-width. II. The feedback vertex set problem
Algorithmica | 2020-01-16 | Paper |
Mim-width. III. Graph powers and generalized distance domination problems
Theoretical Computer Science | 2019-11-13 | Paper |
The teaching size: computable teachers and learners for universal languages
Machine Learning | 2019-08-23 | Paper |
Typical Sequences Revisited --- Computing Width Parameters of Graphs
(available as arXiv preprint) | 2019-05-09 | Paper |
FPT algorithms for domination in sparse graphs and beyond
Theoretical Computer Science | 2019-05-02 | Paper |
Maximum matching width: new characterizations and a fast algorithm for dominating set
Discrete Applied Mathematics | 2018-09-17 | Paper |
On satisfiability problems with a linear structure
(available as arXiv preprint) | 2018-04-10 | Paper |
Generalized distance domination problems and their complexity on graphs of bounded mim-width
(available as arXiv preprint) | 2018-03-09 | Paper |
A width parameter useful for chordal and co-comparability graphs
Theoretical Computer Science | 2017-11-16 | Paper |
Maximum matching width: new characterizations and a fast algorithm for dominating set
(available as arXiv preprint) | 2017-09-29 | Paper |
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
European Journal of Combinatorics | 2017-09-11 | Paper |
A width parameter useful for chordal and co-comparability graphs
Lecture Notes in Computer Science | 2017-05-05 | Paper |
| Recognizability equals definability for graphs of bounded treewidth and bounded chordality | 2016-10-14 | Paper |
Between treewidth and clique-width
Algorithmica | 2016-06-28 | Paper |
Computational complexity of covering three-vertex multigraphs
Theoretical Computer Science | 2015-12-08 | Paper |
Solving #SAT and MAXSAT by Dynamic Programming
Journal of Artificial Intelligence Research | 2015-10-29 | Paper |
Between treewidth and clique-width
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Mod-2 independence and domination in graphs
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Computational complexity of covering three-vertex multigraphs
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| Computing minimal triangulations in time \(O(n^{\alpha \log n}) = o(n^{2.376})\) | 2014-10-13 | Paper |
The graph formulation of the union-closed sets conjecture
European Journal of Combinatorics | 2014-10-08 | Paper |
Solving MaxSAT and \#SAT on structured CNF formulas
Lecture Notes in Computer Science | 2014-09-26 | Paper |
The graph formulation of the union-closed sets conjecture
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Theoretical Computer Science | 2014-01-13 | Paper |
Upper Bounds on Boolean-Width with Applications to Exact Algorithms
Parameterized and Exact Computation | 2013-12-10 | Paper |
Connecting Terminals and 2-Disjoint Connected Subgraphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics | 2013-01-24 | Paper |
Chordal digraphs
Theoretical Computer Science | 2013-01-07 | Paper |
FPT algorithms for domination in biclique-free graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Mike Fellows: Weaving the Web of Mathematics and Adventure
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Finding good decompositions for dynamic programming on dense graphs
Parameterized and Exact Computation | 2012-06-15 | Paper |
On the complexity of reconstructing H-free graphs from their Star Systems
Journal of Graph Theory | 2011-10-12 | Paper |
Boolean-width of graphs
Theoretical Computer Science | 2011-10-10 | Paper |
On the Boolean-width of a graph: structure and applications
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Generalized graph clustering: recognizing \((p,q)\)-cluster graphs
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics | 2010-05-25 | Paper |
Recognizing digraphs of Kelly-width 2
Discrete Applied Mathematics | 2010-05-25 | Paper |
Branchwidth of chordal graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
Discrete Applied Mathematics | 2010-04-28 | Paper |
Graph searching, elimination trees, and a generalization of bandwidth.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
A work-optimal coarse-grained PRAM algorithm for Lexicographically First Maximal Independent Set.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Chordal digraphs
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Boolean-width of graphs
Parameterized and Exact Computation | 2010-01-14 | Paper |
Feedback vertex set on graphs of low cliquewidth
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Interval Completion Is Fixed Parameter Tractable
SIAM Journal on Computing | 2009-11-06 | Paper |
| On the boolean-width of a graph: structure and applications | 2009-08-19 | Paper |
Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
Discrete Mathematics | 2009-06-17 | Paper |
Leaf Powers and Their Properties: Using the Trees
Algorithms and Computation | 2009-01-29 | Paper |
| scientific article; zbMATH DE number 5485472 (Why is no real title available?) | 2009-01-05 | Paper |
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Generation of Graphs with Bounded Branchwidth
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
Characterization and Recognition of Digraphs of Bounded Kelly-width
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Towards a Taxonomy of Techniques for Designing Parameterized Algorithms
Parameterized and Exact Computation | 2008-06-03 | Paper |
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics | 2008-05-13 | Paper |
On the Complexity of Reconstructing H-free Graphs from Their Star Systems
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Graph Drawing | 2007-08-28 | Paper |
| PRO: a model for the design and analysis of efficient and scalable parallel algorithms | 2007-08-24 | Paper |
Planar decompositions and the crossing number of graphs with an excluded minor
The New York Journal of Mathematics | 2007-07-16 | Paper |
Planar decompositions and the crossing number of graphs with an excluded minor
The New York Journal of Mathematics | 2007-07-16 | Paper |
Planar decompositions and the crossing number of graphs with an excluded minor
The New York Journal of Mathematics | 2007-07-16 | Paper |
Edge-maximal graphs of branchwidth k
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Tree-decompositions of small pathwidth
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
| scientific article; zbMATH DE number 2149351 (Why is no real title available?) | 2005-03-30 | Paper |
Tree-decompositions of small pathwidth
Discrete Applied Mathematics | 2005-02-22 | Paper |
Graph searching, elimination trees, and a generalization of bandwidth
Algorithmica | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2111730 (Why is no real title available?) | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2080268 (Why is no real title available?) | 2004-08-04 | Paper |
Iterated colorings of graphs.
Discrete Mathematics | 2004-03-14 | Paper |
Graph coloring on coarse grained multicomputers
Discrete Applied Mathematics | 2003-09-25 | Paper |
Multicoloring trees.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1953094 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1926662 (Why is no real title available?) | 2003-06-11 | Paper |
| scientific article; zbMATH DE number 1696533 (Why is no real title available?) | 2002-07-22 | Paper |
A practical algorithm for making filled graphs minimal
Theoretical Computer Science | 2000-12-12 | Paper |
Memory requirements for table computations in partial \(k\)-tree algorithms
Algorithmica | 2000-08-27 | 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 1375584 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1375584 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1303600 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1236360 (Why is no real title available?) | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1202982 (Why is no real title available?) | 1999-01-11 | 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 |
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics | 1998-02-09 | Paper |
Making an arbitrary filled graph minimal by removing fill edges
Algorithm Theory — SWAT'96 | 1998-02-08 | Paper |
| scientific article; zbMATH DE number 617552 (Why is no real title available?) | 1994-10-03 | Paper |
Efficient sets in partial \(k\)-trees
Discrete Applied Mathematics | 1993-11-30 | Paper |
On a Combinatorial Problem Arising in Machine Teaching
(available as arXiv preprint) | N/A | Paper |
