Schedule
Schedule
Use the tabs below to view the schedule for each day. Click here for an overview of the schedule structure for the whole week. You can also download a compact schedule and the proceedings.
Sunday, June 21
| Time | |
|---|---|
| 15:00-19:30 | Arrival |
| 19:30-21:30 | Dinner (Great Hall) |
| Time | ||
|---|---|---|
| 7:00-9:00 | Breakfast (Restaurant 1744) | |
| 9:00-10:00 | Session 1 (Prince Bishop Suite) Chair: Lars Rohwedder Keynote Talk Franziska Eberle: Stochastic load balancing and related problems |
|
| 10:00-10:40 | Coffee Break | |
| 10:40-11:55 | Session 2A (Prince Bishop Suite) Chair: Rob van Stee 10:40. Ya-Chun Liang, Jian-Xi Shao and Chung-Shou Liao*: Revisit the Online TSP on the Line 11:05. Anna Hu and Hsiang-Hsuan Liu*: Power of knowing the full neighborhood of online vertex cover 11:30. 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 |
Session 2B (Great Hall) Chair: Kevin Schewior 10:40. Sanjoy Baruah* and Pontus Ekberg: Rethinking efficiency in real-time schedulability analysis 11:05. Sanjoy Baruah and Pontus Ekberg*: Efficient explainability of schedulability analysis 11:30. 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 |
| 12:00-13:00 | Lunch (Restaurant 1744) | |
| 13:00-15:00 | Collaboration | |
| 15:00-15:50 | Session 3A (Prince Bishop Suite) Chair: Marc Uetz 15:00. Maximilian von Aspern*, Felix Buld and Michael Pinedo: Flow Shop Scheduling with Stochastic Reentry 15:25. Sven Jäger and Daniel Schmidt Genannt Waldschmidt*: A Novel IP Formulation for Stochastic Non-Preemptive Scheduling |
Session 3B (Great Hall) Chair: Samir Khuller 15:00. Martijn van Ee* and Rene Sitters: Approximation algorithms for graph search problems with imperfect detection 15:25. Sunny Atalig, Marek Chrobak, Christoph Dürr, Petr Kolman, Huong Luu, Jiří Sgall* and Gregory Zhu: Two Complexity Results on Spanning-Tree Congestion Problems |
| 15:50-16:30 | Coffee Break | |
| 16:30-17:45 | Session 4A (Prince Bishop Suite) Chair: Malin Rau 16:30. Mong-Jen Kao*: On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem 16:55. Sander Borst, Golnoosh Shahkarami* and Rohit Vaish: Interval Scheduling under Approximate Envy-Freeness 17:20. Sami Davies*, Venkatesan Guruswami and Xuandi Ren: Scheduling Problems with Constrained Rejections |
Session 4B (Great Hall) Chair: Martijn van Ee 16:30. Moritz Buchem*, Nicole Megow, Marc Uetz and Leoni Winschermann: Approximating Fair Repetitive Scheduling 16:55. Mirabel Mendoza-Cadena, Arturo Merino, Mads Anker Nielsen* and Kevin Schewior: Combinatorial Perpetual Scheduling 17:20. Kalina Jasińska, John Kuszmaul* and Gyudong Lee: Strengths and Limitations of Greedy in Cup games |
| 17:45-19:00 | Collaboration | |
| 19:00-21:00 | Dinner (Great Hall) |
| Time | ||
|---|---|---|
| 7:00-9:00 | Breakfast (Restaurant 1744) | |
| 9:00-10:00 | Session 5 (Prince Bishop Suite) Chair: Prudence Wong Keynote Talk Jannik Matuschke: When Nicolas and Vilfredo Join Hands: Condorcet Dimension and Pareto Optimality for Matchings and Beyond | |
| 10:00-10:40 | Coffee Break | |
| 10:40-11:55 |
Session 6A (Prince Bishop Suite) Chair: Samir Khuller 10:40. Antonios Antoniadis, Denise Graafsma*, Ruben Hoeksma and Maria Vlasiou: Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms 11:05. Peter Gyorgyi and Tamas Kis*: Resource leveling problems with precedence constraints and convex cost functions 11:30. Klaus Jansen and Felix Ohnesorge*: A Practical 73/50 Approximation for Contiguous Monotone Moldable Job Scheduling |
Session 6B (Great Hall) Chair: Kevin Schewior 10:40. Benjamin Moseley, Heather Newman*, Kirk Pruhs and Rudy Zhou: Robust Gittins for Stochastic Scheduling 11:05. Benjamin Moseley, Kirk Pruhs, Marc Uetz* and Rudy Zhou: Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard 11:30. P.J. van Mill*, André Berger and Tjark Vredeveld: A further investigation of Learning-SEPT |
| 12:00-13:00 | Lunch (Restaurant 1744) | |
| 13:00-15:00 | Collaboration | |
| 15:00-15:50 |
Session 7A (Prince Bishop Suite) Chair: Marc Uetz 15:00. 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 15:25. 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 |
Session 7B (Great Hall) Chair: Martijn van Ee 15:00. Steven Miltenburg*: On the Complexity of the Euclidean Capacitated Vehicle Routing Problem 15:25. Steven Miltenburg, Tim Oosterwijk* and René Sitters: Capacitated Vehicle Routing with Order Restrictions: Models, Algorithms, and Limits |
| 15:50-16:30 | Coffee Break | |
| 16:30-17:45 |
Session 8A (Prince Bishop Suite) Chair: Antonios Antoniadis 16:30. 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 16:55. 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 17:20. Enoch Peserico and Michele Scquizzato*: Is competitive paging an artifact? |
Session 8B (Great Hall) Chair: Eric Balkanski 16:30. Stephen Arndt, Benjamin Moseley, Kirk Pruhs and Michael Zlatin*: Edmonds++: Efficiently Coloring more Matroid Intersections 16:55. Stephen Arndt*, Benjamin Moseley, Kirk Pruhs, Chaitanya Swamy and Michael Zlatin: Efficiently Coloring the Intersection of General Matroids 17:20. Lisa Hellerstein, Benedikt M. Plank and Kevin Schewior*: Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation |
| 17:45-19:00 | Collaboration | |
| 19:00-21:00 | Dinner (Great Hall) |
| Time | ||
|---|---|---|
| 7:00-9:00 | Breakfast (Restaurant 1744) | |
| 9:00-9:50 |
Session 9A (Prince Bishop Suite) Chair: Alexander Lindermayr 9:00. Spyros Angelopoulos, Mathis Degryse*, Christoph Dürr and Imrane Sakkour: Randomized online bidding with prediction 9:25. Samuel McCauley, Benjamin Moseley*, Helia Niaparast and Shikha Singh: Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences |
Session 9B (Great Hall) Chair: Malin Rau 9:00. Jesper Nederlof, Céline Swennenhuis and Karol Węgrzycki*: A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints 9:25. Klaus Jansen*, Felix Ohnesorge and Lis Pirotton: A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing |
| 9:50-10:40 | Coffee Break | |
| 10:40-11:55 |
Session 10A (Prince Bishop Suite) Chair: Ben Moseley 10:40. Samir Khuller*, Mozhengfu Liu and Xueyan Tang: To delay or not to delay – Online Span Minimization 11:05. Ekin Ergen*: Online Makespan Scheduling under Two Scenarios 11:30. Kunal Agrawal, Sanjoy Baruah, Gregory Kehne, Jubayer Nirjhor, Kei Rockwell* and Nicole Wein: Scheduling Jobs to Maximize Fractional Value |
Session 10B (Great Hall) Chair: Eric Balkanski 10:40. Sven Jäger, Alexander Lindermayr and Bart Zondervan*: Tight Analysis of Proportional Fairness for Minimizing Weighted Flow Time in Monotone Polytope Scheduling 11:05. Frits Spieksma and Sten Wessel*: Fair Incomplete Round-Robin Tournaments 11:30. Frits Spieksma*, Mark de Berg and Andrés López Martínez: The Price of Diversity of the Traveling Salesman Problem |
| 12:00-13:00 | Lunch (Restaurant 1744) | |
| 13:00-19:00 | Social Events / Collaboration | |
| 19:00-21:00 | Dinner (Great Hall) |
| Time | ||
|---|---|---|
| 7:00-9:00 | Breakfast (Restaurant 1744) | |
| 9:00-10:00 | Session 11 (Prince Bishop Suite) Chair: Thomas Erlebach Keynote Talk Andreas Wiese: Practical scheduling problems and where to find them … at my university | |
| 10:00-10:40 | Coffee Break | |
| 10:40-11:55 | Session 12 (Prince Bishop Suite) Chair: Kirk Pruhs Short Talks |
|
| 12:00-13:00 | Lunch (Restaurant 1744) | |
| 13:00-15:00 | Collaboration | |
| 15:00-15:50 |
Session 13A (Prince Bishop Suite) Chair: Antonios Antoniadis 15:00. Max Hugen, Bob Krekelberg* and Alison Hsiang-Hsuan Liu: Online Firefighting on Cactus Graphs 15:25. Kunal Agrawal, Benjamin Moseley, Heather Newman and Kirk Pruhs*: Scheduling Out-Trees Online to Optimize Maximum Flow |
Session 13B (Great Hall) Chair: Andreas Wiese 15:00. Debajyoti Kar, Arindam Khan and Malin Rau*: Improved Approximation Algorithms for Three-Dimensional Bin Packing 15:25. Debajyoti Kar, Arindam Khan, Malin Rau, Ann-Brith Strömberg and Albert Vesterlund*: A Tight 2-Approximation for Demand Bin Packing |
| 15:50-16:30 | Coffee Break | |
| 16:30-17:45 |
Session 14A (Prince Bishop Suite) Chair: Jens Schlöter 16:30. Lars Rohwedder and Leander Schnaars*: Graph Scheduling with Group Completion Times 16:55. Thomas Erlebach, Natalia Shakhlevich*, Akiyoshi Shioura and Jie Xu: Scheduling Framework for Edge-to-Cloud Task Offloading 17:20. Thomas Erlebach*, Naveen Garg, Sukriti Gupta and Amitabh Trehan: Approximating optimal broadcast of files in a hose-model network |
Session 14B (Great Hall) Chair: Ben Moseley 16:30. Aflatoun Amouzandeh, Klaus Jansen, Lis Pirotton, Rob van Stee* and Corinna Wambsganz: Online and offline algorithms for weighted makespan minimization 16:55. Alexander Lindermayr and Morten Weber*: Online Weighted Flow Time with Equal-Size Jobs 17:20. Felix Buld* and Andreas S. Schulz: Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model |
| 17:45-19:00 | Collaboration | |
| 19:00-21:00 | Dinner (Great Hall) |
| Time | ||
|---|---|---|
| 7:00-9:00 | Breakfast (Restaurant 1744) | |
| 9:00-9:50 |
Session 15A (Prince Bishop Suite) Chair: Andreas Wiese 9:00. Vipin Ravindran Vijayalakshmi, Marc Schroder and Tami Tamir*: Interval Scheduling Games 9:25. Etienne Bamas, Shi Li and Lars Rohwedder*: Randomized Rounding over Dynamic Programs |
Session 15B (Great Hall) Chair: Rob van Stee 9:00. Ziyad Benomar, Romain Cosson, Alexander Lindermayr* and Jens Schlöter: Non-Clairvoyant Scheduling with Progress Bars 9:25. Anupam Gupta, Haim Kaplan, Alexander Lindermayr, Jens Schlöter* and Sorrachai Yingchareonthawornchai: A Little Clairvoyance Is All You Need |
| 9:50-10:40 | Coffee Break | |
| 10:40-11:55 |
Session 16A (Prince Bishop Suite) Chair: Alexander Lindermayr 10:40. Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis, Giorgos Mitropoulos* and Michalis Xefteris: What to Predict for Efficient Scheduling on Multiple Machines? 11:05. Eric Balkanski*, Vasilis Gkatzelis and Xizhi Tan: Strategyproof Scheduling with Predictions 11:30. Eric Balkanski, Jingwei Li*, Clifford Stein and Cherlin Zhu: Speed Predictions for Online Energy-Efficient Scheduling |
Session 16B (Great Hall) Chair: Jens Schlöter 10:40. Federico Della Croce and Quentin Schau*: Revisiting Johnson’s rule for minimizing makespan in the two-machine flow shop scheduling problem 11:05. Lin Chen, Yixiong Gao*, Minming Li, Guohui Lin and Kai Wang: Revisit the Scheduling Problem with Calibrations |
| 12:00-13:00 | Lunch (Restaurant 1744) | |
| 13:00 | Departure |