Abstract is missing.
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global DependenciesMarek Karpinski. 3-11 [doi]
- On the Existence and Computability of Long-Run Average Properties in Probabilistic VASSAntonín Kucera. 12-24 [doi]
- Longest α-Gapped Repeat and PalindromePawel Gawrychowski, Florin Manea. 27-40 [doi]
- On the Enumeration of PermutominoesAna Paula Tomás. 41-52 [doi]
- Stabbing Segments with Rectilinear ObjectsMercè Claverol, Delia Garijo, Matias Korman, Carlos Seara, Rodrigo I. Silveira. 53-64 [doi]
- 2Miroslaw Kowaluk, Gabriela Majewska. 65-78 [doi]
- Depth, Highness and DNR DegreesPhilippe Moser, Frank Stephan. 81-94 [doi]
- On the Expressive Power of Read-Once DeterminantsN. R. Aravind, Pushkar S. Joglekar. 95-105 [doi]
- Constructive Relationships Between Algebraic Thickness and NormalityJoan Boyar, Magnus Gausdal Find. 106-117 [doi]
- On the Structure of Solution-Graphs for Boolean FormulasPatrick Scharpfenecker. 118-130 [doi]
- Interprocedural Reachability for Flat Integer ProgramsPierre Ganty, Radu Iosif. 133-145 [doi]
- Complexity of Suffix-Free Regular LanguagesJanusz A. Brzozowski, Marek Szykula. 146-159 [doi]
- Alternation Hierarchies of First Order Logic with Regular PredicatesLuc Dartois, Charles Paperman. 160-172 [doi]
- A Note on Decidable Separability by Piecewise Testable LanguagesWojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun. 173-185 [doi]
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee ParameterizationsMarin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant. 189-201 [doi]
- Incremental Complexity of a Bi-objective Hypergraph Transversal ProblemRicardo Andrade, Etienne Birmelé, Arnaud Mary, Thomas Picchetti, Marie-France Sagot. 202-213 [doi]
- Pairs Covered by a Sequence of SetsPeter Damaschke. 214-226 [doi]
- Recurring Comparison Faults: Sorting and Finding the MinimumBarbara Geissmann, Matús Mihalák, Peter Widmayer. 227-239 [doi]
- Minimal Disconnected Cuts in Planar GraphsMarcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos. 243-254 [doi]
- ϵ-Almost Selectors and Their ApplicationsAnnalisa De Bonis, Ugo Vaccaro. 255-268 [doi]
- Derandomized Construction of Combinatorial Batch CodesSrimanta Bhattacharya. 269-282 [doi]
- On the Mathematics of Data Centre Network TopologiesIain A. Stewart. 283-295 [doi]
- Privacy in Elections: k-Anonymizing Preference OrdersNimrod Talmon. 299-310 [doi]
- On Equivalences, Metrics, and Polynomial TimeAlberto Cappai, Ugo Dal Lago. 311-323 [doi]
- Conjunctive Visibly-Pushdown Path QueriesMartin Lange, Étienne Lozes. 327-338 [doi]
- On the Power of Color RefinementVikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky. 339-350 [doi]
- Block Representation of Reversible Causal Graph DynamicsPablo Arrighi, Simon Martiel, Simon Perdrix. 351-363 [doi]
- Reasoning with Global Assumptions in Arithmetic Modal LogicsClemens Kupke, Dirk Pattinson, Lutz Schröder. 367-380 [doi]
- Nearest Fixed Points and Concurrent Priority GamesBruno Karelovic, Wieslaw Zielonka. 381-393 [doi]