| Publication | Date of Publication | Type |
|---|
| 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 |
| https://portal.mardi4nfdi.de/entity/Q6060002 | 2023-11-02 | Paper |
| Faster (1+µ)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back | 2023-09-20 | Paper |
| FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees | 2023-09-20 | Paper |
| Fixed-parameter algorithms for unsplittable flow cover | 2023-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874315 | 2023-02-07 | Paper |
| Better Approximations for General Caching and UFP-Cover Under Resource Augmentation | 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 |
| https://portal.mardi4nfdi.de/entity/Q5075798 | 2022-05-11 | Paper |
| Approximating Geometric Knapsack via L-packings | 2022-02-22 | Paper |
| Fixed-Parameter Approximation Schemes for Weighted Flowtime. | 2021-08-04 | Paper |
| Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs | 2021-08-04 | Paper |
| On the extension complexity of scheduling polytopes | 2021-04-07 | Paper |
| Breaking symmetries to rescue sum of squares in the case of makespan scheduling | 2020-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111361 | 2020-05-27 | Paper |
| A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time | 2020-05-27 | Paper |
| On minimizing the makespan when some jobs cannot be assigned on the same machine | 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 in 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 + ε)-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+ε Approximation for Unsplittable Flow on a Path | 2019-03-28 | Paper |
| A New Approach to Online Scheduling | 2018-11-05 | Paper |
| Semidefinite and linear programming integrality gaps for scheduling identical machines | 2018-10-26 | Paper |
| Submodular unsplittable flow on trees | 2018-10-26 | Paper |
| Impact of locality on location aware unit disk graphs | 2018-08-20 | Paper |
| On approximating strip packing with a better ratio than 3/2 | 2018-07-16 | Paper |
| Faster approximation schemes for the two-dimensional knapsack problem | 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 |
| https://portal.mardi4nfdi.de/entity/Q5351886 | 2017-08-31 | Paper |
| How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking | 2017-08-31 | Paper |
| This House Proves that Debating is Harder than Soccer | 2017-07-17 | Paper |
| Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines | 2016-08-10 | Paper |
| Submodular Unsplittable Flow on Trees | 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 }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking | 2016-05-03 | Paper |
| Scheduling and fixed-parameter tractability | 2015-12-09 | Paper |
| A $$(2+\epsilon )$$-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 |
| Assigning Sporadic Tasks to Unrelated Parallel Machines | 2013-08-12 | Paper |
| The Power of Recourse for Online MST and TSP | 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 |
