| Publication | Date of Publication | Type |
|---|
| On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves | 2023-10-04 | Paper |
| What Is Known About Vertex Cover Kernelization? | 2023-06-30 | Paper |
| A Survey on the Complexity of Flood-Filling Games | 2023-06-30 | Paper |
| Obstructions to within a few vertices or edges of acyclic | 2022-12-16 | Paper |
| Collaborating with Hans: Some Remaining Wonderments | 2022-10-19 | Paper |
| Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory | 2022-03-02 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2019-12-06 | Paper |
| Two strikes against perfect phylogeny | 2019-12-04 | Paper |
| Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number | 2018-05-24 | Paper |
| A brief history of Edward K. Blum and the Journal of Computer and System Sciences | 2018-04-18 | Paper |
| Corrigendum to: ``Advice classes of parameterized tractability | 2018-03-21 | Paper |
| Parameterized approximation via fidelity preserving transformations | 2017-12-21 | Paper |
| Constructivity issues in graph algorithms | 2017-11-17 | Paper |
| Surfing with Rod | 2017-04-04 | Paper |
| FPT is characterized by useful obstruction sets | 2016-10-24 | Paper |
| The Flood-It game parameterized by the vertex cover number | 2016-10-17 | Paper |
| Beyond NP-completeness for problems of bounded width (extended abstract) | 2016-09-01 | Paper |
| An improved fixed-parameter algorithm for vertex cover | 2016-06-09 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2016-02-19 | Paper |
| Distortion is Fixed Parameter Tractable | 2015-09-24 | Paper |
| A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems | 2015-09-24 | Paper |
| Tractability and hardness of flood-filling games on trees | 2015-05-18 | Paper |
| Control complexity in Bucklin and fallback voting: a theoretical analysis | 2015-02-20 | Paper |
| Control complexity in Bucklin and fallback voting: an experimental analysis | 2015-02-20 | Paper |
| Clique-width minimization is NP-hard | 2014-11-25 | Paper |
| Parameterized complexity of firefighting | 2014-06-10 | Paper |
| Multivariate Complexity Theory | 2014-02-21 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2014-01-14 | Paper |
| Fundamentals of parameterized complexity | 2013-12-06 | Paper |
| FPT Is Characterized by Useful Obstruction Sets | 2013-12-06 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2013-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843923 | 2013-08-27 | Paper |
| Parameterized Approximation via Fidelity Preserving Transformations | 2013-08-12 | Paper |
| Parameterized Complexity | 2013-07-24 | Paper |
| Constraint satisfaction problems: convexity makes AllDifferent constraints tractable | 2013-03-04 | Paper |
| Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity | 2013-01-24 | Paper |
| Parameterizing by the number of numbers | 2012-12-06 | Paper |
| Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications | 2012-11-21 | Paper |
| Graph-based data clustering with overlaps | 2012-10-16 | Paper |
| Determining the winner of a Dodgson election is hard | 2012-08-29 | Paper |
| Local search: is brute-force avoidable? | 2012-08-17 | Paper |
| The parameterized complexity of stabbing rectangles | 2012-04-26 | Paper |
| A Generalization of Nemhauser and Trotter's Local Optimization Theorem. | 2012-04-24 | Paper |
| A generalization of Nemhauser and Trotter's local optimization theorem | 2012-01-11 | Paper |
| Parameterized Complexity of the Firefighter Problem | 2011-12-16 | Paper |
| Quadratic kernelization for convex recoloring of trees | 2011-09-20 | Paper |
| Facility location problems: a parameterized view | 2011-08-10 | Paper |
| Recent Developments in the Theory of Pre-processing | 2011-06-03 | Paper |
| Upper and lower bounds for finding connected motifs in vertex-colored graphs | 2011-04-28 | Paper |
| On the complexity of some colorful problems parameterized by treewidth | 2011-02-21 | Paper |
| Parameterizing by the number of numbers | 2010-12-07 | Paper |
| Milling a Graph with Turn Costs: A Parameterized Complexity Perspective | 2010-11-16 | Paper |
| The parameterized complexity of some minimum label problems | 2010-10-07 | Paper |
| Polynomial-time data reduction for dominating set | 2010-08-17 | Paper |
| A Linear Kernel for Co-Path/Cycle Packing | 2010-07-20 | Paper |
| Parameterized approximation of dominating set problems | 2010-06-09 | Paper |
| Clique-Width is NP-Complete | 2010-06-01 | Paper |
| W-hierarchies defined by symmetric gates | 2010-05-10 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Clustering with partial information | 2010-03-09 | Paper |
| The Parameterized Complexity of Some Minimum Label Problems | 2010-01-21 | Paper |
| What Makes Equitable Connected Partition Easy | 2010-01-14 | Paper |
| Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs | 2010-01-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology | 2009-12-11 | Paper |
| On problems without polynomial kernels | 2009-11-10 | Paper |
| Fixed-parameter algorithms for Kemeny rankings | 2009-11-04 | Paper |
| The complexity ecology of parameters: An illustration using bounded max leaf number | 2009-10-19 | Paper |
| A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems | 2009-10-16 | Paper |
| Graph-Based Data Clustering with Overlaps | 2009-07-23 | Paper |
| Distortion Is Fixed Parameter Tractable | 2009-07-14 | Paper |
| Haplotype Inference Constrained by Plausible Haplotype Data | 2009-07-07 | Paper |
| Derivation of algorithms for cutwidth and related graph layout parameters | 2009-04-30 | Paper |
| Connected Coloring Completion for General Graphs: Algorithms and Complexity | 2009-03-06 | Paper |
| Quadratic Kernelization for Convex Recoloring of Trees | 2009-03-06 | Paper |
| On the Complexity of Some Colorful Problems Parameterized by Treewidth | 2009-03-03 | Paper |
| Parameterized Complexity of Stabbing Rectangles and Squares in the Plane | 2009-02-24 | Paper |
| On the parameterized complexity of multiple-interval graph problems | 2009-02-19 | Paper |
| Clustering with Partial Information | 2009-02-03 | Paper |
| Graph Layout Problems Parameterized by Vertex Cover | 2009-01-29 | Paper |
| Leaf Powers and Their Properties: Using the Trees | 2009-01-29 | Paper |
| Faster fixed-parameter tractable algorithms for matching and packing problems | 2008-12-02 | Paper |
| On the parameterized complexity of layered graph drawing | 2008-12-02 | Paper |
| On Problems without Polynomial Kernels (Extended Abstract) | 2008-08-28 | Paper |
| Fixed-Parameter Algorithms for Kemeny Scores | 2008-07-10 | Paper |
| Facility Location Problems: A Parameterized View | 2008-07-10 | Paper |
| Parameterized Algorithms and Hardness Results for Some Graph Motif Problems | 2008-06-17 | Paper |
| A Purely Democratic Characterization of W[1] | 2008-06-05 | Paper |
| Parameterized Approximation Problems | 2008-06-03 | Paper |
| The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel | 2008-06-03 | Paper |
| The Lost Continent of Polynomial Time: Preprocessing and Kernelization | 2008-06-03 | Paper |
| Crown structures for vertex cover kernelization | 2007-12-19 | Paper |
| An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem | 2007-12-19 | Paper |
| The complexity of polynomial-time approximation | 2007-12-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On complexity of lobbying in multiple referenda | 2007-12-06 | Paper |
| Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs | 2007-11-28 | Paper |
| The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number | 2007-11-13 | Paper |
| On the parameterized intractability of motif search problems | 2007-01-08 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| On the structure of parameterized problems in NP | 2006-10-10 | Paper |
| A fixed-parameter approach to 2-layer planarization | 2006-08-11 | Paper |
| On finding short resolution refutations and small unsatisfiable subsets | 2006-04-06 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
| A refined search tree technique for dominating set on planar graphs | 2005-12-07 | Paper |
| Tight lower bounds for certain parameterized NP-hard problems | 2005-10-10 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Analogs & duals of the MAST problem for sequences & trees | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046487 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736845 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043700 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472448 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474097 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417671 | 2003-07-29 | Paper |
| On the parametric complexity of schedules to minimize tardy tasks. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796197 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779138 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776269 | 2002-07-22 | Paper |
| Constructions of large planar networks with given degree and diameter | 2002-07-21 | Paper |
| Index sets and parametric reductions | 2002-07-14 | Paper |
| Forbidden minors to graphs with small feedback sets | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520519 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503944 | 2001-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501141 | 2000-09-03 | Paper |
| On computing graph minor obstruction sets | 2000-08-23 | Paper |
| The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs | 2000-08-21 | Paper |
| On search, decision, and the efficiency of polynomial-time algorithms | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263467 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940885 | 2000-04-06 | Paper |
| The complexity of irredundant sets parameterized by size | 2000-03-22 | Paper |
| The Parametrized Complexity of Some Fundamental Problems in Coding Theory | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252027 | 2000-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249534 | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318710 | 1999-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217593 | 1999-08-17 | Paper |
| Threshold dominating sets and an improved characterization of \(W[2\)] | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375789 | 1998-10-11 | Paper |
| Parameterized circuit complexity and the \(W\) hierarchy | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393480 | 1998-06-10 | Paper |
| On the parameterized complexity of short computation and factorization | 1998-06-02 | Paper |
| Advice classes of parametrized tractability | 1997-11-02 | Paper |
| The parameterized complexity of sequence alignment and consensus | 1997-09-29 | Paper |
| Fixed-parameter tractability and completeness II: On completeness for W[1] | 1997-02-28 | Paper |
| A simple linear-time algorithm for finding path-decompositions of small width | 1997-02-27 | Paper |
| Sparse parameterized problems | 1997-02-13 | Paper |
| \(W[2\)-hardness of precedence constrained \(K\)-processor scheduling] | 1996-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862104 | 1996-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873792 | 1996-04-21 | Paper |
| Fixed-Parameter Tractability and Completeness I: Basic Results | 1996-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850549 | 1995-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4313178 | 1995-09-06 | Paper |
| Large planar graphs with given diameter and maximum degree | 1995-08-27 | Paper |
| Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues] | 1995-07-26 | Paper |
| The complexity of induced minors and related problems | 1995-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314356 | 1995-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281497 | 1994-11-13 | Paper |
| The Private Neighbor Cube | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273870 | 1994-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281539 | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279511 | 1994-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273844 | 1994-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038748 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027320 | 1993-02-21 | Paper |
| Self-witnessing polynomial-time complexity and prime factorization | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4017175 | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4017197 | 1993-01-16 | Paper |
| Polynomial-time self-reducibility: theoretical motivations and practical results∗ | 1992-09-27 | Paper |
| Constructive complexity | 1992-06-28 | Paper |
| On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design | 1992-06-28 | Paper |
| Searching forK3,3in linear time | 1992-06-25 | Paper |
| Transversals of Vertex Partitions in Graphs | 1992-06-25 | Paper |
| Counting trees in directed regular multigraphs | 1989-01-01 | Paper |
| Radius and diameter in Manhattan lattices | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3032280 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3034816 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833615 | 1989-01-01 | Paper |
| On finding optimal and near-optimal lineal spanning trees | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798235 | 1988-01-01 | Paper |
| Nonconstructive tools for proving polynomial-time decidability | 1988-01-01 | Paper |
| Nonconstructive advances in polynomial-time complexity | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3775581 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800059 | 1987-01-01 | Paper |
| Algorithms for learning and teaching sets of vertices in graphs | 0001-01-03 | Paper |
