| Publication | Date of Publication | Type |
|---|
| Optimization Problems in Graphs with Locational Uncertainty | 2024-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6152160 | 2024-02-12 | Paper |
| Single machine robust scheduling with budgeted uncertainty | 2023-06-28 | Paper |
| Parameterized complexity of computing maximum minimal blocking and hitting sets | 2023-02-16 | Paper |
| Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. | 2023-02-03 | Paper |
| Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel | 2022-11-15 | Paper |
| Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty | 2022-11-09 | Paper |
| Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds | 2022-10-27 | Paper |
| Packing Arc-Disjoint Cycles in Tournaments | 2022-07-21 | Paper |
| Approximation results for makespan minimization with budgeted uncertainty | 2021-09-28 | Paper |
| Packing arc-disjoint cycles in tournaments | 2021-04-19 | Paper |
| Approximation results for makespan minimization with budgeted uncertainty | 2020-08-24 | Paper |
| Triangle packing in (sparse) tournaments: approximation and kernelization | 2020-05-27 | Paper |
| How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs | 2020-05-27 | Paper |
| On independent set in \(B_1\)-EPG graphs | 2020-04-21 | Paper |
| Approximating robust bin packing with budgeted uncertainty | 2020-01-16 | Paper |
| How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? | 2019-09-10 | Paper |
| Robust scheduling with budgeted uncertainty | 2019-05-17 | Paper |
| Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations | 2018-12-10 | Paper |
| Approximability and exact resolution of the multidimensional binary vector assignment problem | 2018-12-06 | Paper |
| On the complexity of wafer-to-wafer integration | 2018-05-24 | Paper |
| (Arc-disjoint) cycle packing in tournament: classical and parameterized complexity | 2018-02-19 | Paper |
| The complexity of partitioning into disjoint cliques and a triangle-free graph | 2017-03-15 | Paper |
| Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem | 2016-11-30 | Paper |
| Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs | 2016-03-21 | Paper |
| On Independent Set on B1-EPG Graphs | 2016-02-26 | Paper |
| Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations | 2015-09-29 | Paper |
| On the Complexity of Wafer-to-Wafer Integration | 2015-09-21 | Paper |
| Improved approximation algorithms for scheduling parallel jobs on identical clusters | 2015-09-16 | Paper |
| Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs | 2015-01-13 | Paper |
| Approximating the Sparsest k-Subgraph in Chordal Graphs | 2014-09-02 | Paper |
| On the sum-max graph partitioning problem | 2014-06-06 | Paper |
| Moderately exponential approximation for makespan minimization on related machines | 2014-01-13 | Paper |
| Approximation Algorithms for the Wafer to Wafer Integration Problem | 2013-09-13 | Paper |
| Sum-Max Graph Partitioning Problem | 2012-11-02 | Paper |
| APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS | 2012-08-27 | Paper |
| Scheduling Jobs on Heterogeneous Platforms | 2011-08-17 | Paper |
| APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM | 2011-05-10 | Paper |
| Approximating the Non-contiguous Multiple Organization Packing Problem | 2010-10-27 | Paper |
| Approximation Algorithms for Multiple Strip Packing | 2010-05-11 | Paper |
