Abstract is missing.
- Parameterized Algorithms for Finding Highly Connected SolutionAnkit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Saket Saurabh 0001. 1-16 [doi]
- Coloring a Dominating Set Without Conflicts: q-Subset Square ColoringAbidha V. P, Pradeesha Ashok, Avi Tomar, Dolly Yadav. 17-34 [doi]
- Quotient Structures and Groups Computable in Polynomial TimePavel Alaev. 35-45 [doi]
- Parameterized Complexity of List Coloring and Max ColoringBardiya Aryanfard, Fahad Panolan. 46-63 [doi]
- Eternal Vertex Cover on Bipartite GraphsJasine Babu, Neeldhara Misra, Saraswati Nanoti. 64-76 [doi]
- Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear TimeLorenzo Balzotti, Paolo Giulio Franciosa. 77-95 [doi]
- Lossy Kernelization of Same-Size ClusteringSayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Siminov. 96-114 [doi]
- Output Sensitive Fault Tolerant Maximum MatchingNiranka Banerjee, Manoj Gupta, Venkatesh Raman 0001, Saket Saurabh 0001. 115-132 [doi]
- Bounds for Synchronizing Markov Decision ProcessesLaurent Doyen 0001, Marie van den Bogaard. 133-151 [doi]
- Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal GraphsPetr A. Golovach, Fahad Panolan, Ashutosh Rai 0001, Saket Saurabh 0001. 152-169 [doi]
- Discrete Versions of the KKM Lemma and Their PPAD-CompletenessAlexander Grishutin, Daniil Musatov. 170-189 [doi]
- The Fast Algorithm for Online k-server Problem on TreesKamil Khadiev, Maxim Yagafarov. 190-208 [doi]
- Finite Ambiguity and Finite Sequentiality in Weighted Automata over FieldsPeter Kostolányi. 209-223 [doi]
- New Bounds for the Flock-of-Birds ProblemAlexander Kozachinskiy. 224-237 [doi]
- Heterogeneous Multi-commodity Network Flows over TimeYifen Li, Xiaohui Bei, Youming Qiao, Dacheng Tao, Zhiya Chen. 238-255 [doi]
- On the Determinization of Event-Clock Input-Driven Pushdown AutomataMizuhito Ogawa, Alexander Okhotin. 256-268 [doi]
- The GKK Algorithm is the Fastest over Simple Mean-Payoff GamesPierre Ohlmann. 269-288 [doi]
- Partial Vertex Cover on Graphs of Bounded DegeneracyFahad Panolan, Hannane Yaghoubizade. 289-301 [doi]
- Abelian Repetition Threshold RevisitedElena A. Petrova, Arseny M. Shur. 302-319 [doi]
- Characterizing Level One in Group-Based Concatenation HierarchiesThomas Place, Marc Zeitoun. 320-337 [doi]
- How Much Randomness is Needed to Convert MA Protocols to AM Protocols?Nikolai K. Vereshchagin. 338-349 [doi]