Abstract is missing.
- Cutting a Tree with Subgraph Complementation is Hard, Except for Some Small TreesDhanyamol Antony, Sagartanu Pal, R. B. Sandeep, R. Subashini. 3-19 [doi]
- Elastic-Degenerate String Matching with 1 ErrorGiulia Bernardini 0001, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba. 20-37 [doi]
- Median and Hybrid Median K-Dimensional TreesAmalia Duch, Conrado Martínez, Mercè Pons, Salvador Roura. 38-53 [doi]
- Weighted Connected MatchingsGuilherme C. M. Gomes, Bruno Porto Masquio, Paulo E. D. Pinto, Vinicius F. dos Santos, Jayme Luiz Szwarcfiter. 54-70 [doi]
- Space-Efficient Data Structure for Next/Previous Larger/Smaller Value QueriesSeungbum Jo, Geunho Kim. 71-87 [doi]
- Near-Optimal Search Time in δ-Optimal SpaceTomasz Kociumaka, Gonzalo Navarro, Francisco Olivares. 88-103 [doi]
- Computing and Listing Avoidable Vertices and PathsCharis Papadopoulos, Athanasios E. Zisis. 104-120 [doi]
- Klee's Measure Problem Made ObliviousThore Thießen, Jan Vahrenhold. 121-138 [doi]
- A Parameterized Approximation Algorithm for the Multiple Allocation k-Hub CenterMarcelo Pinheiro Leite Benedito, Lucas P. Melo, Lehilton L. C. Pedrosa. 141-156 [doi]
- Theoretical Analysis of git bisectJulien Courtiel, Paul Dorbec, Romain Lecoq. 157-171 [doi]
- Pathlength of Outerplanar GraphsThomas Dissaux, Nicolas Nisse. 172-187 [doi]
- Approximations for the Steiner Multicycle ProblemCristina G. Fernandes, Carla Negri Lintzmayer, Phablo F. S. Moura. 188-203 [doi]
- p-norm Diversity ConstraintsWaldo Gálvez, Víctor Verdugo. 204-221 [doi]
- Obtaining Approximately Optimal and Diverse Solutions via DispersionJie Gao 0001, Mayank Goswami 0001, Karthik C. S., Meng-Tsung Tsai, Shih-Yu Tsai, Hao-Tsung Yang. 222-239 [doi]
- On APN Functions Whose Graphs are Maximal Sidon SetsClaude Carlet. 243-254 [doi]
- On the Subfield Codes of a Subclass of Optimal Cyclic Codes and Their Covering StructuresFélix Hernández, Gerardo Vega. 255-270 [doi]
- Multidimensional Manhattan PreferencesJiehua Chen 0001, Martin Nöllenburg, Sofia Simola, Anaïs Villedieu, Markus Wallinger. 273-289 [doi]
- Exact Learning of Multitrees and Almost-Trees Using Path QueriesRamtin Afshar, Michael T. Goodrich. 293-311 [doi]
- Almost Optimal Proper Learning and Testing PolynomialsNader H. Bshouty. 312-327 [doi]
- Estimating the Clustering Coefficient Using Sample Complexity AnalysisAlane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti. 328-341 [doi]
- Binary Completely Reachable AutomataDavid Casas, Mikhail V. Volkov. 345-358 [doi]
- Conelikes and Ranker ComparisonsViktor Henriksson, Manfred Kufleitner. 359-375 [doi]
- The Net Automaton of a Rational ExpressionSylvain Lombardy, Jacques Sakarovitch. 376-392 [doi]
- Embedding Arbitrary Boolean Circuits into Fungal AutomataAugusto Modanese, Thomas Worsch. 393-408 [doi]
- How Many Times Do You Need to Go Back to the Future in Unary Temporal Logic?Thomas Place, Marc Zeitoun. 409-425 [doi]
- String Attractors and Infinite WordsAntonio Restivo, Giuseppe Romana, Marinella Sciortino. 426-442 [doi]
- On the Zero-Sum Ramsey Problem over $\mathbb {Z}_2^d$José D. Alvarado, Lucas Colucci, Roberto Parente, Victor Souza. 445-459 [doi]
- On χ-Diperfect Digraphs with Stability Number TwoCaroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee. 460-475 [doi]
- Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract)Luca Becchetti, Andrea E. F. Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi. 476-492 [doi]
- A Combinatorial Link Between Labelled Graphs and Increasingly Labelled Schröder TreesOlivier Bodini, Antoine Genitrini, Mehdi Naima. 493-509 [doi]
- Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned GraphsJan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey. 510-526 [doi]
- On the Zombie Number of Various Graph ClassesProsenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer. 527-543 [doi]
- Patterns in Ordered (random) MatchingsAndrzej Dudek, Jaroslaw Grytczuk, Andrzej Rucinski 0001. 544-556 [doi]
- Tree 3-Spanners on Generalized Prisms of GraphsRenzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi. 557-573 [doi]
- A General Approach to Ammann Bars for Aperiodic TilingsCarole Porrier, Thomas Fernique. 574-589 [doi]
- List Homomorphism: Beyond the Known BoundariesSriram Bhyravarapu, Satyabrata Jana, Fahad Panolan, Saket Saurabh 0001, Shaily Verma. 593-609 [doi]
- On the Closures of Monotone Algebraic Classes and Variants of the DeterminantPrasad Chaugule, Nutan Limaye. 610-625 [doi]
- MCSP is Hard for Read-Once Nondeterministic Branching ProgramsLudmila Glinskih, Artur Riazanov. 626-640 [doi]
- Bounds on Oblivious Multiparty Quantum Communication ComplexityFrançois Le Gall, Daiki Suruga. 641-657 [doi]
- Improved Parallel Algorithms for Generalized Baumslag GroupsCaroline Mattes, Armin Weiß. 658-675 [doi]
- Piercing Pairwise Intersecting Convex Shapes in the PlaneSaman Bazargani, Ahmad Biniaz, Prosenjit Bose. 679-695 [doi]
- Local Routing Algorithms on Euclidean Spanners with Small DiameterNicolas Bonichon, Prosenjit Bose, Yan Garito. 696-712 [doi]
- On r-Guarding SCOTs - A New Family of Orthogonal PolygonsVasco Cruz, Ana Paula Tomás. 713-729 [doi]
- Complexity Results on Untangling Red-Blue MatchingsArun Kumar Das, Sandip Das 0001, Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier. 730-745 [doi]
- On Vertex Guarding Staircase PolygonsMatt Gibson-Lopez, Erik Krohn, Bengt J. Nilsson, Matthew Rayford, Sean Soderman, Pawel Zylinski. 746-760 [doi]
- On the Complexity of Half-Guarding Monotone PolygonsHannah Miller Hillberg, Erik Krohn, Alex Pahlow. 761-777 [doi]