Compact Location Problems. - Venkatesh Radhakrishnan; Sven Oliver Krumke; Madhav V. Marathe; Daniel J. Rosenkrantz; S. S. Ravi (FSTTCS, 1993)

Compact Location Problems with Budget and Communication Constraints. - Sven Oliver Krumke; Hartmut Noltemeier; S. S. Ravi; Madhav V. Marathe (COCOON, 1995)

Complexity and Approximability of Certain Bicriteria Location Problems. - Sven Oliver Krumke; Hartmut Noltemeier; S. S. Ravi; Madhav V. Marathe (WG, 1995)

On a Generalization of the p-Center Problem. - Sven Oliver Krumke (Inf. Process. Lett., 1995)

Modifying Networks to Obtain Low Cost Trees. - Sven Oliver Krumke; Hartmut Noltemeier; Madhav V. Marathe; S. S. Ravi; Kay U. Drangmeister (WG, 1996)

Network improvement problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; R. Ravi 001; S. S. Ravi (Network Design: Connectivity and Facilities Location, 1997)

Compact Location Problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1997)

On the approximability of location and network design problems. - Sven O. Krumke (Shaker, 1997)

On the Minimum Label Spanning Tree Problem. - Sven Oliver Krumke; Hans-Christoph Wirth (Inf. Process. Lett., 1998)

On Budget-Constrained Flow Improvement. - S. Schwarz; Sven Oliver Krumke (Inf. Process. Lett., 1998)

Approximation Algorithms for Certain Network Improvement Problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; R. Ravi 001; S. S. Ravi (J. Comb. Optim., 1998)

Modifying Edges of a Network to Obtain Short Subgraphs. - Kay U. Drangmeister; Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; S. S. Ravi (Theor. Comput. Sci., 1998)

Euler is Standing in Line. - Dietrich Hauptmeier; Sven Oliver Krumke; Jörg Rambau; Hans-Christoph Wirth (WG, 1999)

Network Design and Improvement. - Hartmut Noltemeier; Hans-Christoph Wirth; Sven Oliver Krumke (ACM Comput. Surv., 1999)

Improving Minimum Cost Spanning Trees by Upgrading Nodes. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; R. Ravi 001; S. S. Ravi; Ravi Sundaram; Hans-Christoph Wirth (J. Algorithms, 1999)

Improving Spanning Trees by Upgrading Nodes. - Sven Oliver Krumke; Hartmut Noltemeier; Madhav V. Marathe; R. Ravi 001; S. S. Ravi; Ravi Sundaram; Hans-Christoph Wirth (Theor. Comput. Sci., 1999)

The Online Dial-a-Ride Problem under Reasonable Load. - Dietrich Hauptmeier; Sven Oliver Krumke; Jörg Rambau (CIAC, 2000)

Online Dial-a-Ride Problems: Minimizing the Completion Time. - Norbert Ascheuer; Sven Oliver Krumke; Jörg Rambau (STACS, 2000)

Online Bin Coloring. - Sven Oliver Krumke; Willem de Paepe; Jörg Rambau; Leen Stougie (ESA, 2001)

Multiple Hotlink Assignment. - Sven Fuhrmann; Sven Oliver Krumke; Hans-Christoph Wirth (WG, 2001)

Euler is standing in line dial-a-ride problems with precedence-constraints. - Dietrich Hauptmeier; Sven Oliver Krumke; Jörg Rambau; Hans-Christoph Wirth (Discret. Appl. Math., 2001)

Upgrading bottleneck constrained forests. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; S. S. Ravi; Hans-Christoph Wirth (Discret. Appl. Math., 2001)

The Online TSP Against Fair Adversaries. - Michiel Blom; Sven Oliver Krumke; Willem de Paepe; Leen Stougie (INFORMS J. Comput., 2001)

Models and Approximation Algorithms for Channel Assignment in Radio Networks. - Sven Oliver Krumke; Madhav V. Marathe; S. S. Ravi (Wirel. Networks, 2001)

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. - Sven Oliver Krumke; Luigi Laura; Maarten Lipmann; Alberto Marchetti-Spaccamela; Willem de Paepe; Diana Poensgen; Leen Stougie (APPROX, 2002)

Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows. - Sven Oliver Krumke; Jörg Rambau; Luis Miguel Torres (ESA, 2002)

Online-Dispatching of Automobile Service Units. - Martin Grötschel; Sven Oliver Krumke; Jörg Rambau; Luis Miguel Torres (OR, 2002)

How to cut a cake almost fairly. - Sven Oliver Krumke; Maarten Lipmann; Willem de Paepe; Diana Poensgen; Jörg Rambau; Leen Stougie; Gerhard J. Woeginger (SODA, 2002)

Budgeted Maximum Graph Coverage. - Sven Oliver Krumke; Madhav V. Marathe; Diana Poensgen; S. S. Ravi; Hans-Christoph Wirth (WG, 2002)

Online Call Admission in Optical Networks with Larger Demands. - Sven Oliver Krumke; Diana Poensgen (WG, 2002)

Topology Control Problems under Symmetric and Asymmetric Power Thresholds. - Sven Oliver Krumke; Rui Liu 001; Errol L. Lloyd; Madhav V. Marathe; Ram Ramanathan; S. S. Ravi (ADHOC-NOW, 2003)

How to Whack Moles. - Sven Oliver Krumke; Nicole Megow; Tjark Vredeveld (WAOA, 2003)

News from the online traveling repairman. - Sven Oliver Krumke; Willem de Paepe; Diana Poensgen; Leen Stougie (Theor. Comput. Sci., 2003)

Budget constrained minimum cost connected medians. - Goran Konjevod; Sven Oliver Krumke; Madhav V. Marathe (J. Discrete Algorithms, 2004)

Deterministic Online Optical Call Admission Revisited. - Elisabeth Gassner; Sven Oliver Krumke (WAOA, 2005)

The Online Target Date Assignment Problem. - Stefan Heinz 001; Sven Oliver Krumke; Nicole Megow; Jörg Rambau; Andreas Tuchscherer; Tjark Vredeveld (WAOA, 2005)

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem. - Sven Oliver Krumke; Willem de Paepe; Diana Poensgen; Maarten Lipmann; Alberto Marchetti-Spaccamela; Leen Stougie (WAOA, 2005)

A Hard Dial-a-Ride Problem that is Easy on Average. - Amin Coja-Oghlan; Sven Oliver Krumke; Till Nierhoff (J. Sched., 2005)

Reoptimization gaps versus model errors in online-dispatching of service units for ADAC. - Benjamin Hiller; Sven Oliver Krumke; Jörg Rambau (Discret. Appl. Math., 2006)

Online-Optimization of Large-Scale Vehicle Dispatching Problems. - Sleman Saliba; Sven Oliver Krumke; Stephan Westphal (Electron. Notes Discret. Math., 2006)

Competitive Algorithms for Cottage Rental. - Stephan Westphal; Sven Oliver Krumke; Rob van Stee (Electron. Notes Discret. Math., 2006)

A heuristic for the Stacker Crane Problem on trees which is almost surely exact. - Amin Coja-Oghlan; Sven Oliver Krumke; Till Nierhoff (J. Algorithms, 2006)

How to whack moles. - Sandra Gutiérrez; Sven Oliver Krumke; Nicole Megow; Tjark Vredeveld (Theor. Comput. Sci., 2006)

Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]. - Sven Oliver Krumke; Willem de Paepe; Diana Poensgen; Leen Stougie (Theor. Comput. Sci., 2006)

Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. - Sven Oliver Krumke; Peter Merz; Tim Nonner; Katharina Rupp (OPODIS, 2007)

Referee report on the book titled "Production planning by mixed integer programming". - Sven Oliver Krumke; Elena O. Gavriliouk (Math. Methods Oper. Res., 2007)

Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. - Kerstin Bauer; Thomas Fischer 003; Sven Oliver Krumke; Katharina Gerhardt; Stephan Westphal; Peter Merz (EvoCOP, 2008)

A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints. - Clemens Thielen; Sven Oliver Krumke (WAOA, 2008)

Pruning in column generation for service vehicle dispatching. - Stephan Westphal; Sven Oliver Krumke (Ann. Oper. Res., 2008)

Semi-preemptive routing on trees. - Sven Oliver Krumke; Dirk Räbiger; Rainer Schrader (Discret. Appl. Math., 2008)

Approximation algorithms for a vehicle routing problem. - Sven Oliver Krumke; Sleman Saliba; Tjark Vredeveld; Stephan Westphal (Math. Methods Oper. Res., 2008)

A monotone approximation algorithm for scheduling with precedence constraints. - Sven Oliver Krumke; Anne Schwahn; Rob van Stee; Stephan Westphal (Oper. Res. Lett., 2008)

Bincoloring. - Sven Oliver Krumke; Willem de Paepe; Jörg Rambau; Leen Stougie (Theor. Comput. Sci., 2008)

Graphentheoretische Konzepte und Algorithmen, 2. Auflage. - Sven Oliver Krumke; Hartmut Noltemeier (Teubner, 2009)

Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2. - Birgit Engels; Sven Oliver Krumke; Rainer Schrader; Christiane Zeck (CTW, 2009)

Complexity of Strong Implementability - Clemens Thielen; Sven Oliver Krumke (ACAC, 2009)

New lower bounds for online k-server routing problems. - Irene Fink; Sven Oliver Krumke; Stephan Westphal (Inf. Process. Lett., 2009)

How hard is it to find extreme Nash equilibria in network congestion games? - Elisabeth Gassner; Johannes Hatzl; Sven Oliver Krumke; Heike Sperber; Gerhard J. Woeginger (Theor. Comput. Sci., 2009)

clever or smart: Strategies for the online target date assignment problem. - Elisabeth Gassner; Johannes Hatzl; Sven Oliver Krumke; Sleman Saliba (Discret. Appl. Math., 2010)

MIP Formulations for Flowshop Scheduling with Limited Buffers. - Janick V. Frasch; Sven Oliver Krumke; Stephan Westphal (TAPAS, 2011)

Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. - Sven Oliver Krumke; Alfred Taudes; Stephan Westphal (Comput. Oper. Res., 2011)

Interval scheduling on related machines. - Sven Oliver Krumke; Clemens Thielen; Stephan Westphal (Comput. Oper. Res., 2011)

Minimum cost flows with minimum quantities. - Sven Oliver Krumke; Clemens Thielen (Inf. Process. Lett., 2011)

Selfish bin coloring. - Leah Epstein; Sven Oliver Krumke; Asaf Levin; Heike Sperber (J. Comb. Optim., 2011)

Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization. - Sven Oliver Krumke; Clemens Thielen; Christiane Zeck (Math. Methods Oper. Res., 2011)

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. - Clemens Thielen; Sven Oliver Krumke (Theory Comput. Syst., 2011)

Optimierte Abstimmung der Umsteigebeziehungenim ungetakteten ÖPNV unter Berücksichtigung der Umlaufplanung. - Neele Leithäuser; Ingmar Schüle; Sven O. Krumke (MKWI, 2012)

Approximating Infeasible 2VPI-Systems. - Neele Leithäuser; Sven Oliver Krumke; Maximilian Merkert (WG, 2012)

Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]. - Sven Oliver Krumke; Clemens Thielen (Inf. Process. Lett., 2012)

Online Job Admission. - Sven O. Krumke; Rob van Stee; Stephan Westphal (Fundamental Problems in Computing, 2013)

Generalized max flow in series-parallel graphs. - Sven Oliver Krumke; Christiane Zeck (Discret. Optim., 2013)

Models and Algorithms for Carsharing Systems and Related Problems. - Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (Electron. Notes Discret. Math., 2013)

The generalized assignment problem with minimum quantities. - Sven Oliver Krumke; Clemens Thielen (Eur. J. Oper. Res., 2013)

Online delay management on a single train line: beyond competitive analysis. - Marco Bender; Sabine Büttner; Sven O. Krumke (Public Transp., 2013)

Being Negative Makes Life NP-hard (for Product Sellers). - Sven Oliver Krumke; Florian D. Schwahn; Clemens Thielen (FUN, 2014)

Relocation in Carsharing Systems Using Flows in Time-Expanded Networks. - Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (SEA, 2014)

Computation of equilibria and the price of anarchy in bottleneck congestion games. - Thomas L. Werth; Heike Sperber; Sven Oliver Krumke (Central Eur. J. Oper. Res., 2014)

ReOpt: an Algorithm with a Quality Guaranty for Solving the Static Relocation Problem. - Sahar Bsaybes; Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (CoRR, 2015)

Convex generalized flows. - Michael Holzhauser; Sven Oliver Krumke; Clemens Thielen (Discret. Appl. Math., 2015)

On the Online Min-Wait Relocation Problem. - Pascal Halffmann; Sven O. Krumke; Alain Quilliot; Annegret Katrin Wagler; Jan-Thierry Wegener (Electron. Notes Discret. Math., 2015)

Robust bottleneck routing games. - Thomas L. Werth; Sabine Büttner; Sven Oliver Krumke (Networks, 2015)

ConGen: An Application Specific DRAM Memory Controller Generator. - Matthias Jung 001; Deepak M. Mathew; Christian Weis; Norbert Wehn; Irene Heinrich; Marco V. Natale; Sven O. Krumke (MEMSYS, 2016)

The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation. - Sabine Büttner; Sven O. Krumke (J. Comb. Optim., 2016)

Budget-constrained minimum cost flows. - Michael Holzhauser; Sven Oliver Krumke; Clemens Thielen (J. Comb. Optim., 2016)

Capacitated network design games with weighted players. - André B. Chassein; Sven O. Krumke; Clemens Thielen (Networks, 2016)

An FPTAS for the Knapsack Problem with Parametric Weights. - Michael Holzhauser; Sven Oliver Krumke (CoRR, 2017)

A network simplex method for the budget-constrained minimum cost flow problem. - Michael Holzhauser; Sven O. Krumke; Clemens Thielen (Eur. J. Oper. Res., 2017)

An FPTAS for the parametric knapsack problem. - Michael Holzhauser; Sven O. Krumke (Inf. Process. Lett., 2017)

On the complexity and approximability of budget-constrained minimum cost flows. - Michael Holzhauser; Sven O. Krumke; Clemens Thielen (Inf. Process. Lett., 2017)

Maximum flows in generalized processing networks. - Michael Holzhauser; Sven O. Krumke; Clemens Thielen (J. Comb. Optim., 2017)

Validating Measurement Data in Manufacturing Processes. - David Brück; Sven Oliver Krumke (OR, 2018)

Simultaneous Dominating Set for Spanning Tree Factorings. - Sebastian S. Johann; Sven O. Krumke; Manuel Streicher (CoRR, 2018)

A generalized approximation framework for fractional network flow and packing problems. - Michael Holzhauser; Sven O. Krumke (Math. Methods Oper. Res., 2018)

An FPTAS for the knapsack problem with parametric weights. - Nir Halman; Michael Holzhauser; Sven O. Krumke (Oper. Res. Lett., 2018)

The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs. - Luca E. Schäfer; Tobias Dietz; Marco V. Natale; Stefan Ruzika; Sven O. Krumke; Carlos M. Fonseca (OR, 2019)

Robust multicovers with budgeted uncertainty. - Sven O. Krumke; Eva Schmidt; Manuel Streicher (Eur. J. Oper. Res., 2019)

Full implementation of social choice functions in dominant strategies. - Sven O. Krumke; Clemens Thielen; Philipp Weinschenk; Stephan Westphal (Int. J. Game Theory, 2019)

Efficient Generation of Application Specific Memory Controllers. - Marco V. Natale; Matthias Jung 001; Kira Kraft; Frederik Lauer; Johannes Feldmann; Chirag Sudarshan; Christian Weis; Sven Oliver Krumke; Norbert Wehn (MEMSYS, 2020)

On the Bicriterion Maximum Flow Network Interdiction Problem. - Luca E. Schäfer; Stefan Ruzika; Sven O. Krumke; Carlos M. Fonseca (CoRR, 2020)

Robust single machine makespan scheduling with release date uncertainty. - Oliver Bachtler; Sven O. Krumke; Le Huy Minh (Oper. Res. Lett., 2020)

Robust absolute single machine makespan scheduling-location problem on trees. - Sven O. Krumke; Le Huy Minh (Oper. Res. Lett., 2020)

Scheduling a proportionate flow shop of batching machines. - Christoph Hertrich; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich; Sven O. Krumke (J. Sched., 2020)

On the Connection between Individual Scaled Vickrey Payments and the Egalitarian Allocation. - Niklas Gräf; Till Heller; Sven O. Krumke (CoRR, 2021)

The Reward-Penalty-Selection Problem. - Till Heller; Sven O. Krumke; Karl-Heinz Küfer (CoRR, 2021)

Computing the egalitarian allocation with network flows. - Till Heller; Sven Oliver Krumke (CoRR, 2021)

Robust flows with adaptive mitigation. - Heiner Ackermann; Erik Diessel; Sven O. Krumke (EURO J. Comput. Optim., 2021)

Local Certification of Reachability. - Oliver Bachtler; Tim Bergner; Sven O. Krumke (INOC, 2022)

A Bicriteria Almost Equal Minimum Cost Flow Model for Day-Ahead Trading. - Elisabeth Finhold; Till Heller; Sven O. Krumke; Neele Leithäuser (OR, 2022)

Towards Obtaining a 3-Decomposition From a Perfect Matching. - Oliver Bachtler; Sven O. Krumke (Electron. J. Comb., 2022)

On Reward-Penalty-Selection Games. - Niklas Gräf; Till Heller; Sven O. Krumke (CoRR, 2022)

Simultaneously dominating all spanning trees of a graph. - Sebastian S. Johann; Sven O. Krumke; Manuel Streicher (Electron. J. Graph Theory Appl., 2022)

Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. - 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; et al. (BMC Medical Informatics Decis. Mak., 2022)

2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem. - Sven O. Krumke; Le Huy Minh (Oper. Res. Lett., 2022)

Online algorithms to schedule a proportionate flexible flow shop of batching machines. - Christoph Hertrich; Christian Weiß 003; Heiner Ackermann; Sandy Heydrich; Sven O. Krumke (J. Sched., 2022)

QCEDA: Using Quantum Computers for EDA. - Matthias Jung 001; Sven O. Krumke; Christof Schroth; Elisabeth Lobe; Wolfgang Mauerer (SAMOS, 2024)

On the mixed connectivity conjecture of Beineke and Harary. - Sebastian S. Johann; Sven O. Krumke; Manuel Streicher (Ann. Oper. Res., 2024)

Almost disjoint paths and separating by forbidden pairs. - Oliver Bachtler; Tim Bergner; Sven O. Krumke (Theor. Comput. Sci., 2024)

Algorithms and complexity for the almost equal maximum flow problem. - Rebekka Haese; Till Heller; Sven O. Krumke (Networks, 2024)

Online delay management on a single train line with predictions. - Daniel Eichhorn; Sven O. Krumke (Inf. Process. Lett., 2025)

On approximating partial scenario set cover. - Shai Michael Dimant; Sven O. Krumke (Theor. Comput. Sci., 2025)

On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning. - Shai Michael Dimant; Sven O. Krumke (Networks, 2025)