| Publication | Date of Publication | Type |
|---|
| Exact and approximation algorithms for routing a convoy through a graph | 2024-12-03 | Paper |
| A \((3 + \epsilon)\)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds | 2024-11-28 | Paper |
| Online and dynamic algorithms for geometric set cover and hitting set | 2024-10-16 | Paper |
| A PTAS for the horizontal rectangle stabbing problem | 2024-08-20 | Paper |
| A 3-approximation algorithm for maximum independent set of rectangles | 2024-07-19 | Paper |
| Unsplittable flow on a path: the game! | 2024-07-19 | Paper |
| Tight approximation algorithms for two-dimensional guillotine strip packing | 2024-06-24 | Paper |
| Simpler constant factor approximation algorithms for weighted flow time -- now for any \(p\)-norm | 2024-05-29 | Paper |
| Optimal fully dynamic \(k\)-center clustering for adaptive and oblivious adversaries | 2024-05-14 | Paper |
| A PTAS for minimizing weighted flow time on a single machine | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187032 | 2024-02-05 | Paper |
| A PTAS for unsplittable flow on a path | 2023-12-08 | Paper |
| A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine | 2023-11-14 | Paper |
| Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles | 2023-11-02 | Paper |
| FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees | 2023-09-20 | Paper |
| Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back | 2023-09-20 | Paper |
| Fixed-parameter algorithms for unsplittable flow cover | 2023-04-27 | Paper |
| Better Approximations for General Caching and UFP-Cover Under Resource Augmentation | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874315 | 2023-02-07 | Paper |
| A PTAS for the horizontal rectangle stabbing problem | 2022-08-16 | Paper |
| Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack | 2022-05-11 | Paper |
| Packing cars into narrow roads: PTASs for limited supply highway | 2022-05-11 | Paper |
| Approximating Geometric Knapsack via L-packings | 2022-02-22 | Paper |
| Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | 2021-08-04 | Paper |
| Fixed-parameter approximation schemes for weighted flowtime | 2021-08-04 | Paper |
| On the extension complexity of scheduling polytopes | 2021-04-07 | Paper |
| Breaking symmetries to rescue sum of squares: the case of makespan scheduling | 2020-08-28 | Paper |
| On minimizing the makespan when some jobs cannot be assigned on the same machine | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111361 | 2020-05-27 | Paper |
| A \((1+\varepsilon)\)-approximation for unsplittable flow on a path in fixed-parameter running time | 2020-05-27 | Paper |
| Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking | 2020-05-26 | Paper |
| Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | 2020-04-14 | Paper |
| Approximation schemes for independent set and sparse subsets of polygons | 2020-02-11 | Paper |
| Breaking symmetries to rescue sum of squares: the case of makespan scheduling | 2020-02-06 | Paper |
| Faster Approximation Schemes for the Two-Dimensional Knapsack Problem | 2019-12-02 | Paper |
| A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes | 2019-08-22 | Paper |
| A Mazing 2+∊ Approximation for Unsplittable Flow on a Path | 2019-06-20 | Paper |
| A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices | 2019-06-20 | Paper |
| A new approach to online scheduling: approximating the optimal competitive ratio | 2019-05-15 | Paper |
| A mazing \(2+\epsilon\) approximation for unsplittable flow on a path | 2019-03-28 | Paper |
| A new approach to online scheduling: approximating the optimal competitive ratio | 2018-11-05 | Paper |
| Submodular unsplittable flow on trees | 2018-10-26 | Paper |
| Semidefinite and linear programming integrality gaps for scheduling identical machines | 2018-10-26 | Paper |
| Impact of locality on location aware unit disk graphs | 2018-08-20 | Paper |
| Faster approximation schemes for the two-dimensional knapsack problem | 2018-07-16 | Paper |
| On approximating strip packing with a better ratio than 3/2 | 2018-07-16 | Paper |
| To augment or not to augment: solving unsplittable flow on a path by creating slack | 2018-07-16 | Paper |
| How unsplittable-flow-covering helps scheduling with job-dependent cost functions | 2018-05-23 | Paper |
| Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking | 2018-04-11 | Paper |
| A quasi-PTAS for the two-dimensional geometric knapsack problem | 2017-10-05 | Paper |
| New approximation schemes for unsplittable flow on a path | 2017-10-05 | Paper |
| How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking | 2017-08-31 | Paper |
| On guillotine cutting sequences | 2017-08-31 | Paper |
| This house proves that debating is harder than soccer | 2017-07-17 | Paper |
| Submodular unsplittable flow on trees | 2016-08-10 | Paper |
| Semidefinite and linear programming integrality gaps for scheduling identical machines | 2016-08-10 | Paper |
| The power of recourse for online MST and TSP | 2016-07-04 | Paper |
| Independent Set of Convex Polygons: from \(n^{\epsilon }\) to \(1+\epsilon\) via shrinking | 2016-05-03 | Paper |
| Scheduling and fixed-parameter tractability | 2015-12-09 | Paper |
| A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem | 2015-10-27 | Paper |
| Assigning sporadic tasks to unrelated machines | 2015-08-31 | Paper |
| Scheduling with an orthogonal resource constraint | 2015-06-25 | Paper |
| On the configuration-LP for scheduling on unrelated machines | 2015-01-22 | Paper |
| A constant factor approximation algorithm for unsplittable flow on paths | 2014-07-30 | Paper |
| A constant-factor approximation algorithm for unsplittable flow on paths | 2014-07-30 | Paper |
| Partitioned EDF scheduling on a few types of unrelated multiprocessors | 2014-07-14 | Paper |
| How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions | 2014-07-01 | Paper |
| Scheduling and fixed-parameter tractability | 2014-06-02 | Paper |
| Scheduling with an orthogonal resource constraint | 2013-09-13 | Paper |
| The power of recourse for online MST and TSP | 2013-08-12 | Paper |
| Assigning sporadic tasks to unrelated parallel machines | 2013-08-12 | Paper |
| Constant integrality gap LP formulations of unsplittable flow on a path | 2013-03-19 | Paper |
| Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines | 2013-03-19 | Paper |
| Analysing local algorithms in location-aware quasi-unit-disk graphs | 2011-10-27 | Paper |
| On the Configuration-LP for Scheduling on Unrelated Machines | 2011-09-16 | Paper |
| Local algorithms for edge colorings in UDGs | 2011-09-12 | Paper |
| Universal packet routing with arbitrary bandwidths and transit times | 2011-06-24 | Paper |
| Throughput maximization for periodic packet routing on trees and grids | 2011-02-15 | Paper |
| Policies for periodic packet routing | 2010-12-09 | Paper |
| Increasing speed scheduling and flow scheduling | 2010-12-09 | Paper |
| Scheduling periodic tasks in a hard real-time environment | 2010-09-07 | Paper |
| Solving an avionics real-time scheduling problem by advanced IP-methods | 2010-09-06 | Paper |
| Packet Routing: Complexity and Algorithms | 2010-05-11 | Paper |
| Packet Routing on the Grid | 2010-04-27 | Paper |
| Local construction and coloring of spanners of location aware unit disk graphs | 2010-03-11 | Paper |
| Local Algorithms for Edge Colorings in UDGs | 2010-01-21 | Paper |
| Optimal movement of mobile sensors for barrier coverage of a planar region | 2009-11-25 | Paper |
| Real-Time Message Routing and Scheduling | 2009-10-28 | Paper |
| Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs | 2009-02-12 | Paper |
| Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region | 2009-01-27 | Paper |
| Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs | 2009-01-20 | Paper |
