SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Guido Schäfer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP]
Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
Guido Schäfer, Naveen Sivadasan
Topology Matters: Smoothed Competitiveness of Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis
An Experimental Study of Dynamic Algorithms for Directed Graphs. [Citation Graph (0, 0)][DBLP]
ESA, 1998, pp:368-380 [Conf]
Kurt Mehlhorn, Guido Schäfer
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. [Citation Graph (0, 0)][DBLP]
ESA, 2001, pp:242-253 [Conf]
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. [Citation Graph (0, 0)][DBLP]
FOCS, 2003, pp:462-471 [Conf]
Jochen Könemann, Stefano Leonardi, Guido Schäfer, Stefan van Zwam
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem. [Citation Graph (0, 0)][DBLP]
ICALP, 2005, pp:930-942 [Conf]
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer
Scheduling to Minimize Flow Time Metrics. [Citation Graph (0, 0)][DBLP]
IPDPS, 2003, pp:223- [Conf]
Stefano Leonardi, Guido Schäfer
Cross-monotonic cost-sharing methods for connected facility location games. [Citation Graph (0, 0)][DBLP]
ACM Conference on Electronic Commerce, 2004, pp:242-243 [Conf]
Jochen Könemann, Stefano Leonardi, Guido Schäfer
A group-strategyproof mechanism for Steiner forests. [Citation Graph (0, 0)][DBLP]
SODA, 2005, pp:612-619 [Conf]
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
STACS, 2004, pp:81-92 [Conf]
Guido Schäfer, Naveen Sivadasan
Topology Matters: Smoothed Competitiveness of Metrical Task Systems. [Citation Graph (0, 0)][DBLP]
STACS, 2004, pp:489-500 [Conf]
Janina Brenner, Guido Schäfer
Cost Sharing Methods for Makespan and Completion Time Scheduling. [Citation Graph (0, 0)][DBLP]
STACS, 2007, pp:670-681 [Conf]
Lisa Fleischer, Jochen Könemann, Stefano Leonardi, Guido Schäfer
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree. [Citation Graph (0, 0)][DBLP]
STOC, 2006, pp:663-670 [Conf]
Kurt Mehlhorn, Guido Schäfer
Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures. [Citation Graph (0, 0)][DBLP]
Algorithm Engineering, 2000, pp:23-38 [Conf]
Holger Bast, Kurt Mehlhorn, Guido Schäfer
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2003, v:36, n:1, pp:75-88 [Journal]
Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan
All-pairs shortest-paths computation in the presence of negative cycles. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2002, v:81, n:6, pp:341-343 [Journal]
Kurt Mehlhorn, Guido Schäfer
Implementation of O(n m log n) Weighted Matchings in General Graphs: The Power of Data Structures. [Citation Graph (0, 0)][DBLP]
ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:4- [Journal]
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2006, v:39, n:1, pp:3-14 [Journal]
Stefano Leonardi, Guido Schäfer
Cross-monotonic cost sharing methods for connected facility location games. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2004, v:326, n:1-3, pp:431-442 [Journal]
Guido Schäfer, Naveen Sivadasan
Topology matters: Smoothed competitiveness of metrical task systems. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:341, n:1-3, pp:216-246 [Journal]
Felix G. König, Macro Lübbecke, Rolf Möhring, Guido Schäfer, Ines Spenke
Solutions to Real-World Instances of PSPACE-Complete Stacking. [Citation Graph (0, 0)][DBLP]
ESA, 2007, pp:729-740 [Conf]
Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. [Citation Graph (0, 0)][DBLP]
SODA, 2007, pp:1153-1162 [Conf]
Online Cooperative Cost Sharing. [Citation Graph (, )][DBLP]
Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle. [Citation Graph (, )][DBLP]
Approximating connected facility location problems via random facility sampling and core detouring. [Citation Graph (, )][DBLP]
Stackelberg Routing in Arbitrary Networks. [Citation Graph (, )][DBLP]
Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.303secs

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