The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andreas S. Schulz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein
    Improved Scheduling Algorithms for Minsum Criteria. [Citation Graph (1, 0)][DBLP]
    ICALP, 1996, pp:646-657 [Conf]
  2. Andreas S. Schulz
    New Old Algorithms for Stochastic Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  3. Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz
    Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:76-90 [Conf]
  4. Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
    Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:139-150 [Conf]
  5. Andreas S. Schulz, Martin Skutella
    Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:416-429 [Conf]
  6. Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler
    0/1-Integer Programming: Optimization and Augmentation are Equivalent. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:473-483 [Conf]
  7. José R. Correa, Andreas S. Schulz
    Single Machine Scheduling with Precedence Constraints: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:283-297 [Conf]
  8. José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
    Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:59-73 [Conf]
  9. José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
    On the Inefficiency of Equilibria in Congestion Games. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:167-181 [Conf]
  10. Friedrich Eisenbrand, Andreas S. Schulz
    Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:137-150 [Conf]
  11. Rudolf Müller, Andreas S. Schulz
    The Interval Order Polytope of a Digraph. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:50-64 [Conf]
  12. Rudolf Müller, Andreas S. Schulz
    Transitive Packing. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:430-444 [Conf]
  13. Alix Munier, Maurice Queyranne, Andreas S. Schulz
    Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:367-382 [Conf]
  14. Maurice Queyranne, Andreas S. Schulz
    Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:307-320 [Conf]
  15. Andreas S. Schulz
    Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:301-315 [Conf]
  16. Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
    Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:144-155 [Conf]
  17. Andreas S. Schulz, Martin Skutella
    Random-Based Scheduling: New Approximations and LP Lower Bounds. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:119-133 [Conf]
  18. James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
    Approximate local search in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:587-596 [Conf]
  19. Andreas S. Schulz, Nicolás E. Stier Moses
    On the performance of user equilibria in traffic networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:86-87 [Conf]
  20. Andreas S. Schulz, Robert Weismantel
    An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:967-968 [Conf]
  21. James B. Orlin, Andreas S. Schulz, Sudipta Sengupta
    epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:565-572 [Conf]
  22. Nicole Megow, Andreas S. Schulz
    Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:227-234 [Conf]
  23. Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
    Switchbox Routing in VLSI Design: Closing the Complexity Gap. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:196-210 [Conf]
  24. Nicole Immorlica, Li Li, Vahab S. Mirrokni, Andreas Schulz
    Coordination Mechanisms for Selfish Scheduling. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:55-69 [Conf]
  25. Juliane Dunkel, Andreas S. Schulz
    On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:62-73 [Conf]
  26. Friedrich Eisenbrand, Andreas S. Schulz
    Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2003, v:23, n:2, pp:245-261 [Journal]
  27. Annelie von Arnim, Andreas S. Schulz
    Facets of the Generalized Permutahedron of a Poset. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:72, n:1-2, pp:179-192 [Journal]
  28. Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz
    On the Chvátal Rank of Polytopes in the 0/1 Cube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:21-27 [Journal]
  29. Andreas S. Schulz
    The Permutahedron of Series-parallel Posets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:1, pp:85-90 [Journal]
  30. Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
    Approximation in stochastic scheduling: the power of LP-based priority policies. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:6, pp:924-942 [Journal]
  31. Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein
    Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:1, n:4, pp:413-426 [Journal]
  32. José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses
    Selfish Routing in Capacitated Networks. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:4, pp:961-976 [Journal]
  33. Andreas S. Schulz, Robert Weismantel
    The Complexity of Generic Primal Algorithms for Solving General Integer Programs. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2002, v:27, n:4, pp:681-692 [Journal]
  34. Rainer Schrader, Andreas S. Schulz, Georg Wambach
    Base polytopes of series-parallel posets: Linear description and optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:82, n:, pp:159-173 [Journal]
  35. Andreas S. Schulz, Nicolás E. Stier Moses
    Efficiency and fairness of system-optimal routing with user constraints. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:48, n:4, pp:223-234 [Journal]
  36. Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz
    On project scheduling with irregular starting time costs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:28, n:4, pp:149-154 [Journal]
  37. Nicole Megow, Andreas S. Schulz
    On-line scheduling to minimize average completion time revisited. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:5, pp:485-490 [Journal]
  38. James B. Orlin, Abraham P. Punnen, Andreas S. Schulz
    Approximate Local Search in Combinatorial Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:5, pp:1201-1214 [Journal]
  39. Maurice Queyranne, Andreas S. Schulz
    Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1241-1253 [Journal]
  40. Michel X. Goemans, Maurice Queyranne, Andreas S. Schulz, Martin Skutella, Yaoguang Wang
    Single Machine Scheduling with Release Dates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:165-192 [Journal]
  41. Andreas S. Schulz, Martin Skutella
    Scheduling Unrelated Machines by Randomized Rounding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:450-469 [Journal]
  42. Stephan Hartmann, Markus W. Schäffter, Andreas S. Schulz
    Switchbox Routing in VLSI Design: Closing the Complexity Gap. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:31-49 [Journal]
  43. Andreas S. Schulz, Nelson A. Uhan
    Encouraging Cooperation in Sharing Supermodular Costs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:271-285 [Conf]

  44. A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. [Citation Graph (, )][DBLP]


  45. On the Rank of Cutting-Plane Proof Systems. [Citation Graph (, )][DBLP]


  46. Integer Programming: Optimization and Evaluation Are Equivalent. [Citation Graph (, )][DBLP]


  47. Stochastic Online Scheduling Revisited. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002