| Publication | Date of Publication | Type |
|---|
| On approximate data reduction for the Rural Postman Problem: Theory and experiments | 2023-11-23 | Paper |
| Parameterized algorithms and data reduction for the short secluded s‐t‐path problem | 2023-11-13 | Paper |
| Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU | 2023-10-24 | Paper |
| On data reduction for dynamic vector bin packing | 2023-09-12 | Paper |
| Polynomial-time data reduction for weighted problems beyond additive goal functions | 2023-02-22 | Paper |
| Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks | 2022-12-09 | Paper |
| Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments | 2022-06-28 | Paper |
| Representative families for matroid intersections, with applications to location, packing, and covering problems | 2021-05-31 | Paper |
| The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable | 2021-04-07 | Paper |
| A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem | 2021-03-30 | Paper |
| Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space | 2020-10-07 | Paper |
| On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem | 2020-05-19 | Paper |
| Fixed-parameter algorithms for maximum-profit facility location under matroid constraints | 2020-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5240198 | 2019-10-24 | Paper |
| Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review | 2019-10-08 | Paper |
| An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times | 2019-05-09 | Paper |
| The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs | 2019-01-14 | Paper |
| Constant-factor approximations for capacitated arc routing without triangle inequality | 2018-09-28 | Paper |
| Parameterized complexity of machine scheduling: 15 open problems | 2018-09-18 | Paper |
| h-Index Manipulation by Undoing Merges | 2018-07-12 | Paper |
| Parameterizing edge modification problems above lower bounds | 2018-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4634388 | 2018-04-10 | Paper |
| Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width | 2018-02-13 | Paper |
| A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack | 2017-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271449 | 2017-07-11 | Paper |
| Star Partitions of Perfect Graphs | 2017-07-05 | Paper |
| Twins in Subdivision Drawings of Hypergraphs | 2017-02-21 | Paper |
| Fixed-parameter algorithms for DAG partitioning | 2017-02-06 | Paper |
| \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments | 2016-10-21 | Paper |
| Parameterizing edge modification problems above lower bounds | 2016-07-25 | Paper |
| Completing Partial Schedules for Open Shop with Unit Processing Times and Routing | 2016-07-25 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2016-02-19 | Paper |
| Exploiting hidden structure in selecting dimensions that distinguish vectors | 2015-12-30 | Paper |
| Interval scheduling and colorful independent sets | 2015-11-12 | Paper |
| On the parameterized complexity of computing balanced partitions in graphs | 2015-09-04 | Paper |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 2015-07-08 | Paper |
| A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments | 2015-06-18 | Paper |
| Approximability and parameterized complexity of multicover by \(c\)-intervals | 2015-06-15 | Paper |
| Network-Based Vertex Dissolution | 2015-06-08 | Paper |
| Towards optimal and expressive kernelization for \(d\)-hitting set | 2015-01-19 | Paper |
| Network-Based Dissolution | 2014-10-14 | Paper |
| Star Partitions of Perfect Graphs | 2014-07-01 | Paper |
| Myhill-Nerode Methods for Hypergraphs | 2014-01-14 | Paper |
| On the Parameterized Complexity of Computing Graph Bisections | 2013-12-06 | Paper |
| A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems | 2013-09-20 | Paper |
| Parameterized Complexity of DAG Partitioning | 2013-06-07 | Paper |
| Interval scheduling and colorful independent sets | 2013-03-21 | Paper |
| A new view on rural postman based on Eulerian extension and matching | 2013-01-18 | Paper |
| Towards Optimal and Expressive Kernelization for d-Hitting Set | 2012-09-25 | Paper |
| Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs | 2012-06-15 | Paper |
| Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion | 2012-04-26 | Paper |
| A New View on Rural Postman Based on Eulerian Extension and Matching | 2012-01-13 | Paper |
| From Few Components to an Eulerian Graph by Adding Arcs | 2011-12-16 | Paper |
| Measuring Indifference: Unit Interval Vertex Deletion | 2010-11-16 | Paper |
| Kernelization through Tidying | 2010-04-27 | Paper |
