Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Klaus Jansen
@article{DBLP:journals/corr/abs-2403-16117,
author = {Kilian Grage and
Klaus Jansen},
title = {Convolution and Knapsack in Higher Dimensions},
journal = {CoRR},
volume = {abs/2403.16117},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.16117},
doi = {10.48550/ARXIV.2403.16117},
eprinttype = {arXiv},
eprint = {2403.16117},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-16117.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GalvezGAJKR23,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Klaus Jansen and
Arindam Khan and
Malin Rau},
title = {A Tight (3/2+{\(\epsilon\)} )-Approximation for Skewed Strip Packing},
journal = {Algorithmica},
volume = {85},
number = {10},
pages = {3088--3109},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01130-2},
doi = {10.1007/S00453-023-01130-2},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GalvezGAJKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DeppertJKRT23,
author = {Max A. Deppert and
Klaus Jansen and
Arindam Khan and
Malin Rau and
Malte Tutas},
title = {Peak Demand Minimization via Sliced Strip Packing},
journal = {Algorithmica},
volume = {85},
number = {12},
pages = {3649--3679},
year = {2023},
url = {https://doi.org/10.1007/s00453-023-01152-w},
doi = {10.1007/S00453-023-01152-W},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DeppertJKRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BerndtEJLMR23,
author = {Sebastian Berndt and
Leah Epstein and
Klaus Jansen and
Asaf Levin and
Marten Maack and
Lars Rohwedder},
title = {Online bin covering with limited migration},
journal = {J. Comput. Syst. Sci.},
volume = {134},
pages = {42--72},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.01.001},
doi = {10.1016/J.JCSS.2023.01.001},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BerndtEJLMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/JansenR23,
author = {Klaus Jansen and
Lars Rohwedder},
title = {On Integer Programming, Discrepancy, and Convolution},
journal = {Math. Oper. Res.},
volume = {48},
number = {3},
pages = {1481--1495},
year = {2023},
url = {https://doi.org/10.1287/moor.2022.1308},
doi = {10.1287/MOOR.2022.1308},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/JansenR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JansenKL23,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Alexandra Lassota},
title = {The double exponential runtime is tight for 2-stage stochastic ILPs},
journal = {Math. Program.},
volume = {197},
number = {2},
pages = {1145--1172},
year = {2023},
url = {https://doi.org/10.1007/s10107-022-01837-0},
doi = {10.1007/S10107-022-01837-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/JansenKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/GrageJO23,
author = {Kilian Grage and
Klaus Jansen and
Felix Ohnesorge},
editor = {Jos{\'{e}} Cano and
Marios D. Dikaiakos and
George A. Papadopoulos and
Miquel Peric{\`{a}}s and
Rizos Sakellariou},
title = {Improved Algorithms for Monotone Moldable Job Scheduling Using Compression
and Convolution},
booktitle = {Euro-Par 2023: Parallel Processing - 29th International Conference
on Parallel and Distributed Computing, Limassol, Cyprus, August 28
- September 1, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14100},
pages = {503--517},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-39698-4\_34},
doi = {10.1007/978-3-031-39698-4\_34},
timestamp = {Tue, 12 Sep 2023 07:57:22 +0200},
biburl = {https://dblp.org/rec/conf/europar/GrageJO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/DeppertJMPR23,
author = {Max A. Deppert and
Klaus Jansen and
Marten Maack and
Simon Pukrop and
Malin Rau},
title = {Scheduling with Many Shared Resources},
booktitle = {{IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2023, St. Petersburg, FL, USA, May 15-19, 2023},
pages = {413--423},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/IPDPS54959.2023.00049},
doi = {10.1109/IPDPS54959.2023.00049},
timestamp = {Tue, 25 Jul 2023 16:27:14 +0200},
biburl = {https://dblp.org/rec/conf/ipps/DeppertJMPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/0001BJMS23,
author = {Sebastian Berndt and
Hauke Brinkop and
Klaus Jansen and
Matthias Mnich and
Tobias Stamm},
editor = {Satoru Iwata and
Naonori Kakimura},
title = {New Support Size Bounds for Integer Programming, Applied to Makespan
Minimization on Uniformly Related Machines},
booktitle = {34th International Symposium on Algorithms and Computation, {ISAAC}
2023, December 3-6, 2023, Kyoto, Japan},
series = {LIPIcs},
volume = {283},
pages = {13:1--13:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2023.13},
doi = {10.4230/LIPICS.ISAAC.2023.13},
timestamp = {Tue, 28 Nov 2023 13:12:50 +0100},
biburl = {https://dblp.org/rec/conf/isaac/0001BJMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BrinkopJ23,
author = {Hauke Brinkop and
Klaus Jansen},
editor = {Leszek Gasieniec},
title = {Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2023, Nov{\'{y}} Smokovec, Slovakia, January 15-18,
2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13878},
pages = {33--46},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-23101-8\_3},
doi = {10.1007/978-3-031-23101-8\_3},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BrinkopJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/JansenK23,
author = {Klaus Jansen and
Kai Kahler},
editor = {Leszek Gasieniec},
title = {On the Complexity of Scheduling Problems with a Fixed Number of Parallel
Identical Machines},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2023, Nov{\'{y}} Smokovec, Slovakia, January 15-18,
2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13878},
pages = {192--206},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-23101-8\_13},
doi = {10.1007/978-3-031-23101-8\_13},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/JansenK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fct/2023,
editor = {Henning Fernau and
Klaus Jansen},
title = {Fundamentals of Computation Theory - 24th International Symposium,
{FCT} 2023, Trier, Germany, September 18-21, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14292},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43587-4},
doi = {10.1007/978-3-031-43587-4},
isbn = {978-3-031-43586-7},
timestamp = {Mon, 25 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-01414,
author = {Kilian Grage and
Klaus Jansen and
Felix Ohnesorge},
title = {Improved Algorithms for Monotone Moldable Job Scheduling using Compression
and Convolution},
journal = {CoRR},
volume = {abs/2303.01414},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.01414},
doi = {10.48550/ARXIV.2303.01414},
eprinttype = {arXiv},
eprint = {2303.01414},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-01414.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-08432,
author = {Sebastian Berndt and
Hauke Brinkop and
Klaus Jansen and
Matthias Mnich and
Tobias Stamm},
title = {New Support Size Bounds for Integer Programming, Applied to Makespan
Minimization on Uniformly Related Machines},
journal = {CoRR},
volume = {abs/2305.08432},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.08432},
doi = {10.48550/ARXIV.2305.08432},
eprinttype = {arXiv},
eprint = {2305.08432},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-08432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JansenKMR22,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Marten Maack and
Malin Rau},
title = {Empowering the configuration-IP: new {PTAS} results for scheduling
with setup times},
journal = {Math. Program.},
volume = {195},
number = {1},
pages = {367--401},
year = {2022},
url = {https://doi.org/10.1007/s10107-021-01694-3},
doi = {10.1007/S10107-021-01694-3},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/JansenKMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BerndtDJR22,
author = {Sebastian Berndt and
Max A. Deppert and
Klaus Jansen and
Lars Rohwedder},
editor = {Cynthia A. Phillips and
Bettina Speckmann},
title = {Load Balancing: The Long Road from Theory to Practice},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2022, Alexandria, VA, USA, January 9-10, 2022},
pages = {104--116},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977042.9},
doi = {10.1137/1.9781611977042.9},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/BerndtDJR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Jansen0LS22,
author = {Klaus Jansen and
Arindam Khan and
Marvin Lira and
K. V. N. Sreenivas},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {A {PTAS} for Packing Hypercubes into a Knapsack},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {78:1--78:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.78},
doi = {10.4230/LIPICS.ICALP.2022.78},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Jansen0LS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/NguyenGJ22,
author = {Thi Huyen Chau Nguyen and
Werner Grass and
Klaus Jansen},
editor = {Cristina Bazgan and
Henning Fernau},
title = {Exact Polynomial Time Algorithm for the Response Time Analysis of
Harmonic Tasks},
booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
Trier, Germany, June 7-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13270},
pages = {451--465},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06678-8\_33},
doi = {10.1007/978-3-031-06678-8\_33},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/NguyenGJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-07932,
author = {Klaus Jansen and
Kai Kahler},
title = {On the Complexity of Scheduling Problems With a Fixed Number of Identical
Machines},
journal = {CoRR},
volume = {abs/2202.07932},
year = {2022},
url = {https://arxiv.org/abs/2202.07932},
eprinttype = {arXiv},
eprint = {2202.07932},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-07932.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-11902,
author = {Klaus Jansen and
Arindam Khan and
Marvin Lira and
K. V. N. Sreenivas},
title = {A {PTAS} for Packing Hypercubes into a Knapsack},
journal = {CoRR},
volume = {abs/2202.11902},
year = {2022},
url = {https://arxiv.org/abs/2202.11902},
eprinttype = {arXiv},
eprint = {2202.11902},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-11902.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-01741,
author = {Hauke Brinkop and
Klaus Jansen},
title = {High Multiplicity Scheduling on Uniform Machines in FPT-Time},
journal = {CoRR},
volume = {abs/2203.01741},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.01741},
doi = {10.48550/ARXIV.2203.01741},
eprinttype = {arXiv},
eprint = {2203.01741},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-01741.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-01523,
author = {Max A. Deppert and
Klaus Jansen and
Marten Maack and
Simon Pukrop and
Malin Rau},
title = {Scheduling with Many Shared Resources},
journal = {CoRR},
volume = {abs/2210.01523},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.01523},
doi = {10.48550/ARXIV.2210.01523},
eprinttype = {arXiv},
eprint = {2210.01523},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-01523.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-02361,
author = {Max A. Deppert and
Klaus Jansen},
title = {The Power of Duality: Response Time Analysis meets Integer Programming},
journal = {CoRR},
volume = {abs/2210.02361},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.02361},
doi = {10.48550/ARXIV.2210.02361},
eprinttype = {arXiv},
eprint = {2210.02361},
timestamp = {Fri, 07 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-02361.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BougeretJPR21,
author = {Marin Bougeret and
Klaus Jansen and
Michael Poss and
Lars Rohwedder},
title = {Approximation Results for Makespan Minimization with Budgeted Uncertainty},
journal = {Theory Comput. Syst.},
volume = {65},
number = {6},
pages = {903--915},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-10024-7},
doi = {10.1007/S00224-020-10024-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BougeretJPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenSW21,
author = {Klaus Jansen and
Oliver Sinnen and
Huijun Wang},
title = {An {EPTAS} for scheduling fork-join graphs with communication delay},
journal = {Theor. Comput. Sci.},
volume = {861},
pages = {66--79},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.02.011},
doi = {10.1016/J.TCS.2021.02.011},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aips/JansenLMP21,
author = {Klaus Jansen and
Alexandra Lassota and
Marten Maack and
Tytus Pikies},
editor = {Susanne Biundo and
Minh Do and
Robert Goldman and
Michael Katz and
Qiang Yang and
Hankz Hankui Zhuo},
title = {Total Completion Time Minimization for Scheduling with Incompatibility
Cliques},
booktitle = {Proceedings of the Thirty-First International Conference on Automated
Planning and Scheduling, {ICAPS} 2021, Guangzhou, China (virtual),
August 2-13, 2021},
pages = {192--200},
publisher = {{AAAI} Press},
year = {2021},
url = {https://ojs.aaai.org/index.php/ICAPS/article/view/15962},
timestamp = {Wed, 30 Aug 2023 08:38:08 +0200},
biburl = {https://dblp.org/rec/conf/aips/JansenLMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DeppertJ0RT21,
author = {Max A. Deppert and
Klaus Jansen and
Arindam Khan and
Malin Rau and
Malte Tutas},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Peak Demand Minimization via Sliced Strip Packing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {21:1--21:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.21},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.21},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/DeppertJ0RT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/BerndtGJJK21,
author = {Sebastian Berndt and
Kilian Grage and
Klaus Jansen and
Lukas Johannsen and
Maria Kosche},
editor = {Liesbeth De Mol and
Andreas Weiermann and
Florin Manea and
David Fern{\'{a}}ndez{-}Duque},
title = {Robust Online Algorithms for Dynamic Choosing Problems},
booktitle = {Connecting with Computability - 17th Conference on Computability in
Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12813},
pages = {38--49},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80049-9\_4},
doi = {10.1007/978-3-030-80049-9\_4},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/BerndtGJJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JansenR21,
author = {Klaus Jansen and
Malin Rau},
editor = {Petra Mutzel and
Rasmus Pagh and
Grzegorz Herman},
title = {Closing the Gap for Single Resource Constraint Scheduling},
booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
6-8, 2021, Lisbon, Portugal (Virtual Conference)},
series = {LIPIcs},
volume = {204},
pages = {53:1--53:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ESA.2021.53},
doi = {10.4230/LIPICS.ESA.2021.53},
timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
biburl = {https://dblp.org/rec/conf/esa/JansenR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/grapp/DomrosLHJ21,
author = {S{\"{o}}ren Domr{\"{o}}s and
Daniel Lucas and
Reinhard von Hanxleden and
Klaus Jansen},
editor = {A. Augusto de Sousa and
Vlastimil Havran and
Alexis Paljic and
Tabitha C. Peck and
Christophe Hurter and
Helen C. Purchase and
Giovanni Maria Farinella and
Petia Radeva and
Kadi Bouatouch},
title = {Revisiting Order-Preserving, Gap-Avoiding Rectangle Packing},
booktitle = {Computer Vision, Imaging and Computer Graphics Theory and Applications
- 16th International Joint Conference, {VISIGRAPP} 2021, Virtual Event,
February 8-10, 2021, Revised Selected Papers},
series = {Communications in Computer and Information Science},
volume = {1691},
pages = {183--205},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-031-25477-2\_9},
doi = {10.1007/978-3-031-25477-2\_9},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/grapp/DomrosLHJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JansenKL21,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Alexandra Lassota},
editor = {Mohit Singh and
David P. Williamson},
title = {The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs},
booktitle = {Integer Programming and Combinatorial Optimization - 22nd International
Conference, {IPCO} 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12707},
pages = {297--310},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-73879-2\_21},
doi = {10.1007/978-3-030-73879-2\_21},
timestamp = {Thu, 06 May 2021 12:02:31 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JansenKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ivapp/DomrosLHJ21,
author = {S{\"{o}}ren Domr{\"{o}}s and
Daniel Lucas and
Reinhard von Hanxleden and
Klaus Jansen},
editor = {Christophe Hurter and
Helen C. Purchase and
Jos{\'{e}} Braz and
Kadi Bouatouch},
title = {On Order-preserving, Gap-avoiding Rectangle Packing},
booktitle = {Proceedings of the 16th International Joint Conference on Computer
Vision, Imaging and Computer Graphics Theory and Applications, {VISIGRAPP}
2021, Volume 3: IVAPP, Online Streaming, February 8-10, 2021},
pages = {38--49},
publisher = {{SCITEPRESS}},
year = {2021},
url = {https://doi.org/10.5220/0010186400380049},
doi = {10.5220/0010186400380049},
timestamp = {Tue, 06 Jun 2023 14:58:00 +0200},
biburl = {https://dblp.org/rec/conf/ivapp/DomrosLHJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DeppertJK21,
author = {Max A. Deppert and
Klaus Jansen and
Kim{-}Manuel Klein},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Fuzzy Simultaneous Congruences},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {39:1--39:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.39},
doi = {10.4230/LIPICS.MFCS.2021.39},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DeppertJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BerndtJL21,
author = {Sebastian Berndt and
Klaus Jansen and
Alexandra Lassota},
editor = {Tom{\'{a}}s Bures and
Riccardo Dondi and
Johann Gamper and
Giovanna Guerrini and
Tomasz Jurdzinski and
Claus Pahl and
Florian Sikora and
Prudence W. H. Wong},
title = {Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs},
booktitle = {{SOFSEM} 2021: Theory and Practice of Computer Science - 47th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2021, Bolzano-Bozen, Italy, January 25-29, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12607},
pages = {349--360},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-67731-2\_25},
doi = {10.1007/978-3-030-67731-2\_25},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BerndtJL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/BerndtJK21,
author = {Sebastian Berndt and
Klaus Jansen and
Kim{-}Manuel Klein},
editor = {Hung Viet Le and
Valerie King},
title = {New Bounds for the Vertices of the Integer Hull},
booktitle = {4th Symposium on Simplicity in Algorithms, {SOSA} 2021, Virtual Conference,
January 11-12, 2021},
pages = {25--36},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976496.3},
doi = {10.1137/1.9781611976496.3},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BerndtJK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-00694,
author = {Hauke Brinkop and
Klaus Jansen and
Tim Wei{\ss}enfels},
title = {An optimal {FPT} algorithm parametrized by treewidth for Weighted-Max-Bisection
given a tree decomposition as advice assuming {SETH} and the hardness
of MinConv},
journal = {CoRR},
volume = {abs/2101.00694},
year = {2021},
url = {https://arxiv.org/abs/2101.00694},
eprinttype = {arXiv},
eprint = {2101.00694},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-00694.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-09803,
author = {Sebastian Berndt and
Kilian Grage and
Klaus Jansen and
Lukas Johannsen and
Maria Kosche},
title = {Robust Online Algorithms for Dynamic Choosing Problems},
journal = {CoRR},
volume = {abs/2104.09803},
year = {2021},
url = {https://arxiv.org/abs/2104.09803},
eprinttype = {arXiv},
eprint = {2104.09803},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-09803.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-07219,
author = {Max A. Deppert and
Klaus Jansen and
Arindam Khan and
Malin Rau and
Malte Tutas},
title = {Peak Demand Minimization via Sliced Strip Packing},
journal = {CoRR},
volume = {abs/2105.07219},
year = {2021},
url = {https://arxiv.org/abs/2105.07219},
eprinttype = {arXiv},
eprint = {2105.07219},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-07219.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-01613,
author = {Klaus Jansen and
Malin Rau},
title = {Closing the gap for single resource constraint scheduling},
journal = {CoRR},
volume = {abs/2107.01613},
year = {2021},
url = {https://arxiv.org/abs/2107.01613},
eprinttype = {arXiv},
eprint = {2107.01613},
timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-01613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-13638,
author = {Sebastian Berndt and
Max A. Deppert and
Klaus Jansen and
Lars Rohwedder},
title = {Load Balancing: The Long Road from Theory to Practice},
journal = {CoRR},
volume = {abs/2107.13638},
year = {2021},
url = {https://arxiv.org/abs/2107.13638},
eprinttype = {arXiv},
eprint = {2107.13638},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-13638.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JansenR20,
author = {Klaus Jansen and
Lars Rohwedder},
title = {A note on the integrality gap of the configuration {LP} for restricted
Santa Claus},
journal = {Inf. Process. Lett.},
volume = {164},
pages = {106025},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.106025},
doi = {10.1016/J.IPL.2020.106025},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JansenR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/JansenKV20,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Jos{\'{e}} Verschae},
title = {Closing the Gap for Makespan Scheduling via Sparsification Techniques},
journal = {Math. Oper. Res.},
volume = {45},
number = {4},
pages = {1371--1392},
year = {2020},
url = {https://doi.org/10.1287/moor.2019.1036},
doi = {10.1287/MOOR.2019.1036},
timestamp = {Sat, 25 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/JansenKV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/JansenK20,
author = {Klaus Jansen and
Kim{-}Manuel Klein},
title = {About the Structure of the Integer Cone and Its Application to Bin
Packing},
journal = {Math. Oper. Res.},
volume = {45},
number = {4},
pages = {1498--1511},
year = {2020},
url = {https://doi.org/10.1287/moor.2019.1040},
doi = {10.1287/MOOR.2019.1040},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/JansenK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BerndtJK20,
author = {Sebastian Berndt and
Klaus Jansen and
Kim{-}Manuel Klein},
title = {Fully dynamic bin packing revisited},
journal = {Math. Program.},
volume = {179},
number = {1},
pages = {109--155},
year = {2020},
url = {https://doi.org/10.1007/s10107-018-1325-x},
doi = {10.1007/S10107-018-1325-X},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/BerndtJK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HenningJRS20,
author = {S{\"{o}}ren Henning and
Klaus Jansen and
Malin Rau and
Lars Schmarje},
title = {Complexity and Inapproximability Results for Parallel Task Scheduling
and Strip Packing},
journal = {Theory Comput. Syst.},
volume = {64},
number = {1},
pages = {120--140},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09910-6},
doi = {10.1007/S00224-019-09910-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HenningJRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JansenR20,
author = {Klaus Jansen and
Lars Rohwedder},
title = {A Quasi-Polynomial Approximation for the Restricted Assignment Problem},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {6},
pages = {1083--1108},
year = {2020},
url = {https://doi.org/10.1137/19M128257X},
doi = {10.1137/19M128257X},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/JansenR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JansenLR20,
author = {Klaus Jansen and
Alexandra Lassota and
Lars Rohwedder},
title = {Near-Linear Time Algorithm for n-Fold ILPs via Color Coding},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {4},
pages = {2282--2299},
year = {2020},
url = {https://doi.org/10.1137/19M1303873},
doi = {10.1137/19M1303873},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/JansenLR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenMS20,
author = {Klaus Jansen and
Marten Maack and
Roberto Solis{-}Oba},
title = {Structural parameters for scheduling with assignment restrictions},
journal = {Theor. Comput. Sci.},
volume = {844},
pages = {154--170},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.08.015},
doi = {10.1016/J.TCS.2020.08.015},
timestamp = {Wed, 04 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Galvez0AJ0R20,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Afrouz Jabal Ameli and
Klaus Jansen and
Arindam Khan and
Malin Rau},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {A Tight (3/2+{\(\epsilon\)}) Approximation for Skewed Strip Packing},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {44:1--44:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.44},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.44},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Galvez0AJ0R20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/JansenLM20,
author = {Klaus Jansen and
Alexandra Lassota and
Marten Maack},
editor = {Christian Scheideler and
Michael Spear},
title = {Approximation Algorithms for Scheduling with Class Constraints},
booktitle = {{SPAA} '20: 32nd {ACM} Symposium on Parallelism in Algorithms and
Architectures, Virtual Event, USA, July 15-17, 2020},
pages = {349--357},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3350755.3400247},
doi = {10.1145/3350755.3400247},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/JansenLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MaackJ20,
author = {Marten Maack and
Klaus Jansen},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Inapproximability Results for Scheduling with Interval and Resource
Restrictions},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {5:1--5:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.5},
doi = {10.4230/LIPICS.STACS.2020.5},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MaackJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07746,
author = {Max A. Deppert and
Klaus Jansen and
Kim{-}Manuel Klein},
title = {Fuzzy Simultaneous Congruences},
journal = {CoRR},
volume = {abs/2002.07746},
year = {2020},
url = {https://arxiv.org/abs/2002.07746},
eprinttype = {arXiv},
eprint = {2002.07746},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07746.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-10847,
author = {Sebastian Berndt and
Klaus Jansen and
Kim{-}Manuel Klein},
title = {New Bounds for the Vertices of the Integer Hull},
journal = {CoRR},
volume = {abs/2006.10847},
year = {2020},
url = {https://arxiv.org/abs/2006.10847},
eprinttype = {arXiv},
eprint = {2006.10847},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-10847.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-12928,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Alexandra Lassota},
title = {The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs},
journal = {CoRR},
volume = {abs/2008.12928},
year = {2020},
url = {https://arxiv.org/abs/2008.12928},
eprinttype = {arXiv},
eprint = {2008.12928},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-12928.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-09255,
author = {Sebastian Berndt and
Klaus Jansen and
Alexandra Lassota},
title = {Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs},
journal = {CoRR},
volume = {abs/2010.09255},
year = {2020},
url = {https://arxiv.org/abs/2010.09255},
eprinttype = {arXiv},
eprint = {2010.09255},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-09255.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-06150,
author = {Klaus Jansen and
Alexandra Lassota and
Marten Maack and
Tytus Pikies},
title = {Total Completion Time Minimization for Scheduling with Incompatibility
Cliques},
journal = {CoRR},
volume = {abs/2011.06150},
year = {2020},
url = {https://arxiv.org/abs/2011.06150},
eprinttype = {arXiv},
eprint = {2011.06150},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-06150.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenM19,
author = {Klaus Jansen and
Marten Maack},
title = {An {EPTAS} for Scheduling on Unrelated Machines of Few Different Types},
journal = {Algorithmica},
volume = {81},
number = {10},
pages = {4134--4164},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00581-w},
doi = {10.1007/S00453-019-00581-W},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JansenK19,
author = {Klaus Jansen and
Kim{-}Manuel Klein},
title = {A Robust {AFPTAS} for Online Bin Packing with Polynomial Migration},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {4},
pages = {2062--2091},
year = {2019},
url = {https://doi.org/10.1137/17M1122529},
doi = {10.1137/17M1122529},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JansenK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JansenMR19,
author = {Klaus Jansen and
Marten Maack and
Malin Rau},
title = {Approximation Schemes for Machine Scheduling with Resource (In-)dependent
Processing Times},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {3},
pages = {31:1--31:28},
year = {2019},
url = {https://doi.org/10.1145/3302250},
doi = {10.1145/3302250},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/JansenMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenR19,
author = {Klaus Jansen and
Malin Rau},
title = {Improved approximation for two dimensional Strip Packing with polynomial
bounded width},
journal = {Theor. Comput. Sci.},
volume = {789},
pages = {34--49},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.04.002},
doi = {10.1016/J.TCS.2019.04.002},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/JansenR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BerndtEJLMR19,
author = {Sebastian Berndt and
Leah Epstein and
Klaus Jansen and
Asaf Levin and
Marten Maack and
Lars Rohwedder},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Online Bin Covering with Limited Migration},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {18:1--18:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.18},
doi = {10.4230/LIPICS.ESA.2019.18},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/BerndtEJLMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/JansenR19,
author = {Klaus Jansen and
Malin Rau},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Closing the Gap for Pseudo-Polynomial Strip Packing},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {62:1--62:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.62},
doi = {10.4230/LIPICS.ESA.2019.62},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/JansenR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/JansenR19,
author = {Klaus Jansen and
Malin Rau},
editor = {Ramin Yahyapour},
title = {Linear Time Algorithms for Multiple Cluster Scheduling and Multiple
Strip Packing},
booktitle = {Euro-Par 2019: Parallel Processing - 25th International Conference
on Parallel and Distributed Computing, G{\"{o}}ttingen, Germany,
August 26-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11725},
pages = {103--116},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-29400-7\_8},
doi = {10.1007/978-3-030-29400-7\_8},
timestamp = {Wed, 21 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/europar/JansenR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenR19,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Local Search Breaks 1.75 for Graph Balancing},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {74:1--74:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.74},
doi = {10.4230/LIPICS.ICALP.2019.74},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/JansenR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenLR19,
author = {Klaus Jansen and
Alexandra Lassota and
Lars Rohwedder},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Near-Linear Time Algorithm for n-fold ILPs via Color Coding},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {75:1--75:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.75},
doi = {10.4230/LIPICS.ICALP.2019.75},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/JansenLR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/JansenR19,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Avrim Blum},
title = {On Integer Programming and Convolution},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {43:1--43:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.43},
doi = {10.4230/LIPICS.ITCS.2019.43},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/JansenR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/JansenKMR19,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Marten Maack and
Malin Rau},
editor = {Avrim Blum},
title = {Empowering the Configuration-IP - New {PTAS} Results for Scheduling
with Setups Times},
booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
2019, January 10-12, 2019, San Diego, California, {USA}},
series = {LIPIcs},
volume = {124},
pages = {44:1--44:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.44},
doi = {10.4230/LIPICS.ITCS.2019.44},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/JansenKMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/JansenMM19,
author = {Klaus Jansen and
Marten Maack and
Alexander M{\"{a}}cker},
title = {Scheduling on (Un-)Related Machines with Setup Times},
booktitle = {2019 {IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2019, Rio de Janeiro, Brazil, May 20-24, 2019},
pages = {145--154},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/IPDPS.2019.00025},
doi = {10.1109/IPDPS.2019.00025},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/ipps/JansenMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GrageJK19,
author = {Kilian Grage and
Klaus Jansen and
Kim{-}Manuel Klein},
editor = {Christian Scheideler and
Petra Berenbrink},
title = {An {EPTAS} for Machine Scheduling with Bag-Constraints},
booktitle = {The 31st {ACM} on Symposium on Parallelism in Algorithms and Architectures,
{SPAA} 2019, Phoenix, AZ, USA, June 22-24, 2019},
pages = {135--144},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3323165.3323192},
doi = {10.1145/3323165.3323192},
timestamp = {Wed, 19 Jun 2019 08:07:06 +0200},
biburl = {https://dblp.org/rec/conf/spaa/GrageJK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/DeppertJ19,
author = {Max A. Deppert and
Klaus Jansen},
editor = {Christian Scheideler and
Petra Berenbrink},
title = {Near-Linear Approximation Algorithms for Scheduling Problems with
Batch Setup Times},
booktitle = {The 31st {ACM} on Symposium on Parallelism in Algorithms and Architectures,
{SPAA} 2019, Phoenix, AZ, USA, June 22-24, 2019},
pages = {155--164},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3323165.3323200},
doi = {10.1145/3323165.3323200},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/DeppertJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BerndtDGJK19,
author = {Sebastian Berndt and
Valentin Dreismann and
Kilian Grage and
Klaus Jansen and
Ingmar Knof},
editor = {Evripidis Bampis and
Nicole Megow},
title = {Robust Online Algorithms for Certain Dynamic Packing Problems},
booktitle = {Approximation and Online Algorithms - 17th International Workshop,
{WAOA} 2019, Munich, Germany, September 12-13, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11926},
pages = {43--59},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-39479-0\_4},
doi = {10.1007/978-3-030-39479-0\_4},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BerndtDGJK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BougeretJPR19,
author = {Marin Bougeret and
Klaus Jansen and
Michael Poss and
Lars Rohwedder},
editor = {Evripidis Bampis and
Nicole Megow},
title = {Approximation Results for Makespan Minimization with Budgeted Uncertainty},
booktitle = {Approximation and Online Algorithms - 17th International Workshop,
{WAOA} 2019, Munich, Germany, September 12-13, 2019, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11926},
pages = {60--71},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-39479-0\_5},
doi = {10.1007/978-3-030-39479-0\_5},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BougeretJPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-03428,
author = {Klaus Jansen and
Malin Rau},
title = {Linear Time Algorithms for Multiple Cluster Scheduling and Multiple
Strip Packing},
journal = {CoRR},
volume = {abs/1902.03428},
year = {2019},
url = {http://arxiv.org/abs/1902.03428},
eprinttype = {arXiv},
eprint = {1902.03428},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-03428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-06543,
author = {Sebastian Berndt and
Leah Epstein and
Klaus Jansen and
Asaf Levin and
Marten Maack and
Lars Rohwedder},
title = {Online Bin Covering with Limited Migration},
journal = {CoRR},
volume = {abs/1904.06543},
year = {2019},
url = {http://arxiv.org/abs/1904.06543},
eprinttype = {arXiv},
eprint = {1904.06543},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-06543.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-07986,
author = {Sebastian Berndt and
Valentin Dreismann and
Kilian Grage and
Klaus Jansen and
Ingmar Knof},
title = {Robust Online Algorithms for Dynamic Problems},
journal = {CoRR},
volume = {abs/1905.07986},
year = {2019},
url = {http://arxiv.org/abs/1905.07986},
eprinttype = {arXiv},
eprint = {1905.07986},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-07986.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-08592,
author = {Marin Bougeret and
Klaus Jansen and
Michael Poss and
Lars Rohwedder},
title = {Approximation results for makespan minimization with budgeted uncertainty},
journal = {CoRR},
volume = {abs/1905.08592},
year = {2019},
url = {http://arxiv.org/abs/1905.08592},
eprinttype = {arXiv},
eprint = {1905.08592},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-08592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-03526,
author = {Marten Maack and
Klaus Jansen},
title = {Inapproximability Results for Scheduling with Interval and Resource
Restrictions},
journal = {CoRR},
volume = {abs/1907.03526},
year = {2019},
url = {http://arxiv.org/abs/1907.03526},
eprinttype = {arXiv},
eprint = {1907.03526},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-03526.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-11970,
author = {Klaus Jansen and
Alexandra Lassota and
Marten Maack},
title = {Approximation Algorithms for Scheduling with Class Constraints},
journal = {CoRR},
volume = {abs/1909.11970},
year = {2019},
url = {http://arxiv.org/abs/1909.11970},
eprinttype = {arXiv},
eprint = {1909.11970},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-11970.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-01161,
author = {Thi Huyen Chau Nguyen and
Werner Grass and
Klaus Jansen},
title = {Exact Polynomial Time Algorithm for the Response Time Analysis of
Harmonic Tasks with Constrained Release Jitter},
journal = {CoRR},
volume = {abs/1912.01161},
year = {2019},
url = {http://arxiv.org/abs/1912.01161},
eprinttype = {arXiv},
eprint = {1912.01161},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-01161.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenLM18,
author = {Klaus Jansen and
Kati Land and
Marten Maack},
title = {Estimating the Makespan of the Two-Valued Restricted Assignment Problem},
journal = {Algorithmica},
volume = {80},
number = {4},
pages = {1357--1382},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0314-4},
doi = {10.1007/S00453-017-0314-4},
timestamp = {Tue, 06 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JansenK18,
author = {Klaus Jansen and
Stefan Erich Julius Kraft},
title = {A faster {FPTAS} for the Unbounded Knapsack Problem},
journal = {Eur. J. Comb.},
volume = {68},
pages = {148--174},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2017.07.016},
doi = {10.1016/J.EJC.2017.07.016},
timestamp = {Tue, 02 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/JansenK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GehrkeJKS18,
author = {Jan Clemens Gehrke and
Klaus Jansen and
Stefan E. J. Kraft and
Jakob Schikowski},
title = {A {PTAS} for Scheduling Unrelated Machines of Few Different Types},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {4},
pages = {591--621},
year = {2018},
url = {https://doi.org/10.1142/S0129054118410071},
doi = {10.1142/S0129054118410071},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/GehrkeJKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenJZ18,
author = {Lin Chen and
Klaus Jansen and
Guochuan Zhang},
title = {On the optimality of exact and approximation algorithms for scheduling
problems},
journal = {J. Comput. Syst. Sci.},
volume = {96},
pages = {1--32},
year = {2018},
url = {https://doi.org/10.1016/j.jcss.2018.03.005},
doi = {10.1016/J.JCSS.2018.03.005},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/ChenJZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BazganBCFJKLLMP18,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {The many facets of upper domination},
journal = {Theor. Comput. Sci.},
volume = {717},
pages = {2--25},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.05.042},
doi = {10.1016/J.TCS.2017.05.042},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BazganBCFJKLLMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/HenningJRS18,
author = {S{\"{o}}ren Henning and
Klaus Jansen and
Malin Rau and
Lars Schmarje},
editor = {Fedor V. Fomin and
Vladimir V. Podolskii},
title = {Complexity and Inapproximability Results for Parallel Task Scheduling
and Strip Packing},
booktitle = {Computer Science - Theory and Applications - 13th International Computer
Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10846},
pages = {169--180},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-90530-3\_15},
doi = {10.1007/978-3-319-90530-3\_15},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/HenningJRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/JansenL18,
author = {Klaus Jansen and
Felix Land},
title = {Scheduling Monotone Moldable Jobs in Linear Time},
booktitle = {2018 {IEEE} International Parallel and Distributed Processing Symposium,
{IPDPS} 2018, Vancouver, BC, Canada, May 21-25, 2018},
pages = {172--181},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/IPDPS.2018.00027},
doi = {10.1109/IPDPS.2018.00027},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/JansenL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenR18,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Raimund Seidel},
title = {Compact {LP} Relaxations for Allocation Problems},
booktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,
2018, New Orleans, LA, {USA}},
series = {OASIcs},
volume = {61},
pages = {11:1--11:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/OASIcs.SOSA.2018.11},
doi = {10.4230/OASICS.SOSA.2018.11},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2018,
editor = {Eric Blais and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Steurer},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {116},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-085-9},
isbn = {978-3-95977-085-9},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-06460,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Marten Maack and
Malin Rau},
title = {Empowering the Configuration-IP - New {PTAS} Results for Scheduling
with Setups Times},
journal = {CoRR},
volume = {abs/1801.06460},
year = {2018},
url = {http://arxiv.org/abs/1801.06460},
eprinttype = {arXiv},
eprint = {1801.06460},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-06460.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-04744,
author = {Klaus Jansen and
Lars Rohwedder},
title = {On Integer Programming and Convolution},
journal = {CoRR},
volume = {abs/1803.04744},
year = {2018},
url = {http://arxiv.org/abs/1803.04744},
eprinttype = {arXiv},
eprint = {1803.04744},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-04744.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-03626,
author = {Klaus Jansen and
Lars Rohwedder},
title = {A note on the integrality gap of the configuration {LP} for restricted
Santa Claus},
journal = {CoRR},
volume = {abs/1807.03626},
year = {2018},
url = {http://arxiv.org/abs/1807.03626},
eprinttype = {arXiv},
eprint = {1807.03626},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-03626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1809-10428,
author = {Klaus Jansen and
Marten Maack and
Alexander M{\"{a}}cker},
title = {Scheduling on (Un-)Related Machines with Setup Times},
journal = {CoRR},
volume = {abs/1809.10428},
year = {2018},
url = {http://arxiv.org/abs/1809.10428},
eprinttype = {arXiv},
eprint = {1809.10428},
timestamp = {Fri, 05 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1809-10428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01223,
author = {Max A. Deppert and
Klaus Jansen},
title = {Near-Linear Approximation Algorithms for Scheduling Problems with
Batch Setup Times},
journal = {CoRR},
volume = {abs/1810.01223},
year = {2018},
url = {http://arxiv.org/abs/1810.01223},
eprinttype = {arXiv},
eprint = {1810.01223},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-01223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-07510,
author = {Kilian Grage and
Klaus Jansen and
Kim{-}Manuel Klein},
title = {An {EPTAS} for machine scheduling with bag-constraints},
journal = {CoRR},
volume = {abs/1810.07510},
year = {2018},
url = {http://arxiv.org/abs/1810.07510},
eprinttype = {arXiv},
eprint = {1810.07510},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-07510.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-00950,
author = {Klaus Jansen and
Alexandra Lassota and
Lars Rohwedder},
title = {Near-Linear Time Algorithm for n-fold ILPs via Color Coding},
journal = {CoRR},
volume = {abs/1811.00950},
year = {2018},
url = {http://arxiv.org/abs/1811.00950},
eprinttype = {arXiv},
eprint = {1811.00950},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-00950.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-00955,
author = {Klaus Jansen and
Lars Rohwedder},
title = {Local search breaks 1.75 for Graph Balancing},
journal = {CoRR},
volume = {abs/1811.00955},
year = {2018},
url = {http://arxiv.org/abs/1811.00955},
eprinttype = {arXiv},
eprint = {1811.00955},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-00955.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/JansenKKL17,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Maria Kosche and
Leon Ladewig},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Online Strip Packing with Polynomial Migration},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {13:1--13:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.13},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.13},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/JansenKKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/JansenR17,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Daya Ram Gaur and
N. S. Narayanaswamy},
title = {Structured Instances of Restricted Assignment with Two Processing
Times},
booktitle = {Algorithms and Discrete Applied Mathematics - Third International
Conference, {CALDAM} 2017, Sancoale, Goa, India, February 16-18, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10156},
pages = {230--241},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53007-9\_21},
doi = {10.1007/978-3-319-53007-9\_21},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/caldam/JansenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Jansen17,
author = {Klaus Jansen},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {New Algorithmic Results for Bin Packing and Scheduling},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {10--15},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_2},
doi = {10.1007/978-3-319-57586-5\_2},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/Jansen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/JansenMS17,
author = {Klaus Jansen and
Marten Maack and
Roberto Solis{-}Oba},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Structural Parameters for Scheduling with Assignment Restrictions},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {357--368},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_30},
doi = {10.1007/978-3-319-57586-5\_30},
timestamp = {Wed, 10 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/JansenMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JansenR17,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Friedrich Eisenbrand and
Jochen K{\"{o}}nemann},
title = {A Quasi-Polynomial Approximation for the Restricted Assignment Problem},
booktitle = {Integer Programming and Combinatorial Optimization - 19th International
Conference, {IPCO} 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10328},
pages = {305--316},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59250-3\_25},
doi = {10.1007/978-3-319-59250-3\_25},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/JansenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenK17,
author = {Klaus Jansen and
Kim{-}Manuel Klein},
editor = {Philip N. Klein},
title = {About the Structure of the Integer Cone and its Application to Bin
Packing},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1571--1581},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.103},
doi = {10.1137/1.9781611974782.103},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenR17,
author = {Klaus Jansen and
Lars Rohwedder},
editor = {Philip N. Klein},
title = {On the Configuration-LP of the Restricted Assignment Problem},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2670--2678},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.176},
doi = {10.1137/1.9781611974782.176},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/JansenM17,
author = {Klaus Jansen and
Marten Maack},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {An {EPTAS} for Scheduling on Unrelated Machines of Few Different Types},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {497--508},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_42},
doi = {10.1007/978-3-319-62127-2\_42},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/JansenM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/JansenR17,
author = {Klaus Jansen and
Malin Rau},
editor = {Sheung{-}Hung Poon and
Md. Saidur Rahman and
Hsu{-}Chun Yen},
title = {Improved Approximation for Two Dimensional Strip Packing with Polynomial
Bounded Width},
booktitle = {{WALCOM:} Algorithms and Computation, 11th International Conference
and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10167},
pages = {409--420},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53925-6\_32},
doi = {10.1007/978-3-319-53925-6\_32},
timestamp = {Tue, 21 Mar 2023 20:55:51 +0100},
biburl = {https://dblp.org/rec/conf/walcom/JansenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2017,
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-044-6},
isbn = {978-3-95977-044-6},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2016,
editor = {Klaus Jansen and
Monaldo Mastrolilli},
title = {Approximation and Online Algorithms - 14th International Workshop,
{WAOA} 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10138},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-51741-4},
doi = {10.1007/978-3-319-51741-4},
isbn = {978-3-319-51740-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenM17,
author = {Klaus Jansen and
Marten Maack},
title = {An {EPTAS} for Scheduling on Unrelated Machines of Few Different Types},
journal = {CoRR},
volume = {abs/1701.03263},
year = {2017},
url = {http://arxiv.org/abs/1701.03263},
eprinttype = {arXiv},
eprint = {1701.03263},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenR17,
author = {Klaus Jansen and
Lars Rohwedder},
title = {A Quasi-Polynomial Approximation for the Restricted Assignment Problem},
journal = {CoRR},
volume = {abs/1701.07208},
year = {2017},
url = {http://arxiv.org/abs/1701.07208},
eprinttype = {arXiv},
eprint = {1701.07208},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenMS17,
author = {Klaus Jansen and
Marten Maack and
Roberto Solis{-}Oba},
title = {Structural Parameters for Scheduling with Assignment Restrictions},
journal = {CoRR},
volume = {abs/1701.07242},
year = {2017},
url = {http://arxiv.org/abs/1701.07242},
eprinttype = {arXiv},
eprint = {1701.07242},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HenningJRS17,
author = {S{\"{o}}ren Henning and
Klaus Jansen and
Malin Rau and
Lars Schmarje},
title = {Complexity and Inapproximability Results for Parallel Task Scheduling
and Strip Packing},
journal = {CoRR},
volume = {abs/1705.04587},
year = {2017},
url = {http://arxiv.org/abs/1705.04587},
eprinttype = {arXiv},
eprint = {1705.04587},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HenningJRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenKKL17,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Maria Kosche and
Leon Ladewig},
title = {Online Strip Packing with Polynomial Migration},
journal = {CoRR},
volume = {abs/1706.04939},
year = {2017},
url = {http://arxiv.org/abs/1706.04939},
eprinttype = {arXiv},
eprint = {1706.04939},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenKKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-00103,
author = {Klaus Jansen and
Felix Land},
title = {Scheduling Monotone Moldable Jobs in Linear Time},
journal = {CoRR},
volume = {abs/1711.00103},
year = {2017},
url = {http://arxiv.org/abs/1711.00103},
eprinttype = {arXiv},
eprint = {1711.00103},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-00103.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-04922,
author = {Klaus Jansen and
Malin Rau},
title = {Closing the gap for pseudo-polynomial strip packing},
journal = {CoRR},
volume = {abs/1712.04922},
year = {2017},
url = {http://arxiv.org/abs/1712.04922},
eprinttype = {arXiv},
eprint = {1712.04922},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-04922.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenP16,
author = {Klaus Jansen and
Lars Pr{\"{a}}del},
title = {New Approximability Results for Two-Dimensional Bin Packing},
journal = {Algorithmica},
volume = {74},
number = {1},
pages = {208--269},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9943-z},
doi = {10.1007/S00453-014-9943-Z},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/JansenT16,
author = {Klaus Jansen and
Denis Trystram},
title = {Scheduling parallel jobs on heterogeneous platforms},
journal = {Electron. Notes Discret. Math.},
volume = {55},
pages = {9--12},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.10.003},
doi = {10.1016/J.ENDM.2016.10.003},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/JansenT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JansenK16,
author = {Klaus Jansen and
Stefan Erich Julius Kraft},
title = {An Improved Approximation Scheme for Variable-Sized Bin Packing},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {262--322},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9644-2},
doi = {10.1007/S00224-015-9644-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JansenK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JansenLL16,
author = {Klaus Jansen and
Felix Land and
Kati Land},
title = {Bounding the Running Time of Algorithms for Scheduling and Packing
Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {30},
number = {1},
pages = {343--366},
year = {2016},
url = {https://doi.org/10.1137/140952636},
doi = {10.1137/140952636},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JansenLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Algorithmic Aspects of Upper Domination: {A} Parameterised Perspective},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
pages = {113--124},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_10},
doi = {10.1007/978-3-319-41168-2\_10},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaim/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/0011JLZ16,
author = {Lin Chen and
Klaus Jansen and
Wenchang Luo and
Guochuan Zhang},
editor = {T.{-}H. Hubert Chan and
Minming Li and
Lusheng Wang},
title = {An Efficient {PTAS} for Parallel Machine Scheduling with Capacity
Constraints},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
{COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10043},
pages = {608--623},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48749-6\_44},
doi = {10.1007/978-3-319-48749-6\_44},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/0011JLZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/JansenL16,
author = {Klaus Jansen and
Felix Land},
editor = {Pierre{-}Fran{\c{c}}ois Dutot and
Denis Trystram},
title = {Non-preemptive Scheduling with Setup Times: {A} {PTAS}},
booktitle = {Euro-Par 2016: Parallel Processing - 22nd International Conference
on Parallel and Distributed Computing, Grenoble, France, August 24-26,
2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9833},
pages = {159--170},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-43659-3\_12},
doi = {10.1007/978-3-319-43659-3\_12},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/JansenL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenKV16,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Jos{\'{e}} Verschae},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Closing the Gap for Makespan Scheduling via Sparsification Techniques},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {72:1--72:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.72},
doi = {10.4230/LIPICS.ICALP.2016.72},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/JansenKV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BazganBCFJKLLMP16,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Kim{-}Manuel Klein and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Upper Domination: Complexity and Approximation},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {241--252},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_19},
doi = {10.1007/978-3-319-44543-4\_19},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/BazganBCFJKLLMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenMR16,
author = {Klaus Jansen and
Marten Maack and
Malin Rau},
editor = {Robert Krauthgamer},
title = {Approximation schemes for machine scheduling with resource (in-)dependent
processing times},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1526--1542},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch104},
doi = {10.1137/1.9781611974331.CH104},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/GehrkeJKS16,
author = {Jan Clemens Gehrke and
Klaus Jansen and
Stefan Erich Julius Kraft and
Jakob Schikowski},
editor = {Rusins Martins Freivalds and
Gregor Engels and
Barbara Catania},
title = {A {PTAS} for Scheduling Unrelated Machines of Few Different Types},
booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International
Conference on Current Trends in Theory and Practice of Computer Science,
Harrachov, Czech Republic, January 23-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9587},
pages = {290--301},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49192-8\_24},
doi = {10.1007/978-3-662-49192-8\_24},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/GehrkeJKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/JansenLK16,
author = {Klaus Jansen and
Felix Land and
Maren Kaluza},
editor = {Rusins Martins Freivalds and
Gregor Engels and
Barbara Catania},
title = {Precedence Scheduling with Unit Execution Time is Equivalent to Parametrized
Biclique},
booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International
Conference on Current Trends in Theory and Practice of Computer Science,
Harrachov, Czech Republic, January 23-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9587},
pages = {329--343},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49192-8\_27},
doi = {10.1007/978-3-662-49192-8\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/JansenLK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenLM16,
author = {Klaus Jansen and
Kati Land and
Marten Maack},
editor = {Rasmus Pagh},
title = {Estimating The Makespan of The Two-Valued Restricted Assignment Problem},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.24},
doi = {10.4230/LIPICS.SWAT.2016.24},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/JansenLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2016,
editor = {Klaus Jansen and
Claire Mathieu and
Jos{\'{e}} D. P. Rolim and
Chris Umans},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2016, September 7-9, 2016, Paris,
France},
series = {LIPIcs},
volume = {60},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-018-7},
isbn = {978-3-95977-018-7},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Jansen16,
author = {Klaus Jansen},
title = {Efficient Polynomial Time Approximation Scheme for Scheduling Jobs
onUniform Processors},
booktitle = {Encyclopedia of Algorithms},
pages = {624--628},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_500},
doi = {10.1007/978-1-4939-2864-4\_500},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Jansen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenKV16,
author = {Klaus Jansen and
Kim{-}Manuel Klein and
Jos{\'{e}} Verschae},
title = {Closing the Gap for Makespan Scheduling via Sparsification Techniques},
journal = {CoRR},
volume = {abs/1604.07153},
year = {2016},
url = {http://arxiv.org/abs/1604.07153},
eprinttype = {arXiv},
eprint = {1604.07153},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenKV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenK16a,
author = {Klaus Jansen and
Kim{-}Manuel Klein},
title = {About the Structure of the Integer Cone and its Application to Bin
Packing},
journal = {CoRR},
volume = {abs/1604.07286},
year = {2016},
url = {http://arxiv.org/abs/1604.07286},
eprinttype = {arXiv},
eprint = {1604.07286},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenK16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenR16,
author = {Klaus Jansen and
Malin Rau},
title = {Improved approximation for two dimensional strip packing with polynomial
bounded width},
journal = {CoRR},
volume = {abs/1610.04430},
year = {2016},
url = {http://arxiv.org/abs/1610.04430},
eprinttype = {arXiv},
eprint = {1610.04430},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenR16a,
author = {Klaus Jansen and
Lars Rohwedder},
title = {On the Configuration-LP of the Restricted Assignment Problem},
journal = {CoRR},
volume = {abs/1611.01934},
year = {2016},
url = {http://arxiv.org/abs/1611.01934},
eprinttype = {arXiv},
eprint = {1611.01934},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenR16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BougeretDTJR15,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Denis Trystram and
Klaus Jansen and
Christina Robenek},
title = {Improved approximation algorithms for scheduling parallel jobs on
identical clusters},
journal = {Theor. Comput. Sci.},
volume = {600},
pages = {70--85},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.07.003},
doi = {10.1016/J.TCS.2015.07.003},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BougeretDTJR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BerndtJK15,
author = {Sebastian Berndt and
Klaus Jansen and
Kim{-}Manuel Klein},
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Fully Dynamic Bin Packing Revisited},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
pages = {135--151},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.135},
doi = {10.4230/LIPICS.APPROX-RANDOM.2015.135},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BerndtJK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/PaulsenDJ15,
author = {Niklas Paulsen and
Florian Diedrich and
Klaus Jansen},
editor = {Giuseppe F. Italiano and
Marie Schmidt},
title = {Heuristic Approaches to Minimize Tour Duration for the {TSP} with
Multiple Time Windows},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling,
Optimization, and Systems, {ATMOS} 2015, September 17, 2015, Patras,
Greece},
series = {OASIcs},
volume = {48},
pages = {42--55},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/OASIcs.ATMOS.2015.42},
doi = {10.4230/OASICS.ATMOS.2015.42},
timestamp = {Tue, 15 Feb 2022 09:40:04 +0100},
biburl = {https://dblp.org/rec/conf/atmos/PaulsenDJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/JansenK15,
author = {Klaus Jansen and
Stefan Erich Julius Kraft},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {A Faster {FPTAS} for the Unbounded Knapsack Problem},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {274--286},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_23},
doi = {10.1007/978-3-319-29516-9\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/JansenK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2015,
editor = {Naveen Garg and
Klaus Jansen and
Anup Rao and
Jos{\'{e}} D. P. Rolim},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2015, August 24-26, 2015, Princeton,
NJ, {USA}},
series = {LIPIcs},
volume = {40},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {http://www.dagstuhl.de/dagpub/978-3-939897-89-7},
isbn = {978-3-939897-89-7},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JansenK15,
author = {Klaus Jansen and
Stefan Erich Julius Kraft},
title = {A Faster {FPTAS} for the Unbounded Knapsack Problem},
journal = {CoRR},
volume = {abs/1504.04650},
year = {2015},
url = {http://arxiv.org/abs/1504.04650},
eprinttype = {arXiv},
eprint = {1504.04650},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JansenK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BazganBCFJLLMP15,
author = {Cristina Bazgan and
Ljiljana Brankovic and
Katrin Casel and
Henning Fernau and
Klaus Jansen and
Michael Lampis and
Mathieu Liedloff and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos},
title = {Algorithmic Aspects of Upper Domination},
journal = {CoRR},
volume = {abs/1506.07260},
year = {2015},
url = {http://arxiv.org/abs/1506.07260},
eprinttype = {arXiv},
eprint = {1506.07260},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BazganBCFJLLMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/HarrenJPS14,
author = {Rolf Harren and
Klaus Jansen and
Lars Pr{\"{a}}del and
Rob van Stee},
title = {A {(5/3} + {\(\epsilon\)})-approximation for strip packing},
journal = {Comput. Geom.},
volume = {47},
number = {2},
pages = {248--267},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.08.008},
doi = {10.1016/J.COMGEO.2013.08.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/HarrenJPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenJZ14,
author = {Lin Chen and
Klaus Jansen and
Guochuan Zhang},
editor = {Chandra Chekuri},
title = {On the optimality of approximation schemes for the classical scheduling
problem},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {657--668},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.50},
doi = {10.1137/1.9781611973402.50},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenJZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/JansenP14,
author = {Klaus Jansen and
Lars Pr{\"{a}}del},
editor = {Viliam Geffert and
Bart Preneel and
Branislav Rovan and
Julius Stuller and
A Min Tjoa},
title = {A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing},
booktitle = {{SOFSEM} 2014: Theory and Practice of Computer Science - 40th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 26-29, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8327},
pages = {327--338},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04298-5\_29},
doi = {10.1007/978-3-319-04298-5\_29},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/JansenP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2014,
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
isbn = {978-3-939897-74-3},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerndtJK14,
author = {Sebastian Berndt and
Klaus Jansen and
Kim{-}Manuel Klein},
title = {Fully Dynamic Bin Packing Revisited},
journal = {CoRR},
volume = {abs/1411.0960},
year = {2014},
url = {http://arxiv.org/abs/1411.0960},
eprinttype = {arXiv},
eprint = {1411.0960},
timestamp = {Wed, 28 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BerndtJK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HarrenJPSS13,
author = {Rolf Harren and
Klaus Jansen and
Lars Pr{\"{a}}del and
Ulrich M. Schwarz and
Rob van Stee},
title = {Two for One: Tight Approximation of 2D Bin Packing},
journal = {Int. J. Found. Comput. Sci.},
volume = {24},
number = {8},
pages = {1299--1328},
year = {2013},
url = {https://doi.org/10.1142/S0129054113500354},
doi = {10.1142/S0129054113500354},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HarrenJPSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JansenKMS13,
author = {Klaus Jansen and
Stefan Kratsch and
D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
title = {Bin packing with fixed number of bins revisited},
journal = {J. Comput. Syst. Sci.},
volume = {79},
number = {1},
pages = {39--49},
year = {2013},
url = {https://doi.org/10.1016/j.jcss.2012.04.004},
doi = {10.1016/J.JCSS.2012.04.004},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/JansenKMS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/JansenK13,
author = {Klaus Jansen and
Stefan Erich Julius Kraft},
editor = {Andrei A. Bulatov and
Arseny M. Shur},
title = {An Improved Knapsack Solver for Column Generation},
booktitle = {Computer Science - Theory and Applications - 8th International Computer
Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June
25-29, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7913},
pages = {12--23},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38536-0\_2},
doi = {10.1007/978-3-642-38536-0\_2},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/JansenK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/DutotJRT13,
author = {Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Robenek and
Denis Trystram},
editor = {Felix Wolf and
Bernd Mohr and
Dieter an Mey},
title = {A {(2} + {\(\epsilon\)})-Approximation for Scheduling Parallel Jobs
in Platforms},
booktitle = {Euro-Par 2013 Parallel Processing - 19th International Conference,
Aachen, Germany, August 26-30, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8097},
pages = {78--89},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40047-6\_11},
doi = {10.1007/978-3-642-40047-6\_11},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/DutotJRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenK13,
author = {Klaus Jansen and
Kim{-}Manuel Klein},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {A Robust {AFPTAS} for Online Bin Packing with Polynomial Migration,},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {589--600},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_50},
doi = {10.1007/978-3-642-39206-1\_50},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JansenK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenP13,
author = {Klaus Jansen and
Lars Pr{\"{a}}del},
editor = {Sanjeev Khanna},
title = {New Approximability Results for Two-Dimensional Bin Packing},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {919--936},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.66},
doi = {10.1137/1.9781611973105.66},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/synasc/EhlersJ13,
author = {Thorsten Ehlers and
Klaus Jansen},
editor = {Nikolaj S. Bj{\o}rner and
Viorel Negru and
Tetsuo Ida and
Tudor Jebelean and
Dana Petcu and
Stephen M. Watt and
Daniela Zaharie},
title = {Online-Scheduling on Identical Machines with Bounded Migration},
booktitle = {15th International Symposium on Symbolic and Numeric Algorithms for
Scientific Computing, {SYNASC} 2013, Timisoara, Romania, September
23-26, 2013},
pages = {361--366},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/SYNASC.2013.54},
doi = {10.1109/SYNASC.2013.54},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/synasc/EhlersJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/JansenLL13,
author = {Klaus Jansen and
Felix Land and
Kati Land},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Bounding the Running Time of Algorithms for Scheduling and Packing
Problems},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {439--450},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_38},
doi = {10.1007/978-3-642-40104-6\_38},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/JansenLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2013,
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {8096},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6},
doi = {10.1007/978-3-642-40328-6},
isbn = {978-3-642-40327-9},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2013,
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3},
doi = {10.1007/978-3-642-45043-3},
isbn = {978-3-642-45042-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-4213,
author = {Klaus Jansen and
Kim{-}Manuel Klein},
title = {A Robust {AFPTAS} for Online Bin Packing with Polynomial Migration},
journal = {CoRR},
volume = {abs/1302.4213},
year = {2013},
url = {http://arxiv.org/abs/1302.4213},
eprinttype = {arXiv},
eprint = {1302.4213},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-4213.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenJZ13,
author = {Lin Chen and
Klaus Jansen and
Guochuan Zhang},
title = {On the optimality of approximation schemes for the classical scheduling
problem},
journal = {CoRR},
volume = {abs/1310.0398},
year = {2013},
url = {http://arxiv.org/abs/1310.0398},
eprinttype = {arXiv},
eprint = {1310.0398},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenJZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JansenZ12,
author = {Klaus Jansen and
Hu Zhang},
title = {Scheduling malleable tasks with precedence constraints},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {1},
pages = {245--259},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.04.003},
doi = {10.1016/J.JCSS.2011.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/JansenZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JansenS12,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Packing Squares with Profits},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {1},
pages = {263--279},
year = {2012},
url = {https://doi.org/10.1137/080717110},
doi = {10.1137/080717110},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JansenS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DiedrichJPSS12,
author = {Florian Diedrich and
Klaus Jansen and
Lars Pr{\"{a}}del and
Ulrich M. Schwarz and
Ola Svensson},
title = {Tight approximation algorithms for scheduling with fixed jobs and
nonavailability},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {27:1--27:15},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229171},
doi = {10.1145/2229163.2229171},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DiedrichJPSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/HarrenJPS12,
author = {Rolf Harren and
Klaus Jansen and
Lars Pr{\"{a}}del and
Rob van Stee},
editor = {Andreas Brieden and
Zafer{-}Korcan G{\"{o}}rg{\"{u}}l{\"{u}} and
Tino Krug and
Erik Kropat and
Silja Meyer{-}Nieberg and
Goran Mihelcic and
Stefan Wolfgang Pickl},
title = {A {(5/3} + eps)-Approximation for 2D Strip Packing},
booktitle = {11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Munich, Germany, May 29-31, 2012. Extended Abstracts},
pages = {139--142},
year = {2012},
timestamp = {Thu, 16 May 2013 15:41:40 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/HarrenJPS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/BougeretDJRT12,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Robenek and
Denis Trystram},
title = {Tight Approximation for Scheduling Parallel Jobs on Identical Clusters},
booktitle = {26th {IEEE} International Parallel and Distributed Processing Symposium
Workshops {\&} PhD Forum, {IPDPS} 2012, Shanghai, China, May 21-25,
2012},
pages = {878--885},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/IPDPSW.2012.108},
doi = {10.1109/IPDPSW.2012.108},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/BougeretDJRT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/JansenK12,
author = {Klaus Jansen and
Stefan Erich Julius Kraft},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {An Improved Approximation Scheme for Variable-Sized Bin Packing},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {529--541},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_47},
doi = {10.1007/978-3-642-32589-2\_47},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/JansenK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Jansen12,
author = {Klaus Jansen},
editor = {M{\'{a}}ria Bielikov{\'{a}} and
Gerhard Friedrich and
Georg Gottlob and
Stefan Katzenbeisser and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {A Fast Approximation Scheme for the Multiple Knapsack Problem},
booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7147},
pages = {313--324},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-27660-6\_26},
doi = {10.1007/978-3-642-27660-6\_26},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/Jansen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/Jansen12,
author = {Klaus Jansen},
editor = {Guy E. Blelloch and
Maurice Herlihy},
title = {A\({}_{\mbox{(3/2+{\(\epsilon\)})}}\) approximation algorithm for
scheduling moldable and non-moldable parallel tasks},
booktitle = {24th {ACM} Symposium on Parallelism in Algorithms and Architectures,
{SPAA} '12, Pittsburgh, PA, USA, June 25-27, 2012},
pages = {224--235},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2312005.2312048},
doi = {10.1145/2312005.2312048},
timestamp = {Wed, 21 Nov 2018 11:16:54 +0100},
biburl = {https://dblp.org/rec/conf/spaa/Jansen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2012,
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {7408},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0},
doi = {10.1007/978-3-642-32512-0},
isbn = {978-3-642-32511-3},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmaa/BougeretDJRT11,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Robenek and
Denis Trystram},
title = {Approximation Algorithms for Multiple Strip Packing and Scheduling
Parallel Jobs in Platforms},
journal = {Discret. Math. Algorithms Appl.},
volume = {3},
number = {4},
pages = {553--586},
year = {2011},
url = {https://doi.org/10.1142/S1793830911001413},
doi = {10.1142/S1793830911001413},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmaa/BougeretDJRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JansenS11,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {A simple {OPT+1} algorithm for cutting stock under the modified integer
round-up property assumption},
journal = {Inf. Process. Lett.},
volume = {111},
number = {10},
pages = {479--482},
year = {2011},
url = {https://doi.org/10.1016/j.ipl.2011.02.009},
doi = {10.1016/J.IPL.2011.02.009},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/JansenS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/JansenS11,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {A Polynomial Time \emph{OPT} + 1 Algorithm for the Cutting Stock Problem
with a Constant Number of Object Lengths},
journal = {Math. Oper. Res.},
volume = {36},
number = {4},
pages = {743--753},
year = {2011},
url = {https://doi.org/10.1287/moor.1110.0515},
doi = {10.1287/MOOR.1110.0515},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/JansenS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/JansenPSS11,
author = {Klaus Jansen and
Lars Pr{\"{a}}del and
Ulrich M. Schwarz and
Ola Svensson},
editor = {Alex Potanin and
Taso Viglas},
title = {Faster Approximation Algorithms for Scheduling with Fixed Jobs},
booktitle = {Seventeenth Computing: The Australasian Theory Symposium, {CATS} 2011,
Perth, Australia, January 2011},
series = {{CRPIT}},
volume = {119},
pages = {3--10},
publisher = {Australian Computer Society},
year = {2011},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV119Jansen.html},
timestamp = {Mon, 08 Feb 2021 13:26:46 +0100},
biburl = {https://dblp.org/rec/conf/cats/JansenPSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BougeretDJRT11,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Robenek and
Denis Trystram},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {Scheduling Jobs on Heterogeneous Platforms},
booktitle = {Computing and Combinatorics - 17th Annual International Conference,
{COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6842},
pages = {271--283},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_25},
doi = {10.1007/978-3-642-22685-4\_25},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BougeretDJRT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/HarrenJPS11,
author = {Rolf Harren and
Klaus Jansen and
Lars Pr{\"{a}}del and
Rob van Stee},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {A {(5/3} + {\(\epsilon\)})-Approximation for Strip Packing},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {475--487},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_40},
doi = {10.1007/978-3-642-22300-6\_40},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/HarrenJPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Jansen11,
author = {Klaus Jansen},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Approximation Algorithms for Scheduling and Packing Problems},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {1--8},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_1},
doi = {10.1007/978-3-642-29116-6\_1},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Jansen11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/JansenR11,
author = {Klaus Jansen and
Christina Robenek},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Scheduling Jobs on Identical and Uniform Processors Revisited},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {109--122},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_10},
doi = {10.1007/978-3-642-29116-6\_10},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/JansenR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2011,
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {6845},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0},
doi = {10.1007/978-3-642-22935-0},
isbn = {978-3-642-22934-3},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2010,
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Approximation and Online Algorithms - 8th International Workshop,
{WAOA} 2010, Liverpool, UK, September 9-10, 2010. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6534},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18318-8},
doi = {10.1007/978-3-642-18318-8},
isbn = {978-3-642-18317-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/JansenMSY11,
author = {Klaus Jansen and
Claire Mathieu and
Hadas Shachnai and
Neal E. Young},
title = {Packing and Scheduling Algorithms for Information and Communication
Services (Dagstuhl Seminar 11091)},
journal = {Dagstuhl Reports},
volume = {1},
number = {2},
pages = {67--93},
year = {2011},
url = {https://doi.org/10.4230/DagRep.1.2.67},
doi = {10.4230/DAGREP.1.2.67},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/JansenMSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DiedrichJPT10,
author = {Florian Diedrich and
Klaus Jansen and
Fanny Pascual and
Denis Trystram},
title = {Approximation Algorithms for Scheduling with Reservations},
journal = {Algorithmica},
volume = {58},
number = {2},
pages = {391--404},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9271-2},
doi = {10.1007/S00453-008-9271-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DiedrichJPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/JansenS10,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints},
journal = {Int. J. Found. Comput. Sci.},
volume = {21},
number = {1},
pages = {27--49},
year = {2010},
url = {https://doi.org/10.1142/S0129054110007118},
doi = {10.1142/S0129054110007118},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/JansenS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErlebachHJMW10,
author = {Thomas Erlebach and
Torben Hagerup and
Klaus Jansen and
Moritz Minzlaff and
Alexander Wolff},
title = {Trimming of Graphs, with Application to Point Labeling},
journal = {Theory Comput. Syst.},
volume = {47},
number = {3},
pages = {613--636},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9184-8},
doi = {10.1007/S00224-009-9184-8},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ErlebachHJMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JansenT10,
author = {Klaus Jansen and
Ralf Th{\"{o}}le},
title = {Approximation Algorithms for Scheduling Parallel Jobs},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {8},
pages = {3571--3615},
year = {2010},
url = {https://doi.org/10.1137/080736491},
doi = {10.1137/080736491},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JansenT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Jansen10,
author = {Klaus Jansen},
title = {An {EPTAS} for Scheduling Jobs on Uniform Processors: Using an {MILP}
Relaxation with a Constant Number of Integral Variables},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {2},
pages = {457--485},
year = {2010},
url = {https://doi.org/10.1137/090749451},
doi = {10.1137/090749451},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Jansen10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/BougeretDJOT10,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Otte and
Denis Trystram},
editor = {Pasqua D'Ambra and
Mario Rosario Guarracino and
Domenico Talia},
title = {A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling},
booktitle = {Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference,
Ischia, Italy, August 31 - September 3, 2010, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6271},
pages = {157--167},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15277-1\_16},
doi = {10.1007/978-3-642-15277-1\_16},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/europar/BougeretDJOT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/BougeretDJOT10,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Otte and
Denis Trystram},
editor = {Cristian S. Calude and
Vladimiro Sassone},
title = {Approximating the Non-contiguous Multiple Organization Packing Problem},
booktitle = {Theoretical Computer Science - 6th {IFIP} {TC} 1/WG 2.2 International
Conference, {TCS} 2010, Held as Part of {WCC} 2010, Brisbane, Australia,
September 20-23, 2010. Proceedings},
series = {{IFIP} Advances in Information and Communication Technology},
volume = {323},
pages = {316--327},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15240-5\_23},
doi = {10.1007/978-3-642-15240-5\_23},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/BougeretDJOT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JansenS10,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Friedrich Eisenbrand and
F. Bruce Shepherd},
title = {An \emph{OPT} + 1 Algorithm for the Cutting Stock Problem with Constant
Number of Object Lengths},
booktitle = {Integer Programming and Combinatorial Optimization, 14th International
Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6080},
pages = {438--449},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13036-6\_33},
doi = {10.1007/978-3-642-13036-6\_33},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JansenS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenKMS10,
author = {Klaus Jansen and
Stefan Kratsch and
D{\'{a}}niel Marx and
Ildik{\'{o}} Schlotter},
editor = {Haim Kaplan},
title = {Bin Packing with Fixed Number of Bins Revisited},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {260--272},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_25},
doi = {10.1007/978-3-642-13731-0\_25},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/JansenKMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2010,
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {6302},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3},
doi = {10.1007/978-3-642-15369-3},
isbn = {978-3-642-15368-6},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2009,
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12450-1},
doi = {10.1007/978-3-642-12450-1},
isbn = {978-3-642-12449-5},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/JansenS09,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Rectangle packing with one-dimensional resource augmentation},
journal = {Discret. Optim.},
volume = {6},
number = {3},
pages = {310--323},
year = {2009},
url = {https://doi.org/10.1016/j.disopt.2009.04.001},
doi = {10.1016/J.DISOPT.2009.04.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/disopt/JansenS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Jansen09,
author = {Klaus Jansen},
title = {Parameterized Approximation Scheme for the Multiple Knapsack Problem},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {4},
pages = {1392--1412},
year = {2009},
url = {https://doi.org/10.1137/080731207},
doi = {10.1137/080731207},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Jansen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dfg/DiedrichJST09,
author = {Florian Diedrich and
Klaus Jansen and
Ulrich M. Schwarz and
Denis Trystram},
editor = {J{\"{u}}rgen Lerner and
Dorothea Wagner and
Katharina Anna Zweig},
title = {A Survey on Approximation Algorithms for Scheduling with Machine Unavailability},
booktitle = {Algorithmics of Large and Complex Networks - Design, Analysis, and
Simulation {[DFG} priority program 1126]},
series = {Lecture Notes in Computer Science},
volume = {5515},
pages = {50--64},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02094-0\_3},
doi = {10.1007/978-3-642-02094-0\_3},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/dfg/DiedrichJST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Jansen09,
author = {Klaus Jansen},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {An {EPTAS} for Scheduling Jobs on Uniform Processors: Using an {MILP}
Relaxation with a Constant Number of Integral Variables},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {562--573},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_47},
doi = {10.1007/978-3-642-02927-1\_47},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Jansen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BansalCJPS09,
author = {Nikhil Bansal and
Alberto Caprara and
Klaus Jansen and
Lars Pr{\"{a}}del and
Maxim Sviridenko},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {A Structural Lemma in 2-Dimensional Packing, and Its Implications
on Approximability},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {77--86},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_10},
doi = {10.1007/978-3-642-10631-6\_10},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BansalCJPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Jansen09,
author = {Klaus Jansen},
editor = {Claire Mathieu},
title = {Parameterized approximation scheme for the multiple knapsack problem},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {665--674},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.73},
doi = {10.1137/1.9781611973068.73},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/Jansen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DiedrichJ09,
author = {Florian Diedrich and
Klaus Jansen},
editor = {Claire Mathieu},
title = {Improved approximation algorithms for scheduling with fixed jobs},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {675--684},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.74},
doi = {10.1137/1.9781611973068.74},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DiedrichJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/JansenPS09,
author = {Klaus Jansen and
Lars Pr{\"{a}}del and
Ulrich M. Schwarz},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Two for One: Tight Approximation of 2D Bin Packing},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {399--410},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_35},
doi = {10.1007/978-3-642-03367-4\_35},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/JansenPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BougeretDJOT09,
author = {Marin Bougeret and
Pierre{-}Fran{\c{c}}ois Dutot and
Klaus Jansen and
Christina Otte and
Denis Trystram},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Approximation Algorithms for Multiple Strip Packing},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {37--48},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_4},
doi = {10.1007/978-3-642-12450-1\_4},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BougeretDJOT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2009,
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {5687},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9},
doi = {10.1007/978-3-642-03685-9},
isbn = {978-3-642-03684-2},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/opt/ErlebachJKP09,
author = {Thomas Erlebach and
Klaus Jansen and
Christos Kaklamanis and
Giuseppe Persiano},
editor = {Christodoulos A. Floudas and
Panos M. Pardalos},
title = {Directed Tree Networks},
booktitle = {Encyclopedia of Optimization, Second Edition},
pages = {716--725},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-0-387-74759-0\_127},
doi = {10.1007/978-0-387-74759-0\_127},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/opt/ErlebachJKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0023544,
author = {Klaus Jansen and
Marian Margraf},
title = {Approximative Algorithmen und Nichtapproximierbarkeit},
series = {De Gruyter Lehrbuch},
publisher = {de Gruyter},
year = {2008},
url = {https://doi.org/10.1515/9783110203172},
doi = {10.1515/9783110203172},
isbn = {978-3-11-020316-5},
timestamp = {Fri, 10 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0023544.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FishkinJM08,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Monaldo Mastrolilli},
title = {Grouping Techniques for Scheduling Problems: Simpler and Faster},
journal = {Algorithmica},
volume = {51},
number = {2},
pages = {183--199},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9086-6},
doi = {10.1007/S00453-007-9086-6},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FishkinJM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/FishkinGJS08,
author = {Aleksei V. Fishkin and
Olga Gerber and
Klaus Jansen and
Roberto Solis{-}Oba},
title = {On Packing Rectangles with Resource Augmentation: Maximizing the Profit},
journal = {Algorithmic Oper. Res.},
volume = {3},
number = {1},
year = {2008},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/5664},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/FishkinGJS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcst/DiedrichHJTT08,
author = {Florian Diedrich and
Rolf Harren and
Klaus Jansen and
Ralf Th{\"{o}}le and
Henning Thomas},
title = {Approximation Algorithms for 3D Orthogonal Knapsack},
journal = {J. Comput. Sci. Technol.},
volume = {23},
number = {5},
pages = {749--762},
year = {2008},
url = {https://doi.org/10.1007/s11390-008-9170-7},
doi = {10.1007/S11390-008-9170-7},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcst/DiedrichHJTT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JansenZ08,
author = {Klaus Jansen and
Hu Zhang},
title = {Approximation algorithms for general packing problems and their application
to the multicast congestion problem},
journal = {Math. Program.},
volume = {114},
number = {1},
pages = {183--206},
year = {2008},
url = {https://doi.org/10.1007/s10107-007-0106-8},
doi = {10.1007/S10107-007-0106-8},
timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/JansenZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenT08,
author = {Klaus Jansen and
Ralf Th{\"{o}}le},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Approximation Algorithms for Scheduling Parallel Jobs: Breaking the
Approximation Ratio of 2},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {234--245},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_20},
doi = {10.1007/978-3-540-70575-8\_20},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/JansenT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JansenS08,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Andrea Lodi and
Alessandro Panconesi and
Giovanni Rinaldi},
title = {A Polynomial Time Approximation Scheme for the Square Packing Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 13th International
Conference, {IPCO} 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5035},
pages = {184--198},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-68891-4\_13},
doi = {10.1007/978-3-540-68891-4\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JansenS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ErlebachHJMW08,
author = {Thomas Erlebach and
Torben Hagerup and
Klaus Jansen and
Moritz Minzlaff and
Alexander Wolff},
editor = {Susanne Albers and
Pascal Weil},
title = {Trimming of Graphs, with Application to Point Labeling},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {265--276},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1350},
doi = {10.4230/LIPICS.STACS.2008.1350},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ErlebachHJMW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2008,
editor = {Ashish Goel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Ronitt Rubinfeld},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {5171},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85363-3},
doi = {10.1007/978-3-540-85363-3},
isbn = {978-3-540-85362-6},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2854,
author = {Thomas Erlebach and
Torben Hagerup and
Klaus Jansen and
Moritz Minzlaff and
Alexander Wolff},
title = {Trimming of Graphs, with Application to Point Labeling},
journal = {CoRR},
volume = {abs/0802.2854},
year = {2008},
url = {http://arxiv.org/abs/0802.2854},
eprinttype = {arXiv},
eprint = {0802.2854},
timestamp = {Sun, 04 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenZ07,
author = {Klaus Jansen and
Guochuan Zhang},
title = {Maximizing the Total Profit of Rectangles Packed into a Rectangle},
journal = {Algorithmica},
volume = {47},
number = {3},
pages = {323--342},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-0194-5},
doi = {10.1007/S00453-006-0194-5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChlebikovaJ07,
author = {Janka Chleb{\'{\i}}kov{\'{a}} and
Klaus Jansen},
title = {The d-precoloring problem for k-degenerate graphs},
journal = {Discret. Math.},
volume = {307},
number = {16},
pages = {2042--2052},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.12.049},
doi = {10.1016/J.DISC.2005.12.049},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChlebikovaJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiedrichJ07,
author = {Florian Diedrich and
Klaus Jansen},
title = {Faster and simpler approximation algorithms for mixed packing and
covering problems},
journal = {Theor. Comput. Sci.},
volume = {377},
number = {1-3},
pages = {181--204},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.02.064},
doi = {10.1016/J.TCS.2007.02.064},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiedrichJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/escape/DiedrichJ07,
author = {Florian Diedrich and
Klaus Jansen},
editor = {Bo Chen and
Mike Paterson and
Guochuan Zhang},
title = {An Approximation Algorithm for the General Mixed Packing and Covering
Problem},
booktitle = {Combinatorics, Algorithms, Probabilistic and Experimental Methodologies,
First International Symposium, {ESCAPE} 2007, Hangzhou, China, April
7-9, 2007, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4614},
pages = {128--139},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74450-4\_12},
doi = {10.1007/978-3-540-74450-4\_12},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/escape/DiedrichJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hipc/DiedrichJPT07,
author = {Florian Diedrich and
Klaus Jansen and
Fanny Pascual and
Denis Trystram},
editor = {Srinivas Aluru and
Manish Parashar and
Ramamurthy Badrinath and
Viktor K. Prasanna},
title = {Approximation Algorithms for Scheduling with Reservations},
booktitle = {High Performance Computing - HiPC 2007, 14th International Conference,
Goa, India, December 18-21, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4873},
pages = {297--307},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77220-0\_29},
doi = {10.1007/978-3-540-77220-0\_29},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/hipc/DiedrichJPT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/JansenS07,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {New Approximability Results for 2-Dimensional Packing Problems},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {103--114},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_11},
doi = {10.1007/978-3-540-74456-6\_11},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/JansenS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/DiedrichHJTT07,
author = {Florian Diedrich and
Rolf Harren and
Klaus Jansen and
Ralf Th{\"{o}}le and
Henning Thomas},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Hong Zhu},
title = {Approximation Algorithms for 3D Orthogonal Knapsack},
booktitle = {Theory and Applications of Models of Computation, 4th International
Conference, {TAMC} 2007, Shanghai, China, May 22-25, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4484},
pages = {34--45},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72504-6\_3},
doi = {10.1007/978-3-540-72504-6\_3},
timestamp = {Mon, 04 May 2020 13:17:48 +0200},
biburl = {https://dblp.org/rec/conf/tamc/DiedrichHJTT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Jansen07,
author = {Klaus Jansen},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Approximation Algorithms for Geometric Intersection Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {151--153},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_15},
doi = {10.1007/978-3-540-74839-7\_15},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Jansen07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2007,
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {4627},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1},
doi = {10.1007/978-3-540-74208-1},
isbn = {978-3-540-74207-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7211,
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
Dieter Kratsch and
Jeremy P. Spinrad},
title = {Exact, Approximative, Robust and Certifying Algorithms on Particular
Graph Classes, 20.05. - 25.05.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07211},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/portals/07211/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7211.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ZhangJ07,
author = {Hu Zhang and
Klaus Jansen},
editor = {Teofilo F. Gonzalez},
title = {Scheduling Malleable Tasks},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch45},
doi = {10.1201/9781420010749.CH45},
timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/crc/ZhangJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BrandstadtJKS07,
author = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
Dieter Kratsch and
Jeremy P. Spinrad},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
Dieter Kratsch and
Jeremy P. Spinrad},
title = {07211 Abstracts Collection - Exact, Approximative, Robust and Certifying
Algorithms on Particular Graph Classes},
booktitle = {Exact, Approximative, Robust and Certifying Algorithms on Particular
Graph Classes, 20.05. - 25.05.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07211},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/1269},
timestamp = {Thu, 10 Jun 2021 13:02:07 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BrandstadtJKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BampisJ06,
author = {Evripidis Bampis and
Klaus Jansen},
title = {Introduction},
journal = {Discret. Appl. Math.},
volume = {154},
number = {4},
pages = {609},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.09.004},
doi = {10.1016/J.DAM.2005.09.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BampisJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Jansen06,
author = {Klaus Jansen},
title = {An approximation algorithm for the general max-min resource sharing
problem},
journal = {Math. Program.},
volume = {106},
number = {3},
pages = {547--566},
year = {2006},
url = {https://doi.org/10.1007/s10107-005-0669-1},
doi = {10.1007/S10107-005-0669-1},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Jansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JansenP06,
author = {Klaus Jansen and
Lorant Porkolab},
title = {On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation
Schemes},
journal = {{SIAM} J. Discret. Math.},
volume = {20},
number = {3},
pages = {545--563},
year = {2006},
url = {https://doi.org/10.1137/S0895480101396949},
doi = {10.1137/S0895480101396949},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JansenP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/Jansen06,
author = {Klaus Jansen},
title = {Approximation Algorithm for the Mixed Fractional Packing and Covering
Problem},
journal = {{SIAM} J. Optim.},
volume = {17},
number = {2},
pages = {331--352},
year = {2006},
url = {https://doi.org/10.1137/030601570},
doi = {10.1137/030601570},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/Jansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JansenZ06,
author = {Klaus Jansen and
Hu Zhang},
title = {An approximation algorithm for scheduling malleable tasks under general
precedence constraints},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {3},
pages = {416--434},
year = {2006},
url = {https://doi.org/10.1145/1159892.1159899},
doi = {10.1145/1159892.1159899},
timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/JansenZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenS06,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Preface},
journal = {Theor. Comput. Sci.},
volume = {361},
number = {2-3},
pages = {131--132},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.005},
doi = {10.1016/J.TCS.2006.05.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenS06,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {An asymptotic approximation algorithm for 3D-strip packing},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {143--152},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109575},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/AizatulinDJ06,
author = {Mihhail Aizatulin and
Florian Diedrich and
Klaus Jansen},
editor = {Carme {\`{A}}lvarez and
Maria J. Serna},
title = {Implementation of Approximation Algorithms for the Max-Min Resource
Sharing Problem},
booktitle = {Experimental Algorithms, 5th International Workshop, {WEA} 2006, Cala
Galdana, Menorca, Spain, May 24-27, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4007},
pages = {207--218},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11764298\_19},
doi = {10.1007/11764298\_19},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/wea/AizatulinDJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/lncs/Jansen06,
author = {Klaus Jansen},
editor = {Evripidis Bampis and
Klaus Jansen and
Claire Kenyon},
title = {Approximation Algorithms for Min-Max and Max-Min Resource Sharing
Problems, and Applications},
booktitle = {Efficient Approximation and Online Algorithms - Recent Progress on
Classical Combinatorial Optimization Problems and New Applications},
series = {Lecture Notes in Computer Science},
volume = {3484},
pages = {156--202},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11671541\_6},
doi = {10.1007/11671541\_6},
timestamp = {Thu, 23 Sep 2021 11:45:21 +0200},
biburl = {https://dblp.org/rec/series/lncs/Jansen06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2006,
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {4110},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924},
doi = {10.1007/11830924},
isbn = {3-540-38044-2},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:series/lncs/3484,
editor = {Evripidis Bampis and
Klaus Jansen and
Claire Kenyon},
title = {Efficient Approximation and Online Algorithms - Recent Progress on
Classical Combinatorial Optimization Problems and New Applications},
series = {Lecture Notes in Computer Science},
volume = {3484},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11671541},
doi = {10.1007/11671541},
isbn = {978-3-540-32212-2},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/lncs/3484.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ErlebachJ05,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Conversion of coloring algorithms into maximum weight independent
set algorithms},
journal = {Discret. Appl. Math.},
volume = {148},
number = {1},
pages = {107--125},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.11.007},
doi = {10.1016/J.DAM.2004.11.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ErlebachJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/JansenMS05,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
title = {Approximation schemes for job shop scheduling problems with controllable
processing times},
journal = {Eur. J. Oper. Res.},
volume = {167},
number = {2},
pages = {297--319},
year = {2005},
url = {https://doi.org/10.1016/j.ejor.2004.03.025},
doi = {10.1016/J.EJOR.2004.03.025},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/JansenMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/JansenMS05,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
title = {Approximation algorithms for flexible job shop problems},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {2},
pages = {361--379},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003030},
doi = {10.1142/S0129054105003030},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/JansenMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ErlebachJS05,
author = {Thomas Erlebach and
Klaus Jansen and
Eike Seidel},
title = {Polynomial-Time Approximation Schemes for Geometric Intersection Graphs},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {6},
pages = {1302--1323},
year = {2005},
url = {https://doi.org/10.1137/S0097539702402676},
doi = {10.1137/S0097539702402676},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/ErlebachJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JansenKLS05,
author = {Klaus Jansen and
Marek Karpinski and
Andrzej Lingas and
Eike Seidel},
title = {Polynomial Time Approximation Schemes for {MAX-BISECTION} on Planar
and Geometric Graphs},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {1},
pages = {110--119},
year = {2005},
url = {https://doi.org/10.1137/S009753970139567X},
doi = {10.1137/S009753970139567X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JansenKLS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JansenP05,
author = {Klaus Jansen and
Lorant Porkolab},
title = {General Multiprocessor Task Scheduling: Approximate Solutions in Linear
Time},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {3},
pages = {519--530},
year = {2005},
url = {https://doi.org/10.1137/S0097539799361737},
doi = {10.1137/S0097539799361737},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JansenP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/FishkinGJS05,
author = {Aleksei V. Fishkin and
Olga Gerber and
Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Mike D. Atkinson and
Frank K. H. A. Dehne},
title = {On Packing Squares with Resource Augmentation: Maximizing the Profit},
booktitle = {Theory of Computing 2005, Eleventh {CATS} 2005, Computing: The Australasian
Theory Symposium, Newcastle, NSW, Australia, January/February 2005},
series = {{CRPIT}},
volume = {41},
pages = {61--67},
publisher = {Australian Computer Society},
year = {2005},
url = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV41Fishkin.html},
timestamp = {Mon, 08 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cats/FishkinGJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FishkinJSS05,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Sergey V. Sevastianov and
Ren{\'{e}} Sitters},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Preemptive Scheduling of Independent Jobs on Identical Parallel Machines
Subject to Migration Delays},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {580--591},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_52},
doi = {10.1007/11561071\_52},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/FishkinJSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JansenZ05,
author = {Klaus Jansen and
Hu Zhang},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {An Approximation Algorithm for Scheduling Malleable Tasks Under General
Precedence Constraints},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {236--245},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_25},
doi = {10.1007/11602613\_25},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/JansenZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FishkinGJ05,
author = {Aleksei V. Fishkin and
Olga Gerber and
Klaus Jansen},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {On Efficient Weighted Rectangle Packing with Large Resources},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {1039--1050},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_103},
doi = {10.1007/11602613\_103},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FishkinGJ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FishkinGJS05,
author = {Aleksei V. Fishkin and
Olga Gerber and
Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {Packing Weighted Rectangles into a Square},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {352--363},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_31},
doi = {10.1007/11549345\_31},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/FishkinGJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/JansenZ05,
author = {Klaus Jansen and
Hu Zhang},
editor = {Phillip B. Gibbons and
Paul G. Spirakis},
title = {Scheduling malleable tasks with precedence constraints},
booktitle = {{SPAA} 2005: Proceedings of the 17th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada,
{USA}},
pages = {86--95},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073970.1073983},
doi = {10.1145/1073970.1073983},
timestamp = {Wed, 13 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/JansenZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JansenS05,
author = {Klaus Jansen and
Rob van Stee},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {On strip packing With rotations},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {755--761},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060702},
doi = {10.1145/1060590.1060702},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JansenS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2005,
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {3624},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462},
doi = {10.1007/11538462},
isbn = {3-540-28239-4},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenK03,
author = {Klaus Jansen and
Samir Khuller},
title = {Guest Editors' Introduction},
journal = {Algorithmica},
volume = {38},
number = {3},
pages = {415--416},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1068-8},
doi = {10.1007/S00453-003-1068-8},
timestamp = {Tue, 13 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jansen04,
author = {Klaus Jansen},
title = {Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial
Time Approximation Scheme},
journal = {Algorithmica},
volume = {39},
number = {1},
pages = {59--81},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1078-6},
doi = {10.1007/S00453-003-1078-6},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Jansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/JansenM04,
author = {Klaus Jansen and
Monaldo Mastrolilli},
title = {Approximation schemes for parallel machine scheduling problems with
controllable processing times},
journal = {Comput. Oper. Res.},
volume = {31},
number = {10},
pages = {1565--1581},
year = {2004},
url = {https://doi.org/10.1016/S0305-0548(03)00101-1},
doi = {10.1016/S0305-0548(03)00101-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/JansenM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/JansenP04,
author = {Klaus Jansen and
Lorant Porkolab},
title = {Preemptive Scheduling with Dedicated Processors: Applications of Fractional
Graph Coloring},
journal = {J. Sched.},
volume = {7},
number = {1},
pages = {35--48},
year = {2004},
url = {https://doi.org/10.1023/B:JOSH.0000013054.30334.b9},
doi = {10.1023/B:JOSH.0000013054.30334.B9},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/JansenP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/Jansen04,
author = {Klaus Jansen},
editor = {Jean{-}Jacques L{\'{e}}vy and
Ernst W. Mayr and
John C. Mitchell},
title = {Approximation Algorithms for Mixed Fractional Packing and Covering
Problems},
booktitle = {Exploring New Frontiers of Theoretical Informatics, {IFIP} 18th World
Computer Congress, {TC1} 3rd International Conference on Theoretical
Computer Science (TCS2004), 22-27 August 2004, Toulouse, France},
series = {{IFIP}},
volume = {155},
pages = {223--236},
publisher = {Kluwer/Springer},
year = {2004},
url = {https://doi.org/10.1007/1-4020-8141-3\_19},
doi = {10.1007/1-4020-8141-3\_19},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/Jansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/FishkinGJ04,
author = {Aleksei V. Fishkin and
Olga Gerber and
Klaus Jansen},
editor = {Jean{-}Jacques L{\'{e}}vy and
Ernst W. Mayr and
John C. Mitchell},
title = {On Weighted Rectangle Packing with Large Resources},
booktitle = {Exploring New Frontiers of Theoretical Informatics, {IFIP} 18th World
Computer Congress, {TC1} 3rd International Conference on Theoretical
Computer Science (TCS2004), 22-27 August 2004, Toulouse, France},
series = {{IFIP}},
volume = {155},
pages = {237--250},
publisher = {Kluwer/Springer},
year = {2004},
url = {https://doi.org/10.1007/1-4020-8141-3\_20},
doi = {10.1007/1-4020-8141-3\_20},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/FishkinGJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenZ04,
author = {Klaus Jansen and
Guochuan Zhang},
editor = {J. Ian Munro},
title = {On rectangle packing: maximizing benefits},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {204--213},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982822},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/JansenZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Jansen04,
author = {Klaus Jansen},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Approximation Algorithms for the General Max-min Resource Sharing
Problem: Faster and Simpler},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {311--322},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_27},
doi = {10.1007/978-3-540-27810-8\_27},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Jansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/JansenZ04,
author = {Klaus Jansen and
Guochuan Zhang},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Maximizing the Number of Packed Rectangles},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {362--371},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_31},
doi = {10.1007/978-3-540-27810-8\_31},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/JansenZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Jansen04,
author = {Klaus Jansen},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Approximation Algorithms for Mixed Fractional Packing and Covering
Problems},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {6--8},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_2},
doi = {10.1007/978-3-540-31833-0\_2},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Jansen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2004,
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {3122},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b99805},
doi = {10.1007/B99805},
isbn = {3-540-22894-2},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4221,
editor = {Andreas Brandst{\"{a}}dt and
Derek G. Corneil and
Klaus Jansen and
Jeremy P. Spinrad},
title = {Robust and Approximative Algorithms an Particular Graph Classes, 23.05.
- 28.05.2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04221},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/portals/04221/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2004P4221.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waoa/2003,
editor = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {Approximation and Online Algorithms, First International Workshop,
{WAOA} 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2909},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/b95598},
doi = {10.1007/B95598},
isbn = {3-540-21079-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BrandstadtCJS04,
author = {Andreas Brandst{\"{a}}dt and
Derek G. Corneil and
Klaus Jansen and
Jeremy P. Spinrad},
editor = {Andreas Brandst{\"{a}}dt and
Derek G. Corneil and
Klaus Jansen and
Jeremy P. Spinrad},
title = {04221 Abstracts Collection - Robust and Approximative Algorithms on
Particular Graph Classes},
booktitle = {Robust and Approximative Algorithms an Particular Graph Classes, 23.05.
- 28.05.2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04221},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/273/},
timestamp = {Thu, 10 Jun 2021 13:02:03 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BrandstadtCJS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Jansen03,
author = {Klaus Jansen},
title = {The mutual exclusion scheduling problem for permutation and comparability
graphs},
journal = {Inf. Comput.},
volume = {180},
number = {2},
pages = {71--81},
year = {2003},
url = {https://doi.org/10.1016/S0890-5401(02)00028-7},
doi = {10.1016/S0890-5401(02)00028-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Jansen03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/JansenP03,
author = {Klaus Jansen and
Lorant Porkolab},
title = {Computing optimal preemptive schedules for parallel tasks: linear
programming approaches},
journal = {Math. Program.},
volume = {95},
number = {3},
pages = {617--630},
year = {2003},
url = {https://doi.org/10.1007/s10107-002-0361-7},
doi = {10.1007/S10107-002-0361-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/JansenP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/JansenSS03,
author = {Klaus Jansen and
Roberto Solis{-}Oba and
Maxim Sviridenko},
title = {Makespan Minimization in Job Shops: {A} Linear Time Approximation
Scheme},
journal = {{SIAM} J. Discret. Math.},
volume = {16},
number = {2},
pages = {288--300},
year = {2003},
url = {https://doi.org/10.1137/S0895480199363908},
doi = {10.1137/S0895480199363908},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/JansenSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Fiala03,
author = {Jir{\'{\i}} Fiala and
Klaus Jansen and
Van Bang Le and
Eike Seidel},
title = {Graph Subcolorings: Complexity and Algorithms},
journal = {{SIAM} J. Discret. Math.},
volume = {16},
number = {4},
pages = {635--650},
year = {2003},
url = {https://doi.org/10.1137/S0895480101395245},
doi = {10.1137/S0895480101395245},
timestamp = {Sat, 31 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Fiala03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Jansen03,
author = {Klaus Jansen},
title = {Approximate strong separation with application in fractional graph
coloring and preemptive scheduling},
journal = {Theor. Comput. Sci.},
volume = {302},
number = {1-3},
pages = {239--256},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00829-0},
doi = {10.1016/S0304-3975(02)00829-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Jansen03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenS03,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
title = {An asymptotic fully polynomial time approximation scheme for bin covering},
journal = {Theor. Comput. Sci.},
volume = {306},
number = {1-3},
pages = {543--551},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00363-3},
doi = {10.1016/S0304-3975(03)00363-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FishkinJM03,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Monaldo Mastrolilli},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {On Minimizing Average Weighted Completion Time: {A} {PTAS} for the
Job Shop Problem with Release Dates},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {319--328},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_34},
doi = {10.1007/978-3-540-24587-2\_34},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/FishkinJM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ppam/JansenS03,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Roman Wyrzykowski and
Jack J. Dongarra and
Marcin Paprzycki and
Jerzy Wasniewski},
title = {Approximation Algorithms for Scheduling Jobs with Chain Precedence
Constraints},
booktitle = {Parallel Processing and Applied Mathematics, 5th International Conference,
{PPAM} 2003, Czestochowa, Poland, September 7-10, 2003. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3019},
pages = {105--112},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24669-5\_14},
doi = {10.1007/978-3-540-24669-5\_14},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ppam/JansenS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/random/2003,
editor = {Sanjeev Arora and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Amit Sahai},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {2764},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/b11961},
doi = {10.1007/B11961},
isbn = {3-540-40770-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wea/2003,
editor = {Klaus Jansen and
Marian Margraf and
Monaldo Mastrolilli and
Jos{\'{e}} D. P. Rolim},
title = {Experimental and Efficient Algorithms, Second International Workshop,
{WEA} 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2647},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44867-5},
doi = {10.1007/3-540-44867-5},
isbn = {3-540-40205-5},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wea/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenP02,
author = {Klaus Jansen and
Lorant Porkolab},
title = {Linear-Time Approximation Schemes for Scheduling Malleable Parallel
Tasks},
journal = {Algorithmica},
volume = {32},
number = {3},
pages = {507--520},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0085-8},
doi = {10.1007/S00453-001-0085-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/JansenP02,
author = {Klaus Jansen and
Lorant Porkolab},
title = {Polynomial time approximation schemes for general multiprocessor job
shop scheduling},
journal = {J. Algorithms},
volume = {45},
number = {2},
pages = {167--191},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00248-1},
doi = {10.1016/S0196-6774(02)00248-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/JansenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ErlebachJ02,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Implementation of Approximation Algorithms for Weighted and Unweighted
Edge-Disjoint Paths in Bidirected Trees},
journal = {{ACM} J. Exp. Algorithmics},
volume = {7},
pages = {6},
year = {2002},
url = {https://doi.org/10.1145/944618.944624},
doi = {10.1145/944618.944624},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ErlebachJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/BalzerJ02,
author = {Thomas Balzer and
Klaus Jansen},
title = {A duality approach to problems of combined stopping and deciding under
constraints},
journal = {Math. Methods Oper. Res.},
volume = {55},
number = {3},
pages = {431--446},
year = {2002},
url = {https://doi.org/10.1007/s001860200195},
doi = {10.1007/S001860200195},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/BalzerJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Jansen02,
author = {Klaus Jansen},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time
Approximation Scheme},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {562--573},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_50},
doi = {10.1007/3-540-45749-6\_50},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Jansen02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/JansenZ02,
author = {Klaus Jansen and
Hu Zhang},
editor = {Ricardo A. Baeza{-}Yates and
Ugo Montanari and
Nicola Santoro},
title = {Approximation Algorithms for General Packing Problems with Modified
Logarithmic Potential Function},
booktitle = {Foundations of Information Technology in the Era of Networking and
Mobile Computing, {IFIP} 17\({}^{\mbox{th}}\) World Computer Congress
- {TC1} Stream / 2\({}^{\mbox{nd}}\) {IFIP} International Conference
on Theoretical Computer Science {(TCS} 2002), August 25-30, 2002,
Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
series = {{IFIP} Conference Proceedings},
volume = {223},
pages = {255--266},
publisher = {Kluwer},
year = {2002},
url = {https://doi.org/10.1007/978-0-387-35608-2\_22},
doi = {10.1007/978-0-387-35608-2\_22},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/JansenZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/JansenP02,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {William J. Cook and
Andreas S. Schulz},
title = {On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation
Schemes},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {329--349},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_24},
doi = {10.1007/3-540-47867-1\_24},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/JansenP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JansenS02,
author = {Klaus Jansen and
Roberto Solis{-}Oba},
editor = {Prosenjit Bose and
Pat Morin},
title = {An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {175--186},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_16},
doi = {10.1007/3-540-36136-7\_16},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/JansenS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jansen02,
author = {Klaus Jansen},
editor = {Helmut Alt and
Afonso Ferreira},
title = {Approximate Strong Separation with Application in Fractional Graph
Coloring and Preemptive Scheduling},
booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2285},
pages = {100--111},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45841-7\_7},
doi = {10.1007/3-540-45841-7\_7},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jansen02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2002,
editor = {Klaus Jansen and
Stefano Leonardi and
Vijay V. Vazirani},
title = {Approximation Algorithms for Combinatorial Optimization, 5th International
Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2462},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45753-4},
doi = {10.1007/3-540-45753-4},
isbn = {3-540-44186-7},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenR01,
author = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Guest Editors' Introduction},
journal = {Algorithmica},
volume = {30},
number = {3},
pages = {351--352},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0025-7},
doi = {10.1007/S00453-001-0025-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/JansenP01,
author = {Klaus Jansen and
Lorant Porkolab},
title = {Improved Approximation Schemes for Scheduling Unrelated Parallel Machines},
journal = {Math. Oper. Res.},
volume = {26},
number = {2},
pages = {324--338},
year = {2001},
url = {https://doi.org/10.1287/moor.26.2.324.10559},
doi = {10.1287/MOOR.26.2.324.10559},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/JansenP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ErlebachJ01,
author = {Thomas Erlebach and
Klaus Jansen},
title = {The Maximum Edge-Disjoint Paths Problem in Bidirected Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {14},
number = {3},
pages = {326--355},
year = {2001},
url = {https://doi.org/10.1137/S0895480199361259},
doi = {10.1137/S0895480199361259},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ErlebachJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachJ01,
author = {Thomas Erlebach and
Klaus Jansen},
title = {The complexity of path coloring and call scheduling},
journal = {Theor. Comput. Sci.},
volume = {255},
number = {1-2},
pages = {33--50},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(99)00152-8},
doi = {10.1016/S0304-3975(99)00152-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErlebachJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/FishkinJM01,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Monaldo Mastrolilli},
editor = {Friedhelm Meyer auf der Heide},
title = {Grouping Techniques for Scheduling Problems: Simpler and Faster},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {206--217},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_17},
doi = {10.1007/3-540-44676-1\_17},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/FishkinJM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Jansen01,
author = {Klaus Jansen},
editor = {Rusins Freivalds},
title = {Approximation Algorithms for Fractional Covering and Packing Problems,
and Applications},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {14},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_2},
doi = {10.1007/3-540-44669-9\_2},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Jansen01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/FishkinJP01,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Lorant Porkolab},
editor = {Rusins Freivalds},
title = {On Minimizing Average Weighted Completion Time: {A} {PTAS} for Scheduling
General Multiprocessor Tasks},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium,
{FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2138},
pages = {495--507},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44669-9\_56},
doi = {10.1007/3-540-44669-9\_56},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/FishkinJP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FishkinJP01,
author = {Aleksei V. Fishkin and
Klaus Jansen and
Lorant Porkolab},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {On Minimizing Average Weighted Completion Time of Multiprocessor Tasks
with Release Dates},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {875--886},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_71},
doi = {10.1007/3-540-48224-5\_71},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FishkinJP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictcs/JansenMS01,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
editor = {Antonio Restivo and
Simona Ronchi Della Rocca and
Luca Roversi},
title = {Job Shop Scheduling Problems with Controllable Processing Times},
booktitle = {Theoretical Computer Science, 7th Italian Conference, {ICTCS} 2001,
Torino, Italy, October 4-6, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2202},
pages = {107--122},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45446-2\_7},
doi = {10.1007/3-540-45446-2\_7},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/ictcs/JansenMS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ErlebachJS01,
author = {Thomas Erlebach and
Klaus Jansen and
Eike Seidel},
editor = {S. Rao Kosaraju},
title = {Polynomial-time approximation schemes for geometric graphs},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {671--679},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365562},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ErlebachJS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenKLS01,
author = {Klaus Jansen and
Marek Karpinski and
Andrzej Lingas and
Eike Seidel},
editor = {Afonso Ferreira and
Horst Reichel},
title = {Polynomial Time Approximation Schemes for {MAX-BISECTION} on Planar
and Geometric Graphs},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {365--375},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_32},
doi = {10.1007/3-540-44693-1\_32},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JansenKLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaJLS01,
author = {Jir{\'{\i}} Fiala and
Klaus Jansen and
Van Bang Le and
Eike Seidel},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Graph Subcolorings: Complexity and Algorithms},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {154--165},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_15},
doi = {10.1007/3-540-45477-2\_15},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaJLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/random/2001,
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {2129},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4},
doi = {10.1007/3-540-44666-4},
isbn = {3-540-42470-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Jansen00,
author = {Klaus Jansen},
title = {Approximation Results for the Optimum Cost Chromatic Partition Problem},
journal = {J. Algorithms},
volume = {34},
number = {1},
pages = {54--89},
year = {2000},
url = {https://doi.org/10.1006/jagm.1999.1022},
doi = {10.1006/JAGM.1999.1022},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Jansen00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BodlaenderJ00,
author = {Hans L. Bodlaender and
Klaus Jansen},
title = {On the Complexity of the Maximum Cut Problem},
journal = {Nord. J. Comput.},
volume = {7},
number = {1},
pages = {14--31},
year = {2000},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BodlaenderJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AfratiBFJK00,
author = {Foto N. Afrati and
Evripidis Bampis and
Aleksei V. Fishkin and
Klaus Jansen and
Claire Kenyon},
editor = {Sanjiv Kapoor and
Sanjiva Prasad},
title = {Scheduling to Minimize the Average Completion Time of Dedicated Tasks},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1974},
pages = {454--464},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44450-5\_37},
doi = {10.1007/3-540-44450-5\_37},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AfratiBFJK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ErlebachJ00,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Jos{\'{e}} D. P. Rolim and
Andrei Z. Broder and
Andrea Corradini and
Roberto Gorrieri and
Reiko Heckel and
Juraj Hromkovic and
Ugo Vaccaro and
J. B. Wells},
title = {Conversion of Coloring Algorithms into Maximum Weight Independent
Set Algorithms},
booktitle = {{ICALP} Workshops 2000, Proceedings of the Satelite Workshops of the
27th International Colloquium on Automata, Languages and Programming,
Geneva, Switzerland, July 9-15, 2000},
pages = {135--146},
publisher = {Carleton Scientific, Waterloo, Ontario, Canada},
year = {2000},
timestamp = {Sat, 04 Apr 2020 17:15:23 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ErlebachJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenM00,
author = {Klaus Jansen and
Monaldo Mastrolilli},
editor = {Jos{\'{e}} D. P. Rolim and
Andrei Z. Broder and
Andrea Corradini and
Roberto Gorrieri and
Reiko Heckel and
Juraj Hromkovic and
Ugo Vaccaro and
J. B. Wells},
title = {Parallel Machine Scheduling Problems with Controllable Processing
Times},
booktitle = {{ICALP} Workshops 2000, Proceedings of the Satelite Workshops of the
27th International Colloquium on Automata, Languages and Programming,
Geneva, Switzerland, July 9-15, 2000},
pages = {179--190},
publisher = {Carleton Scientific, Waterloo, Ontario, Canada},
year = {2000},
timestamp = {Wed, 06 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/JansenM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JansenP00,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {Polynominal Time Approximation Schemes for General Multiprocessor
Job Shop Scheduling},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {878--889},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_74},
doi = {10.1007/3-540-45022-X\_74},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JansenP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/JansenP00,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {D. T. Lee and
Shang{-}Hua Teng},
title = {Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time},
booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC}
2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1969},
pages = {398--409},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40996-3\_34},
doi = {10.1007/3-540-40996-3\_34},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/JansenP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/JansenMS00,
author = {Klaus Jansen and
Monaldo Mastrolilli and
Roberto Solis{-}Oba},
editor = {Gaston H. Gonnet and
Daniel Panario and
Alfredo Viola},
title = {Approximation Algorithms for Flexible Job Shop Problems},
booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1776},
pages = {68--77},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10719839\_7},
doi = {10.1007/10719839\_7},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/JansenMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/JansenP00,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {Mogens Nielsen and
Branislav Rovan},
title = {Preemptive Scheduling on Dedicated Processors: Applications of Fractional
Graph Coloring},
booktitle = {Mathematical Foundations of Computer Science 2000, 25th International
Symposium, {MFCS} 2000, Bratislava, Slovakia, August 28 - September
1, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1893},
pages = {446--455},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44612-5\_40},
doi = {10.1007/3-540-44612-5\_40},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/JansenP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenS00,
author = {Klaus Jansen and
Maxim Sviridenko},
editor = {Horst Reichel and
Sophie Tison},
title = {Polynomial Time Approximation Schemes for the Multiprocessor Open
and Flow Shop Scheduling Problem},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {455--465},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_38},
doi = {10.1007/3-540-46541-3\_38},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JansenS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/ErlebachJ00,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Stefan N{\"{a}}her and
Dorothea Wagner},
title = {Implementation of Approximation Algorithms for Weighted and Unweighted
Edge-Disjoint Paths in Bidirected Trees},
booktitle = {Algorithm Engineering, 4th International Workshop, {WAE} 2000, Saarbr{\"{u}}cken,
Germany, September 5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1982},
pages = {195--206},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44691-5\_17},
doi = {10.1007/3-540-44691-5\_17},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wae/ErlebachJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2000,
editor = {Klaus Jansen and
Samir Khuller},
title = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X},
doi = {10.1007/3-540-44436-X},
isbn = {3-540-67996-0},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/2000.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-064,
author = {Klaus Jansen and
Marek Karpinski and
Andrzej Lingas},
title = {A Polynomial Time Approximation Scheme for {MAX-BISECTION} on Planar
Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-064}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-064/index.html},
eprinttype = {ECCC},
eprint = {TR00-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Jansen99,
author = {Klaus Jansen},
title = {An Approximation Scheme for Bin Packing with Conflicts},
journal = {J. Comb. Optim.},
volume = {3},
number = {4},
pages = {363--377},
year = {1999},
url = {https://doi.org/10.1023/A:1009871302966},
doi = {10.1023/A:1009871302966},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Jansen99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/ErlebachJ99,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Efficient Implementation of an Optimal Greedy Algorithm for Wavelength
Assignment in Directed Tree Networks},
journal = {{ACM} J. Exp. Algorithmics},
volume = {4},
pages = {4},
year = {1999},
url = {https://doi.org/10.1145/347792.347808},
doi = {10.1145/347792.347808},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jea/ErlebachJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ErlebachJKMP99,
author = {Thomas Erlebach and
Klaus Jansen and
Christos Kaklamanis and
Milena Mihail and
Pino Persiano},
title = {Optimal Wavelength Routing on Directed Fiber Trees},
journal = {Theor. Comput. Sci.},
volume = {221},
number = {1-2},
pages = {119--137},
year = {1999},
url = {https://doi.org/10.1016/S0304-3975(99)00029-8},
doi = {10.1016/S0304-3975(99)00029-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ErlebachJKMP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/JansenSS99,
author = {Klaus Jansen and
Roberto Solis{-}Oba and
Maxim Sviridenko},
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {A Linear Time Approximation Scheme for the Job Shop Scheduling Problem},
booktitle = {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},
series = {Lecture Notes in Computer Science},
volume = {1671},
pages = {177--188},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/978-3-540-48413-4\_19},
doi = {10.1007/978-3-540-48413-4\_19},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/JansenSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/JansenP99,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Linear-Time Approximation Schemes for Scheduling Malleable Parallel
Tasks},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {490--498},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314870},
timestamp = {Thu, 05 Jul 2018 07:29:57 +0200},
biburl = {https://dblp.org/rec/conf/soda/JansenP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JansenSS99,
author = {Klaus Jansen and
Roberto Solis{-}Oba and
Maxim Sviridenko},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Makespan Minimization in Job Shops: {A} Polynomial Time Approximation
Scheme},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {394--399},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301351},
doi = {10.1145/301250.301351},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JansenSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JansenP99,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Improved Approximation Schemes for Scheduling Unrelated Parallel Machines},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {408--417},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301361},
doi = {10.1145/301250.301361},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JansenP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/JansenP99,
author = {Klaus Jansen and
Lorant Porkolab},
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {General Multiprocessor Task Scheduling: Approximate Solutions in Linear
Time},
booktitle = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {110--121},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7\_13},
doi = {10.1007/3-540-48447-7\_13},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/JansenP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/random/1999,
editor = {Dorit S. Hochbaum and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Alistair Sinclair},
title = {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},
series = {Lecture Notes in Computer Science},
volume = {1671},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/b72324},
doi = {10.1007/B72324},
isbn = {3-540-66329-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/random/1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/integration/JansenR98,
author = {Klaus Jansen and
Joachim Reiter},
title = {An approximation algorithm for the register allocation problem},
journal = {Integr.},
volume = {25},
number = {2},
pages = {89--102},
year = {1998},
url = {https://doi.org/10.1016/S0167-9260(98)00008-X},
doi = {10.1016/S0167-9260(98)00008-X},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/integration/JansenR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderDJKKMT98,
author = {Hans L. Bodlaender and
Jitender S. Deogun and
Klaus Jansen and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Zsolt Tuza},
title = {Rankings of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {11},
number = {1},
pages = {168--181},
year = {1998},
url = {https://doi.org/10.1137/S0895480195282550},
doi = {10.1137/S0895480195282550},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderDJKKMT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ErlebachJ98,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Kyung{-}Yong Chwa and
Oscar H. Ibarra},
title = {Maximizing the Number of Connections in Optical Tree Networks},
booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
Taejon, Korea, December 14-16, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1533},
pages = {179--188},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49381-6\_20},
doi = {10.1007/3-540-49381-6\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ErlebachJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Jansen98,
author = {Klaus Jansen},
editor = {Claudio L. Lucchesi and
Arnaldo V. Moura},
title = {A New Characterization for Parity Graphs and a Coloring Problem with
Costs},
booktitle = {{LATIN} '98: Theoretical Informatics, Third Latin American Symposium,
Campinas, Brazil, April, 20-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1380},
pages = {249--260},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054326},
doi = {10.1007/BFB0054326},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/Jansen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/JansenR98,
author = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
editor = {Branislav Rovan},
title = {Algorithms Based on Randomization and Linear and Semidefinite Programming},
booktitle = {{SOFSEM} '98: Theory and Practice of Informatics, 25th Conference
on Current Trends in Theory and Practice of Informatics, Jasn{\'{a}},
Slovakia, November 21-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1521},
pages = {124--134},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49477-4\_8},
doi = {10.1007/3-540-49477-4\_8},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/JansenR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jansen98,
author = {Klaus Jansen},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {The Mutual Exclusion Scheduling Problem for Permutation and Comparability
Graphs},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {287--297},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028568},
doi = {10.1007/BFB0028568},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jansen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Jansen98,
author = {Klaus Jansen},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {An Approximation Scheme for Bin Packing with Conflicts},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {35--46},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054353},
doi = {10.1007/BFB0054353},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Jansen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wae/ErlebachJ98,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Kurt Mehlhorn},
title = {Efficient Implementation of an Optimal Greedy Algorithm for Wavelength
Assignment in Directed Tree Networks},
booktitle = {Algorithm Engineering, 2nd International Workshop, {WAE} '92, Saarbr{\"{u}}cken,
Germany, August 20-22, 1998, Proceedings},
pages = {13--24},
publisher = {Max-Planck-Institut f{\"{u}}r Informatik},
year = {1998},
timestamp = {Mon, 10 May 2021 14:22:35 +0200},
biburl = {https://dblp.org/rec/conf/wae/ErlebachJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/1998,
editor = {Klaus Jansen and
Dorit S. Hochbaum},
title = {Approximation Algorithms for Combinatorial Optimization, International
Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1444},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0053958},
doi = {10.1007/BFB0053958},
isbn = {3-540-64736-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/1998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JansenS97,
author = {Klaus Jansen and
Petra Scheffler},
title = {Generalized Coloring for Tree-like Graphs},
journal = {Discret. Appl. Math.},
volume = {75},
number = {2},
pages = {135--155},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(96)00085-6},
doi = {10.1016/S0166-218X(96)00085-6},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JansenS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/JansenO97,
author = {Klaus Jansen and
Sabine R. {\"{O}}hring},
title = {Approximation Algorithms for Time Constrained Scheduling},
journal = {Inf. Comput.},
volume = {132},
number = {2},
pages = {85--108},
year = {1997},
url = {https://doi.org/10.1006/inco.1996.2616},
doi = {10.1006/INCO.1996.2616},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/JansenO97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Jansen97,
author = {Klaus Jansen},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {The Optimum Cost Chromatic Partition Problem},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {25--36},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_58},
doi = {10.1007/3-540-62592-5\_58},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Jansen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Jansen97a,
author = {Klaus Jansen},
editor = {Panos M. Pardalos and
Sanguthevar Rajasekaran and
Jos{\'{e}} Rolim},
title = {An approximation scheme for scheduling of malleable parallel tasks},
booktitle = {Randomization Methods in Algorithm Design, Proceedings of a {DIMACS}
Workshop, Princeton, New Jersey, USA, December 12-14, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {43},
pages = {109--121},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/043/06},
doi = {10.1090/DIMACS/043/06},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Jansen97a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/ErlebachJKP97,
author = {Thomas Erlebach and
Klaus Jansen and
Christos Kaklamanis and
Giuseppe Persiano},
editor = {Panos M. Pardalos and
Ding{-}Zhu Du},
title = {An optimal greedy algorithm for wavelength allocation in directed
tree networks},
booktitle = {Network Design: Connectivity and Facilities Location, Proceedings
of a {DIMACS} Workshop, Princetin, New Jersey, USA, April 28-30, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {40},
pages = {117--129},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/040/08},
doi = {10.1090/DIMACS/040/08},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/ErlebachJKP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Jansen97,
author = {Klaus Jansen},
editor = {Panos M. Pardalos and
Ding{-}Zhu Du},
title = {Approximation results for the optimum cost chromatic partition problem},
booktitle = {Network Design: Connectivity and Facilities Location, Proceedings
of a {DIMACS} Workshop, Princetin, New Jersey, USA, April 28-30, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {40},
pages = {143--168},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/040/10},
doi = {10.1090/DIMACS/040/10},
timestamp = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Jansen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hicss/ErlebachJ97,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Call Scheduling in Trees, Rings and Meshes},
booktitle = {30th Annual Hawaii International Conference on System Sciences (HICSS-30),
7-10 January 1997, Maui, Hawaii, {USA}},
pages = {221},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/HICSS.1997.667220},
doi = {10.1109/HICSS.1997.667220},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hicss/ErlebachJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KaklamanisPEJ97,
author = {Christos Kaklamanis and
Pino Persiano and
Thomas Erlebach and
Klaus Jansen},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Constrained Bipartite Edge Coloring with Applications to Wavelength
Routing},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {493--504},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_205},
doi = {10.1007/3-540-63165-8\_205},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KaklamanisPEJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Jansen97,
author = {Klaus Jansen},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Approximation Results for the Optimum Cost Partition Problem},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {727--737},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_226},
doi = {10.1007/3-540-63165-8\_226},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Jansen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/irregular/JansenR97,
author = {Klaus Jansen and
Joachim Reiter},
editor = {Gianfranco Bilardi and
Afonso Ferreira and
Reinhard L{\"{u}}ling and
Jos{\'{e}} D. P. Rolim},
title = {A New Approximation Algorithm for the Register Allocation Problem},
booktitle = {Solving Irregularly Structured Problems in Parallel, 4th International
Symposium, {IRREGULAR} '97, Paderborn, Germany, June 12-13, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1253},
pages = {135--146},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63138-0\_13},
doi = {10.1007/3-540-63138-0\_13},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/irregular/JansenR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ErlebachJ97,
author = {Thomas Erlebach and
Klaus Jansen},
editor = {Rolf H. M{\"{o}}hring},
title = {Off-Line and On-Line Call-Scheduling in Stars and Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop,
{WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1335},
pages = {199--213},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024499},
doi = {10.1007/BFB0024499},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/ErlebachJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI97-01,
author = {Klaus Jansen},
title = {Approximation Results for the Optimum Cost Chromatic Partition Problem},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {97-01},
year = {1997},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI97-01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI97-03,
author = {Thomas Erlebach and
Klaus Jansen},
title = {An Optimal Greedy Algorithm for Wavelength Allocation in Directed
Tree Networks},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {97-03},
year = {1997},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI97-03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jansen96,
author = {Klaus Jansen},
title = {A rainbow about T-colorings for complete graphs},
journal = {Discret. Math.},
volume = {154},
number = {1-3},
pages = {129--139},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(94)00344-I},
doi = {10.1016/0012-365X(94)00344-I},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Jansen96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI96-13,
author = {Klaus Jansen and
Joachim Reiter},
title = {Approximation Algorithms for Register Allocation},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {96-13},
year = {1996},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI96-13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI96-19,
author = {Thomas Erlebach and
Klaus Jansen},
title = {Scheduling of Virtual Connections in Fast Networks},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {96-19},
year = {1996},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI96-19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI96-37,
author = {Klaus Jansen},
title = {Approximation Results for Wavelength Routing in Directed Binary Trees},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {96-37},
year = {1996},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI96-37.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI96-41,
author = {Klaus Jansen},
title = {Complexity Results for the Optimum Cost Chromatic Partition Problem},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {96-41},
year = {1996},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI96-41.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/JansenWY95,
author = {Klaus Jansen and
Gerhard J. Woeginger and
Zhongliang Yu},
title = {UET-scheduling with chain-type precedence constraints},
journal = {Comput. Oper. Res.},
volume = {22},
number = {9},
pages = {915--920},
year = {1995},
url = {https://doi.org/10.1016/0305-0548(94)00084-L},
doi = {10.1016/0305-0548(94)00084-L},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cor/JansenWY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Jansen95,
author = {Klaus Jansen},
title = {Scheduling of Conditional Executed Jobs on Unrelated Processors},
journal = {Discret. Appl. Math.},
volume = {61},
number = {3},
pages = {245--255},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00013-4},
doi = {10.1016/0166-218X(94)00013-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Jansen95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenM95,
author = {Klaus Jansen and
Haiko M{\"{u}}ller},
title = {The Minimum Broadcast Time Problem for Several Processor Networks},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {69--85},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00230-G},
doi = {10.1016/0304-3975(94)00230-G},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderJ95,
author = {Hans L. Bodlaender and
Klaus Jansen},
title = {Restrictions of Graph Partition Problems. Part {I}},
journal = {Theor. Comput. Sci.},
volume = {148},
number = {1},
pages = {93--109},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00057-4},
doi = {10.1016/0304-3975(95)00057-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/irregular/JansenO95,
author = {Klaus Jansen and
Sabine R. {\"{O}}hring},
editor = {Afonso Ferreira and
Jos{\'{e}} D. P. Rolim},
title = {Approximation Algorithms for Time Constrained Scheduling},
booktitle = {Parallel Algorithms for Irregularly Structured Problems, Second International
Workshop, {IRREGULAR} '95, Lyon, France, September 4-6, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {980},
pages = {143--157},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60321-2\_12},
doi = {10.1007/3-540-60321-2\_12},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/irregular/JansenO95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Jansen94,
author = {Klaus Jansen},
title = {Analysis of Scheduling Problems with Typed Task Systems},
journal = {Discret. Appl. Math.},
volume = {52},
number = {3},
pages = {223--232},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90142-2},
doi = {10.1016/0166-218X(94)90142-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Jansen94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderJW94,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
title = {Scheduling with Incompatible Jobs},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {219--232},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90009-4},
doi = {10.1016/0166-218X(94)90009-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderJW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/integration/Jansen94,
author = {Klaus Jansen},
title = {On the complexity of allocation problems in high-level synthesis},
journal = {Integr.},
volume = {17},
number = {3},
pages = {241--252},
year = {1994},
url = {https://doi.org/10.1016/0167-9260(94)90002-7},
doi = {10.1016/0167-9260(94)90002-7},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/integration/Jansen94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/Jansen94,
author = {Klaus Jansen},
title = {Integral Flow with Disjoint Bundles},
journal = {Nord. J. Comput.},
volume = {1},
number = {2},
pages = {264--267},
year = {1994},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/Jansen94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cfcp/JansenM94,
author = {Klaus Jansen and
Haiko M{\"{u}}ller},
editor = {Michel Cosnard and
Afonso Ferreira and
Joseph G. Peters},
title = {The Minimum Broadcast Time Problem},
booktitle = {Parallel and Distributed Computing, First Canada-France Conference,
Montr{\'{e}}al, Canada, May 19-21, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {805},
pages = {219--234},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58078-6\_19},
doi = {10.1007/3-540-58078-6\_19},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cfcp/JansenM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderJ94,
author = {Hans L. Bodlaender and
Klaus Jansen},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {On the Complexity of the Maximum Cut Problem},
booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
Science, Caen, France, February 24-26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {769--780},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_189},
doi = {10.1007/3-540-57785-8\_189},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderJ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderDJKKMT94,
author = {Hans L. Bodlaender and
Jitender S. Deogun and
Klaus Jansen and
Ton Kloks and
Dieter Kratsch and
Haiko M{\"{u}}ller and
Zsolt Tuza},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Ranking of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {292--304},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_56},
doi = {10.1007/3-540-59071-4\_56},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderDJKKMT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/JansenW93,
author = {Klaus Jansen and
Gerhard J. Woeginger},
title = {The Complexity of Detecting Crossingfree Configurations in the Plane},
journal = {{BIT}},
volume = {33},
number = {4},
pages = {580--595},
year = {1993},
url = {https://doi.org/10.1007/BF01990536},
doi = {10.1007/BF01990536},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/JansenW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Jansen93,
author = {Klaus Jansen},
title = {One Strike Against the Min-max Degree Triangulation Problem},
journal = {Comput. Geom.},
volume = {3},
pages = {107--120},
year = {1993},
url = {https://doi.org/10.1016/0925-7721(93)90003-O},
doi = {10.1016/0925-7721(93)90003-O},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cor/Jansen93,
author = {Klaus Jansen},
title = {Scheduling with constrained processor allocation for interval orders},
journal = {Comput. Oper. Res.},
volume = {20},
number = {6},
pages = {587--595},
year = {1993},
url = {https://doi.org/10.1016/0305-0548(93)90114-X},
doi = {10.1016/0305-0548(93)90114-X},
timestamp = {Tue, 18 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cor/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Jansen93,
author = {Klaus Jansen},
title = {The Allocation Problem in Hardware Design},
journal = {Discret. Appl. Math.},
volume = {43},
number = {1},
pages = {37--46},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90167-M},
doi = {10.1016/0166-218X(93)90167-M},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jansen93,
author = {Klaus Jansen},
title = {Transfer flow graphs},
journal = {Discret. Math.},
volume = {115},
number = {1-3},
pages = {187--199},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90488-F},
doi = {10.1016/0012-365X(93)90488-F},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Jansen93,
author = {Klaus Jansen},
title = {Scheduling of Incompatible Jobs on Unrelated Machines},
journal = {Int. J. Found. Comput. Sci.},
volume = {4},
number = {4},
pages = {275--291},
year = {1993},
url = {https://doi.org/10.1142/S0129054193000183},
doi = {10.1142/S0129054193000183},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Jansen93,
author = {Klaus Jansen},
title = {The Interconnection Problem},
journal = {J. Comput. Syst. Sci.},
volume = {46},
number = {1},
pages = {27--38},
year = {1993},
url = {https://doi.org/10.1016/0022-0000(93)90047-Z},
doi = {10.1016/0022-0000(93)90047-Z},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Jansen93,
author = {Klaus Jansen},
title = {Bounds for the general capacitated routing problem},
journal = {Networks},
volume = {23},
number = {3},
pages = {165--173},
year = {1993},
url = {https://doi.org/10.1002/net.3230230304},
doi = {10.1002/NET.3230230304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/JansenSW93,
author = {Klaus Jansen and
Petra Scheffler and
Gerhard J. Woeginger},
editor = {Zolt{\'{a}}n {\'{E}}sik},
title = {Maximum Covering with {D} Cliques},
booktitle = {Fundamentals of Computation Theory, 9th International Symposium, {FCT}
'93, Szeged, Hungary, August 23-27, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {710},
pages = {319--328},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57163-9\_27},
doi = {10.1007/3-540-57163-9\_27},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/JansenSW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DessmarkJL93,
author = {Anders Dessmark and
Klaus Jansen and
Andrzej Lingas},
editor = {Kam{-}Wing Ng and
Prabhakar Raghavan and
N. V. Balasubramanian and
Francis Y. L. Chin},
title = {The Maximum k-Dependent and f-Dependent Set Problem},
booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
Hong Kong, December 15-17, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {762},
pages = {88--98},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57568-5\_238},
doi = {10.1007/3-540-57568-5\_238},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DessmarkJL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BodlaenderJ93,
author = {Hans L. Bodlaender and
Klaus Jansen},
editor = {Andrzej M. Borzyszkowski and
Stefan Sokolowski},
title = {On the Complexity of Scheduling Incompatible Jobs with Unit-Times},
booktitle = {Mathematical Foundations of Computer Science 1993, 18th International
Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {711},
pages = {291--300},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57182-5\_21},
doi = {10.1007/3-540-57182-5\_21},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderJ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Jansen93,
author = {Klaus Jansen},
editor = {Jan van Leeuwen},
title = {A Rainbow About T-Colorings for Complete Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {189--199},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_52},
doi = {10.1007/3-540-57899-4\_52},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Jansen93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI93-01,
author = {Klaus Jansen},
title = {Scheduling of Conditional Executed Jobs},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {93-01},
year = {1993},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI93-01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI93-03,
author = {Klaus Jansen},
title = {A Rainbow about T-Colorings for Complete Graphs},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {93-03},
year = {1993},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI93-03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI93-04,
author = {Klaus Jansen},
title = {Scheduling of Conditional Executed Jobs on Unrelated Processors},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {93-04},
year = {1993},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI93-04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI93-24,
author = {Klaus Jansen},
title = {Scheduling and Related Graph Theoretical Problems},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {93-24},
year = {1993},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI93-24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jansen92,
author = {Klaus Jansen},
title = {An Approximation Algorithm for the General Routing Problem},
journal = {Inf. Process. Lett.},
volume = {41},
number = {6},
pages = {333--339},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90161-N},
doi = {10.1016/0020-0190(92)90161-N},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Jansen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Jansen92,
author = {Klaus Jansen},
title = {Processor Optimization for Flow Graphs},
journal = {Theor. Comput. Sci.},
volume = {104},
number = {2},
pages = {285--298},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90126-Z},
doi = {10.1016/0304-3975(92)90126-Z},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Jansen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Jansen92,
author = {Klaus Jansen},
editor = {Ernst W. Mayr},
title = {On Scheduling Problems Restricted to Interval Orders},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {27--36},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_33},
doi = {10.1007/3-540-56402-0\_33},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Jansen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderJW92,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
editor = {Ernst W. Mayr},
title = {Scheduling with Incompatible Jobs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {37--49},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_34},
doi = {10.1007/3-540-56402-0\_34},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderJW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/JansenS92,
author = {Klaus Jansen and
Petra Scheffler},
editor = {Ernst W. Mayr},
title = {Generalized Coloring for Tree-like Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {50--59},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_35},
doi = {10.1007/3-540-56402-0\_35},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/JansenS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-08,
author = {Klaus Jansen and
Petra Scheffler},
title = {Generalized Coloring for Tree-like Graphs},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-08},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-09,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
title = {Scheduling with Incompatible Jobs},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-09},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-11,
author = {Klaus Jansen},
title = {Scheduling with Constrained Processor Allocation for Interval Orders},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-11},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-12,
author = {Klaus Jansen},
title = {On the Complexity of One Branching Graphs},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-12},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-14,
author = {Klaus Jansen},
title = {One Strike Against the Min-Max Degree Triangulation Problem},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-14},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-15,
author = {Klaus Jansen},
title = {On the Complexity of a Licence Constrained Job Assignment Problem},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-15},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-23,
author = {Klaus Jansen and
Petra Scheffler and
Gerhard J. Woeginger},
title = {The Disjoint Cliques Problem},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-23},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-25,
author = {Klaus Jansen and
Gerhard J. Woeginger},
title = {The Complexity of Detecting Crossingfree Configurations in the Plane},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-25},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Jansen90,
author = {Klaus Jansen},
title = {Ein Zuordnungsproblem im Hardware-Design},
school = {University of Trier, Germany},
year = {1990},
url = {https://d-nb.info/910099537},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Jansen90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
