Abstract is missing.
- Selected Combinatorial Problems Through the Prism of Random Intersection Graphs ModelsPaul G. Spirakis, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos. 1-4 [doi]
- Unifying Gathering Protocols for Swarms of Mobile RobotsJannik Castenow, Jonas Harbig, Friedhelm Meyer auf der Heide. 5-16 [doi]
- The Complexity of Secure RAMsGiuseppe Persiano. 17-20 [doi]
- The Power of the Binary Value PrincipleYaroslav Alekseev, Edward A. Hirsch. 21-36 [doi]
- Independent Set Under a Change Constraint from an Initial SolutionYuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue. 37-51 [doi]
- Asynchronous Fully-Decentralized SGD in the Cluster-Based ModelHagit Attiya, Noa Schiller. 52-66 [doi]
- Non-crossing Shortest Paths Lengths in Planar Graphs in Linear TimeLorenzo Balzotti, Paolo Giulio Franciosa. 67-81 [doi]
- How Vulnerable is an Undirected Planar Graph with Respect to Max FlowLorenzo Balzotti, Paolo Giulio Franciosa. 82-96 [doi]
- Maximum Flows in Parametric Graph TemplatesTal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler, Yishai Oltchik. 97-111 [doi]
- Dynamic Coloring on Restricted Graph ClassesSriram Bhyravarapu, Swati Kumari, I. Vinod Reddy. 112-126 [doi]
- Enumeration of Minimal Tropical Connected SetsIvan Bliznets, Danil Sagunov, Eugene Tagin. 127-141 [doi]
- Dynamic Flows with Time-Dependent CapacitiesThomas Bläsius, Adrian Feilhauer, Jannik Westenfelder. 142-156 [doi]
- On One-Sided Testing Affine SubspacesNader H. Bshouty. 157-171 [doi]
- Stable Scheduling in Transactional MemoryCostas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel. 172-186 [doi]
- Parameterizing Path PartitionsHenning Fernau, Florent Foucaud, Kevin Mann, Utkarsh Padariya, Rajath Rao K. N. 187-201 [doi]
- Maintaining Triconnected Components Under Node ExpansionSimon D. Fink, Ignaz Rutter. 202-216 [doi]
- Approximating Power Node-Deletion ProblemsToshihiro Fujito, Kneto Mukae, Junya Tsuzuki. 217-231 [doi]
- Phase Transition in Count Approximation by Count-Min Sketch with Conservative UpdatesÉric Fusy, Gregory Kucherov. 232-246 [doi]
- Minimum-Link C-Oriented Paths Visiting a Sequence of Regions in the PlaneKerem Geva, Matthew J. Katz, Joseph S. B. Mitchell, Eli Packer. 247-262 [doi]
- Grouped Domination Parameterized by Vertex Cover, Twin Cover, and BeyondTesshu Hanaka, Hirotaka Ono, Yota Otachi, Saeki Uda. 263-277 [doi]
- Broadcasting in Split GraphsHovhannes A. Harutyunyan, Narek Hovhannisyan. 278-292 [doi]
- Partitioning Subclasses of Chordal Graphs with Few DeletionsSatyabrata Jana, Souvik Saha 0002, Abhishek Sahu, Saket Saurabh 0001, Shaily Verma. 293-307 [doi]
- Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic PrecisionPascal Koiran, Subhayan Saha. 308-322 [doi]
- Improved Deterministic Leader Election in Diameter-Two NetworksManish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam. 323-335 [doi]
- Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix EigenvaluesVictor Y. Pan, Soo Go, Qi Luan, Liang Zhao. 336-352 [doi]
- On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of LeavesEmmanuel Sam, Michael R. Fellows, Frances A. Rosamond, Petr A. Golovach. 353-367 [doi]
- Efficiently Enumerating All Spanning Trees of a Plane 3-Tree - (Extended Abstract)Muhammad Nur Yanhaona, Asswad Sarker Nomaan, Md. Saidur Rahman 0001. 368-382 [doi]
- Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication ModelsChun Jiang Zhu. 383-398 [doi]