Abstract is missing.
- Derandomizing HSSW Algorithm for 3-SATKazuhisa Makino, Suguru Tamaki, Masaki Yamamoto. 1-12 [doi]
- Dominating Set Counting in Graph ClassesShuji Kijima, Yoshio Okamoto, Takeaki Uno. 13-24 [doi]
- The Density Maximization Problem in GraphsMong-Jen Kao, Bastian Katz, Marcus Krug, D. T. Lee, Ignaz Rutter, Dorothea Wagner. 25-36 [doi]
- FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial TimeMalte Brinkmeyer, Thasso Griebel, Sebastian Böcker. 37-48 [doi]
- Tight Bounds on Local Search to Approximate the Maximum Satisfiability ProblemsDaming Zhu, Shaohan Ma, Pingping Zhang. 49-61 [doi]
- Parameterized Complexity in Multiple-Interval Graphs: Partition, Separation, IrredundancyMinghui Jiang, Yong Zhang. 62-73 [doi]
- Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint SumDongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Francis C. M. Lau. 74-85 [doi]
- On the Rainbow Connectivity of Graphs: Complexity and FPT AlgorithmsKei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou. 86-97 [doi]
- On Parameterized Independent Feedback Vertex SetNeeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh. 98-109 [doi]
- Cograph Editing: Complexity and Parameterized AlgorithmsYunlong Liu, Jianxin Wang, Jiong Guo, Jianer Chen. 110-121 [doi]
- Strong I/O Lower Bounds for Binomial and FFT Computation GraphsDesh Ranjan, John E. Savage, Mohammad Zubair. 134-145 [doi]
- Spin Systems on Graphs with Complex Edge Functions and Specified Degree RegularitiesJin-yi Cai, Michael Kowalczyk. 146-157 [doi]
- Quantum Algorithm for the Boolean Hidden Shift ProblemDmitry Gavinsky, Martin Roetteler, Jérémie Roland. 158-167 [doi]
- A Kolmogorov Complexity Proof of the Lovász Local Lemma for SatisfiabilityJochen Messner, Thomas Thierauf. 168-179 [doi]
- Proper n-Cell Polycubes in n - 3 DimensionsAndrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote. 180-191 [doi]
- Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise DataOvidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu. 192-203 [doi]
- Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-TreesTanaeem M. Moosa, M. Sohel Rahman. 204-212 [doi]
- Optimal Strategies for the One-Round Discrete Voronoi Game on a LineAritra Banik, Bhaswar B. Bhattacharya, Sandip Das. 213-224 [doi]
- Computing the Girth of a Planar Graph in Linear TimeHsien-Chih Chang, Hsueh-I Lu. 225-236 [doi]
- Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity TheoryRyan Williams. 237-239 [doi]
- Unions of Disjoint NP-Complete SetsChristian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers. 240-251 [doi]
- ReachFewL = ReachULBrady Garvin, Derrick Stolee, Raghunath Tewari, N. V. Vinodchandran. 252-258 [doi]
- (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource AugmentationYuichi Asahiro, Kenta Kanmera, Eiji Miyano. 259-270 [doi]
- Scheduling Jobs on Heterogeneous PlatformsMarin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram. 271-283 [doi]
- Self-assembling Rulers for Approximating Generalized Sierpinski CarpetsSteven M. Kautz, Brad Shutters. 284-296 [doi]
- Approximately Uniform Online CheckpointingLauri Ahlroth, Olli Pottonen, André Schumacher. 297-306 [doi]
- Bandwidth of Convex Bipartite Graphs and Related GraphsAnish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno. 307-318 [doi]
- Algorithms for Partition of Some Class of Graphs under CompactionNarayan Vikas. 319-330 [doi]
- A Generic Approach to Decomposition Algorithms, with an Application to Digraph DecompositionBinh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski. 331-342 [doi]
- Matching and P 2-Packing: Weighted VersionsQilong Feng, Jianxin Wang, Jianer Chen. 343-353 [doi]
- On Totally Unimodularity of Edge-Edge Adjacency MatricesYusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai. 354-365 [doi]
- The Topology Aware File Distribution ProblemShawn T. O Neil, Amitabh Chaudhary, Danny Z. Chen, Haitao Wang. 366-378 [doi]
- Exploiting the Robustness on Power-Law NetworksYilin Shen, Nam P. Nguyen, My T. Thai. 379-390 [doi]
- Competitive Algorithms for Online PricingYong Zhang, Francis Y. L. Chin, Hing-Fung Ting. 391-401 [doi]
- Making Abstraction-Refinement Efficient in Model CheckingCong Tian, Zhenhua Duan. 402-413 [doi]
- An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel TimesGuozhen Tan, Jinghao Sun. 414-431 [doi]
- Property Testing for Cyclic Groups and BeyondFrançois Le Gall, Yuichi Yoshida. 432-443 [doi]
- Canonizing Hypergraphs under Abelian Group ActionVikraman Arvind, Johannes Köbler. 444-455 [doi]
- Linear Time Algorithms for the Basis of Abelian GroupsGregory Karagiorgos, Dimitrios Poulakis. 456-466 [doi]
- Characterizations of Locally Testable Linear- and Affine-Invariant FamiliesAngsheng Li, Yicheng Pan. 467-478 [doi]
- A New Conditionally Anonymous Ring SignatureShengke Zeng, Shaoquan Jiang, Zhiguang Qin. 479-491 [doi]
- On the Right-Seed Array of a StringMichalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis. 492-502 [doi]
- Compressed Directed Acyclic Word Graph with Application in Local AlignmentHuy Hoang Do, Wing-Kin Sung. 503-518 [doi]
- Unavoidable Regularities in Long Words with Bounded Number of Symbol OccurrencesJuha Kortelainen, Tuomas Kortelainen, Ari Vesanen. 519-530 [doi]
- Summing Symbols in Mutual RecurrencesBerkeley R. Churchill, Edmund A. Lamagna. 531-542 [doi]
- Flipping Triangles and RectanglesMinghui Jiang. 543-554 [doi]
- Unconstrained and Constrained Fault-Tolerant Resource AllocationKewen Liao, Hong Shen. 555-566 [doi]
- Finding Paths with Minimum Shared EdgesMasoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh. 567-578 [doi]
- Combinatorial Group Testing for Corruption Localizing HashingAnnalisa De Bonis, Giovanni Di Crescenzo. 579-591 [doi]
- Task Ordering and Memory Management Problem for Degree of Parallelism EstimationSergiu Carpov, Jacques Carlier, Dritan Nace, Renaud Sirdey. 592-603 [doi]
- Computing Majority with Triple QueriesGianluca De Marco, Evangelos Kranakis, Gábor Wiener. 604-615 [doi]
- A New Variation of Hat Guessing GamesTengyu Ma, Xiaoming Sun, Huacheng Yu. 616-626 [doi]
- Oblivious Transfer and n-Variate Linear Function EvaluationYeow Meng Chee, Huaxiong Wang, Liang Feng Zhang. 627-637 [doi]
- Optimal Online Algorithms on Two Hierarchical Machines with Resource AugmentationYiwei Jiang, An Zhang, Jueliang Hu. 638-648 [doi]