| Publication | Date of Publication | Type |
|---|
| Computing generalized convolutions faster than brute force | 2024-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6182148 | 2023-12-20 | Paper |
| Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams | 2023-10-31 | Paper |
| Parameterized complexity of multicut in weighted trees | 2023-10-12 | Paper |
| Parameterized complexity of weighted multicut in trees | 2023-05-05 | Paper |
| Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering | 2023-04-04 | Paper |
| Parameterized algorithms for generalizations of directed feedback vertex set | 2023-02-16 | Paper |
| Chordless Cycle Packing Is Fixed-Parameter Tractable | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874544 | 2023-02-07 | Paper |
| Finding and Counting Permutations via CSPs | 2023-02-03 | Paper |
| How Does Object Fatness Impact the Complexity of Packing in d Dimensions | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875640 | 2023-02-03 | Paper |
| Parameterized Intractability of Even Set and Shortest Vector Problem | 2022-12-08 | Paper |
| Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs | 2022-12-08 | Paper |
| Four Shorts Stories on Surprising Algorithmic Uses of Treewidth | 2022-10-19 | Paper |
| Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088957 | 2022-07-18 | Paper |
| A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs | 2022-04-20 | Paper |
| Incompressibility of \(H\)-free edge modification problems: towards a dichotomy | 2022-01-31 | Paper |
| Multi-Budgeted Directed Cuts | 2021-08-04 | Paper |
| Finding and counting permutations via CSPs | 2021-07-26 | Paper |
| A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs | 2021-01-13 | Paper |
| The Parameterized Hardness of the k-Center Problem in Transportation Networks | 2020-08-25 | Paper |
| Multi-budgeted directed cuts | 2020-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304125 | 2020-08-05 | Paper |
| Subexponential parameterized algorithms for graphs of polynomial growth | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111866 | 2020-05-27 | Paper |
| The parameterized hardness of the \(k\)-center problem in transportation networks | 2020-05-21 | Paper |
| Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) | 2020-03-27 | Paper |
| Parameterized algorithms for generalizations of directed feedback vertex set | 2020-02-06 | Paper |
| Routing with congestion in acyclic digraphs | 2019-09-20 | Paper |
| Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms | 2019-09-10 | Paper |
| A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs | 2019-08-22 | Paper |
| Finding and counting permutations via CSPs | 2019-08-13 | Paper |
| Finding small patterns in permutations in linear time | 2019-06-20 | Paper |
| Interval Deletion is Fixed-Parameter Tractable | 2019-06-20 | Paper |
| Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) | 2019-06-20 | Paper |
| A subexponential parameterized algorithm for Subset TSP on planar graphs | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743378 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743512 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633903 | 2019-05-06 | Paper |
| Erd\"os-P\'osa property of minor-models with prescribed vertex sets | 2019-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4626304 | 2019-02-27 | Paper |
| Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs | 2019-02-14 | Paper |
| Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal | 2018-11-13 | Paper |
| On Problems as Hard as CNF-SAT | 2018-11-05 | Paper |
| Exponential Time Complexity of the Permanent and the Tutte Polynomial | 2018-10-30 | Paper |
| Minimizing Movement: Fixed-Parameter Tractability | 2018-10-30 | Paper |
| Interval Deletion Is Fixed-Parameter Tractable | 2018-10-30 | Paper |
| Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation | 2018-10-30 | Paper |
| Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable | 2018-10-30 | Paper |
| Constraint solving via fractional edge covers | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4580091 | 2018-08-13 | Paper |
| Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus | 2018-07-16 | Paper |
| Slightly Superexponential Parameterized Problems | 2018-06-05 | Paper |
| The limited blessing of low dimensionality | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636620 | 2018-04-19 | Paper |
| Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs. | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634386 | 2018-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608564 | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4608073 | 2018-03-15 | Paper |
| Fixed-parameter Approximability of Boolean MinCSPs | 2018-03-02 | Paper |
| Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598163 | 2017-12-19 | Paper |
| Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth | 2017-12-19 | Paper |
| Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels | 2017-10-05 | Paper |
| An exact characterization of tractable demand patterns for maximum disjoint path problems | 2017-10-05 | Paper |
| A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365079 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365080 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365098 | 2017-09-29 | Paper |
| Hitting forbidden subgraphs in graphs of bounded treewidth | 2017-09-28 | Paper |
| Homomorphisms are a good basis for counting small subgraphs | 2017-08-17 | Paper |
| Coloring Graphs with Constraints on Connectivity | 2017-08-10 | Paper |
| List H-coloring a graph by removing few vertices | 2017-05-11 | Paper |
| Chordal Editing is Fixed-Parameter Tractable | 2017-03-03 | Paper |
| Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). | 2017-03-03 | Paper |
| Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property | 2016-12-22 | Paper |
| Rooted grid minors | 2016-11-25 | Paper |
| Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | 2016-10-24 | Paper |
| Chordal editing is fixed-parameter tractable | 2016-06-28 | Paper |
| Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams | 2015-11-19 | Paper |
| On the parameterized complexity of finding separators with non-hereditary properties | 2015-09-02 | Paper |
| Parameterized Algorithms | 2015-08-17 | Paper |
| Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs | 2015-06-02 | Paper |
| Finding small separators in linear time via treewidth reduction | 2014-12-05 | Paper |
| Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth | 2014-10-14 | Paper |
| Geometric clustering | 2014-09-09 | Paper |
| On the hardness of losing weight | 2014-09-09 | Paper |
| Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth | 2014-08-13 | Paper |
| Tractable hypergraph properties for constraint satisfaction and conjunctive queries | 2014-08-13 | Paper |
| Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset | 2014-07-30 | Paper |
| Constraint Satisfaction Parameterized by Solution Size | 2014-07-30 | Paper |
| Immersions in Highly Edge Connected Graphs | 2014-06-19 | Paper |
| Fixed-parameter tractability of multicut parameterized by the size of the cutset | 2014-06-05 | Paper |
| Finding topological subgraphs is fixed-parameter tractable | 2014-06-05 | Paper |
| Structure theorem and isomorphism test for graphs with excluded topological subgraphs | 2014-05-13 | Paper |
| A faster FPT algorithm for bipartite contraction | 2014-04-14 | Paper |
| Parameterized complexity of Eulerian deletion problems | 2014-03-25 | Paper |
| Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth | 2014-02-17 | Paper |
| Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries | 2014-02-17 | Paper |
| A faster FPT algorithm for bipartite contraction | 2013-12-10 | Paper |
| Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset | 2013-11-14 | Paper |
| Size Bounds and Query Plans for Relational Joins | 2013-11-14 | Paper |
| List H-coloring a graph by removing few vertices | 2013-09-17 | Paper |
| Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable | 2013-08-12 | Paper |
| Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time | 2013-08-12 | Paper |
| A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals | 2013-08-12 | Paper |
| Block-Sorted Quantified Conjunctive Queries | 2013-08-07 | Paper |
| Fixed-Parameter Algorithms for Minimum Cost Edge-Connectivity Augmentation | 2013-08-06 | Paper |
| Clustering with local restrictions | 2013-06-06 | Paper |
| The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable | 2013-04-15 | Paper |
| Cleaning interval graphs | 2013-03-05 | Paper |
| Bin packing with fixed number of bins revisited | 2013-02-21 | Paper |
| Completely inapproximable monotone and antimonotone parameterized problems | 2013-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904144 | 2013-01-28 | Paper |
| The Tractability of CSP Classes Defined by Forbidden Patterns | 2012-12-03 | Paper |
| On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties | 2012-11-06 | Paper |
| Stable assignment with couples: parameterized complexity and local search | 2012-10-16 | Paper |
| FPT Suspects and Tough Customers: Open Problems of Downey and Fellows | 2012-09-05 | Paper |
| What’s Next? Future Directions in Parameterized Complexity | 2012-09-05 | Paper |
| Enumerating homomorphisms | 2012-05-11 | Paper |
| Obtaining a planar graph by vertex deletion | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389980 | 2012-04-24 | Paper |
| Tractable Structures for Constraint Satisfaction with Truth Tables | 2012-04-24 | Paper |
| Treewidth reduction for constrained separation and bipartization problems | 2012-01-23 | Paper |
| Important Separators and Parameterized Algorithms | 2011-12-16 | Paper |
| Parameterized Complexity of Eulerian Deletion Problems | 2011-12-16 | Paper |
| Sparse Balanced Partitions and the Complexity of Subgraph Problems | 2011-10-27 | Paper |
| Packing cycles through prescribed vertices | 2011-08-10 | Paper |
| Complexity of clique coloring and related problems | 2011-07-14 | Paper |
| Constraint Satisfaction Parameterized by Solution Size | 2011-07-06 | Paper |
| Clustering with Local Restrictions | 2011-07-06 | Paper |
| Soft Constraints of Difference and Equality | 2011-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002818 | 2011-05-24 | Paper |
| Tractable structures for constraint satisfaction with truth tables | 2011-05-23 | Paper |
| The complexity of global cardinality constraints | 2010-12-20 | Paper |
| Parameterized Complexity of the Arc-Preserving Subsequence Problem | 2010-11-16 | Paper |
| Parameterized complexity and local search approaches for the stable marriage problem with ties | 2010-10-07 | Paper |
| Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems | 2010-09-03 | Paper |
| Constant ratio fixed-parameter approximation of the edge multicut problem | 2010-09-01 | Paper |
| Constraint solving via fractional edge covers | 2010-08-16 | Paper |
| Bin Packing with Fixed Number of Bins Revisited | 2010-06-22 | Paper |
| Chordal deletion is fixed-parameter tractable | 2010-05-28 | Paper |
| COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD | 2010-05-28 | Paper |
| Parameterized graph cleaning problems | 2010-04-28 | Paper |
| Stable Assignment with Couples: Parameterized Complexity and Local Search | 2010-01-14 | Paper |
| A parameterized view on matroid optimization problems | 2009-11-04 | Paper |
| Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem | 2009-10-29 | Paper |
| Minimizing Movement: Fixed-Parameter Tractability | 2009-10-29 | Paper |
| Closest Substring Problems with Small Distances | 2009-08-20 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| List edge multicoloring in graphs with few cycles | 2009-07-09 | Paper |
| Complexity results for minimum sum edge coloring | 2009-06-30 | Paper |
| A Parameterized View on Matroid Optimization Problems | 2009-03-12 | Paper |
| The complexity of nonrepetitive coloring | 2009-03-04 | Paper |
| On tree width, bramble size, and expansion | 2009-01-21 | Paper |
| Parameterized Graph Cleaning Problems | 2009-01-20 | Paper |
| Chordal Deletion Is Fixed-Parameter Tractable | 2008-09-04 | Paper |
| On the Hardness of Losing Weight | 2008-08-28 | Paper |
| Complexity of unique list colorability | 2008-07-31 | Paper |
| Obtaining a Planar Graph by Vertex Deletion | 2008-07-01 | Paper |
| Parameterized Complexity of Independence and Domination on Geometric Graphs | 2008-06-03 | Paper |
| Searching the \(k\)-change neighborhood for TSP is W[1-hard] | 2008-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424784 | 2007-03-05 | Paper |
| The complexity of chromatic strength and chromatic edge strength | 2006-11-17 | Paper |
| Minimum sum multicoloring on the edges of trees | 2006-09-14 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Precoloring extension on unit interval graphs | 2006-06-09 | Paper |
| Parameterized graph separation problems | 2006-04-06 | Paper |
| Parameterized coloring problems on chordal graphs | 2006-04-06 | Paper |
| Parameterized complexity of constraint satisfaction problems | 2006-02-07 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| NP‐completeness of list coloring and precoloring extension on the edges of planar graphs | 2005-08-29 | Paper |
| A short proof of the NP-completeness of minimum sum interval coloring | 2005-08-25 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Eulerian disjoint paths problem in grid graphs is NP-complete | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708601 | 2003-06-18 | Paper |
