| 2025 | FAW | Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model. | Felix Buld, Andreas S. Schulz |
| 2019 | WAOA | Precedence-Constrained Scheduling and Min-Sum Set Cover. | Felix Happach, Andreas S. Schulz |
| 2016 | ESA | Min-Sum Scheduling Under Precedence Constraints. | Andreas S. Schulz, Jos Verschae |
| 2016 | IPCO | Robust Monotone Submodular Function Maximization. | James B. Orlin, Andreas S. Schulz, Rajan Udwani |
| 2011 | ESA | Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. | Andreas S. Schulz, Claudio Telha |
| 2010 | IPCO | On the Rank of Cutting-Plane Proof Systems. | Sebastian Pokutta, Andreas S. Schulz |
| 2009 | WADS | Integer Programming: Optimization and Evaluation Are Equivalent. | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
| 2008 | COCOA | Stochastic Online Scheduling Revisited. | Andreas S. Schulz |
| 2005 | IPCO | On the Inefficiency of Equilibria in Congestion Games. | Jos R. Correa, Andreas S. Schulz, Nicols E. Stier Moses |
| 2004 | IPCO | Single Machine Scheduling with Precedence Constraints: Extended Abstract. | Jos R. Correa, Andreas S. Schulz |
| 2004 | IPCO | Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. | Jos R. Correa, Andreas S. Schulz, Nicols E. Stier Moses |
| 2004 | SODA | Approximate local search in combinatorial optimization. | James B. Orlin, Abraham P. Punnen, Andreas S. Schulz |
| 2003 | SODA | On the performance of user equilibria in traffic networks. | Andreas S. Schulz, Nicols E. Stier Moses |
| 2003 | WAOA | Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms. | Nicole Megow, Andreas S. Schulz |
| 2000 | STOC | epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract). | James B. Orlin, Andreas S. Schulz, Sudipta Sengupta |
| 1999 | ESA | Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. | Rolf H. Mhring, Andreas S. Schulz, Frederik Stork, Marc Uetz |
| 1999 | IPCO | Bounds on the Chvtal Rank of Polytopes in the 0/1-Cube. | Friedrich Eisenbrand, Andreas S. Schulz |
| 1999 | SODA | An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming. | Andreas S. Schulz, Robert Weismantel |
| 1998 | IPCO | Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems. | Alix Munier, Maurice Queyranne, Andreas S. Schulz |
| 1997 | ESA | Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria. | Andreas S. Schulz, Martin Skutella |
| 1996 | ESA | Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). | Rolf H. Mhring, Markus W. Schffter, Andreas S. Schulz |
| 1996 | ICALP | Improved Scheduling Algorithms for Minsum Criteria. | Soumen Chakrabarti, Cynthia A. Phillips, Andreas S. Schulz, David B. Shmoys, Clifford Stein, Joel Wein |
| 1996 | IPCO | Transitive Packing. | Rudolf Mller, Andreas S. Schulz |
| 1996 | IPCO | Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds. | Andreas S. Schulz |
| 1996 | WG | Switchbox Routing in VLSI Design: Closing the Complexity Gap. | Stephan Hartmann, Markus W. Schffter, Andreas S. Schulz |
| 1995 | ESA | 0/1-Integer Programming: Optimization and Augmentation are Equivalent. | Andreas S. Schulz, Robert Weismantel, Gnter M. Ziegler |
| 1995 | IPCO | The Interval Order Polytope of a Digraph. | Rudolf Mller, Andreas S. Schulz |
| 1995 | IPCO | Scheduling Unit Jobs with Compatible Release Dates on Parallel Machines with Nonstationary Speeds. | Maurice Queyranne, Andreas S. Schulz |