| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147300 | 2024-01-15 | Paper |
| Approximating sparse quadratic programs | 2024-01-02 | Paper |
| SETH-based Lower Bounds for Subset Sum and Bicriteria Path | 2023-10-31 | Paper |
| No Polynomial Kernels for Knapsack | 2023-08-24 | Paper |
| Equitable scheduling on a single machine | 2023-06-27 | Paper |
| Temporal interval cliques and independent sets | 2023-05-23 | Paper |
| Computing the \(k\) densest subgraphs of a graph | 2022-10-28 | Paper |
| Hans Bodlaender and the Theory of Kernelization Lower Bounds | 2022-10-19 | Paper |
| A general scheme for solving a large set of scheduling problems with rejection in FPT time | 2022-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5075765 | 2022-05-11 | Paper |
| Faster minimization of tardy processing time on a single machine | 2022-05-03 | Paper |
| Scheduling lower bounds via AND subset sum | 2022-04-04 | Paper |
| Efficient enumeration of maximal induced bicliques | 2021-09-15 | Paper |
| How hard is it to satisfy (almost) all roommates | 2021-07-28 | Paper |
| New algorithms for minimizing the weighted number of tardy jobs on a single machine | 2021-05-05 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2020-09-08 | Paper |
| Parameterized multi-scenario single-machine scheduling problems | 2020-09-03 | Paper |
| Lossy Kernels for Hitting Subgraphs | 2020-05-26 | Paper |
| The clever shopper problem | 2020-02-27 | Paper |
| On the parameterized tractability of the just-in-time flow-shop scheduling problem | 2020-02-12 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2019-12-06 | Paper |
| Domination When the Stars Are Out | 2019-11-25 | Paper |
| SETH-Based Lower Bounds for Subset Sum and Bicriteria Path | 2019-10-15 | Paper |
| On approximate preprocessing for domination and hitting subgraphs with connected deletion sets | 2019-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743381 | 2019-05-10 | Paper |
| The clever shopper problem | 2018-11-28 | Paper |
| Tight Kernel Bounds for Problems on Graphs with Small Degeneracy | 2018-11-12 | Paper |
| On the parameterized tractability of single machine scheduling with rejection | 2018-10-30 | Paper |
| Diminishable parameterized problems and strict polynomial kernelization | 2018-09-06 | Paper |
| Fractals for Kernelization Lower Bounds | 2018-03-26 | Paper |
| A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands | 2018-03-23 | Paper |
| Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems | 2017-12-19 | Paper |
| Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs | 2017-09-29 | Paper |
| Parameterized Complexity of Critical Node Cuts | 2017-09-29 | Paper |
| Parameterized complexity of critical node cuts | 2017-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2954992 | 2017-01-24 | Paper |
| Parameterized complexity dichotomy for \textsc{Steiner Multicut} | 2016-06-13 | Paper |
| Binary jumbled pattern matching on trees and tree-like structures | 2015-11-19 | Paper |
| Parameterized complexity analysis for the closest string with wildcards problem | 2015-09-16 | Paper |
| On the average-case complexity of parameterized clique | 2015-05-18 | Paper |
| A completeness theory for polynomial (Turing) kernelization | 2015-05-04 | Paper |
| Parameterized complexity of induced graph matching on claw-free graphs | 2015-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934605 | 2014-12-18 | Paper |
| Optimization problems in dotted interval graphs | 2014-08-22 | Paper |
| Parameterized Complexity Analysis for the Closest String with Wildcards Problem | 2014-06-30 | Paper |
| Local search for string problems: brute-force is essentially optimal | 2014-03-13 | Paper |
| A Completeness Theory for Polynomial (Turing) Kernelization | 2013-12-10 | Paper |
| Tight Kernel Bounds for Problems on Graphs with Small Degeneracy | 2013-09-17 | Paper |
| Tractable Parameterizations for the Minimum Linear Arrangement Problem | 2013-09-17 | Paper |
| Binary Jumbled Pattern Matching on Trees and Tree-Like Structures | 2013-09-17 | Paper |
| Local Search for String Problems: Brute Force Is Essentially Optimal | 2013-06-14 | Paper |
| Parameterized two-player Nash equilibrium | 2013-05-16 | Paper |
| Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph | 2013-03-21 | Paper |
| Unified compression-based acceleration of edit-distance computation | 2013-03-05 | Paper |
| Constraint satisfaction problems: convexity makes AllDifferent constraints tractable | 2013-03-04 | Paper |
| Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications | 2012-11-21 | Paper |
| Optimization Problems in Dotted Interval Graphs | 2012-11-06 | Paper |
| Treewidth governs the complexity of target set selection | 2012-10-16 | Paper |
| Parameterized Complexity of Induced H-Matching on Claw-Free Graphs | 2012-09-25 | Paper |
| Mod/Resc parsimony inference: theory and application | 2012-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390005 | 2012-04-24 | Paper |
| Parameterized two-player Nash equilibrium | 2011-12-16 | Paper |
| Minimum vertex cover in rectangle graphs | 2011-07-20 | Paper |
| Distance Oracles for Vertex-Labeled Graphs | 2011-07-07 | Paper |
| Domination When the Stars Are Out | 2011-07-06 | Paper |
| Upper and lower bounds for finding connected motifs in vertex-colored graphs | 2011-04-28 | Paper |
| Optimization problems in multiple subtree graphs | 2011-04-19 | Paper |
| An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications | 2011-03-15 | Paper |
| Minimum Vertex Cover in Rectangle Graphs | 2010-09-06 | Paper |
| Mod/Resc Parsimony Inference | 2010-07-26 | Paper |
| Finding common structured patterns in linear graphs | 2010-06-07 | Paper |
| Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications | 2010-05-11 | Paper |
| Optimization Problems in Multiple Subtree Graphs | 2010-05-11 | Paper |
| W-hierarchies defined by symmetric gates | 2010-05-10 | Paper |
| Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs | 2010-01-14 | Paper |
| On problems without polynomial kernels | 2009-11-10 | Paper |
| Haplotype Inference Constrained by Plausible Haplotype Data | 2009-07-07 | Paper |
| Fixed-parameter algorithms for protein similarity search under mRNA structure constraints | 2009-02-23 | Paper |
| On the parameterized complexity of multiple-interval graph problems | 2009-02-19 | Paper |
| The minimum substring cover problem | 2008-12-03 | Paper |
| On Problems without Polynomial Kernels (Extended Abstract) | 2008-08-28 | Paper |
| Approximating the 2-interval pattern problem | 2008-07-10 | Paper |
| Common Structured Patterns in Linear Graphs: Approximation and Combinatorics | 2008-06-17 | Paper |
| Constrained LCS: Hardness and Approximation | 2008-06-17 | Paper |
| A Purely Democratic Characterization of W[1] | 2008-06-05 | Paper |
| The Minimum Substring Cover Problem | 2008-02-20 | Paper |
| Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs | 2007-11-28 | Paper |
| Local Alignment of RNA Sequences with Arbitrary Scoring Schemes | 2007-09-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
