Sven O. Krumke

56 papers B 1C 1Journal 43Unranked 10
YearRankTypeTitle / Venue / Authors
2026 J jnl
On generalizations of partial scenario set cover.
Theor. Comput. Sci.
Shai Michael Dimant, Sven O. Krumke
2025 — conf
A Mathematical Model for XOR-Based Application Specific DRAM Address Mapping Schemes.
MEMSYS
Andrei Rotaru, Oliver Bachtler, Lukas Steiner, Matthias Jung, Sven O. Krumke, Norbert Wehn
2025 J jnl
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning.
Networks
Shai Michael Dimant, Sven O. Krumke
2025 J jnl
On approximating partial scenario set cover.
Theor. Comput. Sci.
Shai Michael Dimant, Sven O. Krumke
2025 J jnl
Online delay management on a single train line with predictions.
Inf. Process. Lett.
Daniel Eichhorn, Sven O. Krumke
2024 J jnl
Algorithms and complexity for the almost equal maximum flow problem.
Networks
Rebekka Haese, Till Heller, Sven O. Krumke
2024 J jnl
Almost disjoint paths and separating by forbidden pairs.
Theor. Comput. Sci.
Oliver Bachtler, Tim Bergner, Sven O. Krumke
2024 — conf
Covering of Graphs of Bounded Cycolomatic Number with Preselected Paths.
OR
Christoph Geis, Sven O. Krumke
2024 — conf
On Applications of Partial Scenario Set Cover: The Graph-Theoretic View.
OR
Shai Michael Dimant, Sven O. Krumke
2024 J jnl
On the mixed connectivity conjecture of Beineke and Harary.
Ann. Oper. Res.
Sebastian S. Johann, Sven O. Krumke, Manuel Streicher
2024 — conf
QCEDA: Using Quantum Computers for EDA.
SAMOS
Matthias Jung, Sven O. Krumke, Christof Schroth, Elisabeth Lobe, Wolfgang Mauerer
2024 J jnl
QCEDA: Using Quantum Computers for EDA.
CoRR
Matthias Jung, Sven O. Krumke, Christof Schroth, Elisabeth Lobe, Wolfgang Mauerer
2022 J jnl
2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem.
Oper. Res. Lett.
Sven O. Krumke, Le Huy Minh
2022 — conf
A Bicriteria Almost Equal Minimum Cost Flow Model for Day-Ahead Trading.
OR
Elisabeth Finhold, Till Heller, Sven O. Krumke, Neele Leithäuser
2022 J jnl
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions.
BMC Medical Informatics Decis. Mak.
Neele Leithäuser, Dennis Adelhütte, Kristin Braun, Christina Büsing, Martin Comis, Timo Gersing, Sebastian S. Johann, Arie M. C. A. Koster, Sven O. Krumke, Frauke Liers, Eva Schmidt, Johanna Schneider, Manuel Streicher, Sebastian Tschuppik, Sophia Wrede
2022 C conf
Local Certification of Reachability.
INOC
Oliver Bachtler, Tim Bergner, Sven O. Krumke
2022 J jnl
On Reward-Penalty-Selection Games.
CoRR
Niklas Gräf, Till Heller, Sven O. Krumke
2022 J jnl
Online algorithms to schedule a proportionate flexible flow shop of batching machines.
J. Sched.
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2022 J jnl
Simultaneously dominating all spanning trees of a graph.
Electron. J. Graph Theory Appl.
Sebastian S. Johann, Sven O. Krumke, Manuel Streicher
2022 J jnl
Towards Obtaining a 3-Decomposition From a Perfect Matching.
Electron. J. Comb.
Oliver Bachtler, Sven O. Krumke
2021 J jnl
Algorithms and Complexity for the Almost Equal Maximum Flow Problem.
CoRR
Rebekka Haese, Till Heller, Sven O. Krumke
2021 J jnl
On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation.
CoRR
Niklas Gräf, Till Heller, Sven O. Krumke
2021 J jnl
Robust flows with adaptive mitigation.
EURO J. Comput. Optim.
Heiner Ackermann, Erik Diessel, Sven O. Krumke
2021 J jnl
The Reward-Penalty-Selection Problem.
CoRR
Till Heller, Sven O. Krumke, Karl-Heinz Küfer
2020 J jnl
On the Bicriterion Maximum Flow Network Interdiction Problem.
CoRR
Luca E. Schäfer, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca
2020 J jnl
Online Algorithms to Schedule a Proportionate Flexible Flow Shop of Batching Machines.
CoRR
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2020 J jnl
Robust absolute single machine makespan scheduling-location problem on trees.
Oper. Res. Lett.
Sven O. Krumke, Le Huy Minh
2020 J jnl
Robust single machine makespan scheduling with release date uncertainty.
Oper. Res. Lett.
Oliver Bachtler, Sven O. Krumke, Le Huy Minh
2020 J jnl
Scheduling a Proportionate Flow Shop of Batching Machines.
CoRR
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2020 J jnl
Scheduling a proportionate flow shop of batching machines.
J. Sched.
Christoph Hertrich, Christian Weiß, Heiner Ackermann, Sandy Heydrich, Sven O. Krumke
2019 — conf
Algorithms and Complexity for the Almost Equal Maximum Flow Problem.
OR
Rebekka Haese, Till Heller, Sven O. Krumke
2019 J jnl
Full implementation of social choice functions in dominant strategies.
Int. J. Game Theory
Sven O. Krumke, Clemens Thielen, Philipp Weinschenk, Stephan Westphal
2019 J jnl
Robust multicovers with budgeted uncertainty.
Eur. J. Oper. Res.
Sven O. Krumke, Eva Schmidt, Manuel Streicher
2019 — conf
The Bicriterion Maximum Flow Network Interdiction Problem in
OR
Luca E. Schäfer, Tobias Dietz, Marco V. Natale, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca
2018 J jnl
A generalized approximation framework for fractional network flow and packing problems.
Math. Methods Oper. Res.
Michael Holzhauser, Sven O. Krumke
2018 J jnl
An FPTAS for the knapsack problem with parametric weights.
Oper. Res. Lett.
Nir Halman, Michael Holzhauser, Sven O. Krumke
2018 J jnl
Simultaneous Dominating Set for Spanning Tree Factorings.
CoRR
Sebastian S. Johann, Sven O. Krumke, Manuel Streicher
2017 J jnl
A network simplex method for the budget-constrained minimum cost flow problem.
Eur. J. Oper. Res.
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2017 J jnl
An FPTAS for the parametric knapsack problem.
CoRR
Michael Holzhauser, Sven O. Krumke
2017 J jnl
An FPTAS for the parametric knapsack problem.
Inf. Process. Lett.
Michael Holzhauser, Sven O. Krumke
2017 J jnl
Maximum flows in generalized processing networks.
J. Comb. Optim.
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2017 J jnl
On the complexity and approximability of budget-constrained minimum cost flows.
Inf. Process. Lett.
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2016 J jnl
A Generalized Approximation Framework for Fractional Network Flow and Packing Problems.
CoRR
Michael Holzhauser, Sven O. Krumke
2016 J jnl
A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem.
CoRR
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2016 J jnl
Capacitated network design games with weighted players.
Networks
André B. Chassein, Sven O. Krumke, Clemens Thielen
2016 — conf
ConGen: An Application Specific DRAM Memory Controller Generator.
MEMSYS
Matthias Jung, Deepak M. Mathew, Christian Weis, Norbert Wehn, Irene Heinrich, Marco V. Natale, Sven O. Krumke
2016 J jnl
On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows.
CoRR
Michael Holzhauser, Sven O. Krumke, Clemens Thielen
2016 J jnl
The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation.
J. Comb. Optim.
Sabine Büttner, Sven O. Krumke
2015 J jnl
On the Online Min-Wait Relocation Problem.
Electron. Notes Discret. Math.
Pascal Halffmann, Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2015 J jnl
ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem.
CoRR
Sahar Bsaybes, Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2014 B conf
Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.
SEA
Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2013 J jnl
Models and Algorithms for Carsharing Systems and Related Problems.
Electron. Notes Discret. Math.
Sven O. Krumke, Alain Quilliot, Annegret K. Wagler, Jan-Thierry Wegener
2013 — conf
Online Job Admission.
Fundamental Problems in Computing
Sven O. Krumke, Rob van Stee, Stephan Westphal
2013 J jnl
Online delay management on a single train line: beyond competitive analysis.
Public Transp.
Marco Bender, Sabine Büttner, Sven O. Krumke
2012 — conf
Optimierte Abstimmung der Umsteigebeziehungenim ungetakteten ÖPNV unter Berücksichtigung der Umlaufplanung.
MKWI
Neele Leithäuser, Ingmar Schüle, Sven O. Krumke
1997 — —
On the approximability of location and network design problems.
Sven O. Krumke