Accepted Papers

  • Umang Bhaskar, Sricharan A R and Rohit Vaish. On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
  • Susanne Albers and Sebastian Schubert. Optimal Algorithms for Online b-Matching with Variable Vertex Capacities
  • Anupam Gupta, Amit Kumar and Sahil Singla. Bag-of-Tasks Scheduling on Related Machines
  • Anup Bhattacharya, Dishant Goyal and Ragesh Jaiswal. Hardness of Approximation for Euclidean k-Median
  • Elena Grigorescu, Young-San Lin and Kent Quanrud. Online Directed Spanners and Steiner Forests
  • Arijit Bishnu, Arijit Ghosh, Gopinath Mishra and Manaswi Paraashar. Query Complexity of Global Minimum Cut
  • Eun Jung Kim, Euiwoong Lee and Dimitrios Thilikos. A Constant-factor Approximation for Weighted Bond Cover
  • János Balogh, Ilan Cohen, Leah Epstein and Asaf Levin. Truly asymptotic lower bounds for online vector bin packing
  • Alejandro Cassis, Nick Fischer, Karl Bringmann and Marvin Künnemann. Fine-Grained Completeness for Optimization in P
  • Hossein Jowhari. An Estimator for Matching Size in Low Arboricity Graphs with Two Applications
  • Rajesh Jayaram and John Kallaugher. An Optimal Algorithm for Triangle Counting
  • Omar El Housni, Vineet Goyal, Clifford Stein and Oussama Hanguir. Matching Drivers to Riders: A Two-stage Robust Approach
  • Calum MacRury, Allan Borodin and Akash Rakheja. Secretary Matching Meets Probing with Commitment
  • Chien-Chung Huang and François Sellier. Semi-Streaming Algorithms for Submodular Function Maximization under b-Matching Constraint
  • Yaron Fairstein, Ariel Kulik, Seffi Naor and Dan Raz. General Knapsack Problems in a Dynamic Setting
  • Sandip Banerjee, Rafail Ostrovsky and Yuval Rabani. Min-Sum Clustering (with Outliers)
  • Noah Singer, Madhu Sudan and Santhoshini Velusamy. Streaming approximation resistance of every ordering CSP
  • Anna Arutyunova, Anna Großwendt, Heiko Röglin, Melanie Schmidt and Julian Wargalla. Upper and Lower Bounds for Complete Linkage in General Metric Spaces
  • Christian Konrad and Kheeran Naidu. On Two-pass Streaming Algorithms for Maximum Bipartite Matching
  • Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli and Kamyar Khodamoradi. Approximation Algorithms for Demand Strip Packing
  • Max A. Deppert, Klaus Jansen, Arindam Khan, Malin Rau and Malte Tutas. Peak Demand Minimization via Sliced Strip Packing
  • Arindam Khan and Eklavya Sharma. Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items
  • Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas and Anil Vullikanti. Approximating Two-Stage Stochastic Supplier Problems
  • Chandra Chekuri, Kent Quanrud and Manuel Torres. Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
  • Alexander Göke, Jochen Koenemann, Matthias Mnich and Hao Sun. Hitting Weighted Even Cycles in Planar Graphs
  • Kshipra Bhawalkar, Manish Purohit and Kostas Kollias. Revenue Maximization in Transportation Networks
  • Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz and Ziena Zeif. Connected $k$-partition of $k$-connected graphs and $c$-claw-free graphs