![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kim-Manuel Klein
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Kim-Manuel Klein
, Janina Reuter
:
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs. ACM Trans. Algorithms 20(3): 22 (2024) - [c19]Christoph Hunkenschröder
, Kim-Manuel Klein
, Martin Koutecký
, Alexandra Lassota
, Asaf Levin
:
Tight Lower Bounds for Block-Structured Integer Programs. IPCO 2024: 224-237 - [i18]Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Alexandra Lassota, Asaf Levin:
Tight Lower Bounds for Block-Structured Integer Programs. CoRR abs/2402.17290 (2024) - 2023
- [j9]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota
:
The double exponential runtime is tight for 2-stage stochastic ILPs. Math. Program. 197(2): 1145-1172 (2023) - [j8]Friedrich Eisenbrand
, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin
, Shmuel Onn
:
Reducibility bounds of objective functions over the integers. Oper. Res. Lett. 51(6): 595-598 (2023) - [c18]Kim-Manuel Klein, Adam Polak
, Lars Rohwedder:
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. SODA 2023: 2947-2960 - [i17]Kim-Manuel Klein, Janina Reuter:
Simple Lattice Basis Computation - The Generalization of the Euclidean Algorithm. CoRR abs/2311.15902 (2023) - 2022
- [j7]Kim-Manuel Klein:
About the complexity of two-stage stochastic IPs. Math. Program. 192(1): 319-337 (2022) - [j6]Klaus Jansen, Kim-Manuel Klein, Marten Maack
, Malin Rau:
Empowering the configuration-IP: new PTAS results for scheduling with setup times. Math. Program. 195(1): 367-401 (2022) - [c17]Kim-Manuel Klein, Janina Reuter:
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs. SODA 2022: 348-358 - [c16]Kim-Manuel Klein:
On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem. SODA 2022: 3567-3582 - [i16]Kim-Manuel Klein, Adam Polak, Lars Rohwedder:
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs. CoRR abs/2211.05053 (2022) - 2021
- [c15]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. IPCO 2021: 297-310 - [c14]Max A. Deppert, Klaus Jansen, Kim-Manuel Klein:
Fuzzy Simultaneous Congruences. MFCS 2021: 39:1-39:16 - [c13]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
New Bounds for the Vertices of the Integer Hull. SOSA 2021: 25-36 - [i15]Kim-Manuel Klein:
On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem. CoRR abs/2108.05581 (2021) - [i14]Kim-Manuel Klein, Janina Reuter:
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs. CoRR abs/2110.12743 (2021) - 2020
- [j5]Klaus Jansen, Kim-Manuel Klein
, José Verschae
:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. Math. Oper. Res. 45(4): 1371-1392 (2020) - [j4]Klaus Jansen, Kim-Manuel Klein
:
About the Structure of the Integer Cone and Its Application to Bin Packing. Math. Oper. Res. 45(4): 1498-1511 (2020) - [j3]Sebastian Berndt
, Klaus Jansen, Kim-Manuel Klein:
Fully dynamic bin packing revisited. Math. Program. 179(1): 109-155 (2020) - [c12]Kim-Manuel Klein
:
About the Complexity of Two-Stage Stochastic IPs. IPCO 2020: 252-265 - [i13]Max A. Deppert, Klaus Jansen, Kim-Manuel Klein:
Fuzzy Simultaneous Congruences. CoRR abs/2002.07746 (2020) - [i12]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
New Bounds for the Vertices of the Integer Hull. CoRR abs/2006.10847 (2020) - [i11]Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs. CoRR abs/2008.12928 (2020)
2010 – 2019
- 2019
- [j2]Klaus Jansen, Kim-Manuel Klein:
A Robust AFPTAS for Online Bin Packing with Polynomial Migration. SIAM J. Discret. Math. 33(4): 2062-2091 (2019) - [c11]Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau
:
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. ITCS 2019: 44:1-44:19 - [c10]Kilian Grage, Klaus Jansen, Kim-Manuel Klein:
An EPTAS for Machine Scheduling with Bag-Constraints. SPAA 2019: 135-144 - [i10]Kim-Manuel Klein:
About the Complexity of Two-Stage Stochastic IPs. CoRR abs/1901.01135 (2019) - [i9]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
An Algorithmic Theory of Integer Programming. CoRR abs/1904.01361 (2019) - 2018
- [j1]Cristina Bazgan, Ljiljana Brankovic
, Katrin Casel, Henning Fernau
, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
The many facets of upper domination. Theor. Comput. Sci. 717: 2-25 (2018) - [c9]Sebastian Berndt, Kim-Manuel Klein:
Using Structural Properties for Integer Programs. CiE 2018: 89-96 - [c8]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
Faster Algorithms for Integer Programs with Block Structure. ICALP 2018: 49:1-49:13 - [i8]Klaus Jansen, Kim-Manuel Klein, Marten Maack, Malin Rau:
Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. CoRR abs/1801.06460 (2018) - [i7]Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein:
Faster Algorithms for Integer Programs with Block Structure. CoRR abs/1802.06289 (2018) - [i6]Kilian Grage, Klaus Jansen, Kim-Manuel Klein:
An EPTAS for machine scheduling with bag-constraints. CoRR abs/1810.07510 (2018) - 2017
- [b1]Kim-Manuel Klein:
About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization. University of Kiel, Germany, 2017 - [c7]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. APPROX-RANDOM 2017: 13:1-13:18 - [c6]Klaus Jansen, Kim-Manuel Klein
:
About the Structure of the Integer Cone and its Application to Bin Packing. SODA 2017: 1571-1581 - [i5]Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig:
Online Strip Packing with Polynomial Migration. CoRR abs/1706.04939 (2017) - 2016
- [c5]Cristina Bazgan, Ljiljana Brankovic
, Katrin Casel, Henning Fernau
, Klaus Jansen, Kim-Manuel Klein
, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Algorithmic Aspects of Upper Domination: A Parameterised Perspective. AAIM 2016: 113-124 - [c4]Klaus Jansen, Kim-Manuel Klein, José Verschae:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. ICALP 2016: 72:1-72:13 - [c3]Cristina Bazgan, Ljiljana Brankovic
, Katrin Casel, Henning Fernau
, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, Vangelis Th. Paschos:
Upper Domination: Complexity and Approximation. IWOCA 2016: 241-252 - [r1]Kim-Manuel Klein
:
Robust Bin Packing. Encyclopedia of Algorithms 2016: 1858-1860 - [i4]Klaus Jansen, Kim-Manuel Klein, José Verschae:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. CoRR abs/1604.07153 (2016) - [i3]Klaus Jansen, Kim-Manuel Klein:
About the Structure of the Integer Cone and its Application to Bin Packing. CoRR abs/1604.07286 (2016) - 2015
- [c2]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
Fully Dynamic Bin Packing Revisited . APPROX-RANDOM 2015: 135-151 - 2014
- [i2]Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein:
Fully Dynamic Bin Packing Revisited. CoRR abs/1411.0960 (2014) - 2013
- [c1]Klaus Jansen, Kim-Manuel Klein
:
A Robust AFPTAS for Online Bin Packing with Polynomial Migration, . ICALP (1) 2013: 589-600 - [i1]Klaus Jansen, Kim-Manuel Klein:
A Robust AFPTAS for Online Bin Packing with Polynomial Migration. CoRR abs/1302.4213 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint