Abstract is missing.
- Propositional Proofs in Frege and Extended Frege Systems (Abstract)Sam Buss. 1-6 [doi]
- Circuit Complexity Meets Ontology-Based Data AccessVladimir V. Podolskii. 7-26 [doi]
- NEXP-Completeness and Universal Hardness Results for Justification LogicAntonis Achilleos. 27-52 [doi]
- A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three HolesMaxim A. Babenko, Alexander V. Karzanov. 53-66 [doi]
- Generalized LR Parsing for Grammars with ContextsMikhail Barash, Alexander Okhotin. 67-79 [doi]
- On Compiling Structured CNFs to OBDDsSimone Bova, Friedrich Slivovsky. 80-93 [doi]
- Satisfiability of ECTL* with Tree ConstraintsClaudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey. 94-108 [doi]
- On Growth and Fluctuation of k-Abelian ComplexityJulien Cassaigne, Juhani Karhumäki, Aleksi Saarela. 109-122 [doi]
- A Polynomial-Time Algorithm for Outerplanar Diameter ImprovementNathann Cohen, Daniel Gonçalves 0001, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller. 123-142 [doi]
- Editing to a Planar Graph of Given DegreesKonrad Kazimierz Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma, Dimitrios M. Thilikos. 143-156 [doi]
- On the Satisfiability of Quantum Circuits of Small TreewidthMateus de Oliveira Oliveira. 157-172 [doi]
- Equations over Free Inverse Monoids with Idempotent VariablesVolker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva. 173-188 [doi]
- A Logical Characterization of Timed Pushdown LanguagesManfred Droste, Vitaly Perevoshchikov. 189-203 [doi]
- An In-Place Priority Queue with O(1) Time for Push and \lg n + O(1) lg n + O ( 1 ) Comparisons for PopStefan Edelkamp, Amr Elmasry, Jyrki Katajainen. 204-218 [doi]
- Resolution Complexity of Perfect Matching Principles for Sparse GraphsDmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov. 219-230 [doi]
- Operations on Self-Verifying Finite AutomataJozef Stefan Jirásek, Galina Jirásková, Alexander Szabari. 231-261 [doi]
- Automath Type Inclusion in Barendregt's CubeFairouz Kamareddine, Joe B. Wells, Daniel Lima Ventura. 262-282 [doi]
- Circuit Lower Bounds for Average-Case MAAlexander Knop. 283-295 [doi]
- Making Randomness Public in Unbounded-Round Information ComplexityAlexander Kozachinskiy. 296-309 [doi]
- First-Order Logic Definability of Free LanguagesVioletta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella. 310-324 [doi]
- Representation of (Left) Ideal Regular Languages by Synchronizing AutomataMarina I. Maslennikova, Emanuele Rodaro. 325-338 [doi]
- Some Properties of Antistochastic StringsAlexey Milovanov. 339-349 [doi]
- Approximation and Exact Algorithms for Special Cases of Connected f-FactorsN. S. Narayanaswamy, C. S. Rahul. 350-363 [doi]
- Rewriting Higher-Order Stack TreesVincent Penelle. 364-397 [doi]
- Interacting with Modal Logics in the Coq Proof AssistantChristoph Benzmüller, Bruno Woltzenlogel Paleo. 398-411 [doi]
- Delay Games with WMSO + + U Winning ConditionsMartin Zimmermann. 412-425 [doi]
- Asymptotically Precise Ranking Functions for Deterministic Size-Change SystemsFlorian Zuleger. 426-442 [doi]