The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sven Oliver Krumke: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2003, pp:187-198 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:200-214 [Conf]
  3. Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau
    The Online Dial-a-Ride Problem under Reasonable Load. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:125-136 [Conf]
  4. Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie
    The Online-TSP against Fair Adversaries. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:137-149 [Conf]
  5. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Compact Location Problems with Budget and Communication Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:510-519 [Conf]
  6. Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie
    Online Bin Coloring. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:74-85 [Conf]
  7. Sven Oliver Krumke, Jörg Rambau, Luis Torres
    Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:637-648 [Conf]
  8. Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:238-247 [Conf]
  9. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:281-291 [Conf]
  10. Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
    A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:605-614 [Conf]
  11. Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie
    News from the Online Traveling Repairman. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:487-499 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:263-264 [Conf]
  13. Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau
    Online Dial-a-Ride Problems: Minimizing the Completion Time. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:639-650 [Conf]
  14. Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld
    How to Whack Moles. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:192-205 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:258-269 [Conf]
  16. Elisabeth Gassner, Sven Oliver Krumke
    Deterministic Online Optical Call Admission Revisited. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:190-202 [Conf]
  17. Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld
    The Online Target Date Assignment Problem. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:230-243 [Conf]
  18. Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth
    Multiple Hotlink Assignment. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:189-200 [Conf]
  19. Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
    Euler is Standing in Line. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:42-54 [Conf]
  20. Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
    Budget Constrained Minimum Cost Connected Medians. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:267-278 [Conf]
  21. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading Bottleneck Constrained Forests. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:215-226 [Conf]
  22. Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth
    Budgeted Maximum Graph Coverage. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:321-332 [Conf]
  23. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister
    Modifying Networks to Obtain Low Cost Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:293-307 [Conf]
  24. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Complexity and Approximability of Certain Bicriteria Location Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:73-87 [Conf]
  25. Sven Oliver Krumke, Diana Poensgen
    Online Call Admission in Optical Networks with Larger Demands. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:333-344 [Conf]
  26. Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
    Network Design and Improvement. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3es, pp:2- [Journal]
  27. Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
    Euler is standing in line dial-a-ride problems with precedence-constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:113, n:1, pp:87-107 [Journal]
  28. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading bottleneck constrained forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:129-142 [Journal]
  29. Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau
    Reoptimization gaps versus model errors in online-dispatching of service units for ADAC. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:13, pp:1897-1907 [Journal]
  30. Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie
    The Online TSP Against Fair Adversaries. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2001, v:13, n:2, pp:138-148 [Journal]
  31. Sven Oliver Krumke
    On a Generalization of the p-Center Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:2, pp:67-71 [Journal]
  32. Sven Oliver Krumke, Hans-Christoph Wirth
    On the Minimum Label Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:2, pp:81-85 [Journal]
  33. S. Schwarz, Sven Oliver Krumke
    On Budget-Constrained Flow Improvement. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:6, pp:291-297 [Journal]
  34. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:92-111 [Journal]
  35. Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
    A heuristic for the Stacker Crane Problem on trees which is almost surely exact. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:61, n:1, pp:1-19 [Journal]
  36. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
    Approximation Algorithms for Certain Network Improvement Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:3, pp:257-288 [Journal]
  37. Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe
    Budget constrained minimum cost connected medians. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:453-469 [Journal]
  38. Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff
    A Hard Dial-a-Ride Problem that is Easy on Average. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2005, v:8, n:3, pp:197-210 [Journal]
  39. Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
    Modifying Edges of a Network to Obtain Short Subgraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:91-121 [Journal]
  40. Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld
    How to whack moles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:329-341 [Journal]
  41. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:379-404 [Journal]
  42. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:139-155 [Journal]
  43. Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie
    News from the online traveling repairman. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:279-294 [Journal]
  44. 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]. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:347-348 [Journal]
  45. Sven Oliver Krumke, Madhav V. Marathe, S. S. Ravi
    Models and Approximation Algorithms for Channel Assignment in Radio Networks. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2001, v:7, n:6, pp:575-584 [Journal]

  46. Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. [Citation Graph (, )][DBLP]


  47. Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. [Citation Graph (, )][DBLP]


  48. A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints. [Citation Graph (, )][DBLP]


  49. How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games? [Citation Graph (, )][DBLP]


  50. Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. [Citation Graph (, )][DBLP]


  51. Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2. [Citation Graph (, )][DBLP]


  52. Complexity of Strong Implementability [Citation Graph (, )][DBLP]


  53. Semi-preemptive routing on trees. [Citation Graph (, )][DBLP]


  54. clever or smart: Strategies for the online target date assignment problem. [Citation Graph (, )][DBLP]


Search in 0.112secs, Finished in 0.114secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002