| Publication | Date of Publication | Type |
|---|
A constant-factor approximation for weighted bond cover
Journal of Computer and System Sciences | 2025-01-27 | Paper |
Compound logics for modification problems
| 2024-11-14 | Paper |
Faster parameterized algorithms for modification problems to minor-closed classes
| 2024-11-14 | Paper |
Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma
| 2024-10-31 | Paper |
Minor-obstructions for apex sub-unicyclic graphs
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
A more accurate view of the flat wall theorem
Journal of Graph Theory | 2024-09-16 | Paper |
Faster parameterized algorithms for modification problems to minor-closed classes
TheoretiCS | 2024-09-10 | Paper |
Kernelization for graph packing problems via rainbow matching
| 2024-05-14 | Paper |
Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes
| 2024-05-14 | Paper |
On Interval Routing Schemes and treewidth
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Fugitive-search games on graphs and related parameters
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
scientific article; zbMATH DE number 7768352 (Why is no real title available?)
| 2023-11-20 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
Networks | 2023-11-15 | Paper |
Edge-treewidth: algorithmic and combinatorial properties
Discrete Applied Mathematics | 2023-11-13 | Paper |
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Combing a Linkage in an Annulus
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Connected search for a lazy robber
Journal of Graph Theory | 2023-10-04 | Paper |
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
SIAM Journal on Computing | 2023-08-10 | Paper |
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
Information and Computation | 2023-07-17 | Paper |
\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Universal Obstructions of Graph Parameters
| 2023-04-27 | Paper |
Approximating branchwidth on parametric extensions of planarity
| 2023-04-10 | Paper |
Graph Parameters, Universal Obstructions, and WQO
| 2023-04-07 | Paper |
On strict brambles
Graphs and Combinatorics | 2023-03-09 | Paper |
The mixed search game against an agile and visible fugitive is monotone
Discrete Mathematics | 2023-02-21 | Paper |
scientific article; zbMATH DE number 7651203 (Why is no real title available?)
| 2023-02-07 | Paper |
An algorithmic meta-theorem for graph modification to planarity and FOL
| 2023-02-07 | Paper |
Clustering to Given Connectivities
| 2023-02-03 | Paper |
Connected Search for a Lazy Robber
| 2023-02-03 | Paper |
Excluding Single-Crossing Matching Minors in Bipartite Graphs
| 2022-12-19 | Paper |
A Retrospective on (Meta) Kernelization
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
Faster parameterized algorithms for modification problems to minor-closed classes
| 2022-10-05 | Paper |
Block elimination distance
Graphs and Combinatorics | 2022-08-08 | Paper |
Data-compression for parametrized counting problems on sparse graphs
| 2022-07-21 | Paper |
Contraction Bidimensionality of Geometric Intersection Graphs
| 2022-07-20 | Paper |
Modification to Planarity is Fixed Parameter Tractable
| 2022-07-18 | Paper |
Lean Tree-Cut Decompositions: Obstructions and Algorithms
| 2022-07-18 | Paper |
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
| 2022-06-08 | Paper |
Block elimination distance
Graph-Theoretic Concepts in Computer Science | 2022-06-08 | Paper |
Parameterized complexity of elimination distance to first-order logic properties
ACM Transactions on Computational Logic | 2022-04-29 | Paper |
Contraction bidimensionality of geometric intersection graphs
Algorithmica | 2022-03-25 | Paper |
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
Discrete Applied Mathematics | 2022-03-24 | Paper |
A linear fixed parameter tractable algorithm for connected pathwidth
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
Compactors for parameterized counting problems
Computer Science Review | 2021-12-20 | Paper |
Compound Logics for Modification Problems
| 2021-11-04 | Paper |
Minimum reload cost graph factors
Theory of Computing Systems | 2021-08-05 | Paper |
A complexity dichotomy for hitting small planar minors parameterized by treewidth
| 2021-08-04 | Paper |
Minor obstructions for apex-pseudoforests
Discrete Mathematics | 2021-08-02 | Paper |
A Menger-like property of tree-cut width
Journal of Combinatorial Theory. Series B | 2021-03-08 | Paper |
Block Elimination Distance
| 2021-03-02 | Paper |
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
SIAM Journal on Discrete Mathematics | 2021-02-15 | Paper |
A more accurate view of the Flat Wall Theorem
| 2021-02-12 | Paper |
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Bidimensionality and kernels
SIAM Journal on Computing | 2021-01-13 | Paper |
Hitting minors on bounded treewidth graphs. I: General upper bounds
SIAM Journal on Discrete Mathematics | 2020-10-28 | Paper |
Minimum reload cost graph factors
Lecture Notes in Computer Science | 2020-10-22 | Paper |
Structure and enumeration of \(K_4\)-minor-free links and link-diagrams
European Journal of Combinatorics | 2020-09-15 | Paper |
Edge degeneracy: algorithmic and structural results
Theoretical Computer Science | 2020-09-03 | Paper |
Partial complementation of graphs
| 2020-08-25 | Paper |
Minor-obstructions for apex sub-unicyclic graphs
Discrete Applied Mathematics | 2020-07-07 | Paper |
Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
| 2020-05-27 | Paper |
Contraction-bidimensionality of geometric intersection graphs
| 2020-05-27 | Paper |
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
| 2020-05-27 | Paper |
Linear kernels for edge deletion problems to immersion-closed graph classes
| 2020-05-27 | Paper |
Structured connectivity augmentation
| 2020-05-26 | Paper |
Subgraph complementation
Algorithmica | 2020-05-21 | Paper |
Sparse obstructions for minor-covering parameters
Discrete Applied Mathematics | 2020-04-21 | Paper |
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Theoretical Computer Science | 2020-03-12 | Paper |
On the parameterized complexity of graph modification to first-order logic properties
Theory of Computing Systems | 2020-02-27 | Paper |
Hitting minors on bounded treewidth graphs. III. Lower bounds
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Coverability and sub-exponential parameterized algorithms in planar graphs
| 2019-11-22 | Paper |
On the algorithmic Lovász local lemma and acyclic edge coloring
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Planar Disjoint Paths in Linear Time
| 2019-07-12 | Paper |
Linear kernels for (connected) dominating set on \(H\)-minor-free graphs
| 2019-05-10 | Paper |
Explicit linear kernels for packing problems
Algorithmica | 2019-04-25 | Paper |
Cutwidth: obstructions and algorithmic aspects
Algorithmica | 2019-02-14 | Paper |
Structured connectivity augmentation
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
Kernels for (connected) dominating set on graphs with excluded topological minors
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams
| 2018-10-11 | Paper |
Data-compression for Parametrized Counting Problems on Sparse graphs
| 2018-09-21 | Paper |
(Meta) kernelization
Journal of the ACM | 2018-08-02 | Paper |
Constructive linear time algorithms for branchwidth
Automata, Languages and Programming | 2018-07-04 | Paper |
Minimal disconnected cuts in planar graphs
Networks | 2018-05-23 | Paper |
An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
Algorithmica | 2018-05-23 | Paper |
Cutwidth: obstructions and algorithmic aspects
| 2018-04-10 | Paper |
FPT algorithms for plane completion problems
| 2018-03-21 | Paper |
An FPT 2-approximation for tree-cut decomposition
Algorithmica | 2018-02-28 | Paper |
On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability
Information and Computation | 2017-11-16 | Paper |
Variants of plane diameter completion
| 2017-09-29 | Paper |
Parameterized algorithms for MIN-MAX multiway cut and List digraph homomorphism
| 2017-09-29 | Paper |
Bidimensionality and parameterized algorithms (invited talk)
| 2017-09-29 | Paper |
Recent techniques and results on the Erdős-Pósa property
Discrete Applied Mathematics | 2017-09-12 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Minors in graphs of large \(\theta_r\)-girth
European Journal of Combinatorics | 2017-08-31 | Paper |
Packing and covering immersion-expansions of planar sub-cubic graphs
European Journal of Combinatorics | 2017-08-31 | Paper |
Parameterized algorithms for min-max multiway cut and list digraph homomorphism
Journal of Computer and System Sciences | 2017-05-26 | Paper |
The parameterized complexity of graph cyclability
SIAM Journal on Discrete Mathematics | 2017-03-16 | Paper |
A linear kernel for planar red-blue dominating set
Discrete Applied Mathematics | 2017-03-15 | Paper |
Explicit linear kernels via dynamic programming
| 2017-03-03 | Paper |
Acyclic edge coloring through the Lovász local lemma
Theoretical Computer Science | 2017-02-06 | Paper |
Low polynomial exclusion of planar graph patterns
Journal of Graph Theory | 2017-02-01 | Paper |
scientific article; zbMATH DE number 6678911 (Why is no real title available?)
| 2017-01-30 | Paper |
Partiality and approximation schemes for local consistency in networks of constraints
Lecture Notes in Computer Science | 2017-01-19 | Paper |
Editing to a planar graph of given degrees
Journal of Computer and System Sciences | 2016-12-28 | Paper |
Packing and covering immersion models of planar subcubic graphs
Graph-Theoretic Concepts in Computer Science | 2016-12-22 | Paper |
Irrelevant vertices for the planar disjoint paths problem
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
Planar disjoint-paths completion
Algorithmica | 2016-10-21 | Paper |
Contraction obstructions for connected graph searching
Discrete Applied Mathematics | 2016-06-21 | 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 |
An edge variant of the Erdős-Pósa property
Discrete Mathematics | 2016-05-18 | Paper |
An FPT 2-approximation for tree-cut decomposition
Lecture Notes in Computer Science | 2016-02-26 | Paper |
An \(O(\log \mathrm{OPT})\)-approximation for covering/packing minor models of \(\theta _{r}\)
Approximation and Online Algorithms | 2016-02-26 | Paper |
The Structure of $W_4$-Immersion-Free Graphs
| 2016-02-05 | Paper |
Subexponential parameterized algorithms on bounded-genus graphs and \(H\)-minor-free graphs
Journal of the ACM | 2015-12-04 | Paper |
Explicit linear kernels via dynamic programming
SIAM Journal on Discrete Mathematics | 2015-10-21 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Editing to a planar graph of given degrees
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Minimal disconnected cuts in planar graphs
Fundamentals of Computation Theory | 2015-09-29 | Paper |
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms | 2015-08-14 | Paper |
Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs
| 2015-08-03 | Paper |
An alternative proof for the constructive Asymmetric Lov\'asz Local Lemma
| 2015-05-11 | Paper |
Finding smallest supertrees under minor containment
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Forbidding Kuratowski graphs as immersions
Journal of Graph Theory | 2015-01-21 | Paper |
Bidimensionality of geometric intersection 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 |
Confronting intractability via parameters
Computer Science Review | 2014-10-24 | Paper |
The parameterized complexity of graph cyclability
Lecture Notes in Computer Science | 2014-10-08 | Paper |
Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms
Computer Science Review | 2014-10-07 | Paper |
Subexponential parameterized algorithms
Computer Science Review | 2014-10-07 | Paper |
Lift-contractions
European Journal of Combinatorics | 2014-07-29 | Paper |
(Meta) Kernelization
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Polynomial gap extensions of the Erdős-Pósa theorem
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
Bidimensionality and kernels
| 2014-05-22 | Paper |
Characterizing graphs of small carving-width
Discrete Applied Mathematics | 2014-04-22 | Paper |
Square roots of minor closed graph classes
Discrete Applied Mathematics | 2014-04-02 | Paper |
Optimizing the graph minors weak structure theorem
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Outerplanar obstructions for matroid pathwidth
Discrete Mathematics | 2014-01-16 | Paper |
Excluding graphs as immersions in surface embedded graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Increasing the minimum degree of a graph by contractions
Theoretical Computer Science | 2013-11-29 | Paper |
Outerplanar obstructions for matroid pathwidth
| 2013-11-01 | Paper |
Lift contractions
| 2013-11-01 | Paper |
Square roots of minor closed graph classes
| 2013-11-01 | Paper |
Nearly Planar Graphs and {\lambda}-flat Graphs
| 2013-11-01 | Paper |
A min-max theorem for LIFO-search
| 2013-11-01 | Paper |
Outerplanar obstructions for the feedback vertex set
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Obstructions for tree-depth
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Asymptotic enumeration of non-crossing partitions on surfaces
Discrete Mathematics | 2013-03-04 | Paper |
A note on exact algorithms for vertex ordering problems on graphs
Theory of Computing Systems | 2012-12-06 | Paper |
Connected graph searching
Information and Computation | 2012-11-27 | Paper |
Fast minor testing in planar graphs
Algorithmica | 2012-11-21 | Paper |
Characterizing Graphs of Small Carving-Width
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth
Discrete Applied Mathematics | 2012-10-26 | Paper |
Paths of bounded length and their cuts: parameterized complexity and algorithms
Discrete Optimization | 2012-10-16 | Paper |
Dynamic Programming for H-minor-free Graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond | 2012-09-05 | Paper |
Contraction checking in graphs on surfaces
| 2012-08-23 | Paper |
Catalan structures and dynamic programming in \(H\)-minor-free graphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Increasing the minimum degree of a graph by contractions
Parameterized and Exact Computation | 2012-06-15 | Paper |
Planar disjoint-paths completion
Parameterized and Exact Computation | 2012-06-15 | Paper |
On graph contractions and induced minors
Discrete Applied Mathematics | 2012-05-11 | Paper |
Forbidden graphs for tree-depth
European Journal of Combinatorics | 2012-05-04 | Paper |
Outerplanar obstructions for a feedback vertex set
European Journal of Combinatorics | 2012-05-04 | Paper |
On self-duality of branchwidth in graphs of bounded genus
Discrete Applied Mathematics | 2012-04-30 | Paper |
Approximating acyclicity parameters of sparse hypergraphs
| 2012-04-24 | Paper |
Containment relations in split graphs
Discrete Applied Mathematics | 2012-03-19 | Paper |
Approximating width parameters of hypergraphs with excluded minors
SIAM Journal on Discrete Mathematics | 2012-03-15 | Paper |
Induced packing of odd cycles in planar graphs
Theoretical Computer Science | 2012-03-13 | Paper |
Parameterizing cut sets in a graph by the number of their components
Theoretical Computer Science | 2012-01-09 | Paper |
Faster parameterized algorithms for minor containment
Theoretical Computer Science | 2011-12-07 | Paper |
Searching for a Visible, Lazy Fugitive
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Fast sub-exponential algorithms and compactness in planar graphs
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Contracting planar graphs to contractions of triangulations
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Contraction obstructions for treewidth
Journal of Combinatorial Theory. Series B | 2011-08-10 | Paper |
On disconnected cuts and separators
Discrete Applied Mathematics | 2011-08-10 | Paper |
Tight bounds for linkages in planar graphs
Automata, Languages and Programming | 2011-07-06 | Paper |
Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms
Algorithmica | 2011-07-01 | Paper |
Strengthening Erdős -- Pósa property for minor-closed graph classes
Journal of Graph Theory | 2011-03-21 | Paper |
Approximation algorithms for domination search
Approximation and Online Algorithms | 2011-02-15 | Paper |
Rank-width and tree-width of \(H\)-minor-free graphs
European Journal of Combinatorics | 2010-10-18 | Paper |
Dynamic programming for graphs on surfaces
Automata, Languages and Programming | 2010-09-07 | Paper |
Contractions of Planar Graphs in Polynomial Time
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Fast minor testing in planar graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Journal of Discrete Algorithms | 2010-08-18 | Paper |
scientific article; zbMATH DE number 5764900 (Why is no real title available?)
| 2010-08-06 | Paper |
Faster parameterized algorithms for minor containment
Lecture Notes in Computer Science | 2010-06-22 | Paper |
A note on the subgraphs of the (\(2\times \infty \))-grid
Discrete Mathematics | 2010-03-29 | Paper |
Graph searching in a crime wave
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
Dominating sets and local treewidth
Lecture Notes in Computer Science | 2010-03-03 | Paper |
On contracting graphs to fixed pattern graphs
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Paths of bounded length and their cuts: parameterized complexity and algorithms
Parameterized and Exact Computation | 2010-01-14 | Paper |
Searching is not jumping.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Induced Packing of Odd Cycles in a Planar Graph
Algorithms and Computation | 2009-12-17 | Paper |
Parameterizing cut sets in a graph by the number of their components
Algorithms and Computation | 2009-12-17 | Paper |
Contraction Bidimensionality: The Accurate Picture
Lecture Notes in Computer Science | 2009-10-29 | Paper |
scientific article; zbMATH DE number 5605062 (Why is no real title available?)
| 2009-09-19 | Paper |
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms | 2009-06-24 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Derivation of algorithms for cutwidth and related graph layout parameters
Journal of Computer and System Sciences | 2009-04-30 | Paper |
Searching for a Visible, Lazy Fugitive
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Faster fixed-parameter tractable algorithms for matching and packing problems
Algorithmica | 2008-12-02 | Paper |
Graph Searching in a Crime Wave
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
Efficient algorithms for counting parameterized list \(H\)-colorings
Journal of Computer and System Sciences | 2008-06-26 | Paper |
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science | 2008-06-24 | Paper |
Fast FPT-Algorithms for Cleaning Grids
STACS 2006 | 2008-03-19 | Paper |
On Exact Algorithms for Treewidth
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Subexponential Parameterized Algorithms
Automata, Languages and Programming | 2007-11-28 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Kernels for the Vertex Cover Problem on the Preferred Attachment Model
Experimental Algorithms | 2007-09-14 | Paper |
Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Complexity issues on bounded restrictive \(H\)-coloring
Discrete Mathematics | 2007-06-26 | Paper |
On self duality of pathwidth in polyhedral graph embeddings
Journal of Graph Theory | 2007-06-11 | Paper |
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
A 3-approximation for the pathwidth of Halin graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Connected Graph Searching in Outerplanar Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The Bidimensional Theory of Bounded-Genus Graphs
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
SIAM Journal on Computing | 2007-05-03 | Paper |
Efficient algorithms for parameterized \(H\)-colorings
| 2007-03-05 | Paper |
A 3-approximation for the pathwidth of Halin graphs
Journal of Discrete Algorithms | 2007-02-14 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
New upper bounds on the decomposability of planar graphs
Journal of Graph Theory | 2006-03-24 | Paper |
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics | 2005-12-27 | Paper |
Bidimensional Parameters and Local Treewidth
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | 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 |
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 |
Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors
Algorithmica | 2005-04-29 | Paper |
scientific article; zbMATH DE number 2151250 (Why is no real title available?)
| 2005-04-04 | Paper |
The restrictive \(H\)-coloring problem
Discrete Applied Mathematics | 2005-02-22 | Paper |
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2080246 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2079336 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 2044935 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 2038758 (Why is no real title available?)
| 2004-02-08 | Paper |
On the monotonicity of games generated by symmetric submodular functions.
Discrete Applied Mathematics | 2003-10-14 | Paper |
scientific article; zbMATH DE number 1983292 (Why is no real title available?)
| 2003-09-18 | Paper |
scientific article; zbMATH DE number 1979505 (Why is no real title available?)
| 2003-09-14 | Paper |
scientific article; zbMATH DE number 1953088 (Why is no real title available?)
| 2003-07-25 | Paper |
scientific article; zbMATH DE number 1947048 (Why is no real title available?)
| 2003-07-07 | Paper |
scientific article; zbMATH DE number 1875430 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1834657 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1830723 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1796974 (Why is no real title available?)
| 2002-09-05 | Paper |
Counting \(H-\)colorings of partial \(k-\)trees
Theoretical Computer Science | 2002-07-15 | Paper |
On graph powers for leaf-labeled trees
Journal of Algorithms | 2002-03-07 | Paper |
Quickly excluding \(K_{2,r}\) from planar graphs
| 2001-09-23 | Paper |
Monotonicity and inert fugitive search games
| 2001-09-23 | Paper |
scientific article; zbMATH DE number 1617253 (Why is no real title available?)
| 2001-07-11 | Paper |
Algorithms and obstructions for linear-width and related search parameters
Discrete Applied Mathematics | 2001-02-27 | Paper |
Graphs with Branchwidth at Most Three
Journal of Algorithms | 2000-10-17 | Paper |
On parallel partial solutions and approximation schemes for local consistency in networks of constraints
Constraints | 2000-09-04 | Paper |
scientific article; zbMATH DE number 1420917 (Why is no real title available?)
| 2000-03-22 | Paper |
Isomorphism for graphs of bounded distance width
Algorithmica | 1999-06-29 | Paper |
Fugitive-search games on graphs and related parameters
Theoretical Computer Science | 1998-07-23 | Paper |
On interval routing schemes and treewidth
Information and Computation | 1998-06-15 | Paper |
Treewidth for graphs with small chordality
Discrete Applied Mathematics | 1998-01-07 | Paper |
The Linkage of a Graph
SIAM Journal on Computing | 1996-10-15 | Paper |
Killing a Vortex
| N/A | Paper |
Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
| N/A | Paper |
Excluding Surfaces as Minors in Graphs
| N/A | Paper |
