Klaus Jansen - RankMe

409 papers A* 24A 22B 69C 12Misc 7Journal 195Unranked 49

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling. STACS Klaus Jansen, Felix Ohnesorge
2026	J	`jnl`	A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling. CoRR Klaus Jansen, Felix Ohnesorge
2026	A	`conf`	Approximation Algorithms for Integer Programming with Resource Augmentation. STACS Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen, Guochuan Zhang
2025	J	`jnl`	A (4/3+ϵ)-Approximation for Preemptive Scheduling with Batch Setup Times. CoRR Max A. Deppert, David Fischer, Klaus Jansen
2025	J	`jnl`	A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing. CoRR Klaus Jansen, Felix Ohnesorge, Lis Pirotton
2025	J	`jnl`	An Analysis of Decision Problems for Relational Pattern Languages under Various Constraints. CoRR Klaus Jansen, Dirk Nowotka, Lis Pirotton, Corinna Wambsganz, Max Wiedenhöft
2025	B	`conf`	Convolution and Knapsack in Higher Dimensions. WADS Kilian Grage, Klaus Jansen, Björn Schumacher
2025	J	`jnl`	Equivalent Instances for Scheduling and Packing Problems. CoRR Klaus Jansen, Kai Kahler, Corinna Wambsganz
2025	—	`conf`	Exact and Approximate High-Multiplicity Scheduling on Identical Machines. CIAC (1) Klaus Jansen, Kai Kahler, Esther Zwanger
2025	J	`jnl`	Hardness of SetCover Reoptimization. CoRR Klaus Jansen, Tobias Mömke, Björn Schumacher
2025	A*	`conf`	Improved Approximation Algorithms for Three-Dimensional Knapsack. SoCG Klaus Jansen, Debajyoti Kar, Arindam Khan, K. V. N. Sreenivas, Malte Tutas
2025	J	`jnl`	Improved Approximation Algorithms for Three-Dimensional Knapsack. CoRR Klaus Jansen, Debajyoti Kar, Arindam Khan, K. V. N. Sreenivas, Malte Tutas
2025	J	`jnl`	Minimizing the Weighted Makespan with Restarts on a Single Machine. CoRR Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton, Rob van Stee, Corinna Wambsganz
2025	B	`conf`	New Algorithm for Combinatorial n-Folds and Applications. IPEC Klaus Jansen, Kai Kahler, Lis Pirotton, Malte Tutas
2025	B	`conf`	Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee. WAOA Hauke Brinkop, David Fischer, Klaus Jansen
2025	J	`jnl`	Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee. CoRR Hauke Brinkop, David Fischer, Klaus Jansen
2025	A	`conf`	The Support of Bin Packing Is Exponential. ESA Klaus Jansen, Lis Pirotton, Malte Tutas
2025	J	`jnl`	The Support of Bin Packing is Exponential. CoRR Klaus Jansen, Lis Pirotton, Malte Tutas
2024	B	`conf`	3/2-Dual Approximation for CPU/GPU Scheduling. SEA Sebastian Bernhard Germann, Klaus Jansen, Felix Ohnesorge, Malte Tutas
2024	J	`jnl`	Convolution and Knapsack in Higher Dimensions. CoRR Kilian Grage, Klaus Jansen
2024	J	`jnl`	Exact and Approximate High-Multiplicity Scheduling on Identical Machines. CoRR Klaus Jansen, Kai Kahler, Esther Zwanger
2024	J	`jnl`	FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares. CoRR Klaus Jansen, Alexandra Lassota, Malte Tutas, Adrian Vetta
2024	B	`conf`	Hardness and Tight Approximations of Demand Strip Packing. SPAA Klaus Jansen, Malin Rau, Malte Tutas
2024	J	`jnl`	Hardness and Tight Approximations of Demand Strip Packing. CoRR Klaus Jansen, Malin Rau, Malte Tutas
2024	J	`jnl`	Improving the Parameter Dependency for High-Multiplicity Scheduling on Uniform Machines. CoRR Klaus Jansen, Kai Kahler, Lis Pirotton, Malte Tutas
2024	Misc	`conf`	The Power of Duality: Response Time Analysis meets Integer Programming. RTNS Max A. Deppert, Klaus Jansen
2023	J	`jnl`	A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
2023	B	`ed.`	Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings FCT Henning Fernau, Klaus Jansen
2023	—	`conf`	Improved Algorithms for Monotone Moldable Job Scheduling Using Compression and Convolution. Euro-Par Kilian Grage, Klaus Jansen, Felix Ohnesorge
2023	J	`jnl`	Improved Algorithms for Monotone Moldable Job Scheduling using Compression and Convolution. CoRR Kilian Grage, Klaus Jansen, Felix Ohnesorge
2023	B	`conf`	New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. ISAAC Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
2023	J	`jnl`	New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. CoRR Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm
2023	J	`jnl`	On Integer Programming, Discrepancy, and Convolution. Math. Oper. Res. Klaus Jansen, Lars Rohwedder
2023	B	`conf`	On the Complexity of Scheduling Problems with a Fixed Number of Parallel Identical Machines. SOFSEM Klaus Jansen, Kai Kahler
2023	J	`jnl`	Online bin covering with limited migration. J. Comput. Syst. Sci. Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2023	J	`jnl`	Peak Demand Minimization via Sliced Strip Packing. Algorithmica Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas
2023	A	`conf`	Scheduling with Many Shared Resources. IPDPS Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau
2023	B	`conf`	Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. SOFSEM Hauke Brinkop, Klaus Jansen
2023	J	`jnl`	The double exponential runtime is tight for 2-stage stochastic ILPs. Math. Program. Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
2022	A*	`conf`	A PTAS for Packing Hypercubes into a Knapsack. ICALP Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas
2022	J	`jnl`	A PTAS for Packing Hypercubes into a Knapsack. CoRR Klaus Jansen, Arindam Khan, Marvin Lira, K. V. N. Sreenivas
2022	J	`jnl`	Empowering the configuration-IP: new PTAS results for scheduling with setup times. Math. Program. Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau
2022	C	`conf`	Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks. IWOCA Thi Huyen Chau Nguyen, Werner Grass, Klaus Jansen
2022	J	`jnl`	High Multiplicity Scheduling on Uniform Machines in FPT-Time. CoRR Hauke Brinkop, Klaus Jansen
2022	A	`conf`	Load Balancing: The Long Road from Theory to Practice. ALENEX Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
2022	J	`jnl`	On the Complexity of Scheduling Problems With a Fixed Number of Identical Machines. CoRR Klaus Jansen, Kai Kahler
2022	J	`jnl`	Scheduling with Many Shared Resources. CoRR Max A. Deppert, Klaus Jansen, Marten Maack, Simon Pukrop, Malin Rau
2022	J	`jnl`	The Power of Duality: Response Time Analysis meets Integer Programming. CoRR Max A. Deppert, Klaus Jansen
2021	J	`jnl`	An EPTAS for scheduling fork-join graphs with communication delay. Theor. Comput. Sci. Klaus Jansen, Oliver Sinnen, Huijun Wang
2021	J	`jnl`	An optimal FPT algorithm parametrized by treewidth for Weighted-Max-Bisection given a tree decomposition as advice assuming SETH and the hardness of MinConv. CoRR Hauke Brinkop, Klaus Jansen, Tim Weißenfels
2021	J	`jnl`	Approximation Results for Makespan Minimization with Budgeted Uncertainty. Theory Comput. Syst. Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
2021	A	`conf`	Closing the Gap for Single Resource Constraint Scheduling. ESA Klaus Jansen, Malin Rau
2021	J	`jnl`	Closing the gap for single resource constraint scheduling. CoRR Klaus Jansen, Malin Rau
2021	B	`conf`	Fuzzy Simultaneous Congruences. MFCS Max A. Deppert, Klaus Jansen, Kim-Manuel Klein
2021	J	`jnl`	Load Balancing: The Long Road from Theory to Practice. CoRR Sebastian Berndt, Max A. Deppert, Klaus Jansen, Lars Rohwedder
2021	—	`conf`	New Bounds for the Vertices of the Integer Hull. SOSA Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2021	—	`conf`	On Order-preserving, Gap-avoiding Rectangle Packing. VISIGRAPP (3: IVAPP) Sören Domrös, Daniel Lucas, Reinhard von Hanxleden, Klaus Jansen
2021	—	`conf`	Peak Demand Minimization via Sliced Strip Packing. APPROX-RANDOM Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas
2021	J	`jnl`	Peak Demand Minimization via Sliced Strip Packing. CoRR Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau, Malte Tutas
2021	—	`conf`	Revisiting Order-Preserving, Gap-Avoiding Rectangle Packing. VISIGRAPP (Revised Selected Papers) Sören Domrös, Daniel Lucas, Reinhard von Hanxleden, Klaus Jansen
2021	C	`conf`	Robust Online Algorithms for Dynamic Choosing Problems. CiE Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche
2021	J	`jnl`	Robust Online Algorithms for Dynamic Choosing Problems. CoRR Sebastian Berndt, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche
2021	B	`conf`	The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. IPCO Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
2021	B	`conf`	Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. SOFSEM Sebastian Berndt, Klaus Jansen, Alexandra Lassota
2021	A*	`conf`	Total Completion Time Minimization for Scheduling with Incompatibility Cliques. ICAPS Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
2020	J	`jnl`	A Quasi-Polynomial Approximation for the Restricted Assignment Problem. SIAM J. Comput. Klaus Jansen, Lars Rohwedder
2020	—	`conf`	A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
2020	J	`jnl`	A note on the integrality gap of the configuration LP for restricted Santa Claus. Inf. Process. Lett. Klaus Jansen, Lars Rohwedder
2020	J	`jnl`	About the Structure of the Integer Cone and Its Application to Bin Packing. Math. Oper. Res. Klaus Jansen, Kim-Manuel Klein
2020	B	`conf`	Approximation Algorithms for Scheduling with Class Constraints. SPAA Klaus Jansen, Alexandra Lassota, Marten Maack
2020	J	`jnl`	Closing the Gap for Makespan Scheduling via Sparsification Techniques. Math. Oper. Res. Klaus Jansen, Kim-Manuel Klein, José Verschae
2020	J	`jnl`	Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. Theory Comput. Syst. Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje
2020	J	`jnl`	Fully dynamic bin packing revisited. Math. Program. Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2020	J	`jnl`	Fuzzy Simultaneous Congruences. CoRR Max A. Deppert, Klaus Jansen, Kim-Manuel Klein
2020	A	`conf`	Inapproximability Results for Scheduling with Interval and Resource Restrictions. STACS Marten Maack, Klaus Jansen
2020	J	`jnl`	Near-Linear Time Algorithm for n-Fold ILPs via Color Coding. SIAM J. Discret. Math. Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2020	J	`jnl`	New Bounds for the Vertices of the Integer Hull. CoRR Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2020	J	`jnl`	Structural parameters for scheduling with assignment restrictions. Theor. Comput. Sci. Klaus Jansen, Marten Maack, Roberto Solis-Oba
2020	J	`jnl`	The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. CoRR Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
2020	J	`jnl`	Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs. CoRR Sebastian Berndt, Klaus Jansen, Alexandra Lassota
2020	J	`jnl`	Total Completion Time Minimization for Scheduling with Incompatibility Cliques. CoRR Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
2019	J	`jnl`	A Robust AFPTAS for Online Bin Packing with Polynomial Migration. SIAM J. Discret. Math. Klaus Jansen, Kim-Manuel Klein
2019	B	`conf`	An EPTAS for Machine Scheduling with Bag-Constraints. SPAA Kilian Grage, Klaus Jansen, Kim-Manuel Klein
2019	J	`jnl`	An EPTAS for Scheduling on Unrelated Machines of Few Different Types. Algorithmica Klaus Jansen, Marten Maack
2019	J	`jnl`	Approximation Algorithms for Scheduling with Class Constraints. CoRR Klaus Jansen, Alexandra Lassota, Marten Maack
2019	B	`conf`	Approximation Results for Makespan Minimization with Budgeted Uncertainty. WAOA Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
2019	J	`jnl`	Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times. ACM Trans. Algorithms Klaus Jansen, Marten Maack, Malin Rau
2019	J	`jnl`	Approximation results for makespan minimization with budgeted uncertainty. CoRR Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
2019	A	`conf`	Closing the Gap for Pseudo-Polynomial Strip Packing. ESA Klaus Jansen, Malin Rau
2019	A	`conf`	Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. ITCS Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau
2019	J	`jnl`	Exact Polynomial Time Algorithm for the Response Time Analysis of Harmonic Tasks with Constrained Release Jitter. CoRR Thi Huyen Chau Nguyen, Werner Grass, Klaus Jansen
2019	J	`jnl`	Improved approximation for two dimensional Strip Packing with polynomial bounded width. Theor. Comput. Sci. Klaus Jansen, Malin Rau
2019	J	`jnl`	Inapproximability Results for Scheduling with Interval and Resource Restrictions. CoRR Marten Maack, Klaus Jansen
2019	—	`conf`	Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. Euro-Par Klaus Jansen, Malin Rau
2019	J	`jnl`	Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing. CoRR Klaus Jansen, Malin Rau
2019	A*	`conf`	Local Search Breaks 1.75 for Graph Balancing. ICALP Klaus Jansen, Lars Rohwedder
2019	B	`conf`	Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. SPAA Max A. Deppert, Klaus Jansen
2019	A*	`conf`	Near-Linear Time Algorithm for n-fold ILPs via Color Coding. ICALP Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2019	A	`conf`	On Integer Programming and Convolution. ITCS Klaus Jansen, Lars Rohwedder
2019	A	`conf`	Online Bin Covering with Limited Migration. ESA Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019	J	`jnl`	Online Bin Covering with Limited Migration. CoRR Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder
2019	B	`conf`	Robust Online Algorithms for Certain Dynamic Packing Problems. WAOA Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof
2019	J	`jnl`	Robust Online Algorithms for Dynamic Problems. CoRR Sebastian Berndt, Valentin Dreismann, Kilian Grage, Klaus Jansen, Ingmar Knof
2019	A	`conf`	Scheduling on (Un-)Related Machines with Setup Times. IPDPS Klaus Jansen, Marten Maack, Alexander Mäcker
2018	J	`jnl`	A PTAS for Scheduling Unrelated Machines of Few Different Types. Int. J. Found. Comput. Sci. Jan Clemens Gehrke, Klaus Jansen, Stefan E. J. Kraft, Jakob Schikowski
2018	J	`jnl`	A faster FPTAS for the Unbounded Knapsack Problem. Eur. J. Comb. Klaus Jansen, Stefan Erich Julius Kraft
2018	J	`jnl`	A note on the integrality gap of the configuration LP for restricted Santa Claus. CoRR Klaus Jansen, Lars Rohwedder
2018	J	`jnl`	An EPTAS for machine scheduling with bag-constraints. CoRR Kilian Grage, Klaus Jansen, Kim-Manuel Klein
2018	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, Princeton, NJ, USA, August 20-22, 2018 APPROX-RANDOM Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer
2018	—	`conf`	Compact LP Relaxations for Allocation Problems. SOSA Klaus Jansen, Lars Rohwedder
2018	Misc	`conf`	Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. CSR Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje
2018	J	`jnl`	Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. CoRR Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau
2018	J	`jnl`	Estimating the Makespan of the Two-Valued Restricted Assignment Problem. Algorithmica Klaus Jansen, Kati Land, Marten Maack
2018	J	`jnl`	Local search breaks 1.75 for Graph Balancing. CoRR Klaus Jansen, Lars Rohwedder
2018	J	`jnl`	Near-Linear Approximation Algorithms for Scheduling Problems with Batch Setup Times. CoRR Max A. Deppert, Klaus Jansen
2018	J	`jnl`	Near-Linear Time Algorithm for n-fold ILPs via Color Coding. CoRR Klaus Jansen, Alexandra Lassota, Lars Rohwedder
2018	J	`jnl`	On Integer Programming and Convolution. CoRR Klaus Jansen, Lars Rohwedder
2018	J	`jnl`	On the optimality of exact and approximation algorithms for scheduling problems. J. Comput. Syst. Sci. Lin Chen, Klaus Jansen, Guochuan Zhang
2018	A	`conf`	Scheduling Monotone Moldable Jobs in Linear Time. IPDPS Klaus Jansen, Felix Land
2018	J	`jnl`	Scheduling on (Un-)Related Machines with Setup Times. CoRR Klaus Jansen, Marten Maack, Alexander Mäcker
2018	J	`jnl`	The many facets of upper domination. Theor. Comput. Sci. Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2017	B	`conf`	A Quasi-Polynomial Approximation for the Restricted Assignment Problem. IPCO Klaus Jansen, Lars Rohwedder
2017	J	`jnl`	A Quasi-Polynomial Approximation for the Restricted Assignment Problem. CoRR Klaus Jansen, Lars Rohwedder
2017	A*	`conf`	About the Structure of the Integer Cone and its Application to Bin Packing. SODA Klaus Jansen, Kim-Manuel Klein
2017	B	`conf`	An EPTAS for Scheduling on Unrelated Machines of Few Different Types. WADS Klaus Jansen, Marten Maack
2017	J	`jnl`	An EPTAS for Scheduling on Unrelated Machines of Few Different Types. CoRR Klaus Jansen, Marten Maack
2017	B	`ed.`	Approximation and Online Algorithms - 14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected Papers WAOA Klaus Jansen, Monaldo Mastrolilli
2017	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, Berkeley, CA, USA, August 16-18, 2017 APPROX-RANDOM Klaus Jansen, José D. P. Rolim, David Williamson, Santosh S. Vempala
2017	J	`jnl`	Closing the gap for pseudo-polynomial strip packing. CoRR Klaus Jansen, Malin Rau
2017	J	`jnl`	Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing. CoRR Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje
2017	B	`conf`	Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width. WALCOM Klaus Jansen, Malin Rau
2017	C	`conf`	New Algorithmic Results for Bin Packing and Scheduling. CIAC Klaus Jansen
2017	A*	`conf`	On the Configuration-LP of the Restricted Assignment Problem. SODA Klaus Jansen, Lars Rohwedder
2017	—	`conf`	Online Strip Packing with Polynomial Migration. APPROX-RANDOM Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig
2017	J	`jnl`	Online Strip Packing with Polynomial Migration. CoRR Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig
2017	J	`jnl`	Scheduling Monotone Moldable Jobs in Linear Time. CoRR Klaus Jansen, Felix Land
2017	C	`conf`	Structural Parameters for Scheduling with Assignment Restrictions. CIAC Klaus Jansen, Marten Maack, Roberto Solis-Oba
2017	J	`jnl`	Structural Parameters for Scheduling with Assignment Restrictions. CoRR Klaus Jansen, Marten Maack, Roberto Solis-Oba
2017	—	`conf`	Structured Instances of Restricted Assignment with Two Processing Times. CALDAM Klaus Jansen, Lars Rohwedder
2016	B	`conf`	A PTAS for Scheduling Unrelated Machines of Few Different Types. SOFSEM Jan Clemens Gehrke, Klaus Jansen, Stefan Erich Julius Kraft, Jakob Schikowski
2016	J	`jnl`	About the Structure of the Integer Cone and its Application to Bin Packing. CoRR Klaus Jansen, Kim-Manuel Klein
2016	C	`conf`	Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2016	C	`conf`	An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. COCOA Lin Chen, Klaus Jansen, Wenchang Luo, Guochuan Zhang
2016	J	`jnl`	An Improved Approximation Scheme for Variable-Sized Bin Packing. Theory Comput. Syst. Klaus Jansen, Stefan Erich Julius Kraft
2016	A*	`conf`	Approximation schemes for machine scheduling with resource (in-)dependent processing times. SODA Klaus Jansen, Marten Maack, Malin Rau
2016	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, Paris, France, September 7-9, 2016 APPROX-RANDOM Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans
2016	J	`jnl`	Bounding the Running Time of Algorithms for Scheduling and Packing Problems. SIAM J. Discret. Math. Klaus Jansen, Felix Land, Kati Land
2016	A*	`conf`	Closing the Gap for Makespan Scheduling via Sparsification Techniques. ICALP Klaus Jansen, Kim-Manuel Klein, José Verschae
2016	J	`jnl`	Closing the Gap for Makespan Scheduling via Sparsification Techniques. CoRR Klaus Jansen, Kim-Manuel Klein, José Verschae
2016	—	`ch.`	Efficient Polynomial Time Approximation Scheme for Scheduling Jobs onUniform Processors. Encyclopedia of Algorithms Klaus Jansen
2016	—	`conf`	Estimating The Makespan of The Two-Valued Restricted Assignment Problem. SWAT Klaus Jansen, Kati Land, Marten Maack
2016	J	`jnl`	Improved approximation for two dimensional strip packing with polynomial bounded width. CoRR Klaus Jansen, Malin Rau
2016	J	`jnl`	New Approximability Results for Two-Dimensional Bin Packing. Algorithmica Klaus Jansen, Lars Prädel
2016	—	`conf`	Non-preemptive Scheduling with Setup Times: A PTAS. Euro-Par Klaus Jansen, Felix Land
2016	J	`jnl`	On the Configuration-LP of the Restricted Assignment Problem. CoRR Klaus Jansen, Lars Rohwedder
2016	B	`conf`	Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized Biclique. SOFSEM Klaus Jansen, Felix Land, Maren Kaluza
2016	J	`jnl`	Scheduling parallel jobs on heterogeneous platforms. Electron. Notes Discret. Math. Klaus Jansen, Denis Trystram
2016	C	`conf`	Upper Domination: Complexity and Approximation. IWOCA Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015	C	`conf`	A Faster FPTAS for the Unbounded Knapsack Problem. IWOCA Klaus Jansen, Stefan Erich Julius Kraft
2015	J	`jnl`	A Faster FPTAS for the Unbounded Knapsack Problem. CoRR Klaus Jansen, Stefan Erich Julius Kraft
2015	J	`jnl`	Algorithmic Aspects of Upper Domination. CoRR Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos
2015	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, Princeton, NJ, USA, August 24-26, 2015 APPROX-RANDOM Naveen Garg, Klaus Jansen, Anup Rao, José D. P. Rolim
2015	—	`conf`	Fully Dynamic Bin Packing Revisited . APPROX-RANDOM Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2015	C	`conf`	Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows. ATMOS Niklas Paulsen, Florian Diedrich, Klaus Jansen
2015	J	`jnl`	Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theor. Comput. Sci. Marin Bougeret, Pierre-François Dutot, Denis Trystram, Klaus Jansen, Christina Robenek
2014	J	`jnl`	A (5/3 + ε)-approximation for strip packing. Comput. Geom. Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2014	B	`conf`	A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing. SOFSEM Klaus Jansen, Lars Prädel
2014	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, Barcelona, Spain, September 4-6, 2014 APPROX-RANDOM Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore
2014	J	`jnl`	Fully Dynamic Bin Packing Revisited. CoRR Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
2014	A*	`conf`	On the optimality of approximation schemes for the classical scheduling problem. SODA Lin Chen, Klaus Jansen, Guochuan Zhang
2013	—	`conf`	A (2 + ε)-Approximation for Scheduling Parallel Jobs in Platforms. Euro-Par Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
2013	J	`jnl`	A Robust AFPTAS for Online Bin Packing with Polynomial Migration CoRR Klaus Jansen, Kim-Manuel Klein
2013	—	`conf`	A Robust AFPTAS for Online Bin Packing with Polynomial Migration, . ICALP (1) Klaus Jansen, Kim-Manuel Klein
2013	Misc	`conf`	An Improved Knapsack Solver for Column Generation. CSR Klaus Jansen, Stefan Erich Julius Kraft
2013	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings APPROX-RANDOM Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim
2013	J	`jnl`	Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
2013	B	`conf`	Bounding the Running Time of Algorithms for Scheduling and Packing Problems. WADS Klaus Jansen, Felix Land, Kati Land
2013	B	`ed.`	Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers WG Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk
2013	A*	`conf`	New Approximability Results for Two-Dimensional Bin Packing. SODA Klaus Jansen, Lars Prädel
2013	J	`jnl`	On the optimality of approximation schemes for the classical scheduling problem. CoRR Lin Chen, Klaus Jansen, Guochuan Zhang
2013	Misc	`conf`	Online-Scheduling on Identical Machines with Bounded Migration. SYNASC Thorsten Ehlers, Klaus Jansen
2013	J	`jnl`	Two for One: Tight Approximation of 2D Bin Packing. Int. J. Found. Comput. Sci. Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Rob van Stee
2012	B	`conf`	A SPAA Klaus Jansen
2012	C	`conf`	A (5/3 + eps)-Approximation for 2D Strip Packing. CTW Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2012	B	`conf`	A Fast Approximation Scheme for the Multiple Knapsack Problem. SOFSEM Klaus Jansen
2012	B	`conf`	An Improved Approximation Scheme for Variable-Sized Bin Packing. MFCS Klaus Jansen, Stefan Erich Julius Kraft
2012	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings APPROX-RANDOM Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio
2012	J	`jnl`	Packing Squares with Profits. SIAM J. Discret. Math. Klaus Jansen, Roberto Solis-Oba
2012	J	`jnl`	Scheduling malleable tasks with precedence constraints. J. Comput. Syst. Sci. Klaus Jansen, Hu Zhang
2012	—	`conf`	Tight Approximation for Scheduling Parallel Jobs on Identical Clusters. IPDPS Workshops Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
2012	J	`jnl`	Tight approximation algorithms for scheduling with fixed jobs and nonavailability. ACM Trans. Algorithms Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson
2011	B	`conf`	A (5/3 + ε)-Approximation for Strip Packing. WADS Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee
2011	J	`jnl`	A Polynomial Time Math. Oper. Res. Klaus Jansen, Roberto Solis-Oba
2011	J	`jnl`	A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption. Inf. Process. Lett. Klaus Jansen, Roberto Solis-Oba
2011	J	`jnl`	Approximation Algorithms for Multiple Strip Packing and Scheduling Parallel Jobs in Platforms. Discret. Math. Algorithms Appl. Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
2011	B	`conf`	Approximation Algorithms for Scheduling and Packing Problems. WAOA Klaus Jansen
2011	B	`ed.`	Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers WAOA Klaus Jansen, Roberto Solis-Oba
2011	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings APPROX-RANDOM Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim
2011	—	`conf`	Faster Approximation Algorithms for Scheduling with Fixed Jobs. CATS Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson
2011	J	`jnl`	Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Dagstuhl Reports Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young
2011	Misc	`conf`	Scheduling Jobs on Heterogeneous Platforms. COCOON Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
2011	B	`conf`	Scheduling Jobs on Identical and Uniform Processors Revisited. WAOA Klaus Jansen, Christina Robenek
2010	—	`conf`	A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. Euro-Par (1) Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram
2010	B	`conf`	An IPCO Klaus Jansen, Roberto Solis-Oba
2010	J	`jnl`	An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. SIAM J. Discret. Math. Klaus Jansen
2010	—	`conf`	Approximating the Non-contiguous Multiple Organization Packing Problem. IFIP TCS Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram
2010	J	`jnl`	Approximation Algorithms for Scheduling Parallel Jobs. SIAM J. Comput. Klaus Jansen, Ralf Thöle
2010	J	`jnl`	Approximation Algorithms for Scheduling with Reservations. Algorithmica Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram
2010	J	`jnl`	Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints. Int. J. Found. Comput. Sci. Klaus Jansen, Roberto Solis-Oba
2010	B	`ed.`	Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers WAOA Evripidis Bampis, Klaus Jansen
2010	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings APPROX-RANDOM Maria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim
2010	—	`conf`	Bin Packing with Fixed Number of Bins Revisited. SWAT Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter
2010	J	`jnl`	Trimming of Graphs, with Application to Point Labeling. Theory Comput. Syst. Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2009	B	`conf`	A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ISAAC Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko
2009	—	`conf`	A Survey on Approximation Algorithms for Scheduling with Machine Unavailability. Algorithmics of Large and Complex Networks Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram
2009	—	`conf`	An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. ICALP (1) Klaus Jansen
2009	B	`conf`	Approximation Algorithms for Multiple Strip Packing. WAOA Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram
2009	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings APPROX-RANDOM Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim
2009	—	`ch.`	Directed Tree Networks. Encyclopedia of Optimization Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano
2009	A*	`conf`	Improved approximation algorithms for scheduling with fixed jobs. SODA Florian Diedrich, Klaus Jansen
2009	J	`jnl`	Parameterized Approximation Scheme for the Multiple Knapsack Problem. SIAM J. Comput. Klaus Jansen
2009	A*	`conf`	Parameterized approximation scheme for the multiple knapsack problem. SODA Klaus Jansen
2009	J	`jnl`	Rectangle packing with one-dimensional resource augmentation. Discret. Optim. Klaus Jansen, Roberto Solis-Oba
2009	B	`conf`	Two for One: Tight Approximation of 2D Bin Packing. WADS Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
2008	B	`conf`	A Polynomial Time Approximation Scheme for the Square Packing Problem. IPCO Klaus Jansen, Roberto Solis-Oba
2008	J	`jnl`	Approximation Algorithms for 3D Orthogonal Knapsack. J. Comput. Sci. Technol. Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
2008	—	`conf`	Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. ICALP (1) Klaus Jansen, Ralf Thöle
2008	J	`jnl`	Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math. Program. Klaus Jansen, Hu Zhang
2008	—	`ed.`	Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings APPROX-RANDOM Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld
2008	—	`book`	Approximative Algorithmen und Nichtapproximierbarkeit. Klaus Jansen, Marian Margraf
2008	J	`jnl`	Grouping Techniques for Scheduling Problems: Simpler and Faster. Algorithmica Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2008	J	`jnl`	On Packing Rectangles with Resource Augmentation: Maximizing the Profit. Algorithmic Oper. Res. Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
2008	J	`jnl`	Trimming of Graphs, with Application to Point Labeling CoRR Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2008	A	`conf`	Trimming of Graphs, with Application to Point Labeling. STACS Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff
2007	—	`conf`	07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
2007	—	`conf`	An Approximation Algorithm for the General Mixed Packing and Covering Problem. ESCAPE Florian Diedrich, Klaus Jansen
2007	C	`conf`	Approximation Algorithms for 3D Orthogonal Knapsack. TAMC Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
2007	B	`conf`	Approximation Algorithms for Geometric Intersection Graphs. WG Klaus Jansen
2007	Misc	`conf`	Approximation Algorithms for Scheduling with Reservations. HiPC Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram
2007	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings APPROX-RANDOM Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim
2007	—	`ed.`	Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy P. Spinrad
2007	J	`jnl`	Faster and simpler approximation algorithms for mixed packing and covering problems. Theor. Comput. Sci. Florian Diedrich, Klaus Jansen
2007	J	`jnl`	Maximizing the Total Profit of Rectangles Packed into a Rectangle. Algorithmica Klaus Jansen, Guochuan Zhang
2007	B	`conf`	New Approximability Results for 2-Dimensional Packing Problems. MFCS Klaus Jansen, Roberto Solis-Oba
2007	—	`ch.`	Scheduling Malleable Tasks. Handbook of Approximation Algorithms and Metaheuristics Hu Zhang, Klaus Jansen
2007	J	`jnl`	The d-precoloring problem for k-degenerate graphs. Discret. Math. Janka Chlebíková, Klaus Jansen
2006	J	`jnl`	An approximation algorithm for scheduling malleable tasks under general precedence constraints. ACM Trans. Algorithms Klaus Jansen, Hu Zhang
2006	J	`jnl`	An approximation algorithm for the general max-min resource sharing problem. Math. Program. Klaus Jansen
2006	A*	`conf`	An asymptotic approximation algorithm for 3D-strip packing. SODA Klaus Jansen, Roberto Solis-Oba
2006	J	`jnl`	Approximation Algorithm for the Mixed Fractional Packing and Covering Problem. SIAM J. Optim. Klaus Jansen
2006	—	`ch.`	Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications. Efficient Approximation and Online Algorithms Klaus Jansen
2006	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings APPROX-RANDOM Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick
2006	—	`book`	Efficient Approximation and Online Algorithms - Recent Progress on Classical Combinatorial Optimization Problems and New Applications Efficient Approximation and Online Algorithms Evripidis Bampis, Klaus Jansen, Claire Kenyon
2006	—	`conf`	Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. WEA Mihhail Aizatulin, Florian Diedrich, Klaus Jansen
2006	J	`jnl`	Introduction. Discret. Appl. Math. Evripidis Bampis, Klaus Jansen
2006	J	`jnl`	On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes. SIAM J. Discret. Math. Klaus Jansen, Lorant Porkolab
2006	J	`jnl`	Preface. Theor. Comput. Sci. Klaus Jansen, Roberto Solis-Oba
2005	B	`conf`	An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. ISAAC Klaus Jansen, Hu Zhang
2005	J	`jnl`	Approximation algorithms for flexible job shop problems. Int. J. Found. Comput. Sci. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2005	J	`jnl`	Approximation schemes for job shop scheduling problems with controllable processing times. Eur. J. Oper. Res. Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2005	—	`ed.`	Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings APPROX-RANDOM Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan
2005	J	`jnl`	Conversion of coloring algorithms into maximum weight independent set algorithms. Discret. Appl. Math. Thomas Erlebach, Klaus Jansen
2005	J	`jnl`	General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. SIAM J. Comput. Klaus Jansen, Lorant Porkolab
2005	B	`conf`	On Efficient Weighted Rectangle Packing with Large Resources. ISAAC Aleksei V. Fishkin, Olga Gerber, Klaus Jansen
2005	—	`conf`	On Packing Squares with Resource Augmentation: Maximizing the Profit. CATS Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
2005	A*	`conf`	On strip packing With rotations. STOC Klaus Jansen, Rob van Stee
2005	B	`conf`	Packing Weighted Rectangles into a Square. MFCS Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba
2005	J	`jnl`	Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. SIAM J. Comput. Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel
2005	J	`jnl`	Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput. Thomas Erlebach, Klaus Jansen, Eike Seidel
2005	A	`conf`	Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. ESA Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters
2005	B	`conf`	Scheduling malleable tasks with precedence constraints. SPAA Klaus Jansen, Hu Zhang
2004	—	`conf`	04221 Abstracts Collection - Robust and Approximative Algorithms on Particular Graph Classes. Robust and Approximative Algorithms an Particular Graph Classes Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad
2004	—	`conf`	Approximation Algorithms for Mixed Fractional Packing and Covering Problems. IFIP TCS Klaus Jansen
2004	B	`conf`	Approximation Algorithms for Mixed Fractional Packing and Covering Problems. WAOA Klaus Jansen
2004	—	`conf`	Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. SWAT Klaus Jansen
2004	B	`ed.`	Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers WAOA Klaus Jansen, Roberto Solis-Oba
2004	J	`jnl`	Approximation schemes for parallel machine scheduling problems with controllable processing times. Comput. Oper. Res. Klaus Jansen, Monaldo Mastrolilli
2004	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings APPROX-RANDOM Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron
2004	J	`jnl`	Guest Editors' Introduction. Algorithmica Klaus Jansen, Samir Khuller
2004	—	`conf`	Maximizing the Number of Packed Rectangles. SWAT Klaus Jansen, Guochuan Zhang
2004	—	`conf`	On Weighted Rectangle Packing with Large Resources. IFIP TCS Aleksei V. Fishkin, Olga Gerber, Klaus Jansen
2004	A*	`conf`	On rectangle packing: maximizing benefits. SODA Klaus Jansen, Guochuan Zhang
2004	J	`jnl`	Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. J. Sched. Klaus Jansen, Lorant Porkolab
2004	—	`ed.`	Robust and Approximative Algorithms an Particular Graph Classes, 23.05. - 28.05.2004 Robust and Approximative Algorithms an Particular Graph Classes Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, Jeremy P. Spinrad
2004	J	`jnl`	Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. Algorithmica Klaus Jansen
2003	J	`jnl`	An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. Klaus Jansen, Roberto Solis-Oba
2003	J	`jnl`	Approximate strong separation with application in fractional graph coloring and preemptive scheduling. Theor. Comput. Sci. Klaus Jansen
2003	Misc	`conf`	Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. PPAM Klaus Jansen, Roberto Solis-Oba
2003	—	`ed.`	Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings RANDOM-APPROX Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai
2003	J	`jnl`	Computing optimal preemptive schedules for parallel tasks: linear programming approaches. Math. Program. Klaus Jansen, Lorant Porkolab
2003	—	`ed.`	Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings WEA Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim
2003	J	`jnl`	Graph Subcolorings: Complexity and Algorithms. SIAM J. Discret. Math. Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
2003	J	`jnl`	Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. SIAM J. Discret. Math. Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
2003	B	`conf`	On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ISAAC Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2003	J	`jnl`	The mutual exclusion scheduling problem for permutation and comparability graphs. Inf. Comput. Klaus Jansen
2002	J	`jnl`	A duality approach to problems of combined stopping and deciding under constraints. Math. Methods Oper. Res. Thomas Balzer, Klaus Jansen
2002	B	`conf`	An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. ISAAC Klaus Jansen, Roberto Solis-Oba
2002	A	`conf`	Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling. STACS Klaus Jansen
2002	—	`ed.`	Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings APPROX Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani
2002	—	`conf`	Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function. IFIP TCS Klaus Jansen, Hu Zhang
2002	J	`jnl`	Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. ACM J. Exp. Algorithmics Thomas Erlebach, Klaus Jansen
2002	J	`jnl`	Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. Algorithmica Klaus Jansen, Lorant Porkolab
2002	B	`conf`	On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes. IPCO Klaus Jansen, Lorant Porkolab
2002	J	`jnl`	Polynomial time approximation schemes for general multiprocessor job shop scheduling. J. Algorithms Klaus Jansen, Lorant Porkolab
2002	A	`conf`	Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme. ESA Klaus Jansen
2001	B	`conf`	Approximation Algorithms for Fractional Covering and Packing Problems, and Applications. FCT Klaus Jansen
2001	—	`ed.`	Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings RANDOM-APPROX Michel X. Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan
2001	B	`conf`	Graph Subcolorings: Complexity and Algorithms. WG Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel
2001	A	`conf`	Grouping Techniques for Scheduling Problems: Simpler and Faster. ESA Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
2001	J	`jnl`	Guest Editors' Introduction. Algorithmica Klaus Jansen, José D. P. Rolim
2001	J	`jnl`	Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. Math. Oper. Res. Klaus Jansen, Lorant Porkolab
2001	—	`conf`	Job Shop Scheduling Problems with Controllable Processing Times. ICTCS Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2001	A*	`conf`	On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates. ICALP Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab
2001	B	`conf`	On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks. FCT Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab
2001	A	`conf`	Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. STACS Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel
2001	A*	`conf`	Polynomial-time approximation schemes for geometric graphs. SODA Thomas Erlebach, Klaus Jansen, Eike Seidel
2001	J	`jnl`	The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. SIAM J. Discret. Math. Thomas Erlebach, Klaus Jansen
2001	J	`jnl`	The complexity of path coloring and call scheduling. Theor. Comput. Sci. Thomas Erlebach, Klaus Jansen
2000	J	`jnl`	A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs Electron. Colloquium Comput. Complex. Klaus Jansen, Marek Karpinski, Andrzej Lingas
2000	—	`ed.`	Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings APPROX Klaus Jansen, Samir Khuller
2000	B	`conf`	Approximation Algorithms for Flexible Job Shop Problems. LATIN Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba
2000	J	`jnl`	Approximation Results for the Optimum Cost Chromatic Partition Problem. J. Algorithms Klaus Jansen
2000	—	`conf`	Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms. ICALP Satellite Workshops Thomas Erlebach, Klaus Jansen
2000	—	`conf`	Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees. WAE Thomas Erlebach, Klaus Jansen
2000	J	`jnl`	On the Complexity of the Maximum Cut Problem. Nord. J. Comput. Hans L. Bodlaender, Klaus Jansen
2000	—	`conf`	Parallel Machine Scheduling Problems with Controllable Processing Times. ICALP Satellite Workshops Klaus Jansen, Monaldo Mastrolilli
2000	A	`conf`	Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. STACS Klaus Jansen, Maxim Sviridenko
2000	A*	`conf`	Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling. ICALP Klaus Jansen, Lorant Porkolab
2000	B	`conf`	Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time. ISAAC Klaus Jansen, Lorant Porkolab
2000	B	`conf`	Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring. MFCS Klaus Jansen, Lorant Porkolab
2000	—	`conf`	Scheduling to Minimize the Average Completion Time of Dedicated Tasks. FSTTCS Foto N. Afrati, Evripidis Bampis, Aleksei V. Fishkin, Klaus Jansen, Claire Kenyon
1999	—	`conf`	A Linear Time Approximation Scheme for the Job Shop Scheduling Problem. RANDOM-APPROX Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
1999	J	`jnl`	An Approximation Scheme for Bin Packing with Conflicts. J. Comb. Optim. Klaus Jansen
1999	J	`jnl`	Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. ACM J. Exp. Algorithmics Thomas Erlebach, Klaus Jansen
1999	B	`conf`	General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. WADS Klaus Jansen, Lorant Porkolab
1999	A*	`conf`	Improved Approximation Schemes for Scheduling Unrelated Parallel Machines. STOC Klaus Jansen, Lorant Porkolab
1999	A*	`conf`	Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. SODA Klaus Jansen, Lorant Porkolab
1999	A*	`conf`	Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme. STOC Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko
1999	J	`jnl`	Optimal Wavelength Routing on Directed Fiber Trees. Theor. Comput. Sci. Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano
1999	—	`ed.`	Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings RANDOM-APPROX Dorit S. Hochbaum, Klaus Jansen, José D. P. Rolim, Alistair Sinclair
1998	B	`conf`	A New Characterization for Parity Graphs and a Coloring Problem with Costs. LATIN Klaus Jansen
1998	B	`conf`	Algorithms Based on Randomization and Linear and Semidefinite Programming. SOFSEM Klaus Jansen, José D. P. Rolim
1998	—	`conf`	An Approximation Scheme for Bin Packing with Conflicts. SWAT Klaus Jansen
1998	J	`jnl`	An approximation algorithm for the register allocation problem. Integr. Klaus Jansen, Joachim Reiter
1998	—	`ed.`	Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings APPROX Klaus Jansen, Dorit S. Hochbaum
1998	—	`conf`	Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks. WAE Thomas Erlebach, Klaus Jansen
1998	B	`conf`	Maximizing the Number of Connections in Optical Tree Networks. ISAAC Thomas Erlebach, Klaus Jansen
1998	J	`jnl`	Rankings of Graphs. SIAM J. Discret. Math. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1998	A	`conf`	The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs. STACS Klaus Jansen
1997	—	`conf`	A New Approximation Algorithm for the Register Allocation Problem. IRREGULAR Klaus Jansen, Joachim Reiter
1997	J	`jnl`	An Optimal Greedy Algorithm for Wavelength Allocation in Directed Tree Networks Universität Trier, Mathematik/Informatik, Forschungsbericht Thomas Erlebach, Klaus Jansen
1997	—	`conf`	An approximation scheme for scheduling of malleable parallel tasks. Randomization Methods in Algorithm Design Klaus Jansen
1997	—	`conf`	An optimal greedy algorithm for wavelength allocation in directed tree networks. Network Design: Connectivity and Facilities Location Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano
1997	J	`jnl`	Approximation Algorithms for Time Constrained Scheduling. Inf. Comput. Klaus Jansen, Sabine R. Öhring
1997	J	`jnl`	Approximation Results for the Optimum Cost Chromatic Partition Problem Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1997	A*	`conf`	Approximation Results for the Optimum Cost Partition Problem. ICALP Klaus Jansen
1997	—	`conf`	Approximation results for the optimum cost chromatic partition problem. Network Design: Connectivity and Facilities Location Klaus Jansen
1997	—	`conf`	Call Scheduling in Trees, Rings and Meshes. HICSS (1) Thomas Erlebach, Klaus Jansen
1997	A*	`conf`	Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen
1997	J	`jnl`	Generalized Coloring for Tree-like Graphs. Discret. Appl. Math. Klaus Jansen, Petra Scheffler
1997	B	`conf`	Off-Line and On-Line Call-Scheduling in Stars and Trees. WG Thomas Erlebach, Klaus Jansen
1997	C	`conf`	The Optimum Cost Chromatic Partition Problem. CIAC Klaus Jansen
1996	J	`jnl`	A rainbow about T-colorings for complete graphs. Discret. Math. Klaus Jansen
1996	J	`jnl`	Approximation Algorithms for Register Allocation Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen, Joachim Reiter
1996	J	`jnl`	Approximation Results for Wavelength Routing in Directed Binary Trees Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1996	J	`jnl`	Complexity Results for the Optimum Cost Chromatic Partition Problem Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1996	J	`jnl`	Scheduling of Virtual Connections in Fast Networks Universität Trier, Mathematik/Informatik, Forschungsbericht Thomas Erlebach, Klaus Jansen
1995	—	`conf`	Approximation Algorithms for Time Constrained Scheduling. IRREGULAR Klaus Jansen, Sabine R. Öhring
1995	J	`jnl`	Restrictions of Graph Partition Problems. Part I. Theor. Comput. Sci. Hans L. Bodlaender, Klaus Jansen
1995	J	`jnl`	Scheduling of Conditional Executed Jobs on Unrelated Processors. Discret. Appl. Math. Klaus Jansen
1995	J	`jnl`	The Minimum Broadcast Time Problem for Several Processor Networks. Theor. Comput. Sci. Klaus Jansen, Haiko Müller
1995	J	`jnl`	UET-scheduling with chain-type precedence constraints. Comput. Oper. Res. Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu
1994	J	`jnl`	Analysis of Scheduling Problems with Typed Task Systems. Discret. Appl. Math. Klaus Jansen
1994	J	`jnl`	Integral Flow with Disjoint Bundles. Nord. J. Comput. Klaus Jansen
1994	A	`conf`	On the Complexity of the Maximum Cut Problem. STACS Hans L. Bodlaender, Klaus Jansen
1994	J	`jnl`	On the complexity of allocation problems in high-level synthesis. Integr. Klaus Jansen
1994	B	`conf`	Ranking of Graphs. WG Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
1994	J	`jnl`	Scheduling with Incompatible Jobs. Discret. Appl. Math. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1994	—	`conf`	The Minimum Broadcast Time Problem. Canada-France Conference on Parallel and Distributed Computing Klaus Jansen, Haiko Müller
1993	B	`conf`	A Rainbow About T-Colorings for Complete Graphs. WG Klaus Jansen
1993	J	`jnl`	A Rainbow about T-Colorings for Complete Graphs Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1993	J	`jnl`	Bounds for the general capacitated routing problem. Networks Klaus Jansen
1993	B	`conf`	Maximum Covering with D Cliques. FCT Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger
1993	B	`conf`	On the Complexity of Scheduling Incompatible Jobs with Unit-Times. MFCS Hans L. Bodlaender, Klaus Jansen
1993	J	`jnl`	One Strike Against the Min-max Degree Triangulation Problem. Comput. Geom. Klaus Jansen
1993	J	`jnl`	Scheduling and Related Graph Theoretical Problems Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1993	J	`jnl`	Scheduling of Conditional Executed Jobs Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1993	J	`jnl`	Scheduling of Conditional Executed Jobs on Unrelated Processors Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1993	J	`jnl`	Scheduling of Incompatible Jobs on Unrelated Machines. Int. J. Found. Comput. Sci. Klaus Jansen
1993	J	`jnl`	Scheduling with constrained processor allocation for interval orders. Comput. Oper. Res. Klaus Jansen
1993	J	`jnl`	The Allocation Problem in Hardware Design. Discret. Appl. Math. Klaus Jansen
1993	J	`jnl`	The Complexity of Detecting Crossingfree Configurations in the Plane. BIT Klaus Jansen, Gerhard J. Woeginger
1993	J	`jnl`	The Interconnection Problem. J. Comput. Syst. Sci. Klaus Jansen
1993	B	`conf`	The Maximum k-Dependent and f-Dependent Set Problem. ISAAC Anders Dessmark, Klaus Jansen, Andrzej Lingas
1993	J	`jnl`	Transfer flow graphs. Discret. Math. Klaus Jansen
1992	J	`jnl`	An Approximation Algorithm for the General Routing Problem. Inf. Process. Lett. Klaus Jansen
1992	J	`jnl`	Generalized Coloring for Tree-like Graphs Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen, Petra Scheffler
1992	B	`conf`	Generalized Coloring for Tree-like Graphs. WG Klaus Jansen, Petra Scheffler
1992	B	`conf`	On Scheduling Problems Restricted to Interval Orders. WG Klaus Jansen
1992	J	`jnl`	On the Complexity of One Branching Graphs Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1992	J	`jnl`	On the Complexity of a Licence Constrained Job Assignment Problem Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1992	J	`jnl`	One Strike Against the Min-Max Degree Triangulation Problem Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1992	J	`jnl`	Processor Optimization for Flow Graphs. Theor. Comput. Sci. Klaus Jansen
1992	J	`jnl`	Scheduling with Constrained Processor Allocation for Interval Orders Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen
1992	J	`jnl`	Scheduling with Incompatible Jobs Universität Trier, Mathematik/Informatik, Forschungsbericht Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1992	B	`conf`	Scheduling with Incompatible Jobs. WG Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
1992	J	`jnl`	The Complexity of Detecting Crossingfree Configurations in the Plane Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen, Gerhard J. Woeginger
1992	J	`jnl`	The Disjoint Cliques Problem Universität Trier, Mathematik/Informatik, Forschungsbericht Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger
1990	—	`—`	Ein Zuordnungsproblem im Hardware-Design. Klaus Jansen