Abstract is missing.
- Two-Sided Matching Markets with Strongly Correlated PreferencesHugo Gimbert, Claire Mathieu, Simon Mauras. 3-17 [doi]
- Communicating Finite State Machines and an Extensible Toolchain for Multiparty Session TypesNobuko Yoshida, Fangyi Zhou 0002, Francisco Ferreira 0001. 18-35 [doi]
- First-Order Logic and Its Infinitary Quantifier Extensions over Countable WordsBharat Adsul, Saptarshi Sarkar 0001, A. V. Sreejith. 39-52 [doi]
- From Symmetry to Asymmetry: Generalizing TSP Approximations by ParametrizationLukas Behrendt, Katrin Casel, Tobias Friedrich 0001, J. A. Gregor Lagodzinski, Alexander Löser, Marcus Wilhelm. 53-66 [doi]
- A Poly-log Competitive Posted-Price Algorithm for Online Metrical Matching on a SpiderMax Bender, Jacob Gilbert, Kirk Pruhs. 67-84 [doi]
- Computational Complexity of Covering Disconnected MultigraphsJan Bok, Jirí Fiala 0001, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová. 85-99 [doi]
- The Complexity of Bicriteria Tree-DepthPiotr Borowiecki, Dariusz Dereniowski, Dorota Osula. 100-113 [doi]
- TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc GraphsNicolas Bousquet, Alice Joffard. 114-134 [doi]
- Bipartite 3-Regular Counting Problems with Mixed SignsJin-yi Cai, Austen Z. Fan, Yin Liu. 135-148 [doi]
- The Satisfiability Problem for a Quantitative Fragment of PCTLMiroslav Chodil, Antonín Kucera 0001. 149-161 [doi]
- Beyond the BEST Theorem: Fast Assessment of Eulerian TrailsAlessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi. 162-175 [doi]
- Linear-Time Minimal Cograph EditingChristophe Crespelle. 176-189 [doi]
- Regular Model Checking with Regular RelationsVrunda Dave, Taylor Dohmen, Shankara Narayanan Krishna, Ashutosh Trivedi 0001. 190-203 [doi]
- Minimum Consistent Subset Problem for TreesSanjana Dey, Anil Maheshwari, Subhas C. Nandy. 204-216 [doi]
- Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph ClassesDavid Eppstein, Siddharth Gupta 0002, Elham Havvaei. 217-229 [doi]
- The Space Complexity of Sum LabellingHenning Fernau, Kshitij Gajjar. 230-244 [doi]
- On Minimizing Regular Expressions Without Kleene StarHermann Gruber, Markus Holzer 0001, Simon Wolfsteiner. 245-258 [doi]
- Computational Complexity of Computing a Quasi-Proper EquilibriumKristoffer Arnsfelt Hansen, Troels Bjerre Lund. 259-271 [doi]
- Computational Complexity of Synchronization Under Sparse Regular ConstraintsStefan Hoffmann 0001. 272-286 [doi]
- On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph ParametersSvein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle. 287-300 [doi]
- Mengerian Temporal Graphs RevisitedAllen Ibiapina, Ana Silva 0001. 301-313 [doi]
- Faster FPT Algorithms for Deletion to Pairs of Graph ClassesAshwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001. 314-326 [doi]
- Fast Algorithms for the Rooted Triplet Distance Between CaterpillarsJesper Jansson, Wing Lik Lee. 327-340 [doi]
- Deciding Top-Down Determinism of Regular Tree LanguagesPeter Leupold, Sebastian Maneth. 341-353 [doi]
- Propositional Gossip ProtocolsJoseph Livesey, Dominik Wojtczak. 354-370 [doi]
- Complexity of Word Problems for HNN-ExtensionsMarkus Lohrey. 371-384 [doi]
- On Finding Separators in Temporal Split and Permutation GraphsNicolas Maack, Hendrik Molter, Rolf Niedermeier, Malte Renken. 385-398 [doi]
- The Possible Winner Problem with Uncertain Weights RevisitedMarc Neveling, Jörg Rothe, Robin Weishaupt. 399-412 [doi]
- Streaming Deletion Problems Parameterized by Vertex CoverJelle J. Oostveen, Erik Jan van Leeuwen. 413-426 [doi]
- On the Hardness of the Determinant: Sum of Regular Set-Multilinear CircuitsS. Raja 0004, G. V. Sumukha Bharadwaj. 427-439 [doi]
- Concentration of the Collision EstimatorMaciej Skorski. 440-456 [doi]
- Valency-Based Consensus Under Message Adversaries Without Limit-ClosureKyrill Winkler, Ulrich Schmid 0001, Thomas Nowak. 457-474 [doi]