| Publication | Date of Publication | Type |
|---|
Parameterized complexity of reconfiguration of atoms
Algorithmica | 2024-10-24 | Paper |
| Reasons to fall (more) in love with combinatorial reconfiguration | 2024-07-19 | Paper |
| Reconfiguration of multisets with applications to bin packing | 2024-07-19 | Paper |
| Finding smallest supertrees | 2023-03-21 | Paper |
Sequential and parallel algorithms for embedding problems on classes of partial k-trees
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
The parallel complexity of tree embedding problems (extended abstract)
STACS 92 | 2022-08-18 | Paper |
Incremental optimization of independent sets under the reconfiguration framework
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
Parameterized complexity of reconfiguration of atoms
(available as arXiv preprint) | 2022-07-13 | Paper |
| A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems | 2022-04-22 | Paper |
Reconfiguration of graph minors
(available as arXiv preprint) | 2021-08-04 | Paper |
| On directed covering and domination problems | 2020-11-25 | Paper |
Incremental optimization of independent sets under the reconfiguration framework
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Reconfiguring spanning and induced subgraphs
Theoretical Computer Science | 2020-01-16 | Paper |
Introduction to reconfiguration
Algorithms | 2019-10-29 | Paper |
| Finding an induced path of given parity in planar graphs in polynomial time | 2019-05-10 | Paper |
On directed covering and domination problems
Discrete Applied Mathematics | 2019-03-28 | Paper |
Reconfiguring spanning and induced subgraphs
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Computing \(k\)-atomicity in polynomial time
SIAM Journal on Computing | 2018-04-24 | Paper |
Reconfiguration of graph minors
(available as arXiv preprint) | 2018-04-24 | Paper |
| Graph editing to a given neighbourhood degree list is fixed-parameter tractable | 2018-03-26 | Paper |
Finding largest common embeddable subtrees
STACS 95 | 2017-12-04 | Paper |
Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width
STACS 96 | 2017-11-16 | Paper |
Shortest reconfiguration paths in the solution space of Boolean formulas
SIAM Journal on Discrete Mathematics | 2017-09-27 | Paper |
On the parameterized complexity of reconfiguration problems
Algorithmica | 2017-05-11 | Paper |
The complexity of dominating set reconfiguration
Theoretical Computer Science | 2017-03-16 | Paper |
Reconfiguration of dominating sets
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Computing weak consistency in polynomial time (extended abstract)
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
The complexity of dominating set reconfiguration
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Shortest reconfiguration paths in the solution space of Boolean formulas
Automata, Languages, and Programming | 2015-10-27 | Paper |
Homotopy types and Nielsen numbers of periodic homotopy idempotents on tori
Journal of Fixed Point Theory and Applications | 2015-10-07 | Paper |
The complexity of bounded length graph recoloring and CSP reconfiguration
Parameterized and Exact Computation | 2015-09-15 | Paper |
Reconfiguration over tree decompositions
Parameterized and Exact Computation | 2015-09-15 | Paper |
Vertex Cover Reconfiguration and Beyond
Algorithms and Computation | 2015-09-11 | Paper |
Finding smallest supertrees under minor containment
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Reconfiguration of dominating sets
Lecture Notes in Computer Science | 2014-09-26 | Paper |
On the parameterized complexity of reconfiguration problems
Lecture Notes in Computer Science | 2013-12-10 | Paper |
Parameterized enumeration of (locally-) optimal aggregations
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Enumerating Neighbour and Closest Strings
Parameterized and Exact Computation | 2013-01-07 | Paper |
Fast multipole boundary element analysis for 2D problems of magneto-electro-elastic media
Engineering Analysis with Boundary Elements | 2012-08-07 | Paper |
On the parameterized complexity of layered graph drawing
Algorithmica | 2008-12-02 | Paper |
Faster fixed-parameter tractable algorithms for matching and packing problems
Algorithmica | 2008-12-02 | Paper |
Solving \#SAT using vertex covers
Acta Informatica | 2007-12-10 | Paper |
Solving #SAT Using Vertex Covers
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences | 2007-05-30 | Paper |
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
A fixed-parameter approach to 2-layer planarization
Algorithmica | 2006-08-11 | Paper |
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics | 2005-12-27 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Embeddings of \(k\)-connected graphs of pathwidth \(k\)
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 2084262 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1929947 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1875438 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1830723 (Why is no real title available?) | 2002-11-18 | Paper |
On graph powers for leaf-labeled trees
Journal of Algorithms | 2002-03-07 | Paper |
| scientific article; zbMATH DE number 1617253 (Why is no real title available?) | 2001-07-11 | Paper |
| scientific article; zbMATH DE number 1617252 (Why is no real title available?) | 2001-07-11 | Paper |
Efficient asynchronous simulation of a class of synchronous parallel algorithms
Journal of Computer and System Sciences | 2000-07-06 | Paper |
| scientific article; zbMATH DE number 1420917 (Why is no real title available?) | 2000-03-22 | Paper |
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Journal of Computer and System Sciences | 1999-02-21 | Paper |
Interval Routing onk-Trees
Journal of Algorithms | 1998-06-23 | Paper |
Finding largest subtrees and smallest supertrees
Algorithmica | 1998-06-08 | Paper |
Pointers versus arithmetic in PRAMs
Journal of Computer and System Sciences | 1997-03-31 | Paper |
The complexity of subgraph isomorphism for classes of partial k-trees
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 910923 (Why is no real title available?) | 1996-08-22 | Paper |
The Parallel Complexity of Tree Embedding Problems
Journal of Algorithms | 1995-04-09 | Paper |
A Model for Asynchronous Shared Memory Parallel Computation
SIAM Journal on Computing | 1995-04-06 | Paper |
Restricted CRCW PRAMs
Theoretical Computer Science | 1994-02-22 | Paper |
| scientific article; zbMATH DE number 140490 (Why is no real title available?) | 1993-03-28 | Paper |
