| Formatted contents note |
<br/>Contact Graphs of Circular Arcs<br/>Md. Jawaherul Alam, David Eppstein, Michael Kaufmann, Stephen G. Kobourov, Sergey Pupyrev, André Schulz et al.<br/><br/>Contact Representations of Graphs in 3D<br/>Jawaherul Alam, William Evans, Stephen Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt<br/><br/>Minimizing the Aggregate Movements for Interval Coverage<br/>Aaron M. Andrews, Haitao Wang<br/><br/>Online Bin Packing with Advice of Small Size<br/>Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault, Adi Rosén<br/><br/>On the Approximability of Orthogonal Order Preserving Layout Adjustment<br/>Sayan Bandyapadhyay, Santanu Bhowmick, Kasturi Varadarajan<br/><br/>An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs<br/>Ahmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel Smid<br/><br/>Generation of Colourings and Distinguishing Colourings of Graphs<br/>William Bird, Wendy Myrvold<br/><br/>Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time<br/>Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen<br/><br/>On Conflict-Free Multi-coloring<br/>Andreas Bärtschi, Fabrizio Grandoni<br/><br/>Semi-dynamic Connectivity in the Plane<br/>Sergio Cabello, Michael Kerber<br/><br/>Interval Selection in the Streaming Model<br/>Sergio Cabello, Pablo Pérez-Lantero<br/><br/>On the Bounded-Hop Range Assignment Problem<br/>Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi<br/><br/>Greedy Is an Almost Optimal Deque<br/>Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak<br/><br/>A New Approach for Contact Graph Representations and Its Applications<br/>Yi-Jun Chang, Hsu-Chun Yen<br/><br/>Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm<br/>Jianer Chen, Chao Xu, Jianxin Wang<br/><br/>Select with Groups of 3 or 4<br/>Ke Chen, Adrian Dumitrescu<br/><br/>Approximating Nearest Neighbor Distances<br/>Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker<br/><br/>Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs<br/>Christophe Crespelle, Tien-Nam Le, Kevin Perrot, Thi Ha Duong Phan<br/><br/>On the Complexity of an Unregulated Traffic Crossing<br/>Philip Dasler, David M. Mount<br/><br/><br/>Finding Pairwise Intersections Inside a Query Range<br/>Mark de Berg, Joachim Gudmundsson, Ali D. Mehrabi<br/><br/>Cache-Oblivious Iterated Predecessor Queries via Range Coalescing<br/>Erik D. Demaine, Vineet Gopal, William Hasenplaugh<br/><br/>Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing<br/>Erik D. Demaine, Tim Kaler, Quanquan Liu, Aaron Sidford, Adam Yedidia<br/><br/>On the Minimum Eccentricity Shortest Path Problem<br/>Feodor F. Dragan, Arne Leitert<br/><br/>Convex Polygons in Geometric Triangulations<br/>Adrian Dumitrescu, Csaba D. Tóth<br/><br/>Straight-Line Drawability of a Planar Graph Plus an Edge<br/>Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon<br/><br/>Solving Problems on Graphs of High Rank-Width<br/>Eduard Eiben, Robert Ganian, Stefan Szeider<br/><br/>The Parametric Closure Problem<br/>David Eppstein<br/><br/>Rooted Cycle Bases<br/>David Eppstein, J. Michael McCarthy, Brian E. Parrish<br/><br/>On the Chain Pair Simplification Problem<br/>Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu<br/><br/>Finding Articulation Points of Large Graphs in Linear Time<br/>Martín Farach-Colton, Tsan-sheng Hsu, Meng Li, Meng-Tsung Tsai<br/><br/>LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design<br/>Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto<br/><br/>Universal Reconstruction of a String<br/>Paweł Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń<br/><br/>The Complexity of Dominating Set Reconfiguration<br/>Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki et al.<br/><br/>Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes<br/>Falk Hüffner, Christian Komusiewicz, André Nichterlein<br/><br/>Competitive Diffusion on Weighted Graphs<br/>Takehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa et al.<br/><br/>Sorting and Selection with Equality Comparisons<br/>Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti<br/><br/>Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs<br/>Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno<br/><br/>Fast and Simple Connectivity in Graph Timelines<br/>Adam Karczmarz, Jakub Łącki<br/><br/>Dynamic Set Intersection<br/>Tsvi Kopelowitz, Seth Pettie, Ely Porat<br/> |
