Accepted Papers

Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton, Rob van Stee* and Corinna Wambsganz: Online and offline algorithms for weighted makespan minimization
Alexander Lindermayr and Morten Weber*: Online Weighted Flow Time with Equal-Size Jobs
Anna Hu and Hsiang-Hsuan Liu*: Power of knowing the full neighborhood of online vertex cover
Antonios Antoniadis, Denise Graafsma*, Ruben Hoeksma and Maria Vlasiou: Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter* and Sorrachai Yingchareonthawornchai: A Little Clairvoyance Is All You Need
Benjamin Moseley, Heather Newman*, Kirk Pruhs and Rudy Zhou: Robust Gittins for Stochastic Scheduling
Benjamin Moseley, Kirk Pruhs, Marc Uetz* and Rudy Zhou: Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard
David Shmoys*, Varun Suriyanarayana and Seeun William Umboh: Improved On-line Algorithms for the JRP with Holding & Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
Debajyoti Kar, Arindam Khan and Malin Rau*: Improved Approximation Algorithms for Three-Dimensional Bin Packing
Debajyoti Kar, Arindam Khan, Malin Rau, Ann-Brith Strömberg and Albert Vesterlund*: A Tight 2-Approximation for Demand Bin Packing
Ekin Ergen*: Online Makespan Scheduling under Two Scenarios
Enoch Peserico and Michele Scquizzato*: Is competitive paging an artifact?
Eric Balkanski*, Vasilis Gkatzelis and Xizhi Tan: Strategyproof Scheduling with Predictions
Eric Balkanski, Jingwei Li*, Clifford Stein and Cherlin Zhu: Speed Predictions for Online Energy-Efficient Scheduling
Etienne Bamas, Shi Li and Lars Rohwedder*: Randomized Rounding over Dynamic Programs
Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis, Giorgos Mitropoulos* and Michalis Xefteris: What to Predict for Efficient Scheduling on Multiple Machines?
Eyüp Ensar Işık*, Z. Caner Taşkın and Semra Ağralı: A Decomposition-Based Exact Solution Approach for Lot-sizing and Scheduling Problem in Co-production Systems
Federico Della Croce and Quentin Schau*: Revisiting Johnson’s rule for minimizing makespan in the two-machine flow shop scheduling problem
Felix Buld* and Andreas S. Schulz: Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model
Frits Spieksma and Sten Wessel*: Fair Incomplete Round-Robin Tournaments
Frits Spieksma*, Mark de Berg and Andrés López Martínez: The Price of Diversity of the Traveling Salesman Problem
Jesper Nederlof, Céline Swennenhuis and Karol Węgrzycki*: A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints
Kalina Jasińska, John Kuszmaul* and Gyudong Lee: Strengths and Limitations of Greedy in Cup games
Klaus Jansen and Felix Ohnesorge*: A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling
Klaus Jansen*, Felix Ohnesorge and Lis Pirotton: A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
Kunal Agrawal, Benjamin Moseley, Heather Newman and Kirk Pruhs*: Scheduling Out-Trees Online to Optimize Maximum Flow
Kunal Agrawal, Sanjoy Baruah, Gregory Kehne, Jubayer Nirjhor, Kei Rockwell* and Nicole Wein: Scheduling Jobs to Maximize Fractional Value
Lars Rohwedder and Leander Schnaars*: Graph Scheduling with Group Completion Times
Lin Chen, Yixiong Gao*, Minming Li, Guohui Lin and Kai Wang: Revisit the Scheduling Problem with Calibrations
Lisa Hellerstein, Benedikt M. Plank and Kevin Schewior*: Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
Mario Günzel, Marion Sudvarg, Max Deppert, Ao Li, Ning Zhang and Jian-Jia Chen*: Optimal Priority Assignment for Synchronous Harmonic Tasks With Dynamic Self-Suspension
Martijn van Ee* and Rene Sitters: Approximation algorithms for graph search problems with imperfect detection
Mateusz Basiak, Marcin Bienkowski, Martin Böhm*, Marek Chrobak, Łukasz Jeż, Jiří Sgall and Agnieszka Tatarczuk: A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
Max Hugen, Bob Krekelberg* and Alison Hsiang-Hsuan Liu: Online Firefighting on Cactus Graphs
Maximilian von Aspern*, Felix Buld and Michael Pinedo: Flow Shop Scheduling with Stochastic Reentry
Michael A. Bender, Alex Conway, Daniel DeLayo*, Martin Farach-Colton, Jaehyun Han, Linfeng He, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Donald Porter and Evan West: Don’t Melt Your Cache: Low-Associativity with Heat-Sink
Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen* and Kevin Schewior: Combinatorial Perpetual Scheduling
Mong-Jen Kao*: On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem
Moritz Buchem*, Nicole Megow, Marc Uetz and Leoni Winschermann: Approximating Fair Repetitive Scheduling
P.J. van Mill*, André Berger and Tjark Vredeveld: A further investigation of Learning-SEPT
Peter Gyorgyi and Tamas Kis*: Resource leveling problems with precedence constraints and convex cost functions
Sami Davies*, Venkatesan Guruswami and Xuandi Ren: Scheduling Problems with Constrained Rejections
Samir Khuller*, Mozhengfu Liu and Xueyan Tang: To delay or not to delay – Online Span Minimization
Samuel McCauley, Benjamin Moseley*, Helia Niaparast and Shikha Singh: Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
Sander Borst, Golnoosh Shahkarami* and Rohit Vaish: Interval Scheduling under Approximate Envy-Freeness
Sanjoy Baruah and Pontus Ekberg*: Efficient explainability of schedulability analysis
Sanjoy Baruah* and Pontus Ekberg: Rethinking efficiency in real-time schedulability analysis
Spyros Angelopoulos, Mathis Degryse*, Christoph Dürr and Imrane Sakkour: Randomized online bidding with prediction
Stephen Arndt*, Benjamin Moseley, Kirk Pruhs, Chaitanya Swamy and Michael Zlatin: Efficiently Coloring the Intersection of General Matroids
Stephen Arndt, Benjamin Moseley, Kirk Pruhs and Michael Zlatin*: Edmonds++: Efficiently Coloring more Matroid Intersections
Steven Miltenburg*: On the Complexity of the Euclidean Capacitated Vehicle Routing Problem
Steven Miltenburg, Tim Oosterwijk* and René Sitters: Capacitated Vehicle Routing with Order Restrictions: Models, Algorithms, and Limits
Sunny Atalig, Marek Chrobak, Christoph Dürr, Petr Kolman, Huong Luu, Jiří Sgall* and Gregory Zhu: Two Complexity Results on Spanning-Tree Congestion Problems
Sven Jäger and Daniel Schmidt Genannt Waldschmidt*: A Novel IP Formulation for Stochastic Non-Preemptive Scheduling
Sven Jäger, Alexander Lindermayr and Bart Zondervan*: Tight Analysis of Proportional Fairness for Minimizing Weighted Flow Time in Monotone Polytope Scheduling
Tanvi Hisaria, Neel Karia, Clifford Stein*, Asser Tantawi, Olivier Tardieu and Wenqing Yu: SMART-MIG: A Learning Framework for Scalable and Energy-Efficient GPU Scheduling
Thomas Erlebach*, Naveen Garg, Sukriti Gupta and Amitabh Trehan: Approximating optimal broadcast of files in a hose-model network
Thomas Erlebach, Natalia Shakhlevich*, Akiyoshi Shioura and Jie Xu: Scheduling Framework for Edge-to-Cloud Task Offloading
Vipin Ravindran Vijayalakshmi, Marc Schroder and Tami Tamir*: Interval Scheduling Games
Ya-Chun Liang, Jian-Xi Shao and Chung-Shou Liao*: Revisit the Online TSP on the Line
Ziyad Benomar, Romain Cosson, Alexander Lindermayr* and Jens Schlöter: Non-Clairvoyant Scheduling with Progress Bars

* Speaker