| Publication | Date of Publication | Type |
|---|
| Faster algorithms for bounded knapsack and bounded subset sum via fine-grained proximity results | 2024-11-28 | Paper |
| FPT algorithms for a special block-structured integer program with applications in scheduling | 2024-11-07 | Paper |
| Bike rebalancing: how to find a balanced matching in the k center problem? | 2024-07-02 | Paper |
| Approximation algorithms for interdiction problem with packing constraints | 2024-06-24 | Paper |
| Scheduling on a graph with release times | 2024-04-02 | Paper |
| Two homogeneous facility location games with a minimum distance requirement on a circle | 2024-03-01 | Paper |
| Learning-augmented algorithms for online subset sum | 2023-11-08 | Paper |
| Approximate ridesharing of personal vehicles problem | 2023-03-21 | Paper |
| Truthful mechanism design for bin packing with applications on cloud computing | 2022-10-18 | Paper |
| From packing rules to cost-sharing mechanisms | 2022-10-04 | Paper |
| Two-facility location games with a minimum distance requirement on a circle | 2022-06-29 | Paper |
| On the price of anarchy of two-stage machine scheduling games | 2021-11-25 | Paper |
| FPT Algorithms for a Special Block-structured Integer Program with Applications in Scheduling | 2021-07-03 | Paper |
| Approximate ridesharing of personal vehicles problem | 2021-06-08 | Paper |
| Block-structured Integer Programming: Can we Parameterize without the Largest Coefficient? | 2020-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3307329 | 2020-08-12 | Paper |
| The \(k\)-delivery traveling salesman problem: revisited | 2020-05-13 | Paper |
| Truthful mechanism design of reversed auction on cloud computing | 2020-02-24 | Paper |
| Weighted throughput maximization with calibrations | 2020-01-16 | Paper |
| Efficient algorithms for ridesharing of personal vehicles | 2019-08-09 | Paper |
| Online scheduling of moldable parallel tasks | 2019-08-08 | Paper |
| On the optimality of approximation schemes for the classical scheduling problem | 2019-06-20 | Paper |
| Facility location games with distinct desires | 2019-06-20 | Paper |
| Strategy-proof mechanisms for obnoxious facility game with bounded service range | 2019-06-06 | Paper |
| Mechanism Design for One-Facility Location Game with Obnoxious Effects | 2019-04-26 | Paper |
| Packing Groups of Items into Multiple Knapsacks | 2019-03-28 | Paper |
| Algorithmic analysis for ridesharing of personal vehicles | 2018-12-05 | Paper |
| The path set packing problem | 2018-10-04 | Paper |
| An improved lower bound for rank four scheduling | 2018-09-28 | Paper |
| On the optimality of exact and approximation algorithms for scheduling problems | 2018-06-06 | Paper |
| Mechanism design for one-facility location game with obnoxious effects on a line | 2018-06-05 | Paper |
| Parallel machine scheduling with speed-up resources | 2018-05-30 | Paper |
| Approximation algorithms for parallel machine scheduling with speed-up resources | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636620 | 2018-04-19 | Paper |
| The price of anarchy in two-stage scheduling games | 2018-03-26 | Paper |
| Online lazy bureaucrat scheduling with a machine deadline | 2018-03-01 | Paper |
| Efficient algorithms for ridesharing of personal vehicles | 2018-02-26 | Paper |
| Cost-sharing mechanisms for selfish bin packing | 2018-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601880 | 2018-01-24 | Paper |
| Online knapsack with resource augmentation | 2017-11-03 | Paper |
| Algorithmic Analysis for Ridesharing of Personal Vehicles | 2017-02-01 | Paper |
| An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints | 2017-02-01 | Paper |
| Approximate composable truthful mechanism design | 2016-11-24 | Paper |
| Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval | 2016-07-08 | Paper |
| Approximate strip packing: revisited | 2016-07-07 | Paper |
| A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer | 2016-06-01 | Paper |
| An asymptotic competitive scheme for online bin packing | 2015-12-11 | Paper |
| Approximate Truthful Mechanism Design for Two-Dimensional Orthogonal Knapsack Problem | 2015-10-29 | Paper |
| An Asymptotic Competitive Scheme for Online Bin Packing | 2015-09-11 | Paper |
| Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming | 2015-04-15 | Paper |
| On two-machine flow shop scheduling | 2015-01-27 | Paper |
| ONLINE SCHEDULING OF MIXED CPU-GPU JOBS | 2015-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934715 | 2014-12-18 | Paper |
| New perspectives of several fundamental problems in combinatorial optimization | 2014-11-03 | Paper |
| A new upper bound 2.5545 on 2D Online Bin Packing | 2014-09-09 | Paper |
| Approximation algorithms for a bi-level knapsack problem | 2014-01-10 | Paper |
| Strategy-proof approximation mechanisms for an obnoxious facility game on networks | 2014-01-10 | Paper |
| A harmonic algorithm for the 3D strip packing problem | 2013-07-24 | Paper |
| Obnoxious Facility Game with a Bounded Service Range | 2013-05-28 | Paper |
| Online Scheduling on a CPU-GPU Cluster | 2013-05-28 | Paper |
| Scheduling on two identical machines with a speed-up resource | 2013-04-04 | Paper |
| Vehicle Scheduling on a Graph Revisited | 2013-03-21 | Paper |
| Approximation schemes for two-machine flow shop scheduling with two agents | 2013-01-03 | Paper |
| Coordination Mechanisms for Selfish Parallel Jobs Scheduling | 2012-07-16 | Paper |
| Improved Approximation Algorithms for Routing Shop Scheduling | 2011-12-16 | Paper |
| Mechanisms for Obnoxious Facility Game on a Path | 2011-08-12 | Paper |
| Approximation Algorithms for a Bi-level Knapsack Problem | 2011-08-12 | Paper |
| Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget | 2011-06-03 | Paper |
| Online multiple-strip packing | 2011-01-28 | Paper |
| On-line scheduling of multi-core processor tasks with virtualization | 2010-09-07 | Paper |
| Optimal online-list batch scheduling | 2010-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3575450 | 2010-07-27 | Paper |
| Approximation Algorithms for Scheduling with a Variable Machine Maintenance | 2010-07-20 | Paper |
| Deterministic on-line call control in cellular networks | 2010-07-07 | Paper |
| Maximizing the throughput of parallel jobs on hypercubes | 2010-01-29 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| A note on online strip packing | 2009-07-10 | Paper |
| A Note on Online Scheduling for Jobs with Arbitrary Release Times | 2009-07-07 | Paper |
| On-Line Multiple-Strip Packing | 2009-07-07 | Paper |
| Hardness of lazy packing and covering | 2009-05-07 | Paper |
| Scheduling with a minimum number of machines | 2009-05-07 | Paper |
| On-line scheduling with extendable working time on a small number of machines | 2009-03-23 | Paper |
| Optimal Resource Augmentations for Online Knapsack | 2009-02-17 | Paper |
| On-line scheduling of parallel jobs on two machines | 2008-11-18 | Paper |
| On-line scheduling of parallel jobs in a list | 2008-11-10 | Paper |
| Online Scheduling of Equal-Length Jobs on Parallel Machines | 2008-09-25 | Paper |
| Common Deadline Lazy Bureaucrat Scheduling Revisited | 2008-09-18 | Paper |
| Online removable square packing | 2008-06-06 | Paper |
| On lazy bureaucrat scheduling with common deadlines | 2008-05-13 | Paper |
| Online bin packing of fragile objects with application in cellular networks | 2008-04-23 | Paper |
| Online Scheduling with Hard Deadlines on Parallel Machines | 2008-01-04 | Paper |
| Strip Packing vs. Bin Packing | 2008-01-04 | Paper |
| The Hardness of Selective Network Design for Bottleneck Routing Games | 2007-11-13 | Paper |
| Maximizing the total profit of rectangles packed into a rectangle | 2007-04-26 | Paper |
| On-line scheduling mesh jobs with dependencies | 2007-03-15 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors | 2005-09-01 | Paper |
| A 3-approximation algorithm for two-dimensional bin packing | 2005-08-25 | Paper |
| A note on on-line scheduling with partial information | 2004-11-18 | Paper |
| An on-line bin-batching problem. | 2004-02-18 | Paper |
| On-line algorithms for minimizing makespan on batch processing machines | 2003-09-15 | Paper |
| A new approximation algorithm for UET-scheduling with chain-type precedence constraints. | 2003-09-07 | Paper |
| On maximizing the throughput of multiprocessor tasks. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708576 | 2003-06-18 | Paper |
| Minimizing makespan on a single batch processing machine with nonidentical job sizes | 2001-09-09 | Paper |
| A constrained minimum spanning tree problem | 2001-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489614 | 2000-07-11 | Paper |
| Optimal on-line algorithms for variable-sized bin covering | 1999-12-19 | Paper |
| A \(17/10\)-approximation algorithm for \(k\)-bounded space on-line variable-sized bin packing | 1999-11-11 | Paper |
| Semi on-line scheduling on two identical machines | 1999-09-07 | Paper |
| The FFD algorithm for the bin packing problem with kernel items | 1999-05-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4367453 | 1998-09-20 | Paper |
| Parameterized on-line open-end bin packing | 1998-06-08 | Paper |
| Tight performance bound of \(AFBk\) bin packing | 1998-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4382124 | 1998-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4351590 | 1997-11-11 | Paper |
| A new version of on-line variable-sized bin packing | 1997-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4714971 | 1996-11-07 | Paper |
