| 2026 | ICALP | A Tight Double-Exponential Lower Bound for High-Multiplicity Bin Packing. | Klaus Jansen, Felix Ohnesorge, Lis Pirotton |
| 2026 | IWOCA | Minimizing the Weighted Makespan with Restarts on a Single Machine. | Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton, Rob van Stee, Corinna Wambsganz |
| 2026 | IWOCA | Hardness of SetCover Reoptimization. | Klaus Jansen, Tobias Mmke, Bjrn Schumacher |
| 2026 | STACS | Approximation Algorithms for Integer Programming with Resource Augmentation. | Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen, Guochuan Zhang |
| 2026 | STACS | A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling. | Klaus Jansen, Felix Ohnesorge |
| 2026 | SPAA | Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling. | Bennet Edler, Klaus Jansen, Felix Ohnesorge, Lis Pirotton |
| 2026 | SPAA | Faster EPTAS for Scheduling on Uniform Machines. | Klaus Jansen, Bjrn Schumacher, Roberto Solis-Oba |
| 2025 | CIAC | Exact and Approximate High-Multiplicity Scheduling on Identical Machines. | Klaus Jansen, Kai Kahler, Esther Zwanger |
| 2025 | ESA | The Support of Bin Packing Is Exponential. | Klaus Jansen, Lis Pirotton, Malte Tutas |
| 2025 | WADS | Convolution and Knapsack in Higher Dimensions. | Kilian Grage, Klaus Jansen, Bjrn Schumacher |
| 2025 | WAOA | Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee. | Hauke Brinkop, David Fischer, Klaus Jansen |
| 2024 | SPAA | Hardness and Tight Approximations of Demand Strip Packing. | Klaus Jansen, Malin Rau, Malte Tutas |
| 2024 | RTNS | The Power of Duality: Response Time Analysis meets Integer Programming. | Max A. Deppert, Klaus Jansen |
| 2023 | EuroPar | Improved Algorithms for Monotone Moldable Job Scheduling Using Compression and Convolution. | Kilian Grage, Klaus Jansen, Felix Ohnesorge |
| 2023 | ISAAC | New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. | Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm |
| 2023 | SOFSEM | Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. | Hauke Brinkop, Klaus Jansen |
| 2023 | SOFSEM | On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines. | Klaus Jansen, Kai Kahler |
| 2022 | ALENEX | Load Balancing: The Long Road from Theory to Practice. | Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder |
| 2022 | ICALP | A PTAS for Packing Hypercubes into a Knapsack. | Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas |
| 2022 | IWOCA | Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks. | Thi Huyen Chau Nguyen, Werner Grass, Klaus Jansen |
| 2021 | CiE | Robust Online Algorithms for Dynamic Choosing Problems. | Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche |
| 2021 | ESA | Closing the Gap for Single Resource Constraint Scheduling. | Klaus Jansen, Malin Rau |
| 2021 | IPCO | The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. | Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota |
| 2021 | MFCS | Fuzzy Simultaneous Congruences. | Max A. Deppert, Klaus Jansen, Kim-Manuel Klein |
| 2021 | SOFSEM | Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. | Sebastian Berndt, Klaus Jansen, Alexandra Lassota |
| 2020 | STACS | Inapproximability Results for Scheduling with Interval and Resource Restrictions. | Marten Maack, Klaus Jansen |
| 2020 | SPAA | Approximation Algorithms for Scheduling with Class Constraints. | Klaus Jansen, Alexandra Lassota, Marten Maack |
| 2019 | ESA | Online Bin Covering with Limited Migration. | Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder |
| 2019 | ESA | Closing the Gap for Pseudo-Polynomial Strip Packing. | Klaus Jansen, Malin Rau |
| 2019 | EuroPar | Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. | Klaus Jansen, Malin Rau |
| 2019 | ICALP | Near-Linear Time Algorithm for n-fold ILPs via Color Coding. | Klaus Jansen, Alexandra Lassota, Lars Rohwedder |
| 2019 | ICALP | Local Search Breaks 1.75 for Graph Balancing. | Klaus Jansen, Lars Rohwedder |
| 2019 | SPAA | Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. | Max A. Deppert, Klaus Jansen |
| 2019 | SPAA | An EPTAS for Machine Scheduling with Bag-Constraints. | Kilian Grage, Klaus Jansen, Kim-Manuel Klein |
| 2019 | WAOA | Robust Online Algorithms for Certain Dynamic Packing Problems. | Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof |
| 2019 | WAOA | Approximation Results for Makespan Minimization with Budgeted Uncertainty. | Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder |
| 2018 | CSR | Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. | Sren Henning, Klaus Jansen, Malin Rau, Lars Schmarje |
| 2018 | SODA | Compact LP Relaxations for Allocation Problems. | Klaus Jansen, Lars Rohwedder |
| 2017 | CIAC | New Algorithmic Results for Bin Packing and Scheduling. | Klaus Jansen |
| 2017 | CIAC | Structural Parameters for Scheduling with Assignment Restrictions. | Klaus Jansen, Marten Maack, Roberto Solis-Oba |
| 2017 | IPCO | A Quasi-Polynomial Approximation for the Restricted Assignment Problem. | Klaus Jansen, Lars Rohwedder |
| 2017 | SODA | About the Structure of the Integer Cone and its Application to Bin Packing. | Klaus Jansen, Kim-Manuel Klein |
| 2017 | SODA | On the Configuration-LP of the Restricted Assignment Problem. | Klaus Jansen, Lars Rohwedder |
| 2017 | WADS | An EPTAS for Scheduling on Unrelated Machines of Few Different Types. | Klaus Jansen, Marten Maack |
| 2017 | WALCOM | Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width. | Klaus Jansen, Malin Rau |
| 2016 | AAIM | Algorithmic Aspects of Upper Domination: A Parameterised Perspective. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | COCOA | An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. | Lin Chen, Klaus Jansen, Wenchang Luo, Guochuan Zhang |
| 2016 | EuroPar | Non-preemptive Scheduling with Setup Times: A PTAS. | Klaus Jansen, Felix Land |
| 2016 | ICALP | Closing the Gap for Makespan Scheduling via Sparsification Techniques. | Klaus Jansen, Kim-Manuel Klein, Jos Verschae |
| 2016 | IWOCA | Upper Domination: Complexity and Approximation. | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jrme Monnot, Vangelis Th. Paschos |
| 2016 | SODA | Approximation schemes for machine scheduling with resource (in-)dependent processing times. | Klaus Jansen, Marten Maack, Malin Rau |
| 2016 | SOFSEM | A PTAS for Scheduling Unrelated Machines of Few Different Types. | Jan Clemens Gehrke, Klaus Jansen, Stefan Erich Julius Kraft, Jakob Schikowski |
| 2016 | SOFSEM | Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique. | Klaus Jansen, Felix Land, Maren Kaluza |
| 2015 | ATMOS | Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows. | Niklas Paulsen, Florian Diedrich, Klaus Jansen |
| 2015 | IWOCA | A Faster FPTAS for the Unbounded Knapsack Problem. | Klaus Jansen, Stefan Erich Julius Kraft |
| 2014 | SODA | On the optimality of approximation schemes for the classical scheduling problem. | Lin Chen, Klaus Jansen, Guochuan Zhang |
| 2014 | SOFSEM | A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing. | Klaus Jansen, Lars Prdel |
| 2013 | CSR | An Improved Knapsack Solver for Column Generation. | Klaus Jansen, Stefan Erich Julius Kraft |
| 2013 | EuroPar | A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms. | Pierre-Franois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram |
| 2013 | ICALP | A Robust AFPTAS for Online Bin Packing with Polynomial Migration, . | Klaus Jansen, Kim-Manuel Klein |
| 2013 | SODA | New Approximability Results for Two-Dimensional Bin Packing. | Klaus Jansen, Lars Prdel |
| 2013 | SYNASC | Online-Scheduling on Identical Machines with Bounded Migration. | Thorsten Ehlers, Klaus Jansen |
| 2013 | WADS | Bounding the Running Time of Algorithms for Scheduling and Packing Problems. | Klaus Jansen, Felix Land, Kati Land |
| 2012 | MFCS | An Improved Approximation Scheme for Variable-Sized Bin Packing. | Klaus Jansen, Stefan Erich Julius Kraft |
| 2012 | SPAA | A | Klaus Jansen |
| 2012 | SOFSEM | A Fast Approximation Scheme for the Multiple Knapsack Problem. | Klaus Jansen |
| 2011 | COCOON | Scheduling Jobs on Heterogeneous Platforms. | Marin Bougeret, Pierre-Franois Dutot, Klaus Jansen, Christina Robenek, Denis Trystram |
| 2011 | WADS | A (5/3 + ε)-Approximation for Strip Packing. | Rolf Harren, Klaus Jansen, Lars Prdel, Rob van Stee |
| 2011 | WAOA | Approximation Algorithms for Scheduling and Packing Problems. | Klaus Jansen |
| 2011 | WAOA | Scheduling Jobs on Identical and Uniform Processors Revisited. | Klaus Jansen, Christina Robenek |
| 2010 | EuroPar | A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. | Marin Bougeret, Pierre-Franois Dutot, Klaus Jansen, Christina Otte, Denis Trystram |
| 2010 | IPCO | An | Klaus Jansen, Roberto Solis-Oba |
| 2009 | ICALP | An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. | Klaus Jansen |
| 2009 | ISAAC | A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. | Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prdel, Maxim Sviridenko |
| 2009 | SODA | Improved approximation algorithms for scheduling with fixed jobs. | Florian Diedrich, Klaus Jansen |
| 2009 | SODA | Parameterized approximation scheme for the multiple knapsack problem. | Klaus Jansen |
| 2009 | WADS | Two for One: Tight Approximation of 2D Bin Packing. | Klaus Jansen, Lars Prdel, Ulrich M. Schwarz |
| 2009 | WAOA | Approximation Algorithms for Multiple Strip Packing. | Marin Bougeret, Pierre-Franois Dutot, Klaus Jansen, Christina Otte, Denis Trystram |
| 2008 | ICALP | Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. | Klaus Jansen, Ralf Thle |
| 2008 | IPCO | A Polynomial Time Approximation Scheme for the Square Packing Problem. | Klaus Jansen, Roberto Solis-Oba |
| 2008 | STACS | Trimming of Graphs, with Application to Point Labeling. | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff |
| 2007 | HiPC | Approximation Algorithms for Scheduling with Reservations. | Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram |
| 2007 | MFCS | New Approximability Results for 2-Dimensional Packing Problems. | Klaus Jansen, Roberto Solis-Oba |
| 2007 | TAMC | Approximation Algorithms for 3D Orthogonal Knapsack. | Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thle, Henning Thomas |
| 2007 | WG | Approximation Algorithms for Geometric Intersection Graphs. | Klaus Jansen |
| 2006 | SODA | An asymptotic approximation algorithm for 3D-strip packing. | Klaus Jansen, Roberto Solis-Oba |
| 2005 | ESA | Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. | Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, Ren Sitters |
| 2005 | ISAAC | On Efficient Weighted Rectangle Packing with Large Resources. | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen |
| 2005 | ISAAC | An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. | Klaus Jansen, Hu Zhang |
| 2005 | MFCS | Packing Weighted Rectangles into a Square. | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba |
| 2005 | STOC | On strip packing With rotations. | Klaus Jansen, Rob van Stee |
| 2005 | SPAA | Scheduling malleable tasks with precedence constraints. | Klaus Jansen, Hu Zhang |
| 2004 | SODA | On rectangle packing: maximizing benefits. | Klaus Jansen, Guochuan Zhang |
| 2004 | WAOA | Approximation Algorithms for Mixed Fractional Packing and Covering Problems. | Klaus Jansen |
| 2003 | ISAAC | On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
| 2003 | PPAM | Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. | Klaus Jansen, Roberto Solis-Oba |
| 2002 | ESA | Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme. | Klaus Jansen |
| 2002 | IPCO | On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. | Klaus Jansen, Lorant Porkolab |
| 2002 | ISAAC | An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. | Klaus Jansen, Roberto Solis-Oba |
| 2002 | STACS | Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. | Klaus Jansen |
| 2001 | ESA | Grouping Techniques for Scheduling Problems: Simpler and Faster. | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
| 2001 | FCT | On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. | Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab |
| 2001 | FCT | Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. | Klaus Jansen |
| 2001 | ICALP | On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. | Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab |
| 2001 | SODA | Polynomial-time approximation schemes for geometric graphs. | Thomas Erlebach, Klaus Jansen, Eike Seidel |
| 2001 | STACS | Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. | Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel |
| 2001 | WG | Graph Subcolorings: Complexity and Algorithms. | Jir Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
| 2000 | ICALP | Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. | Thomas Erlebach, Klaus Jansen |
| 2000 | ICALP | Parallel Machine Scheduling Problems with Controllable Processing Times. | Klaus Jansen, Monaldo Mastrolilli |
| 2000 | ICALP | Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling. | Klaus Jansen, Lorant Porkolab |
| 2000 | ISAAC | Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. | Klaus Jansen, Lorant Porkolab |
| 2000 | LATIN | Approximation Algorithms for Flexible Job Shop Problems. | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |
| 2000 | MFCS | Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring. | Klaus Jansen, Lorant Porkolab |
| 2000 | STACS | Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. | Klaus Jansen, Maxim Sviridenko |
| 1999 | SODA | Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. | Klaus Jansen, Lorant Porkolab |
| 1999 | STOC | Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. | Klaus Jansen, Lorant Porkolab |
| 1999 | STOC | Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. | Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko |
| 1999 | WADS | General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. | Klaus Jansen, Lorant Porkolab |
| 1998 | ISAAC | Maximizing the Number of Connections in Optical Tree Networks. | Thomas Erlebach, Klaus Jansen |
| 1998 | LATIN | A New Characterization for Parity Graphs and a Coloring Problem with Costs. | Klaus Jansen |
| 1998 | STACS | The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs. | Klaus Jansen |
| 1998 | SOFSEM | Algorithms Based on Randomization and Linear and Semidefinite Programming. | Klaus Jansen, Jos D. P. Rolim |
| 1997 | CIAC | The Optimum Cost Chromatic Partition Problem. | Klaus Jansen |
| 1997 | ICALP | Approximation Results for the Optimum Cost Partition Problem. | Klaus Jansen |
| 1997 | ICALP | Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. | Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen |
| 1997 | WG | Off-Line and On-Line Call-Scheduling in Stars and Trees. | Thomas Erlebach, Klaus Jansen |
| 1994 | STACS | On the Complexity of the Maximum Cut Problem. | Hans L. Bodlaender, Klaus Jansen |
| 1994 | WG | Ranking of Graphs. | Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Mller, Zsolt Tuza |
| 1993 | FCT | Maximum Covering with D Cliques. | Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger |
| 1993 | ISAAC | The Maximum k-Dependent and f-Dependent Set Problem. | Anders Dessmark, Klaus Jansen, Andrzej Lingas |
| 1993 | MFCS | On the Complexity of Scheduling Incompatible Jobs with Unit-Times. | Hans L. Bodlaender, Klaus Jansen |
| 1993 | WG | A Rainbow About T-Colorings for Complete Graphs. | Klaus Jansen |
| 1992 | WG | Scheduling with Incompatible Jobs. | Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger |
| 1992 | WG | On Scheduling Problems Restricted to Interval Orders. | Klaus Jansen |
| 1992 | WG | Generalized Coloring for Tree-like Graphs. | Klaus Jansen, Petra Scheffler |