Abstract is missing.
- Alternation Trading Proofs and Their LimitationsSam Buss. 1-7 [doi]
- Bin Packing Games with Selfish ItemsLeah Epstein. 8-21 [doi]
- A Constructive Proof of the Topological Kruskal TheoremJean Goubault-Larrecq. 22-41 [doi]
- Logical and Structural Approaches to the Graph Isomorphism ProblemMartin Grohe. 42 [doi]
- Prior-Free Auctions of Digital GoodsElias Koutsoupias. 43-44 [doi]
- Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven DevelopmentNir Piterman. 45-49 [doi]
- Clustering on k-Edge-Colored GraphsEric Angel, Evripidis Bampis, Alexander Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos. 50-61 [doi]
- How to Pack Your Items When You Have to Buy Your KnapsackAntonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae. 62-73 [doi]
- Computing Behavioral Distances, CompositionallyGiorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare. 74-85 [doi]
- Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? - (Extended Abstract)Sebastian Bala. 86-97 [doi]
- Rewriting Guarded Negation QueriesVince Bárány, Michael Benedikt, Balder ten Cate. 98-110 [doi]
- Parity Games and Propositional ProofsArnold Beckmann, Pavel Pudlák, Neil Thapen. 111-122 [doi]
- Logic and Branching AutomataNicolas Bedon. 123-134 [doi]
- A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size ItemsMarco Bender, Clemens Thielen, Stephan Westphal. 135-145 [doi]
- Determinacy and Rewriting of Top-Down and MSO Tree TransformationsMichael Benedikt, Joost Engelfriet, Sebastian Maneth. 146-158 [doi]
- On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency TestingChristoph Berkholz, Oleg Verbitsky. 159-170 [doi]
- Validity of Tree Pattern Queries with Respect to Schema InformationHenrik Björklund, Wim Martens, Thomas Schwentick. 171-182 [doi]
- Auctions for Partial Heterogeneous PreferencesPiero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro. 183-194 [doi]
- New Polynomial Cases of the Weighted Efficient Domination ProblemAndreas Brandstädt, Martin Milanic, Ragnar Nevries. 195-206 [doi]
- Bringing Order to Special Cases of Klee's Measure ProblemKarl Bringmann. 207-218 [doi]
- Random Shortest Paths: Non-euclidean Instances for Metric Optimization ProblemsKarl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao. 219-230 [doi]
- Semilinearity and Context-Freeness of Languages Accepted by Valence AutomataP. Buckheister, Georg Zetzsche. 231-242 [doi]
- Learning Reductions to Sparse SetsHarry Buhrman, Lance Fortnow, John M. Hitchcock, Bruno Loff. 243-253 [doi]
- Probabilistic Automata with Isolated Cut-PointsRohit Chadha, A. Prasad Sistla, Mahesh Viswanathan. 254-265 [doi]
- On Stochastic Games with Multiple ObjectivesTaolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, Clemens Wiltsche. 266-277 [doi]
- Minimal Indices for Successor Search - (Extended Abstract)Sarel Cohen, Amos Fiat, Moshik Hershcovitch, Haim Kaplan. 278-289 [doi]
- Paradigms for Parameterized EnumerationNadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer. 290-301 [doi]
- Complexity of Checking Bisimilarity between Sequential and Parallel ProcessesWojciech Czerwinski, Petr Jancar, Martin Kot, Zdenek Sawa. 302-313 [doi]
- Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness ResultsStephane Durocher, Saeed Mehrabi 0001. 314-324 [doi]
- Linear-Space Data Structures for Range Frequency Queries on Arrays and TreesStephane Durocher, Rahul Shah, Matthew Skala, Sharma V. Thankachan. 325-336 [doi]
- Noninterference with Local PoliciesSebastian Eggert, Henning Schnoor, Thomas Wilke. 337-348 [doi]
- In-Place Binary CountersAmr Elmasry, Jyrki Katajainen. 349-360 [doi]
- Rent or Buy Problems with a Fixed Time HorizonLeah Epstein, Hanan Zebedat-Haider. 361-372 [doi]
- On the Recognition of Four-Directional Orthogonal Ray GraphsStefan Felsner, George B. Mertzios, Irina Musta. 373-384 [doi]
- Reachability Analysis of Recursive Quantum Markov ChainsYuan Feng, Nengkun Yu, Mingsheng Ying. 385-396 [doi]
- Ordering Metro Lines by Block CrossingsMartin Fink, Sergey Pupyrev. 397-408 [doi]
- Reachability in Register Machines with Polynomial UpdatesAlain Finkel, Stefan Göller, Christoph Haase. 409-420 [doi]
- On the Parameterized Complexity of Cutting a Few Vertices from a GraphFedor V. Fomin, Petr A. Golovach, Janne H. Korhonen. 421-432 [doi]
- On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of ValiantHervé Fournier, Sylvain Perifel, Rémi de Verclos. 433-444 [doi]
- A Parameterized Complexity Analysis of Combinatorial Feature Selection ProblemsVincent Froese, René van Bevern, Rolf Niedermeier, Manuel Sorge. 445-456 [doi]
- Meta-kernelization with Structural ParametersRobert Ganian, Friedrich Slivovsky, Stefan Szeider. 457-468 [doi]
- Separating Hierarchical and General Hub LabelingsAndrew V. Goldberg, Ilya Razenshteyn, Ruslan Savchenko. 469-479 [doi]
- Solving 3-Superstring in 3 n/3 TimeAlexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin. 480-491 [doi]
- On the Parameterized Complexity of the Maximum Edge 2-Coloring ProblemPrachi Goyal, Vikram Kamat, Neeldhara Misra. 492-503 [doi]
- A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column SumsLeonid Gurvits. 504-515 [doi]
- Polynomial Threshold Functions and Boolean Threshold CircuitsKristoffer Arnsfelt Hansen, Vladimir V. Podolskii. 516-527 [doi]
- Reachability in Higher-Order-CountersAlexander Heußner, Alexander Kartzow. 528-539 [doi]
- Length-Increasing Reductions for PSPACE-CompletenessJohn M. Hitchcock, Aduri Pavan. 540-550 [doi]
- Improved Complexity Results on k-Coloring P t -Free GraphsShenwei Huang. 551-558 [doi]
- A Polychromatic Ramsey Theory for OrdinalsMartin Huschenbett, Jiamou Liu. 559-570 [doi]
- Detecting Regularities on Grammar-Compressed StringsTomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara. 571-582 [doi]
- Small Depth Proof SystemsAndreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah. 583-594 [doi]
- Reversibility of Computations in Graph-Walking AutomataMichal Kunc, Alexander Okhotin. 595-606 [doi]
- Prime LanguagesOrna Kupferman, Jonathan Mosheiff. 607-618 [doi]
- Logical Aspects of the Lexicographic Order on 1-Counter LanguagesDietrich Kuske. 619-630 [doi]
- Helly Circular-Arc Graph Isomorphism Is in LogspaceJohannes Köbler, Sebastian Kuhnert, Oleg Verbitsky. 631-642 [doi]
- Zeno, Hercules and the Hydra: Downward Rational Termination Is AckermannianRanko Lazic, Joël Ouaknine, James Worrell. 643-654 [doi]
- Strong Completeness for Markovian LogicsDexter Kozen, Radu Mardare, Prakash Panangaden. 655-666 [doi]
- Arithmetic Branching Programs with MemoryStefan Mengel. 667-678 [doi]
- Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?Neeldhara Misra, Fahad Panolan, Saket Saurabh. 679-690 [doi]
- Unlimited Decidability of Distributed Synthesis with Limited Missing KnowledgeAnca Muscholl, Sven Schewe. 691-703 [doi]
- Revisiting Space in Proof Complexity: Treewidth and PathwidthMoritz Müller, Stefan Szeider. 704-716 [doi]
- Space-Efficient Parallel Algorithms for Combinatorial Search ProblemsAndrea Pietracaprina, Geppino Pucci, Francesco Silvestri, Fabio Vandin. 717-728 [doi]
- Separating Regular Languages by Piecewise Testable and Unambiguous LanguagesThomas Place, Lorijn van Rooijen, Marc Zeitoun. 729-740 [doi]
- An Unusual Temporal LogicAlexander Rabinovich. 741-752 [doi]
- A More Efficient Simulation Algorithm on Kripke StructuresFrancesco Ranzato. 753-764 [doi]
- A Planarity Test via Construction SequencesJens M. Schmidt. 765-776 [doi]
- Feasible Combinatorial Matrix TheoryAriel Germán Fernández, Michael Soltys. 777-788 [doi]
- Approximation Algorithms for Generalized Plant LocationAlexander Souza. 789-800 [doi]
- Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out GatesYasuhiro Takahashi, Takeshi Yamazaki, Kazuyuki Tanaka. 801-812 [doi]
- Improved Bounds for Reduction to Depth 4 and Depth 3Sébastien Tavenas. 813-824 [doi]
- Parameterized Algorithms for Module MotifMeirav Zehavi. 825-836 [doi]
- On the Quantifier-Free Dynamic Complexity of ReachabilityThomas Zeume, Thomas Schwentick. 837-848 [doi]