Abstract is missing.
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness TournamentMarek Karpinski, Warren Schudy. 3-14 [doi]
- A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2Piotr Berman, Marek Karpinski, Alexander Zelikovsky. 15-24 [doi]
- Approximate PeriodicityAmihood Amir, Estrella Eisenberg, Avivit Levy. 25-36 [doi]
- Approximating the Average Stretch Factor of Geometric GraphsSiu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid. 37-48 [doi]
- Satisfiability with Index DependencyHongyu Liang, Jing He. 49-60 [doi]
- Anonymous Fuzzy Identity-Based Encryption for Similarity SearchDavid W. Cheung, Nikos Mamoulis, W. K. Wong, Siu-Ming Yiu, Ye Zhang. 61-72 [doi]
- Improved Randomized Algorithms for 3-SATKazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki. 73-84 [doi]
- Quantum Counterfeit Coin ProblemsKazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama. 85-96 [doi]
- Should Static Search Trees Ever Be Unbalanced?Prosenjit Bose, Karim Douïeb. 109-120 [doi]
- Levelwise Mesh Sparsification for Shortest Path QueriesYuichiro Miyamoto, Takeaki Uno, Mikio Kubo. 121-132 [doi]
- Unit-Time Predecessor Queries on Massive Data SetsAndrej Brodnik, John Iacono. 133-144 [doi]
- Popularity at Minimum CostTelikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar. 145-156 [doi]
- Structural and Complexity Aspects of Line Systems of GraphsJozef Jirásek, Pavel Klavík. 157-168 [doi]
- Neighbor Systems, Jump Systems, and Bisubmodular PolyhedraAkiyoshi Shioura. 169-181 [doi]
- Generating Trees on MultisetsBingbing Zhuang, Hiroshi Nagamochi. 182-193 [doi]
- Seidel Minor, Permutation Graphs and Combinatorial PropertiesVincent Limouzy. 194-205 [doi]
- Simultaneous Interval GraphsKrishnam Raju Jampani, Anna Lubiw. 206-217 [doi]
- Unbalanced Graph PartitioningAngsheng Li, Peng Zhang. 218-229 [doi]
- On the Intersection of Tolerance and Cocomparability GraphsGeorge B. Mertzios, Shmuel Zaks. 230-240 [doi]
- Flows in One-Crossing-Minor-Free GraphsErin W. Chambers, David Eppstein. 241-252 [doi]
- From Holant to #CSP and Back: Dichotomy for Holant:::::::c::::::: ProblemsJin-yi Cai, Sangxia Huang, Pinyan Lu. 253-265 [doi]
- Computing Sparse Multiples of PolynomialsMark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak. 266-278 [doi]
- Fractal Parallelism: Solving SAT in Bounded Space and TimeDenys Duchier, Jérôme Durand-Lose, Maxime Senot. 279-290 [doi]
- Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time ComplexityHugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux. 291-303 [doi]
- New Upper Bounds on the Average PTF Density of Boolean FunctionsKazuyuki Amano. 304-315 [doi]
- An Optimal Algorithm for Computing Angle-Constrained SpannersPaz Carmi, Michiel H. M. Smid. 316-327 [doi]
- Approximating Minimum Bending Energy Path in a Simple CorridorJinhui Xu, Lei Xu, Yulai Xie. 328-339 [doi]
- Analysis of an Iterated Local Search Algorithm for Vertex ColoringDirk Sudholt, Christine Zarges. 340-352 [doi]
- Bounded Max-colorings of GraphsEvripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis. 353-365 [doi]
- Parameterized Algorithms for BoxicityAbhijin Adiga, Rajesh Chitnis, Saket Saurabh. 366-377 [doi]
- On Tractable Cases of Target Set SelectionAndré Nichterlein, Rolf Niedermeier, Johannes Uhlmann, Mathias Weller. 378-389 [doi]
- Combining Two Worlds: Parameterised Approximation for Vertex CoverLjiljana Brankovic, Henning Fernau. 390-402 [doi]
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal TimeDavid Eppstein, Maarten Löffler, Darren Strash. 403-414 [doi]
- Lower Bounds for Howard s Algorithm for Finding Minimum Mean-Cost CyclesThomas Dueholm Hansen, Uri Zwick. 415-426 [doi]
- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-CutImmanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey. 427-439 [doi]
- An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related ProblemsJoachim Spoerhase. 440-450 [doi]
- A Faster Algorithm for the Maximum Even Factor ProblemMaxim A. Babenko. 451-462 [doi]