| No. |
Title |
Author |
Year |
| 1 |
A PTAS for Packing Hypercubes into a Knapsack |
Jansen, Klaus et al. |
2022 |
| 2 |
Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251) |
Bampis, Evripidis et al. |
2021 |
| 3 |
Closing the Gap for Single Resource Constraint Scheduling |
Jansen, Klaus et al. |
2021 |
| 4 |
Fuzzy Simultaneous Congruences |
Deppert, Max A. et al. |
2021 |
| 5 |
Linear, Semidefinite Programming and Randomization Methods for Combinatorial Optimization Problems (Dagstuhl Seminar 00041) |
Jansen, Klaus et al. |
2021 |
| 6 |
Peak Demand Minimization via Sliced Strip Packing |
Deppert, Max A. et al. |
2021 |
| 7 |
A Tight (3/2+ε) Approximation for Skewed Strip Packing |
Gálvez, Waldo et al. |
2020 |
| 8 |
Inapproximability Results for Scheduling with Interval and Resource Restrictions |
Maack, Marten et al. |
2020 |
| 9 |
Closing the Gap for Pseudo-Polynomial Strip Packing |
Jansen, Klaus et al. |
2019 |
| 10 |
Local Search Breaks 1.75 for Graph Balancing |
Jansen, Klaus et al. |
2019 |
| 11 |
Near-Linear Time Algorithm for n-fold ILPs via Color Coding |
Jansen, Klaus et al. |
2019 |
| 12 |
Online Bin Covering with Limited Migration |
Berndt, Sebastian et al. |
2019 |
| 13 |
Compact LP Relaxations for Allocation Problems |
Jansen, Klaus et al. |
2018 |
| 14 |
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times |
Jansen, Klaus et al. |
2018 |
| 15 |
Front Matter, Table of Contents, Preface, Conference Organization |
Blais, Eric et al. |
2018 |
| 16 |
LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume |
Blais, Eric et al. |
2018 |
| 17 |
On Integer Programming and Convolution |
Jansen, Klaus et al. |
2018 |
| 18 |
Frontmatter, Table of Contents, Preface, Organization, External Reviewers, List of Authors |
Jansen, Klaus et al. |
2017 |
| 19 |
LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume |
Jansen, Klaus et al. |
2017 |
| 20 |
Online Strip Packing with Polynomial Migration |
Jansen, Klaus et al. |
2017 |
| 21 |
Closing the Gap for Makespan Scheduling via Sparsification Techniques |
Jansen, Klaus et al. |
2016 |
| 22 |
Estimating The Makespan of The Two-Valued Restricted Assignment Problem |
Jansen, Klaus et al. |
2016 |
| 23 |
Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors |
Jansen, Klaus et al. |
2016 |
| 24 |
LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume |
Jansen, Klaus et al. |
2016 |
| 25 |
Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors |
Garg, Naveen et al. |
2015 |
| 26 |
Fully Dynamic Bin Packing Revisited |
Berndt, Sebastian et al. |
2015 |
| 27 |
Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows |
Paulsen, Niklas et al. |
2015 |
| 28 |
LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume |
Garg, Naveen et al. |
2015 |
| 29 |
Frontmatter, Table of Contents, Preface, Conference Organization |
Jansen, Klaus et al. |
2014 |
| 30 |
LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume |
Jansen, Klaus et al. |
2014 |
| 31 |
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) |
Jansen, Klaus et al. |
2011 |
| 32 |
Trimming of Graphs, with Application to Point Labeling |
Erlebach, Thomas et al. |
2008 |
| 33 |
07211 Abstracts Collection -- Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes |
Brandstädt, Andreas et al. |
2007 |
| 34 |
04221 Abstracts Collection -- Robust and Approximative Algorithms on Particular Graph Classes |
Brandstädt, Andreas et al. |
2005 |
