Abstract is missing.
- Designing Algorithms with Limited Work SpaceTetsuo Asano. 1 [doi]
- Group-Theoretic Lower Bounds for the Complexity of Matrix MultiplicationAlexey Pospelov. 2-13 [doi]
- A Real Elementary Approach to the Master Recurrence and GeneralizationsChee Yap. 14-26 [doi]
- Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and DeadlinesPaul C. Bell, Prudence W. H. Wong. 27-36 [doi]
- Approximating Edge Dominating Set in Dense GraphsRichard Schmied, Claus Viehmann. 37-47 [doi]
- Near Approximation of Maximum Weight Matching through Efficient Weight ReductionAndrzej Lingas, Cui Di. 48-57 [doi]
- Approximability of the Subset Sum Reconfiguration ProblemTakehiro Ito, Erik D. Demaine. 58-69 [doi]
- An Improved Kernel for Planar Connected Dominating SetWeizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen. 70-81 [doi]
- Fast Exact Algorithm for ::::L::::(2, 1)-Labeling of GraphsKonstanty Junosza-Szaniawski, Jan Kratochvíl, Mathieu Liedloff, Peter Rossmanith, Pawel Rzazewski. 82-93 [doi]
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a TreeTakehiro Ito, Kazuto Kawamura, Xiao Zhou. 94-105 [doi]
- A Compact Encoding of Unordered Binary TreesKozue Iwata, Shiro Ishiwata, Shin-Ichi Nakano. 106-113 [doi]
- Low Distortion Metric Embedding into Constant DimensionAndrás Faragó. 114-123 [doi]
- A Better Upper Bound on Weights of Exact Threshold FunctionsXue Chen, Guangda Hu, Xiaoming Sun. 124-132 [doi]
- Submodular Function Minimization under a Submodular Set Covering ConstraintNaoyuki Kamiyama. 133-141 [doi]
- Optimal Allocation in Combinatorial Auctions with Quadratic Utility FunctionsAkiyoshi Shioura, Shunya Suzuki. 142-153 [doi]
- Energy and Fan-In of Threshold Circuits Computing Mod FunctionsAkira Suzuki, Kei Uchizawa, Xiao Zhou. 154-163 [doi]
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of ::::o::::(loglog::::n::::) DepthFengming Wang. 164-170 [doi]
- Quantum Complexity: Some Recent Results, Some Open Problems, Some ThoughtsRichard J. Lipton. 171 [doi]
- Non-adaptive Complex Group Testing with Multiple Positive SetsFrancis Y. L. Chin, Henry C. M. Leung, Siu-Ming Yiu. 172-183 [doi]
- How to Cut a Graph into Many PiecesRuben van der Zwaan, André Berger, Alexander Grigoriev. 184-194 [doi]
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small AlphabetPooya Davoodi, S. Srinivasa Rao. 195-205 [doi]
- Integer Representations towards Efficient Counting in the Bit Probe ModelGerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti. 206-217 [doi]
- Closed Left-R.E. SetsSanjay Jain, Frank Stephan, Jason Teutsch. 218-229 [doi]
- P:::0:::::1::/it /Pi^0_1 Sets and TilingsEmmanuel Jeandel, Pascal Vanier. 230-239 [doi]
- Intuitive Probability LogicChunlai Zhou. 240-251 [doi]
- An Algebraic Characterization of Strictly Piecewise LanguagesJie Fu, Jeffrey Heinz, Herbert G. Tanner. 252-263 [doi]
- Extending Partial Representations of Interval GraphsPavel Klavík, Jan Kratochvíl, Tomás Vyskocil. 276-285 [doi]
- Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way - (Extended Abstract)Serafino Cicerone. 286-297 [doi]
- The Complexity and Approximability of Minimum Contamination ProblemsAngsheng Li, Linqing Tang. 298-307 [doi]
- On the Low-Dimensional Steiner Minimum Tree Problem in Hamming MetricErnst Althaus, Joschka Kupilas, Rouven Naujoks. 308-319 [doi]
- Lower Bounds for Testing Computability by Small Width OBDDsJoshua Brody, Kevin Matulef, Chenggang Wu. 320-331 [doi]
- On the Amount of Nonconstructivity in Learning Recursive FunctionsRusins Freivalds, Thomas Zeugmann. 332-343 [doi]
- A Bad Instance for k-Means++Tobias Brunsch, Heiko Röglin. 344-352 [doi]
- Catching a Fast Robber on Interval GraphsTomás Gavenciak. 353-364 [doi]
- Some Tractable Win-Lose GamesSamir Datta, Nagarajan Krishnamurthy. 365-376 [doi]
- A Note on Obfuscation for Cryptographic Functionalities of Secret-Operation Then Public-EncryptionNing Ding, Dawu Gu. 377-389 [doi]
- Grey-Box SteganographyMaciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel. 390-402 [doi]
- Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP ModelsMing Lam Leung, Yang Li, Shengyu Zhang. 403-408 [doi]
- The Hardness of Median in the Synchronized Bit Communication ModelKarolina Soltys. 409-415 [doi]
- Lower Bounds for the Smoothed Number of Pareto Optimal SolutionsTobias Brunsch, Heiko Röglin. 416-427 [doi]
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity DemandsTakuro Fukunaga. 428-439 [doi]
- Improved Approximation Bounds for the Student-Project Allocation Problem with Preferences over ProjectsKazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa. 440-451 [doi]
- Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion ProblemYoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno. 452-462 [doi]
- Switching to Hedgehog-Free Graphs Is NP-CompleteEva Jelínková. 463-470 [doi]
- Locally Injective Homomorphism to the Simple Weight GraphsOndrej Bílka, Bernard Lidický, Marek Tesar. 471-482 [doi]
- Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique WidthBenjamin Hellouin de Menibus, Takeaki Uno. 483-494 [doi]
- Hide-and-Seek: Algorithms for Polygon Walk ProblemsAtlas F. Cook, Chenglin Fan, Jun Luo. 495-504 [doi]
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory - (Extended Abstract)Alexander Langer, Peter Rossmanith, Somnath Sikdar. 505-516 [doi]
- Edge Contractions in Subclasses of Chordal GraphsRémy Belmonte, Pinar Heggernes, Pim van t Hof. 528-539 [doi]
- Planarity Testing RevisitedSamir Datta, Gautam Prakriya. 540-551 [doi]
- Generalized Satisfiability for the Description Logic ::::ALC::::/mathcal{ALC} - (Extended Abstract)Arne Meier, Thomas Schneider 0002. 552-562 [doi]