| Publication | Date of Publication | Type |
|---|
| Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters | 2024-11-14 | Paper |
Parameterized problems complete for nondeterministic FPT time and logarithmic space
Information and Computation | 2024-10-08 | Paper |
NC-algorithms for graphs with small treewidth
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
On Interval Routing Schemes and treewidth
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
scientific article; zbMATH DE number 7803587 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-12 | Paper |
Reduction algorithms for constructing solutions in graphs with small treewidth
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Rankings of graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
On reduction algorithms for graphs with small treewidth
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Dynamic algorithms for graphs with treewidth 2
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Domino treewidth
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
scientific article; zbMATH DE number 7764095 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-13 | Paper |
An ETH-Tight Exact Algorithm for Euclidean TSP
SIAM Journal on Computing | 2023-06-09 | Paper |
Problems hard for treewidth but easy for stable gonality
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Problems hard for treewidth but easy for stable gonality
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
| Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem | 2023-05-02 | 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 |
| Treewidth is NP-Complete on Cubic Graphs (and related results) | 2023-01-24 | Paper |
Knot diagrams of treewidth two
(available as arXiv preprint) | 2022-12-21 | Paper |
The pathwidth and treewidth of cographs
SWAT 90 | 2022-12-09 | Paper |
Testing superperfection of k-trees
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Triangulating planar graphs while minimizing the maximum degree
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Constructing tree decompositions of graphs with bounded gonality
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
| Steiner trees for hereditary graph classes | 2022-10-13 | Paper |
A simple linear time algorithm for triangulating three-colored graphs
STACS 92 | 2022-08-18 | Paper |
Distributed computing on transitive networks: the torus
STACS 89 | 2022-08-16 | Paper |
Dynamic sampling from a discrete probability distribution with a known distribution of rates
Computational Statistics | 2022-07-15 | Paper |
| From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability | 2022-07-13 | Paper |
Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation}
(available as arXiv preprint) | 2022-06-08 | Paper |
Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes
(available as arXiv preprint) | 2021-10-04 | Paper |
Parameterized Complexity of Conflict-Free Graph Coloring
SIAM Journal on Discrete Mathematics | 2021-09-17 | Paper |
Stable divisorial gonality is in NP
Theory of Computing Systems | 2021-06-24 | Paper |
Constructing tree decompositions of graphs with bounded gonality
Lecture Notes in Computer Science | 2021-04-21 | Paper |
Steiner trees for hereditary graph classes: a treewidth perspective
Theoretical Computer Science | 2021-04-15 | Paper |
A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
SIAM Journal on Computing | 2021-01-13 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Algorithmica | 2020-11-11 | Paper |
Stable divisorial gonality is in NP
SOFSEM 2019: Theory and Practice of Computer Science | 2020-10-22 | Paper |
On the exact complexity of polyomino packing
Theoretical Computer Science | 2020-09-03 | Paper |
| On the exact complexity of polyomino packing | 2020-08-11 | Paper |
Computing treewidth on the GPU
(available as arXiv preprint) | 2020-05-27 | Paper |
Constructing Tree Decompositions of Graphs with Bounded Gonality
(available as arXiv preprint) | 2020-05-12 | Paper |
Recognizing hyperelliptic graphs in polynomial time
Theoretical Computer Science | 2020-04-06 | Paper |
Subgraph isomorphism on graph classes that exclude a substructure
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Parameterized complexity of conflict-free graph coloring
(available as arXiv preprint) | 2020-01-16 | Paper |
Two strikes against perfect phylogeny
Automata, Languages and Programming | 2019-12-04 | Paper |
On the maximum weight minimal separator
Theoretical Computer Science | 2019-11-13 | Paper |
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
Algorithmica | 2019-05-21 | Paper |
The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds
Algorithmica | 2019-05-21 | Paper |
Typical Sequences Revisited --- Computing Width Parameters of Graphs
(available as arXiv preprint) | 2019-05-09 | Paper |
Treewidth and pathwidth of permutation graphs
Automata, Languages and Programming | 2019-03-29 | Paper |
Parallel algorithms with optimal speedup for bounded treewidth
Automata, Languages and Programming | 2019-01-10 | Paper |
Intervalizing \(k\)-colored graphs
Automata, Languages and Programming | 2019-01-10 | Paper |
On exploring always-connected temporal graphs of small pathwidth
Information Processing Letters | 2018-12-05 | Paper |
Recognizing hyperelliptic graphs in polynomial time
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
Recognizing hyperelliptic graphs in polynomial time
Graph-Theoretic Concepts in Computer Science | 2018-11-22 | Paper |
(Meta) kernelization
Journal of the ACM | 2018-08-02 | Paper |
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
Algorithmica | 2018-07-25 | Paper |
Constructive linear time algorithms for branchwidth
Automata, Languages and Programming | 2018-07-04 | Paper |
| Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity | 2018-04-19 | Paper |
| A faster parameterized algorithm for pseudoforest deletion | 2018-04-10 | Paper |
| Cut and count and representative sets on branch decompositions | 2018-04-10 | Paper |
A faster parameterized algorithm for pseudoforest deletion
Discrete Applied Mathematics | 2018-01-11 | Paper |
| scientific article; zbMATH DE number 6823377 (Why is no real title available?) | 2018-01-09 | Paper |
| Subexponential time algorithms for embedding \(H\)-minor free graphs | 2017-12-19 | Paper |
Parallel algorithms for series parallel graphs
Algorithms — ESA '96 | 2017-12-05 | Paper |
Definability equals recognizability for \(k\)-outerplanar graphs
(available as arXiv preprint) | 2017-09-29 | Paper |
Practical algorithms for linear Boolean-width
(available as arXiv preprint) | 2017-09-29 | Paper |
The homogeneous broadcast problem in narrow and wide strips
(available as arXiv preprint) | 2017-09-22 | Paper |
Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
European Journal of Combinatorics | 2017-09-11 | Paper |
Improved lower bounds for graph embedding problems
Lecture Notes in Computer Science | 2017-07-21 | Paper |
On the maximum weight minimal separator
Lecture Notes in Computer Science | 2017-05-19 | Paper |
On making a distinguished vertex of minimum degree by vertex deletion
Algorithmica | 2017-05-17 | Paper |
Characterizing width two for variants of treewidth
Discrete Applied Mathematics | 2016-11-24 | Paper |
| Recognizability equals definability for graphs of bounded treewidth and bounded chordality | 2016-10-14 | Paper |
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
| The algorithmic theory of treewidth | 2016-07-01 | Paper |
| Treewidth: computational experiments | 2016-07-01 | Paper |
It is hard to know when greedy is good for finding independent sets
Information Processing Letters | 2016-05-26 | Paper |
Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems
Information Processing Letters | 2016-05-26 | Paper |
A \(c^k n\) 5-approximation algorithm for treewidth
SIAM Journal on Computing | 2016-04-11 | Paper |
Robust recoverable path using backup nodes
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Exact algorithms for intervalizing coloured graphs
Theory of Computing Systems | 2016-03-09 | Paper |
Subexponential time algorithms for finding small tree and path decompositions
Algorithms - ESA 2015 | 2015-11-19 | Paper |
PSPACE-completeness of Bloxorz and of games with 2-buttons
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Google Scholar makes it hard -- the complexity of organizing one's publications
Information Processing Letters | 2015-09-15 | Paper |
Google Scholar makes it hard -- the complexity of organizing one's publications
Information Processing Letters | 2015-09-15 | Paper |
Lower bounds for kernelization
Parameterized and Exact Computation | 2015-09-15 | Paper |
Online topological ordering
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Information and Computation | 2015-06-09 | Paper |
A linear time algorithm for finding tree-decompositions of small treewidth
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
Algorithmica | 2015-05-04 | Paper |
Finding small equivalent decision trees is hard
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
| MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree $k$-Outerplanar Graphs | 2015-03-05 | 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 |
| Online topological ordering | 2014-10-13 | Paper |
(Meta) Kernelization
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Kernelization Lower Bounds by Cross-Composition
SIAM Journal on Discrete Mathematics | 2014-06-19 | Paper |
Preprocessing for treewidth: a combinatorial analysis through kernelization
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Scheduling of pipelined operator graphs
Journal of Scheduling | 2014-02-05 | Paper |
Kernel bounds for path and cycle problems
Theoretical Computer Science | 2014-01-13 | Paper |
Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions
Parameterized and Exact Computation | 2013-12-10 | Paper |
The Fine Details of Fast Dynamic Programming over Tree Decompositions
Parameterized and Exact Computation | 2013-12-10 | Paper |
Fixed-parameter tractability and characterizations of small special treewidth
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
Theory of Computing Systems | 2013-10-21 | Paper |
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Automata, Languages, and Programming | 2013-08-06 | Paper |
Partition into triangles on bounded degree graphs
Theory of Computing Systems | 2013-08-01 | Paper |
Exact algorithms for edge domination
Algorithmica | 2013-04-03 | Paper |
| Design by measure and conquer. A faster exact algorithm for dominating set | 2013-03-19 | Paper |
A note on exact algorithms for vertex ordering problems on graphs
Theory of Computing Systems | 2012-12-06 | Paper |
Parameterized complexity of the spanning tree congestion problem
Algorithmica | 2012-11-21 | Paper |
Fixed-parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Kernel bounds for structural parameterizations of pathwidth
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
The valve location problem in simple network topologies
INFORMS Journal on Computing | 2012-07-28 | Paper |
Kernel bounds for path and cycle problems
Parameterized and Exact Computation | 2012-06-15 | Paper |
On switching classes, NLC-width, cliquewidth and treewidth
Theoretical Computer Science | 2012-05-30 | Paper |
Exact algorithms for dominating set
Discrete Applied Mathematics | 2012-04-30 | Paper |
| Cross-composition: a new technique for kernelization lower bounds | 2012-01-23 | Paper |
Cross-composition: a new technique for kernelization lower bounds
(available as arXiv preprint) | 2012-01-23 | Paper |
| Vertex cover kernelization revisited: upper and lower bounds for a refined parameter | 2012-01-23 | Paper |
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter
(available as arXiv preprint) | 2012-01-23 | Paper |
Exact algorithms for Kayles
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Faster parameterized algorithms for \textsc{Minimum Fill-in}
Algorithmica | 2011-12-14 | Paper |
Quadratic kernelization for convex recoloring of trees
Algorithmica | 2011-09-20 | Paper |
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science | 2011-09-12 | Paper |
Treewidth computations. II. Lower bounds
Information and Computation | 2011-07-18 | Paper |
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
Automata, Languages and Programming | 2011-07-06 | Paper |
On stopping evidence gathering for diagnostic Bayesian networks
Lecture Notes in Computer Science | 2011-06-29 | Paper |
Spanning tree congestion of \(k\)-outerplanar graphs
Discrete Mathematics | 2011-05-16 | Paper |
Exact algorithms for intervalizing colored graphs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
| The necessity of bounded treewidth for efficient inference in Bayesian networks | 2011-05-11 | Paper |
Partition into triangles on bounded degree graphs
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
The complexity of finding \(k\)th most probable explanations in probabilistic networks
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
A local search algorithm for branchwidth
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Complexity results for the spanning tree congestion problem
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
Algorithmica | 2010-09-27 | Paper |
Faster algorithms on branch and clique decompositions
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
A cubic kernel for feedback vertex set and loop cutset
Theory of Computing Systems | 2010-05-05 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Treewidth computations. I: Upper bounds
Information and Computation | 2010-04-14 | Paper |
Clustering with partial information
Theoretical Computer Science | 2010-03-09 | Paper |
A kernel for convex recoloring of weighted forests
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Kernelization: new upper and lower bound techniques
Parameterized and Exact Computation | 2010-01-14 | Paper |
Planar capacitated dominating set is \(W[1\)-hard]
Parameterized and Exact Computation | 2010-01-14 | Paper |
On problems without polynomial kernels
Journal of Computer and System Sciences | 2009-11-10 | Paper |
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Kernel Bounds for Disjoint Cycles and Disjoint Paths
Lecture Notes in Computer Science | 2009-10-29 | Paper |
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry | 2009-08-14 | Paper |
Wooden geometric puzzles: Design and hardness proofs
Theory of Computing Systems | 2009-08-06 | Paper |
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences | 2009-04-30 | Paper |
Quadratic Kernelization for Convex Recoloring of Trees
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Clustering with Partial Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
Algorithms and Computation | 2009-01-29 | Paper |
Faster Parameterized Algorithms for Minimum Fill-In
Algorithms and Computation | 2009-01-29 | Paper |
The Valve Location Problem in Simple Network Topologies
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Contraction and Treewidth Lower Bounds
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Contraction and Treewidth Lower Bounds
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Local Monotonicity in Probabilistic Networks
Lecture Notes in Computer Science | 2008-09-16 | Paper |
Treewidth: Characterizations, Applications, and Computations
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
On Problems without Polynomial Kernels (Extended Abstract)
Automata, Languages and Programming | 2008-08-28 | Paper |
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
A Linear Kernel for Planar Feedback Vertex Set
Parameterized and Exact Computation | 2008-06-05 | Paper |
Exact Algorithms for Edge Domination
Parameterized and Exact Computation | 2008-06-05 | Paper |
Treewidth lower bounds with brambles
Algorithmica | 2008-05-27 | Paper |
Weighted Treewidth Algorithmic Techniques and Results
Algorithms and Computation | 2008-05-27 | Paper |
On Exact Algorithms for Treewidth
Lecture Notes in Computer Science | 2008-03-11 | Paper |
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
Approximation and Online Algorithms | 2008-02-21 | Paper |
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Algorithms for graphs embeddable with few crossings per edge
Algorithmica | 2007-11-28 | Paper |
Wooden Geometric Puzzles: Design and Hardness Proofs
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Treewidth: Structure and Algorithms
Structural Information and Communication Complexity | 2007-11-15 | Paper |
A Cubic Kernel for Feedback Vertex Set
STACS 2007 | 2007-09-03 | Paper |
On the maximum cardinality search lower bound for treewidth
Discrete Applied Mathematics | 2007-07-19 | Paper |
Safe reduction rules for weighted treewidth
Algorithmica | 2007-03-12 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Safe separators for treewidth
Discrete Mathematics | 2006-03-29 | Paper |
On algorithms for (\(P_5\), gem)-free graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science | 2006-03-20 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2005-12-08 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms | 2005-08-01 | Paper |
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms | 2005-08-01 | Paper |
SIZES OF ORDERED DECISION TREES
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
A Note on Rectilinearity and Angular Resolution
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
| scientific article; zbMATH DE number 2149351 (Why is no real title available?) | 2005-03-30 | Paper |
Radio Labeling with Preassigned Frequencies
SIAM Journal on Optimization | 2005-02-23 | Paper |
Tree decompositions with small cost
Discrete Applied Mathematics | 2005-02-22 | Paper |
Tree Decompositions with Small Cost
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2080246 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081020 (Why is no real title available?) | 2004-08-04 | Paper |
Approximations for -Colorings of Graphs
The Computer Journal | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2044933 (Why is no real title available?) | 2004-02-18 | Paper |
Necessary edges in \(k\)-chordalisations of graphs
Journal of Combinatorial Optimization | 2004-01-06 | Paper |
Finding a \(\Delta\)-regular supergraph of minimum order
Discrete Applied Mathematics | 2003-09-25 | Paper |
Computing the treewidth and the minimum fill-in with the modular decomposition
Algorithmica | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1953092 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1947394 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1875430 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1735822 (Why is no real title available?) | 2003-01-30 | Paper |
Reduction algorithms for graphs of small treewidth
Information and Computation | 2003-01-14 | Paper |
Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
Algorithmica | 2002-12-01 | Paper |
Kayles and Nimbers
Journal of Algorithms | 2002-09-30 | Paper |
Approximation of pathwidth of outerplanar graphs
Journal of Algorithms | 2002-09-30 | Paper |
| scientific article; zbMATH DE number 1500531 (Why is no real title available?) | 2002-04-08 | Paper |
Parallel algorithms for series parallel graphs and graphs with treewidth two
Algorithmica | 2002-01-09 | Paper |
| SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s | 2001-09-23 | Paper |
| scientific article; zbMATH DE number 1617251 (Why is no real title available?) | 2001-07-11 | Paper |
Graphs with Branchwidth at Most Three
Journal of Algorithms | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1496855 (Why is no real title available?) | 2000-08-27 | Paper |
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1390064 (Why is no real title available?) | 2000-08-15 | Paper |
| scientific article; zbMATH DE number 1361465 (Why is no real title available?) | 2000-08-03 | Paper |
Improved self-reduction algorithms for graphs with bounded treewidth
Discrete Applied Mathematics | 2000-08-01 | Paper |
| scientific article; zbMATH DE number 1414279 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1379308 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1375581 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1375581 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1333600 (Why is no real title available?) | 1999-09-19 | Paper |
Isomorphism for graphs of bounded distance width
Algorithmica | 1999-06-29 | Paper |
| scientific article; zbMATH DE number 1303600 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1301101 (Why is no real title available?) | 1999-06-15 | Paper |
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1222605 (Why is no real title available?) | 1998-11-11 | Paper |
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
Journal of Graph Algorithms and Applications | 1998-10-28 | Paper |
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
SIAM Journal on Computing | 1998-09-21 | Paper |
On interval routing schemes and treewidth
Information and Computation | 1998-06-15 | Paper |
Rankings of Graphs
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
| scientific article; zbMATH DE number 1107730 (Why is no real title available?) | 1998-02-16 | Paper |
Treewidth for graphs with small chordality
Discrete Applied Mathematics | 1998-01-07 | Paper |
The parameterized complexity of sequence alignment and consensus
Theoretical Computer Science | 1997-09-29 | Paper |
Domino Treewidth
Journal of Algorithms | 1997-08-25 | Paper |
Triangulating planar graphs while minimizing the maximum degree
Information and Computation | 1997-08-11 | Paper |
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing | 1997-06-09 | Paper |
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
Journal of Algorithms | 1997-05-11 | Paper |
On intervalizing \(k\)-colored graphs for DNA physical mapping
Discrete Applied Mathematics | 1997-04-21 | Paper |
Restrictions of graph partition problems. I
Theoretical Computer Science | 1997-02-28 | Paper |
\(W[2\)-hardness of precedence constrained \(K\)-processor scheduling]
Operations Research Letters | 1996-08-01 | Paper |
Treewidth and Pathwidth of Permutation Graphs
SIAM Journal on Discrete Mathematics | 1996-02-20 | Paper |
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Journal of Algorithms | 1995-08-20 | Paper |
| scientific article; zbMATH DE number 720183 (Why is no real title available?) | 1995-03-20 | Paper |
Scheduling with incompatible jobs
Discrete Applied Mathematics | 1995-02-01 | Paper |
| scientific article; zbMATH DE number 566078 (Why is no real title available?) | 1995-01-12 | Paper |
ON DISJOINT CYCLES
International Journal of Foundations of Computer Science | 1995-01-02 | Paper |
| scientific article; zbMATH DE number 512917 (Why is no real title available?) | 1994-04-07 | Paper |
| scientific article; zbMATH DE number 512922 (Why is no real title available?) | 1994-03-10 | Paper |
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Information and Computation | 1994-02-22 | Paper |
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
Journal of Algorithms | 1993-12-09 | Paper |
Complexity of path-forming games
Theoretical Computer Science | 1993-08-30 | Paper |
The Pathwidth and Treewidth of Cographs
SIAM Journal on Discrete Mathematics | 1993-07-21 | Paper |
| scientific article; zbMATH DE number 219228 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 219251 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 219268 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176762 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177556 (Why is no real title available?) | 1993-05-18 | Paper |
On Linear Time Minor Tests with Depth-First Search
Journal of Algorithms | 1993-05-16 | Paper |
The complexity of coloring games on perfect graphs
Theoretical Computer Science | 1993-04-22 | Paper |
| scientific article; zbMATH DE number 139777 (Why is no real title available?) | 1993-03-28 | Paper |
| scientific article; zbMATH DE number 140499 (Why is no real title available?) | 1993-03-28 | Paper |
ON THE COMPLEXITY OF SOME COLORING GAMES
International Journal of Foundations of Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 17531 (Why is no real title available?) | 1992-06-26 | Paper |
Some lower bound results for decentralized extrema-finding in rings of processors
Journal of Computer and System Sciences | 1991-01-01 | Paper |
New lower bound techniques for distributed leader finding and other problems on rings of processors
Theoretical Computer Science | 1991-01-01 | Paper |
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Journal of Algorithms | 1990-01-01 | Paper |
Computational complexity of norm-maximization
Combinatorica | 1990-01-01 | Paper |
The complexity of finding uniform emulations on paths and ring networks
Information and Computation | 1990-01-01 | Paper |
Bit-optimal election in synchronous rings
Information Processing Letters | 1990-01-01 | Paper |
Achromatic number is NP-complete for cographs and interval graphs
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4121424 (Why is no real title available?) | 1988-01-01 | Paper |
The complexity of finding uniform emulations on fixed graphs
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062614 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060712 (Why is no real title available?) | 1988-01-01 | Paper |
A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4008432 (Why is no real title available?) | 1987-01-01 | Paper |
Diameter increase caused by edge deletion
Journal of Graph Theory | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4028858 (Why is no real title available?) | 1987-01-01 | Paper |
Simulation of large networks on smaller networks
Information and Control | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3978376 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3903985 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3918378 (Why is no real title available?) | 1984-01-01 | Paper |
