Abstract is missing.
- On r-Simple k-PathHasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty. 1-12 [doi]
- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line ProgramsEric Allender, Nikhil Balaji, Samir Datta. 13-24 [doi]
- Zero Knowledge and Circuit MinimizationEric Allender, Bireswar Das. 25-32 [doi]
- A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and SensitivityAndris Ambainis, Krisjanis Prusis. 33-44 [doi]
- Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph ReachabilityTetsuo Asano, David G. Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe. 45-56 [doi]
- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex SetRémy Belmonte, Pim van 't Hof, Marcin Jakub Kaminski, Daniël Paulusma. 57-68 [doi]
- Network-Based DissolutionRené van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger. 69-80 [doi]
- On Unification of QBF Resolution-Based CalculiOlaf Beyersdorff, Leroy Chew, Mikolas Janota. 81-93 [doi]
- Minimum Planar Multi-sink Cuts with Connectivity PriorsIvona Bezáková, Zachary Langley. 94-105 [doi]
- The Price of Envy-Freeness in Machine SchedulingVittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli. 106-117 [doi]
- On the Complexity of Some Ordering ProblemsBeate Bollig. 118-129 [doi]
- The Relationship between Multiplicative Complexity and NonlinearityJoan Boyar, Magnus Gausdal Find. 130-140 [doi]
- Dual Connectedness of Edge-Bicolored Graphs and BeyondLeizhen Cai, Junjie Ye. 141-152 [doi]
- Combinatorial Voter Control in ElectionsJiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon. 153-164 [doi]
- An Improved Deterministic #SAT Algorithm for Small De Morgan FormulasRuiwen Chen, Valentine Kabanets, Nitin Saurabh. 165-176 [doi]
- On the Limits of Depth Reduction at Depth 3 Over Small Finite FieldsSuryajith Chillara, Partha Mukhopadhyay. 177-188 [doi]
- Hitting Forbidden Subgraphs in Graphs of Bounded TreewidthMarek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk. 189-200 [doi]
- Probabilistic Analysis of Power AssignmentsMaurits de Graaf, Bodo Manthey. 201-212 [doi]
- Existence of Secure Equilibrium in Multi-player Games with Perfect InformationJulie De Pril, János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze. 213-225 [doi]
- An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear GroupThomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha. 226-238 [doi]
- A Note on the Minimum Distance of Quantum LDPC CodesNicolas Delfosse, Zhentao Li, Stéphan Thomassé. 239-250 [doi]
- Minimum Bisection Is NP-hard on Unit Disk GraphsJosep Díaz, George B. Mertzios. 251-262 [doi]
- Query-Competitive Algorithms for Cheapest Set Problems under UncertaintyThomas Erlebach, Michael Hoffmann 0002, Frank Kammer. 263-274 [doi]
- Streaming KernelizationStefan Fafianie, Stefan Kratsch. 275-286 [doi]
- A Reconfigurations Analogue of Brooks' TheoremCarl Feghali, Matthew Johnson, Daniël Paulusma. 287-298 [doi]
- Intersection Graphs of L-Shapes and Segments in the PlaneStefan Felsner, Kolja B. Knauer, George B. Mertzios, Torsten Ueckerdt. 299-310 [doi]
- Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other ClassesChristian Glaßer, Maximilian Witek. 311-323 [doi]
- Editing to a Connected Graph of Given DegreesPetr A. Golovach. 324-335 [doi]
- Circuit Complexity of Properties of Graphs with Constant Planar CutwidthKristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard. 336-347 [doi]
- On Characterizations of Randomized Computation Using Plain Kolmogorov ComplexityShuichi Hirahara, Akitoshi Kawamura. 348-359 [doi]
- New Results for Non-Preemptive Speed ScalingChien-Chung Huang, Sebastian Ott. 360-371 [doi]
- Lower Bounds for Splittings by Linear CombinationsDmitry Itsykson, Dmitry Sokolov. 372-383 [doi]
- On the Complexity of List Ranking in the Parallel External Memory ModelRiko Jacob, Tobias Lieber, Nodari Sitchinava. 384-395 [doi]
- Knocking Out P k -free GraphsMatthew Johnson, Daniël Paulusma, Anthony Stewart. 396-407 [doi]
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time HypothesisPeter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman. 408-419 [doi]
- Affine Consistency and the Complexity of Semilinear ConstraintsPeter Jonsson, Johan Thapper. 420-431 [doi]
- Small Complexity Classes for Computable AnalysisAkitoshi Kawamura, Hiroyuki Ota. 432-444 [doi]
- Two Results about Quantum MessagesHartmut Klauck, Supartha Podder. 445-456 [doi]
- Parameterized Approximations via d-Skew-Symmetric MulticutSudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh. 457-468 [doi]
- On the Clique Editing ProblemIvan Kovác, Ivana Selecéniová, Monika Steinová. 469-480 [doi]
- On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector LogicGergely Kovásznai, Helmut Veith, Andreas Fröhlich, Armin Biere. 481-492 [doi]
- Computational Complexity of Covering Three-Vertex MultigraphsJan Kratochvíl, Jan Arne Telle, Marek Tesar. 493-504 [doi]
- Finding Maximum Common Biconnected Subgraphs in Series-Parallel GraphsNils Kriege, Petra Mutzel. 505-516 [doi]
- On Coloring Resilient GraphsJeremy Kun, Lev Reyzin. 517-528 [doi]
- Document Retrieval with One WildcardMoshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan. 529-540 [doi]
- An H n/2 Upper Bound on the Price of Stability of Undirected Network Design GamesAkaki Mamageishvili, Matús Mihalák, Simone Montemezzani. 541-552 [doi]
- Traveling Salesman Problems in Temporal GraphsOthon Michail, Paul G. Spirakis. 553-564 [doi]
- Inferring Strings from Lyndon FactorizationYuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 565-576 [doi]
- Betweenness Centrality - Incremental and FasterMeghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran. 577-588 [doi]
- Deterministic Parameterized Algorithms for the Graph Motif ProblemRon Y. Pinter, Hadas Shachnai, Meirav Zehavi. 589-600 [doi]
- The Two Queries Assumption and Arthur-Merlin ClassesVyas Ram Selvam. 601-612 [doi]
- Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract)Hadas Shachnai, Ariella Voloshin, Shmuel Zaks. 613-624 [doi]
- Approximation Algorithms for Bounded Color Matchings via Convex DecompositionsGeorgios Stamoulis. 625-636 [doi]