Abstract is missing.
- Contact Graphs of Circular ArcsMd. Jawaherul Alam, David Eppstein, Michael Kaufmann 0001, Stephen G. Kobourov, Sergey Pupyrev, André Schulz, Torsten Ueckerdt. 1-13 [doi]
- Contact Representations of Graphs in 3DMd. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt. 14-27 [doi]
- Minimizing the Aggregate Movements for Interval CoverageAaron M. Andrews, Haitao Wang. 28-39 [doi]
- Online Bin Packing with Advice of Small SizeSpyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén. 40-53 [doi]
- On the Approximability of Orthogonal Order Preserving Layout AdjustmentSayan Bandyapadhyay, Santanu Bhowmick, Kasturi R. Varadarajan. 54-65 [doi]
- An Optimal Algorithm for Plane Matchings in Multipartite Geometric GraphsAhmad Biniaz, Anil Maheshwari, Subhas C. Nandy, Michiel H. M. Smid. 66-78 [doi]
- Generation of Colourings and Distinguishing Colourings of GraphsWilliam Bird, Wendy Myrvold. 79-90 [doi]
- Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case TimeGerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen. 91-102 [doi]
- On Conflict-Free Multi-coloringAndreas Bärtschi, Fabrizio Grandoni. 103-114 [doi]
- Semi-dynamic Connectivity in the PlaneSergio Cabello, Michael Kerber. 115-126 [doi]
- Interval Selection in the Streaming ModelSergio Cabello, Pablo Pérez-Lantero. 127-139 [doi]
- On the Bounded-Hop Range Assignment ProblemPaz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi. 140-151 [doi]
- Greedy Is an Almost Optimal DequeParinya Chalermsook, Mayank Goswami, László Kozma 0002, Kurt Mehlhorn, Thatchaphol Saranurak. 152-165 [doi]
- A New Approach for Contact Graph Representations and Its ApplicationsYi-Jun Chang, Hsu-Chun Yen. 166-177 [doi]
- Dealing with 4-Variables by Resolution: An Improved MaxSAT AlgorithmJianer Chen, Chao Xu 0010, Jianxin Wang. 178-188 [doi]
- Select with Groups of 3 or 4Ke Chen, Adrian Dumitrescu. 189-199 [doi]
- Approximating Nearest Neighbor DistancesMichael B. Cohen, Brittany Terese Fasy, Gary L. Miller, Amir Nayyeri, Donald R. Sheehy, Ameya Velingker. 200-211 [doi]
- Linearity Is Strictly More Powerful Than Contiguity for Encoding GraphsChristophe Crespelle, Tien-Nam Le, Kevin Perrot, Thi Ha Duong Phan. 212-223 [doi]
- On the Complexity of an Unregulated Traffic CrossingPhilip Dasler, David M. Mount. 224-235 [doi]
- Finding Pairwise Intersections Inside a Query RangeMark de Berg, Joachim Gudmundsson, Ali D. Mehrabi. 236-248 [doi]
- Cache-Oblivious Iterated Predecessor Queries via Range CoalescingErik D. Demaine, Vineet Gopal, William Hasenplaugh. 249-262 [doi]
- Polylogarithmic Fully Retroactive Priority Queues via Hierarchical CheckpointingErik D. Demaine, Tim Kaler, Quanquan Liu, Aaron Sidford, Adam Yedidia. 263-275 [doi]
- On the Minimum Eccentricity Shortest Path ProblemFeodor F. Dragan, Arne Leitert. 276-288 [doi]
- Convex Polygons in Geometric TriangulationsAdrian Dumitrescu, Csaba D. Tóth. 289-300 [doi]
- Straight-Line Drawability of a Planar Graph Plus an EdgePeter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, Sheung-Hung Poon. 301-313 [doi]
- Solving Problems on Graphs of High Rank-WidthEduard Eiben, Robert Ganian, Stefan Szeider. 314-326 [doi]
- The Parametric Closure ProblemDavid Eppstein. 327-338 [doi]
- Rooted Cycle BasesDavid Eppstein, J. Michael McCarthy, Brian E. Parrish. 339-350 [doi]
- On the Chain Pair Simplification ProblemChenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu. 351-362 [doi]
- Finding Articulation Points of Large Graphs in Linear TimeMartin Farach-Colton, Tsan-sheng Hsu, Meng Li, Meng-Tsung Tsai. 363-372 [doi]
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network DesignZachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto. 373-385 [doi]
- Universal Reconstruction of a StringPawel Gawrychowski, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 386-397 [doi]
- The Complexity of Dominating Set ReconfigurationArash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal. 398-409 [doi]
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization SchemesFalk Hüffner, Christian Komusiewicz, André Nichterlein. 410-421 [doi]
- Competitive Diffusion on Weighted GraphsTakehiro Ito, Yota Otachi, Toshiki Saitoh, Hisayuki Satoh, Akira Suzuki, Kei Uchizawa, Ryuhei Uehara, Katsuhisa Yamanaka, Xiao Zhou. 422-433 [doi]
- Sorting and Selection with Equality ComparisonsVarunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti. 434-445 [doi]
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in GraphsMamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno. 446-457 [doi]
- Fast and Simple Connectivity in Graph TimelinesAdam Karczmarz, Jakub Lacki. 458-469 [doi]
- Dynamic Set IntersectionTsvi Kopelowitz, Seth Pettie, Ely Porat. 470-481 [doi]
- Time-Space Trade-offs for Triangulations and Voronoi DiagramsMatias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein. 482-494 [doi]
- A 2k-vertex Kernel for Maximum Internal Spanning TreeWenjun Li, Jianxin Wang, Jianer Chen, Yixin Cao. 495-505 [doi]
- Reconfiguration on Sparse GraphsDaniel Lokshtanov, Amer E. Mouawad, Fahad Panolan, M. S. Ramanujan, Saket Saurabh. 506-517 [doi]
- Smoothed Analysis of Local Search AlgorithmsBodo Manthey. 518-527 [doi]
- Optimal Shuffle Code with Permutation InstructionsSebastian Buchwald, Manuel Mohr, Ignaz Rutter. 528-541 [doi]
- Non-preemptive Scheduling on Machines with Setup TimesAlexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide, Sören Riechers. 542-553 [doi]
- A Moderately Exponential Time Algorithm for k-IBDD SatisfiabilityAtsuki Nagao, Kazuhisa Seto, Junichi Teruyama. 554-565 [doi]
- On the Parameterized Complexity of Girth and Connectivity Problems on Linear MatroidsFahad Panolan, M. S. Ramanujan, Saket Saurabh. 566-577 [doi]
- Elastic Geometric Shape Matching for Point Sets under TranslationsChristian Knauer, Fabian Stehn. 578-592 [doi]
- Constant Time Enumeration by AmortizationTakeaki Uno. 593-605 [doi]
- Computing the Center of Uncertain Points on Tree NetworksHaitao Wang, Jingru Zhang. 606-618 [doi]
- Swapping Colored Tokens on GraphsKatsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno. 619-628 [doi]
- Positive Semidefinite Zero Forcing: Complexity and Lower BoundsBoting Yang. 629-639 [doi]