No. Title Author Year
1 Closing the Gap for Pseudo-Polynomial Strip Packing Jansen, Klaus et al. 2019
2 Local Search Breaks 1.75 for Graph Balancing Jansen, Klaus et al. 2019
3 Near-Linear Time Algorithm for n-fold ILPs via Color Coding Jansen, Klaus et al. 2019
4 Online Bin Covering with Limited Migration Berndt, Sebastian et al. 2019
5 Compact LP Relaxations for Allocation Problems Jansen, Klaus et al. 2018
6 Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times Jansen, Klaus et al. 2018
7 Front Matter, Table of Contents, Preface, Conference Organization Blais, Eric et al. 2018
8 LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume Blais, Eric et al. 2018
9 On Integer Programming and Convolution Jansen, Klaus et al. 2018
10 Frontmatter, Table of Contents, Preface, Organization, External Reviewers, List of Authors Jansen, Klaus et al. 2017
11 LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume Jansen, Klaus et al. 2017
12 Online Strip Packing with Polynomial Migration Jansen, Klaus et al. 2017
13 Closing the Gap for Makespan Scheduling via Sparsification Techniques Jansen, Klaus et al. 2016
14 Estimating The Makespan of The Two-Valued Restricted Assignment Problem Jansen, Klaus et al. 2016
15 Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors Jansen, Klaus et al. 2016
16 LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume Jansen, Klaus et al. 2016
17 Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors Garg, Naveen et al. 2015
18 Fully Dynamic Bin Packing Revisited Berndt, Sebastian et al. 2015
19 Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows Paulsen, Niklas et al. 2015
20 LIPIcs, Volume 40, APPROX/RANDOM'15, Complete Volume Garg, Naveen et al. 2015
21 Frontmatter, Table of Contents, Preface, Conference Organization Jansen, Klaus et al. 2014
22 LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume Jansen, Klaus et al. 2014
23 Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Jansen, Klaus et al. 2011
24 Trimming of Graphs, with Application to Point Labeling Erlebach, Thomas et al. 2008
25 07211 Abstracts Collection -- Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Brandst├Ądt, Andreas et al. 2007
26 04221 Abstracts Collection -- Robust and Approximative Algorithms on Particular Graph Classes Brandst├Ądt, Andreas et al. 2005
Current Page :
Number of result pages: 1
Number of documents: 26


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI