Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Krumke, Sven O."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Erratum to ``Minimum cost flows with minimum quantities''
Sven O. Krumke
,
Clemens Thielen
Information Processing Letters
112
(13), 2012, pp. 523-524
Approximating infeasible 2VPI-systems
Neele Leithäuser
,
Sven O. Krumke
,
Maximilian Merkert
Lecture Notes in Computer Science
7551
, 2012, pp. 225-236
Approximating infeasible 2VPI-systems
Neele Leithäuser
,
Sven O. Krumke
,
Maximilian Merkert
Lecture Notes in Computer Science
7551
, 2012, pp. 225-236
Minimum cost flows with minimum quantities
Sven O. Krumke
,
Clemens Thielen
Information Processing Letters
111
(11), 2011, pp. 533-537
Truthful mechanisms for selfish routing and two-parameter agents
Clemens Thielen
,
Sven O. Krumke
Theory of Computing Systems
49
(1), 2011, pp. 196-223
New lower bounds for online
k
-server routing problems
Irene Fink
,
Sven O. Krumke
,
Stephan Westphal
Information Processing Letters
109
(11), 2009, pp. 563-567
How hard is it to find extreme Nash equilibria in network congestion games?
Elisabeth Gassner
,
Johannes Hatzl
,
Sven O. Krumke
,
Heike Sperber
,
Gerhard J. Woeginger
Theoretical Computer Science
410
(47-49), 2009, pp. 4989-4999
Bincoloring
Sven O. Krumke
,
Willem E. de Paepe
,
Jörg Rambau
,
Leen Stougie
Theoretical Computer Science
407
(1-3), 2008, pp. 231-241
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Amin Coja-Oghlan
,
Sven O. Krumke
,
Till Nierhoff
Journal of Algorithms
61
(1), 2006, pp. 1-19
How to whack moles
Sandra Gutiérrez
,
Sven O. Krumke
,
Nicole Megow
,
Tjark Vredeveld
Theoretical Computer Science
361
(2-3), 2006, pp. 329-341
Erratum to ''News from the online traveling repairman''
Sven O. Krumke
,
Willem E. de Paepe
,
Diana Poensgen
,
Leen Stougie
Theoretical Computer Science
352
(1-3), 2006, pp. 347-348
A heuristic for the stacker crane problem on trees which is almost surely exact
Amin Coja-Oghlan
,
Sven O. Krumke
,
Till Nierhoff
Lecture Notes in Computer Science
2906
, 2003, pp. 605-614
News from the online Traveling Repairman
Sven O. Krumke
,
Willem E. de Paepe
,
Diana Poensgen
,
Leen Stougie
Theoretical Computer Science
295
(1-3), 2003, pp. 279-294
News from the online traveling repairman
Sven O. Krumke
,
Willem E. de Paepe
,
Diana Poensgen
,
Leen Stougie
Lecture Notes in Computer Science
2136
, 2001, pp. 487-499
Online bin coloring
Sven O. Krumke
,
Willem E. de Paepe
,
Jörg Rambau
,
Leen Stougie
Lecture Notes in Computer Science
2161
, 2001, pp. 74-85
Online dial-a-ride problems: Minimizing the completion time
Norbert Ascheuer
,
Sven O. Krumke
,
Jörg Rambau
Lecture Notes in Computer Science
1770
, 2000, pp. 639-650
The online-TSP against fair adversaries
Michiel Blom
,
Sven O. Krumke
,
Willem de Paepe
,
Leen Stougie
Lecture Notes in Computer Science
1767
, 2000, pp. 137-149
The online dial-a-ride problem under reasonable load
Dietrich Hauptmeier
,
Sven O. Krumke
,
Jörg Rambau
Lecture Notes in Computer Science
1767
, 2000, pp. 125-136
Budget constrained minimum cost connected medians
Goran Konjevod
,
Sven O. Krumke
,
Madhav Marathe
Lecture Notes in Computer Science
1928
, 2000, pp. 267-278
Improving spanning trees by upgrading nodes
Sven O. Krumke
,
Hartmut Noltemeier
,
Hans-C. Wirth
,
Madhav V. Marathe
,
R. Ravi
,
S.S. Ravi
,
R. Sundaram
Theoretical Computer Science
221
(1-2), 1999, pp. 139-155
Modifying edges of a network to obtain short subgraphs
Kay U. Drangmeister
,
Sven O. Krumke
,
Madhav V. Marathe
,
Hartmut Noltemeier
,
S.S. Ravi
Theoretical Computer Science
203
(1), 1998, pp. 91-121
On the minimum label spanning tree problem
Sven O. Krumke
,
Hans-Christoph Wirth
Information Processing Letters
66
(2), 1998, pp. 81-85
Compact location problems
Venkatesh Radhakrishnan
,
Sven O. Krumke
,
Madhav V. Marathe
,
Daniel J. Rosenkrantz
,
S.S. Ravi
Lecture Notes in Computer Science
761
, 1993, pp. 238-247