Abstract is missing.
- D:::2:::-Tree: A New Overlay with Deterministic BoundsGerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis. 1-12 [doi]
- Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small AlphabetsChih-Chiang Yu, Biing-Feng Wang, Chung-Chin Kuo. 13-24 [doi]
- Dynamic Range Reporting in External MemoryYakov Nekrich. 25-36 [doi]
- A Cache-Oblivious Implicit Dictionary with the Working Set PropertyGerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen. 37-48 [doi]
- The (::::p::::, ::::q::::)-total Labeling Problem for TreesToru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno. 49-60 [doi]
- Drawing a Tree as a Minimum Spanning Tree ApproximationEmilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer. 61-72 [doi]
- ::::k::::-cyclic Orientations of GraphsYasuaki Kobayashi, Yuichiro Miyamoto, Hisao Tamaki. 73-84 [doi]
- Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor SizeQian-Ping Gu, Hisao Tamaki. 85-96 [doi]
- Maximum Overlap of Convex Polytopes under TranslationHee-Kap Ahn, Siu-Wing Cheng, Iris Reinbacher. 97-108 [doi]
- Approximate Shortest Homotopic Paths in Weighted RegionsSiu-Wing Cheng, Jiongxin Jin, Antoine Vigneron, Yajun Wang. 109-120 [doi]
- Spanning Ratio and Maximum Detour of Rectilinear Paths in the ::::L::::::1:: PlaneAnsgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon. 121-131 [doi]
- Approximation and Hardness Results for the Maximum Edge ::::q::::-coloring ProblemAnna Adamaszek, Alexandru Popa. 132-143 [doi]
- 3-Colouring AT-Free Graphs in Polynomial TimeJuraj Stacho. 144-155 [doi]
- On Coloring Graphs without Induced ForestsHajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song. 156-167 [doi]
- On the Approximability of the Maximum Interval Constrained Coloring ProblemStefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman. 168-179 [doi]
- Approximability of Constrained LCSMinghui Jiang. 180-191 [doi]
- Approximation Algorithms for the Multi-Vehicle Scheduling ProblemBinay K. Bhattacharya, Yuzhuang Hu. 192-205 [doi]
- On Greedy Algorithms for Decision TreesFerdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro. 206-217 [doi]
- Single and Multiple Device DSA Problem, Complexities and Online AlgorithmsWeiwei Wu, Wanyong Tian, Minming Li, Chun Jason Xue, Enhong Chen. 218-229 [doi]
- The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications - (Extended Abstract)Sang Won Bae, Chan-Su Shin. 230-241 [doi]
- Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin PackingYong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin. 242-253 [doi]
- On the Continuous CNN ProblemJohn Augustine, Nick Gravin. 254-265 [doi]
- Policies for Periodic Packet RoutingBritta Peis, Sebastian Stiller, Andreas Wiese. 266-278 [doi]
- Increasing Speed Scheduling and Flow SchedulingSebastian Stiller, Andreas Wiese. 279-290 [doi]
- A Tighter Analysis of Work StealingMarc Tchiboukdjian, Nicolas Gast, Denis Trystram, Jean-Louis Roch, Julien Bernard. 291-302 [doi]
- Approximating the Traveling Tournament Problem with Maximum Tour Length 2Clemens Thielen, Stephan Westphal. 303-314 [doi]
- Alphabet Partitioning for Compressed Rank/Select and ApplicationsJérémy Barbay, Travis Gagie, Gonzalo Navarro, Yakov Nekrich. 315-326 [doi]
- Entropy-Bounded Representation of Point GridsArash Farzan, Travis Gagie, Gonzalo Navarro. 327-338 [doi]
- Identifying Approximate Palindromes in Run-Length Encoded StringsKuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao. 339-350 [doi]
- Minimum Cost Partitions of Trees with Supply and DemandTakehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki. 351-362 [doi]
- Computing the (::::t::::, ::::k::::)-Diagnosability of Component-Composition Graphs and Its ApplicationSun-Yuan Hsieh, Chun-An Chen. 363-374 [doi]
- Why Depth-First Search Efficiently Identifies Two and Three-Connected GraphsAmr Elmasry. 375-386 [doi]
- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut OptimizationHenning Meyerhenke. 387-398 [doi]
- Induced Subgraph Isomorphism on Interval and Proper Interval GraphsPinar Heggernes, Daniel Meister, Yngve Villanger. 399-409 [doi]
- Testing Simultaneous Planarity When the Common Graph Is 2-ConnectedBernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw. 410-421 [doi]
- Computing the Discrete Fréchet Distance with Imprecise InputHee-Kap Ahn, Christian Knauer, Marc Scherfenberg, Lena Schlipf, Antoine Vigneron. 422-433 [doi]
- Connectivity Graphs of Uncertainty RegionsErin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Venkatesh Srinivasan, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides. 434-445 [doi]
- ::::pi::::/2-Angle Yao Graphs Are SpannersProsenjit Bose, Mirela Damian, Karim Douïeb, Joseph O Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer. 446-457 [doi]
- Identifying Shapes Using Self-assembly - (Extended Abstract)Matthew J. Patitz, Scott M. Summers. 458-469 [doi]