| Publication | Date of Publication | Type |
|---|
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Foundations of Computing | 2024-11-05 | Paper |
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
Parameterized algorithms and data reduction for safe convoy routing
| 2024-08-27 | Paper |
On approximate data reduction for the Rural Postman Problem: Theory and experiments
Networks | 2023-11-23 | Paper |
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
Networks | 2023-11-13 | Paper |
Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
Journal of Computer and System Sciences | 2023-10-24 | Paper |
On data reduction for dynamic vector bin packing
Operations Research Letters | 2023-09-12 | Paper |
Polynomial-time data reduction for weighted problems beyond additive goal functions
Discrete Applied Mathematics | 2023-02-22 | Paper |
Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
Algorithms for Sensor Systems | 2022-12-09 | Paper |
A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number
| 2022-07-18 | Paper |
Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
INFORMS Journal on Computing | 2022-06-28 | Paper |
Representative families for matroid intersections, with applications to location, packing, and covering problems
Discrete Applied Mathematics | 2021-05-31 | Paper |
The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
Operations Research Letters | 2021-04-07 | Paper |
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
Historia Mathematica | 2021-03-30 | Paper |
The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable
| 2020-11-08 | Paper |
Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
Information Processing Letters | 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 |
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
| 2019-10-24 | Paper |
Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
Journal of Scheduling | 2019-10-08 | Paper |
Polynomial-Time Data Reduction for Weighted Problems Beyond Additive Goal Functions
| 2019-10-01 | Paper |
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Sibirskie Elektronnye Matematicheskie Izvestiya | 2019-05-09 | Paper |
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Discrete Optimization | 2019-01-14 | Paper |
Constant-factor approximations for capacitated arc routing without triangle inequality
Operations Research Letters | 2018-09-28 | Paper |
Parameterized complexity of machine scheduling: 15 open problems
Computers \& Operations Research | 2018-09-18 | Paper |
h-Index Manipulation by Undoing Merges
| 2018-07-12 | Paper |
Parameterizing edge modification problems above lower bounds
Theory of Computing Systems | 2018-06-01 | Paper |
Finding secluded places of special interest in graphs
| 2018-04-10 | Paper |
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
Journal of Scheduling | 2017-09-01 | Paper |
The complexity of arc routing problems
| 2017-07-11 | Paper |
Partitioning perfect graphs into stars
Journal of Graph Theory | 2017-07-05 | Paper |
Twins in Subdivision Drawings of Hypergraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Fixed-parameter algorithms for DAG partitioning
Discrete Applied Mathematics | 2017-02-06 | Paper |
\(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
Artificial Intelligence | 2016-10-21 | Paper |
Completing partial schedules for open shop with unit processing times and routing
Computer Science – Theory and Applications | 2016-07-25 | Paper |
Parameterizing edge modification problems above lower bounds
Lecture Notes in Computer Science | 2016-07-25 | Paper |
Myhill-Nerode methods for hypergraphs
Algorithmica | 2016-02-19 | Paper |
Exploiting hidden structure in selecting dimensions that distinguish vectors
Journal of Computer and System Sciences | 2015-12-30 | Paper |
Interval scheduling and colorful independent sets
Journal of Scheduling | 2015-11-12 | Paper |
On the parameterized complexity of computing balanced partitions in graphs
Theory of Computing Systems | 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
Information Processing Letters | 2015-06-15 | Paper |
Network-based vertex dissolution
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
Towards optimal and expressive kernelization for \(d\)-hitting set
Algorithmica | 2015-01-19 | Paper |
Network-based dissolution
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Star partitions of perfect graphs
Lecture Notes in Computer Science | 2014-07-01 | Paper |
Myhill-Nerode methods for hypergraphs
Lecture Notes in Computer Science | 2014-01-14 | Paper |
On the parameterized complexity of computing graph bisections
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
A parameterized complexity analysis of combinatorial feature selection problems
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Parameterized complexity of DAG partitioning
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Interval scheduling and colorful independent sets
Lecture Notes in Computer Science | 2013-03-21 | Paper |
A new view on rural postman based on Eulerian extension and matching
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Towards optimal and expressive kernelization for \(d\)-hitting set
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Linear-time computation of a linear problem kernel for dominating set on planar graphs
Parameterized and Exact Computation | 2012-06-15 | Paper |
Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
Algorithmica | 2012-04-26 | Paper |
A new view on rural postman based on Eulerian extension and matching
Lecture Notes in Computer Science | 2012-01-13 | Paper |
From few components to an Eulerian graph by adding ARCS
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Measuring indifference: unit interval vertex deletion
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Kernelization through Tidying
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
