| 2008 |
|---|
| 56 | EE | Kerstin Bauer,
Thomas Fischer,
Sven Oliver Krumke,
Katharina Gerhardt,
Stephan Westphal,
Peter Merz:
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.
EvoCOP 2008: 158-169 |
| 55 | EE | Clemens Thielen,
Sven Oliver Krumke:
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.
WAOA 2008: 105-118 |
| 54 | EE | Elisabeth Gassner,
Johannes Hatzl,
Sven Oliver Krumke,
Heike Sperber,
Gerhard J. Woeginger:
How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?
WINE 2008: 82-93 |
| 53 | EE | Stephan Westphal,
Sven Oliver Krumke:
Pruning in column generation for service vehicle dispatching.
Annals OR 159(1): 355-371 (2008) |
| 52 | EE | Sven Oliver Krumke,
Dirk Räbiger,
Rainer Schrader:
Semi-preemptive routing on trees.
Discrete Applied Mathematics 156(17): 3298-3304 (2008) |
| 51 | EE | Sven Oliver Krumke,
Anne Schwahn,
Rob van Stee,
Stephan Westphal:
A monotone approximation algorithm for scheduling with precedence constraints.
Oper. Res. Lett. 36(2): 247-249 (2008) |
| 50 | EE | Sven Oliver Krumke,
Willem de Paepe,
Jörg Rambau,
Leen Stougie:
Bincoloring.
Theor. Comput. Sci. 407(1-3): 231-241 (2008) |
| 2007 |
|---|
| 49 | EE | Sven Oliver Krumke,
Peter Merz,
Tim Nonner,
Katharina Rupp:
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.
OPODIS 2007: 159-173 |
| 2006 |
|---|
| 48 | EE | Benjamin Hiller,
Sven Oliver Krumke,
Jörg Rambau:
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC.
Discrete Applied Mathematics 154(13): 1897-1907 (2006) |
| 47 | EE | Sleman Saliba,
Sven Oliver Krumke,
Stephan Westphal:
Online-Optimization of Large-Scale Vehicle Dispatching Problems.
Electronic Notes in Discrete Mathematics 25: 145-146 (2006) |
| 46 | EE | Stephan Westphal,
Sven Oliver Krumke,
Rob van Stee:
Competitive Algorithms for Cottage Rental.
Electronic Notes in Discrete Mathematics 25: 187-188 (2006) |
| 45 | EE | Amin Coja-Oghlan,
Sven Oliver Krumke,
Till Nierhoff:
A heuristic for the Stacker Crane Problem on trees which is almost surely exact.
J. Algorithms 61(1): 1-19 (2006) |
| 44 | EE | Sven Oliver Krumke,
Willem de Paepe,
Diana Poensgen,
Leen Stougie:
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294].
Theor. Comput. Sci. 352(1-3): 347-348 (2006) |
| 43 | EE | Sandra Gutiérrez,
Sven Oliver Krumke,
Nicole Megow,
Tjark Vredeveld:
How to whack moles.
Theor. Comput. Sci. 361(2-3): 329-341 (2006) |
| 2005 |
|---|
| 42 | EE | Elisabeth Gassner,
Sven Oliver Krumke:
Deterministic Online Optical Call Admission Revisited.
WAOA 2005: 190-202 |
| 41 | EE | Stefan Heinz,
Sven Oliver Krumke,
Nicole Megow,
Jörg Rambau,
Andreas Tuchscherer,
Tjark Vredeveld:
The Online Target Date Assignment Problem.
WAOA 2005: 230-243 |
| 40 | EE | Sven Oliver Krumke,
Willem de Paepe,
Diana Poensgen,
Maarten Lipmann,
Alberto Marchetti-Spaccamela,
Leen Stougie:
On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.
WAOA 2005: 258-269 |
| 39 | EE | Amin Coja-Oghlan,
Sven Oliver Krumke,
Till Nierhoff:
A Hard Dial-a-Ride Problem that is Easy on Average.
J. Scheduling 8(3): 197-210 (2005) |
| 2004 |
|---|
| 38 | EE | Benjamin Hiller,
Sven Oliver Krumke,
Jörg Rambau:
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC.
Electronic Notes in Discrete Mathematics 18: 157-163 (2004) |
| 37 | EE | Goran Konjevod,
Sven Oliver Krumke,
Madhav V. Marathe:
Budget constrained minimum cost connected medians.
J. Discrete Algorithms 2(4): 453-469 (2004) |
| 2003 |
|---|
| 36 | EE | Sven Oliver Krumke,
Rui Liu,
Errol L. Lloyd,
Madhav V. Marathe,
Ram Ramanathan,
S. S. Ravi:
Topology Control Problems under Symmetric and Asymmetric Power Thresholds.
ADHOC-NOW 2003: 187-198 |
| 35 | EE | Amin Coja-Oghlan,
Sven Oliver Krumke,
Till Nierhoff:
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact.
ISAAC 2003: 605-614 |
| 34 | EE | Sven Oliver Krumke,
Nicole Megow,
Tjark Vredeveld:
How to Whack Moles.
WAOA 2003: 192-205 |
| 33 | EE | Sven Oliver Krumke,
Willem de Paepe,
Diana Poensgen,
Leen Stougie:
News from the online traveling repairman.
Theor. Comput. Sci. 295: 279-294 (2003) |
| 2002 |
|---|
| 32 | EE | Sven Oliver Krumke,
Luigi Laura,
Maarten Lipmann,
Alberto Marchetti-Spaccamela,
Willem de Paepe,
Diana Poensgen,
Leen Stougie:
Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
APPROX 2002: 200-214 |
| 31 | EE | Sven Oliver Krumke,
Jörg Rambau,
Luis Torres:
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows.
ESA 2002: 637-648 |
| 30 | EE | Sven Oliver Krumke,
Maarten Lipmann,
Willem de Paepe,
Diana Poensgen,
Jörg Rambau,
Leen Stougie,
Gerhard J. Woeginger:
How to cut a cake almost fairly.
SODA 2002: 263-264 |
| 29 | EE | Sven Oliver Krumke,
Madhav V. Marathe,
Diana Poensgen,
S. S. Ravi,
Hans-Christoph Wirth:
Budgeted Maximum Graph Coverage.
WG 2002: 321-332 |
| 28 | EE | Sven Oliver Krumke,
Diana Poensgen:
Online Call Admission in Optical Networks with Larger Demands.
WG 2002: 333-344 |
| 2001 |
|---|
| 27 | EE | Sven Oliver Krumke,
Willem de Paepe,
Jörg Rambau,
Leen Stougie:
Online Bin Coloring.
ESA 2001: 74-85 |
| 26 | EE | Sven Oliver Krumke,
Willem de Paepe,
Diana Poensgen,
Leen Stougie:
News from the Online Traveling Repairman.
MFCS 2001: 487-499 |
| 25 | EE | Sven Fuhrmann,
Sven Oliver Krumke,
Hans-Christoph Wirth:
Multiple Hotlink Assignment.
WG 2001: 189-200 |
| 24 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi,
Hans-Christoph Wirth:
Upgrading bottleneck constrained forests.
Discrete Applied Mathematics 108(1-2): 129-142 (2001) |
| 23 | | Dietrich Hauptmeier,
Sven Oliver Krumke,
Jörg Rambau,
Hans-Christoph Wirth:
Euler is standing in line dial-a-ride problems with precedence-constraints.
Discrete Applied Mathematics 113(1): 87-107 (2001) |
| 22 | EE | Michiel Blom,
Sven Oliver Krumke,
Willem de Paepe,
Leen Stougie:
The Online TSP Against Fair Adversaries.
INFORMS Journal on Computing 13(2): 138-148 (2001) |
| 21 | | Sven Oliver Krumke,
Madhav V. Marathe,
S. S. Ravi:
Models and Approximation Algorithms for Channel Assignment in Radio Networks.
Wireless Networks 7(6): 575-584 (2001) |
| 2000 |
|---|
| 20 | EE | Dietrich Hauptmeier,
Sven Oliver Krumke,
Jörg Rambau:
The Online Dial-a-Ride Problem under Reasonable Load.
CIAC 2000: 125-136 |
| 19 | EE | Michiel Blom,
Sven Oliver Krumke,
Willem de Paepe,
Leen Stougie:
The Online-TSP against Fair Adversaries.
CIAC 2000: 137-149 |
| 18 | EE | Norbert Ascheuer,
Sven Oliver Krumke,
Jörg Rambau:
Online Dial-a-Ride Problems: Minimizing the Completion Time.
STACS 2000: 639-650 |
| 17 | EE | Goran Konjevod,
Sven Oliver Krumke,
Madhav V. Marathe:
Budget Constrained Minimum Cost Connected Medians.
WG 2000: 267-278 |
| 1999 |
|---|
| 16 | EE | Dietrich Hauptmeier,
Sven Oliver Krumke,
Jörg Rambau,
Hans-Christoph Wirth:
Euler is Standing in Line.
WG 1999: 42-54 |
| 15 | EE | Hartmut Noltemeier,
Hans-Christoph Wirth,
Sven Oliver Krumke:
Network Design and Improvement.
ACM Comput. Surv. 31(3es): 2 (1999) |
| 14 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms 33(1): 92-111 (1999) |
| 13 | EE | Sven Oliver Krumke,
Hartmut Noltemeier,
Madhav V. Marathe,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci. 221(1-2): 139-155 (1999) |
| 1998 |
|---|
| 12 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi,
Hans-Christoph Wirth:
Upgrading Bottleneck Constrained Forests.
WG 1998: 215-226 |
| 11 | EE | Sven Oliver Krumke,
Hans-Christoph Wirth:
On the Minimum Label Spanning Tree Problem.
Inf. Process. Lett. 66(2): 81-85 (1998) |
| 10 | EE | S. Schwarz,
Sven Oliver Krumke:
On Budget-Constrained Flow Improvement.
Inf. Process. Lett. 66(6): 291-297 (1998) |
| 9 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi:
Approximation Algorithms for Certain Network Improvement Problems.
J. Comb. Optim. 2(3): 257-288 (1998) |
| 8 | EE | Kay U. Drangmeister,
Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
S. S. Ravi:
Modifying Edges of a Network to Obtain Short Subgraphs.
Theor. Comput. Sci. 203(1): 91-121 (1998) |
| 1997 |
|---|
| 7 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes.
ICALP 1997: 281-291 |
| 6 | EE | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
Venkatesh Radhakrishnan,
S. S. Ravi,
Daniel J. Rosenkrantz:
Compact Location Problems.
Theor. Comput. Sci. 181(2): 379-404 (1997) |
| 1996 |
|---|
| 5 | | Sven Oliver Krumke,
Hartmut Noltemeier,
Madhav V. Marathe,
S. S. Ravi,
Kay U. Drangmeister:
Modifying Networks to Obtain Low Cost Trees.
WG 1996: 293-307 |
| 1995 |
|---|
| 4 | | Sven Oliver Krumke,
Hartmut Noltemeier,
S. S. Ravi,
Madhav V. Marathe:
Compact Location Problems with Budget and Communication Constraints.
COCOON 1995: 510-519 |
| 3 | | Sven Oliver Krumke,
Hartmut Noltemeier,
S. S. Ravi,
Madhav V. Marathe:
Complexity and Approximability of Certain Bicriteria Location Problems.
WG 1995: 73-87 |
| 2 | EE | Sven Oliver Krumke:
On a Generalization of the p-Center Problem.
Inf. Process. Lett. 56(2): 67-71 (1995) |
| 1993 |
|---|
| 1 | | Venkatesh Radhakrishnan,
Sven Oliver Krumke,
Madhav V. Marathe,
Daniel J. Rosenkrantz,
S. S. Ravi:
Compact Location Problems.
FSTTCS 1993: 238-247 |
