Abstract is missing.
- Multi-priority Graph SparsificationAbu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence. 1-12 [doi]
- Point Enclosure Problem for Homothetic PolygonsWaseem Akram, Sanjeev Saxena. 13-24 [doi]
- Hardness of Balanced MobilesVirginia Ardévol Martínez, Romeo Rizzi, Florian Sikora. 25-35 [doi]
- Burn and WinPradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh 0001, Avi Tomar, Shaily Verma. 36-48 [doi]
- Min-Max Relative Regret for Scheduling to Minimize Maximum LatenessImad Assayakh, Imed Kacem, Giorgio Lucarelli. 49-61 [doi]
- Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion ProblemsNiklas Berndt, Henri Lotze. 62-73 [doi]
- Parameterized Algorithms for Eccentricity Shortest Path ProblemSriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh 0001, Shaily Verma. 74-86 [doi]
- A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic GraphsAndrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba. 87-98 [doi]
- Deterministic Performance Guarantees for Bidirectional BFS on Real-World NetworksThomas Bläsius, Marcus Wilhelm. 99-110 [doi]
- A Polyhedral Perspective on Tropical ConvolutionsCornelius Brand, Martin Koutecký, Alexandra Lassota. 111-122 [doi]
- Online Knapsack with Removal and RecourseHans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner. 123-135 [doi]
- Minimum Surgical Probing with Convexity ConstraintsToni Böhnlein, Niccolò Di Marco, Andrea Frosini. 136-147 [doi]
- A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small DiameterDipayan Chakraborty, Soumen Nandi, Sagnik Sen 0001, D. K. Supraja. 148-159 [doi]
- Capacity-Preserving Subgraphs of Directed Flow NetworksMarkus Chimani, Max Ilsen. 160-172 [doi]
- Timeline Cover in Temporal Graphs: Exact and Approximation AlgorithmsRiccardo Dondi, Alexandru Popa 0001. 173-184 [doi]
- Finding Small Complete Subgraphs EfficientlyAdrian Dumitrescu, Andrzej Lingas. 185-196 [doi]
- Maximal Distortion of Geodesic Diameters in Polygonal DomainsAdrian Dumitrescu, Csaba D. Tóth. 197-208 [doi]
- On 2-Strong Connectivity Orientations of Mixed Graphs and Related ProblemsLoukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas. 209-220 [doi]
- Make a Graph Singly Connected by Edge OrientationsTim A. Hartmann, Komal Muluk. 221-232 [doi]
- Computing the Center of Uncertain Points on Cactus GraphsRan Hu, Divy H. Kanani, Jingru Zhang. 233-245 [doi]
- Cosecure Domination: Hardness Results and AlgorithmsKusum, Arti Pandey. 246-258 [doi]
- Optimal Cost-Based Allocations Under Two-Sided PreferencesGirija Limaye, Meghana Nasre. 259-270 [doi]
- Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meandersBowie Liu, Dennis Wong. 271-281 [doi]
- On Computing Large Temporal (Unilateral) Connected ComponentsIsnard Lopes Costa, Raul Lopes 0001, Andrea Marino 0001, Ana Silva. 282-293 [doi]
- On Integer Linear Programs for Treewidth Based on Perfect Elimination OrderingsSven Mallach. 294-306 [doi]
- Finding Perfect Matching Cuts FasterNeeldhara Misra, Yash More. 307-318 [doi]
- Connected Feedback VertexSet on AT-Free GraphsJoydeep Mukherjee, Tamojit Saha. 319-330 [doi]
- Reconfiguration and Enumeration of Optimal Cyclic Ladder LotteriesYuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka. 331-342 [doi]
- Improved Analysis of Two Algorithms for Min-Weighted Sum Bin PackingGuillaume Sagnol. 343-355 [doi]
- Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree IsomorphismFrank Kammer, Johannes Meintrup, Andrej Sajenko. 356-367 [doi]
- A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced SubgraphsTakumi Tada, Kazuya Haraguchi. 368-379 [doi]
- Partial-Adaptive Submodular MaximizationShaoJie Tang, Jing Yuan 0002. 380-391 [doi]
- Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing PlatformChi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen, Chuang-Chieh Lin. 392-403 [doi]