Article 2026 Block Stacking, Airplane Refueling, and Robust Appointment Scheduling Gmeiner, Simon; Schulz, Andreas S. DOI
Article 2026 Robust Appointment Scheduling with Waiting Time Guarantees Bauerhenne, Carolin; Kolisch, Rainer; Schulz, Andreas S. DOI
Article 2026 Flow Shop Scheduling with Stochastic Reentry von Aspern, Maximilian; Buld, Felix; Pinedo, Michael DOI
Article 2026 Robust Appointment Scheduling with Waiting Time Guarantees Kolisch, Rainer; Schulz, Andreas S.; Bauerhenne, Carolin DOI
Article 2026 Block Stacking, Airplane Refueling, and Robust Appointment Scheduling Schulz, Andreas S.; Gmeiner, Simon DOI
Article 2025 3.415-Approximation for Coflow Scheduling via Iterated Rounding Rohwedder, Lars; Schnaars, Leander DOI
Chapter 2025 Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model Buld, Felix; Schulz, Andreas S. DOI
Article 2025 Flow shops with reentry Aspern, Maximilian von; Buld, Felix; Klein, Nicklas; Pinedo, Michael DOI
Article 2025 On the Smoothed Complexity of Combinatorial Local Search Grosz, Alexander; Giannakopoulos, Yiannis; Melissourgos, Themistoklis DOI
Article 2025 Flow shops with reentry: The total weighted completion time objective Aspern, Maximilian von; Buld, Felix; Klein, Nicklas; Pinedo, Michael DOI
Article 2024 Primal separation and approximation for the {0,1/2}-closure Brandl, Lukas; Schulz, Andreas S. DOI
Article 2024 Flow shops with reentry: The total weighted completion time objective von Aspern, Maximilian; Buld, Felix; Klein, Nicklas; Pinedo, Michael DOI
Article 2024 On the complexity of a maintenance problem for hierarchical systems Schulz, Andreas S.; Telha, Claudio DOI
Article 2024 Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover Happach, Felix; Schulz, Andreas S. DOI
Article 2023 On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture Black, Alexander E.; Borgwardt, Steffen; Brugger, Matthias DOI
Article 2023 A bijectionist's toolkit Grosz, Alexander; Kietreiber, Tobias; Pfannerer, Stephan; Rubey, Martin
Preprint 2023 Primal Separation and Approximation for the {0, 1/2}-closure Brandl, Lukas; Schulz, Andreas S. DOI
Article 2022 On the impossibility of decomposing binary matroids Leichter, Marilena; Moseley, Benjamin; Pruhs, Kirk DOI
Doctoral Thesis 2022 Lotteries, Prophets, and Pandora’s Box: A New Take on Classic Problems in Mechanism Design and Online Selection Tsigonias-Dimitriadis, Alexandros
Article 2022 Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses Giannakopoulos, Yiannis; Noarov, Georgy; Schulz, Andreas S. DOI
Article 2022 On the complexity of recognizing integrality and total dual integrality of the {0,1/2}-closure Brugger, Matthias; Schulz, Andreas S. DOI
Article 2021 Limitations of the Hyperplane Separation Technique for Bounding the Extension Complexity of Polytopes Brugger, Matthias