|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 19 occurrences of 15 keywords
|
|
|
|
|
Results
Found 69 publication records. Showing 69 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sven Oliver Krumke, Clemens Thielen |
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537].  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber |
Selfish bin coloring. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Clemens Thielen |
Minimum cost flows with minimum quantities. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Alfred Taudes, Stephan Westphal |
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines. |
Computers & OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Clemens Thielen, Stephan Westphal |
Interval scheduling on related machines. |
Computers & OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Thielen, Sven Oliver Krumke |
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Janick V. Frasch, Sven Oliver Krumke, Stephan Westphal |
MIP Formulations for Flowshop Scheduling with Limited Buffers. |
TAPAS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elisabeth Gassner, Johannes Hatzl, Sven Oliver Krumke, Sleman Saliba |
clever or smart: Strategies for the online target date assignment problem. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Irene Fink, Sven Oliver Krumke, Stephan Westphal |
New lower bounds for online k-server routing problems. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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? |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Thielen, Sven Oliver Krumke |
Complexity of Strong Implementability |
ACAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Thielen, Sven Oliver Krumke |
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
Nash flows, selfish routing, algorithmic mechanism design |
| 1 | Birgit Engels, Sven Oliver Krumke, Rainer Schrader, Christiane Zeck |
Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Anne Schwahn, Rob van Stee, Stephan Westphal |
A monotone approximation algorithm for scheduling with precedence constraints. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie |
Bincoloring. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Westphal, Sven Oliver Krumke |
Pruning in column generation for service vehicle dispatching. |
Annals OR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Dirk Räbiger, Rainer Schrader |
Semi-preemptive routing on trees. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
Network congestion game, makespan objective, extreme equilibria, complexity, unsplittable flow |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Thielen, Sven Oliver Krumke |
A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
Monotone algorithms, scheduling, precedence constraints, algorithmic mechanism design |
| 1 | Sven Oliver Krumke, Peter Merz, Tim Nonner, Katharina Rupp |
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. |
OPODIS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Westphal, Sven Oliver Krumke, Rob van Stee |
Competitive Algorithms for Cottage Rental. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sleman Saliba, Sven Oliver Krumke, Stephan Westphal |
Online-Optimization of Large-Scale Vehicle Dispatching Problems. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Gutiérrez, Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld |
How to whack moles. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A heuristic for the Stacker Crane Problem on trees which is almost surely exact. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau |
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Hard Dial-a-Ride Problem that is Easy on Average. |
J. Scheduling |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithm, NP-hard, average-case analysis |
| 1 | Elisabeth Gassner, Sven Oliver Krumke |
Deterministic Online Optical Call Admission Revisited. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Heinz, Sven Oliver Krumke, Nicole Megow, Jörg Rambau, Andreas Tuchscherer, Tjark Vredeveld |
The Online Target Date Assignment Problem. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe |
Budget constrained minimum cost connected medians. |
J. Discrete Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie |
News from the online traveling repairman. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 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. |
ADHOC-NOW |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Nicole Megow, Tjark Vredeveld |
How to Whack Moles. |
WAOA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Diana Poensgen |
Online Call Admission in Optical Networks with Larger Demands. |
WG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth |
Budgeted Maximum Graph Coverage. |
WG |
2002 |
DBLP DOI BibTeX RDF |
budgeted maximum coverage, approximation algorithm, integer linear programming, treewidth, maximum weight matching |
| 1 | Sven Oliver Krumke, Jörg Rambau, Luis Torres |
Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Madhav V. Marathe, S. S. Ravi |
Models and Approximation Algorithms for Channel Assignment in Radio Networks. |
Wireless Networks |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth |
Upgrading bottleneck constrained forests. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie |
The Online TSP Against Fair Adversaries. |
INFORMS Journal on Computing |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth |
Multiple Hotlink Assignment. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Willem de Paepe, Jörg Rambau, Leen Stougie |
Online Bin Coloring. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Willem de Paepe, Diana Poensgen, Leen Stougie |
News from the Online Traveling Repairman. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe |
Budget Constrained Minimum Cost Connected Medians. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau |
Online Dial-a-Ride Problems: Minimizing the Completion Time. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau |
The Online Dial-a-Ride Problem under Reasonable Load. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie |
The Online-TSP against Fair Adversaries. |
CIAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke |
Network Design and Improvement. |
ACM Comput. Surv. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth |
Euler is Standing in Line. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi |
Approximation Algorithms for Certain Network Improvement Problems. |
J. Comb. Optim. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Hans-Christoph Wirth |
On the Minimum Label Spanning Tree Problem. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Schwarz, Sven Oliver Krumke |
On Budget-Constrained Flow Improvement. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth |
Upgrading Bottleneck Constrained Forests. |
WG |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz |
Compact Location Problems. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister |
Modifying Networks to Obtain Low Cost Trees. |
WG |
1996 |
DBLP DOI BibTeX RDF |
Computational Complexity, Approximation Algorithms, NP-hardness, Location Theory, Parametric Search |
| 1 | Sven Oliver Krumke |
On a Generalization of the p-Center Problem. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe |
Complexity and Approximability of Certain Bicriteria Location Problems. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe |
Compact Location Problems with Budget and Communication Constraints. |
COCOON |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesh Radhakrishnan, Sven Oliver Krumke, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi |
Compact Location Problems. |
FSTTCS |
1993 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #69 of 69 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")