Abstract is missing.
- New Research Directions in the Information AgeJohn E. Hopcroft. 1 [doi]
- Proof Complexity of Non-classical LogicsOlaf Beyersdorff. 15-27 [doi]
- Optimal Acceptors and Optimal Proof SystemsEdward A. Hirsch. 28-39 [doi]
- Different Approaches to Proof SystemsOlaf Beyersdorff, Sebastian Müller. 50-59 [doi]
- Algebraic Proofs over Noncommutative FormulasIddo Tzameret. 60-71 [doi]
- Nonlocal Quantum XOR Games for Large Number of PlayersAndris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh. 72-83 [doi]
- Nontriviality for Exponential Time w.r.t. Weak ReducibilitiesKlaus Ambos-Spies, Timur Bakibayev. 84-93 [doi]
- Streaming Algorithms for Some Problems in Log-SpaceAjesh Babu, Nutan Limaye, Girish Varma. 94-104 [doi]
- Temperature Aware Online Scheduling with a Low Cooling FactorMartin Birks, Stanley P. Y. Fung. 105-116 [doi]
- On Solution Concepts for Matching GamesPéter Biró, Walter Kern, Daniël Paulusma. 117-127 [doi]
- Binary De Bruijn Partial Words with One HoleFrancine Blanchet-Sadri, Jarett Schwartz, Slater Stich, Benjamin J. Wyatt. 128-138 [doi]
- Complexity Invariance of Real InterpretationsGuillaume Bonfante, Florian Deloup. 139-150 [doi]
- Pivot and Loop Complementation on Graphs and Set SystemsRobert Brijder, Hendrik Jan Hoogeboom. 151-162 [doi]
- Revisiting the Minimum Breakpoint Linearization ProblemLaurent Bulteau, Guillaume Fertin, Irena Rusu. 163-174 [doi]
- An ::::O::::(::::n:::::::2:::){/mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion ProblemChristophe Crespelle, Ioan Todinca. 175-186 [doi]
- Centdian Computation for Sensor NetworksBoaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir. 187-198 [doi]
- Twisted Jacobi Intersections CurvesRongquan Feng, Menglong Nie, Hongfeng Wu. 199-210 [doi]
- ::::L::::(2, 1, 1)-Labeling Is NP-Complete for TreesPetr A. Golovach, Bernard Lidický, Daniël Paulusma. 211-221 [doi]
- Complexity of Paths, Trails and Circuits in Arc-Colored DigraphsLaurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot. 222-233 [doi]
- The Max ::::k::::-Cut Game and Its Strong EquilibriaLaurent Gourvès, Jérôme Monnot. 234-246 [doi]
- Kernel and Fast Algorithm for Dense Triplet InconsistencySylvain Guillemot, Matthias Mnich. 247-257 [doi]
- Incremental List Coloring of Graphs, Parameterized by ConservationSepp Hartung, Rolf Niedermeier. 258-270 [doi]
- Schnyder Greedy Routing AlgorithmXin He, Huaming Zhang. 271-283 [doi]
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-WidthPinar Heggernes, Daniel Meister, Udi Rotics. 284-295 [doi]
- A Note on the Testability of Ramsey s ClassCharles Jordan, Thomas Zeugmann. 296-307 [doi]
- Deterministic Polynomial-Time Algorithms for Designing Short DNA WordsMing-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang. 308-319 [doi]
- Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem DifficultNicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin. 320-327 [doi]
- A Dichotomy for ::::k::::-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge FunctionsJin-yi Cai, Michael Kowalczyk. 328-339 [doi]
- Graph Sharing Games: Complexity and ConnectivityJosef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr. 340-349 [doi]
- A Visual Model of ComputationIan Mackie. 350-360 [doi]
- An Automata-Theoretic Characterization of the Chomsky-HierarchyBenedek Nagy. 361-372 [doi]
- Maximum Independent Set in Graphs of Average Degree at Most Three in ::::O::::(1.08537:::::::n:::::::){/mathcal O}(1.08537^n)Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij. 373-384 [doi]
- Simultaneity in Event StructuresG. Michele Pinna, Andrea Saba. 385-396 [doi]
- Safety Verification of Non-linear Hybrid Systems Is Quasi-SemidecidableStefan Ratschan. 397-408 [doi]
- Closed Rectangle-of-Influence Drawings for Irreducible TriangulationsSadish Sadasivam, Huaming Zhang. 409-418 [doi]
- Recovering Social Networks from Contagion InformationSucheta Soundarajan, John E. Hopcroft. 419-430 [doi]
- Two-Layer Planarization Parameterized by Feedback Edge SetJohannes Uhlmann, Mathias Weller. 431-442 [doi]
- A Categorical View of Timed Weak BisimulationNatalya Gribovskaya, Irina Virbitskaite. 443-454 [doi]
- Community Structure in Large Complex NetworksLiaoruo Wang, John E. Hopcroft. 455-466 [doi]
- Generating Internally Triconnected Rooted Plane GraphsBingbing Zhuang, Hiroshi Nagamochi. 467-478 [doi]