Abstract is missing.
- PTAS for Steiner Tree on Map GraphsJaroslaw Byrka, Mateusz Lewandowski, Syed Mohammad Meesum, Joachim Spoerhase, Sumedha Uniyal. 3-14 [doi]
- Near-Linear Time Algorithm for Approximate Minimum Degree Spanning TreesRan Duan, Haoqing He, Tianyi Zhang 0008. 15-26 [doi]
- Approximation Algorithms for Cost-Robust Discrete Minimization Problems Based on Their LP-RelaxationsKhaled M. Elbassioni. 27-37 [doi]
- Scheduling on Hybrid Platforms: Improved Approximability WindowVincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon. 38-49 [doi]
- Leafy Spanning Arborescences in DAGsCristina G. Fernandes, Carla Negri Lintzmayer. 50-62 [doi]
- Approximating Routing and Connectivity Problems with Multiple DistancesLehilton L. C. Pedrosa, Greis Y. O. Quesquén. 63-75 [doi]
- A 2-Approximation for the k-Prize-Collecting Steiner Tree ProblemLehilton L. C. Pedrosa, Hugo Kooki Kasuya Rosado. 76-88 [doi]
- Maximizing Happiness in Graphs of Bounded Clique-WidthIvan Bliznets, Danil Sagunov. 91-103 [doi]
- Graph Hamiltonicity Parameterized by Proper Interval Deletion SetPetr A. Golovach, R. Krithika 0001, Abhishek Sahu, Saket Saurabh 0001, Meirav Zehavi. 104-115 [doi]
- Graph Square Roots of Small Distance from Degree One GraphsPetr A. Golovach, Paloma T. Lima, Charis Papadopoulos. 116-128 [doi]
- Structural Parameterizations for Equitable ColoringGuilherme de C. M. Gomes, Matheus R. Guedes, Vinicius F. dos Santos. 129-140 [doi]
- Dynamically Optimal Self-adjusting Single-Source Tree NetworksChen Avin, Kaushik Mondal 0001, Stefan Schmid 0001. 143-154 [doi]
- Batched Predecessor and Sorting with Size-Priced Information in External MemoryMichael A. Bender, Mayank Goswami 0001, Dzejla Medjedovic, Pablo Montes, Kostas Tsichlas. 155-167 [doi]
- Probabilistically Faulty Searching on a Half-Line - (Extended Abstract)Anthony Bonato, Konstantinos Georgiou, Calum MacRury, Pawel Pralat. 168-180 [doi]
- Query Minimization Under Stochastic UncertaintySteven Chaplick, Magnús M. Halldórsson, Murilo Santos de Lima, Tigran Tonoyan. 181-193 [doi]
- Suffix Trees, DAWGs and CDAWGs for Forward and Backward TriesShunsuke Inenaga. 194-206 [doi]
- Towards a Definitive Measure of RepetitivenessTomasz Kociumaka, Gonzalo Navarro, Nicola Prezza. 207-219 [doi]
- Flips in Higher Order Delaunay TriangulationsElena Arseneva, Prosenjit Bose, Pilar Cano, Rodrigo I. Silveira. 223-234 [doi]
- An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral StructuresFrank Bauernöppel, Anil Maheshwari, Jörg-Rüdiger Sack. 235-246 [doi]
- Computing Balanced Convex Partitions of LinesSergey Bereg. 247-257 [doi]
- Ordered Strip PackingKevin Buchin, D. Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek. 258-270 [doi]
- Shortest Rectilinear Path Queries to Rectangles in a Rectangular DomainMincheol Kim, Sang Duk Yoon, Hee-Kap Ahn. 271-282 [doi]
- Farthest Color Voronoi Diagrams: Complexity and AlgorithmsIoannis Mantas, Evanthia Papadopoulou, Vera Sacristán, Rodrigo I. Silveira. 283-295 [doi]
- Rectilinear Convex Hull of Points in 3DPablo Pérez-Lantero, Carlos Seara, Jorge Urrutia. 296-307 [doi]
- Monotone Circuit Lower Bounds from Robust SunflowersBruno Pasqualotto Cavalar, Mrinal Kumar, Benjamin Rossman. 311-322 [doi]
- Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive FunctionsSiddhesh Chaubal, Anna Gál. 323-335 [doi]
- Sherali-Adams and the Binary Encoding of Combinatorial PrinciplesStefan S. Dantchev, Abdul Ghani, Barnaby Martin. 336-347 [doi]
- Hardness of Variants of the Graph Coloring GameThiago Marcilon, Nícolas A. Martins, Rudini Menezes Sampaio. 348-359 [doi]
- Tractable Unordered 3-CNF GamesMd Lutfar Rahman, Thomas Watson 0001. 360-372 [doi]
- Lower Bounds for Testing Complete Positivity and Quantum SeparabilityCostin Badescu, Ryan O'Donnell. 375-386 [doi]
- Exponential-Time Quantum Algorithms for Graph Coloring ProblemsKazuya Shimizu, Ryuhei Mori. 387-398 [doi]
- On Symmetry and Initialization for Neural NetworksIdo Nachum, Amir Yehudayoff. 401-412 [doi]
- How to Color a French Flag - Biologically Inspired Algorithms for Scale-Invariant PatterningBertie Ancona, Ayesha Bajwa, Nancy A. Lynch, Frederik Mallmann-Trenn. 413-424 [doi]
- Simple Intrinsic Simulation of Cellular Automata in Oritatami Molecular Folding ModelDaria Pchelina, Nicolas Schabanel, Shinnosuke Seki, Yuki Ubukata. 425-436 [doi]
- Transmitting once to Elect a Leader on Wireless NetworksNy Aina Andriambolamalala, Vlady Ravelomanana. 439-450 [doi]
- Asymptotics for Push on the Complete GraphRami Daknama, Konstantinos Panagiotou, Simon Reisser. 451-463 [doi]
- The Hardness of Sampling Connected SubgraphsAndrew Read-McFarland, Daniel Stefankovic. 464-475 [doi]
- Lower Bounds for Max-Cut via Semidefinite ProgrammingCharles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan. 479-490 [doi]
- Quasi-Random Words and Limits of Word SequencesHiêp Hàn, Marcos Kiwi, Matías Pavez-Signé. 491-503 [doi]
- Thresholds in the Lattice of Subspaces of $\mathbb {F}_q^n$Benjamin Rossman. 504-515 [doi]
- On Minimal-Perimeter Lattice AnimalsGill Barequet, Gil Ben-Shachar. 519-531 [doi]
- Improved Upper Bounds on the Growth Constants of Polyominoes and PolycubesGill Barequet, Mira Shalah. 532-545 [doi]
- On the Collection of Fringe Subtrees in Random Binary TreesLouisa Seelbach Benkner, Stephan G. Wagner. 546-558 [doi]
- A Method to Prove the Nonrationality of Some Combinatorial Generating FunctionsMiklós Bóna. 559-570 [doi]
- Binary Decision Diagrams: From Tree Compaction to SamplingJulien Clément 0001, Antoine Genitrini. 571-583 [doi]
- Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ CliquesSancrey Rodrigues Alves, Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein, Uéverton S. Souza. 587-599 [doi]
- On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching NumberJean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov. 600-612 [doi]
- Steiner Trees for Hereditary Graph ClassesHans L. Bodlaender, Nick Brettell, Matthew Johnson 0002, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen. 613-624 [doi]
- 1-EPG GraphsZakir Deniz, Simon Nivelle, Bernard Ries, David Schindl. 625-636 [doi]
- On the Helly Subclasses of Interval Bigraphs and Circular Arc BigraphsMarina Groshaus, André Luiz Pires Guedes, Fabricio Schiavon Kolberg. 637-648 [doi]