Abstract is missing.
- Erratum: Competitive Analysis for Multi-objective Online AlgorithmsMorten Tiedemann, Jonas Ide, Anita Schöbel. [doi]
- Encoding Data StructuresRajeev Raman. 1-7 [doi]
- Fast Algorithms for Constrained Graph Density ProblemsVenkatesan T. Chakaravarthy, Neelima Gupta, Aditya Pancholi, Sambuddha Roy. 8-19 [doi]
- The Directed Ring Loading with Penalty CostLi Guan, Jianping Li, Xuejie Zhang, Weidong Li. 20-31 [doi]
- Edge-Colorings of Weighted Graphs - (Extended Abstract)Yuji Obata, Takao Nishizeki. 32-43 [doi]
- Unit Covering in Color-Spanning Set ModelEhsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin. 44-52 [doi]
- Compact Encodings and Indexes for the Nearest Larger Neighbor ProblemSeungbum Jo, Rajeev Raman, Srinivasa Rao Satti. 53-64 [doi]
- A Practical Succinct Data Structure for Tree-Like GraphsJohannes Fischer, Daniel Peters. 65-76 [doi]
- Forming Plurality at Minimum CostWei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao. 77-88 [doi]
- Approximate Distance Oracle in O(n 2) Time and O(n) Space for Chordal GraphsGaurav Singh, N. S. Narayanaswamy, G. Ramakrishna. 89-100 [doi]
- Straight-Path Queries in Trajectory DataMark de Berg, Ali D. Mehrabi. 101-112 [doi]
- Folding a Paper Strip to Minimize ThicknessErik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno. 113-124 [doi]
- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments - (Extended Abstract)Sang Won Bae. 125-136 [doi]
- PTAS's for Some Metric p-source Communication Spanning Tree ProblemsSantiago V. Ravelo, Carlos E. Ferreira. 137-148 [doi]
- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis AgreementSubhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya. 149-160 [doi]
- Enumerating Eulerian Trails via Hamiltonian Path EnumerationHiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato. 161-174 [doi]
- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search TreesThim Strothmann. 175-186 [doi]
- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous NetworksYuma Asada, Michiko Inoue. 187-198 [doi]
- Dynamic Online Multiselection in Internal and External MemoryJérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson. 199-209 [doi]
- Competitive Analysis for Multi-objective Online AlgorithmsMorten Tiedemann, Jonas Ide, Anita Schöbel. 210-221 [doi]
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few BendsMichael A. Bekos, Thomas C. van Dijk, Philipp Kindermann, Alexander Wolff. 222-233 [doi]
- An Improved Algorithm for Parameterized Edge Dominating Set ProblemKen Iwaide, Hiroshi Nagamochi. 234-245 [doi]
- On Bar (1, j)-Visibility Graphs - (Extended Abstract)Franz J. Brandenburg, Niklas Heinsohn, Michael Kaufmann 0001, Daniel Neuwirth. 246-257 [doi]
- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGsDiptarka Chakraborty, Raghunath Tewari. 258-269 [doi]
- Non-repetitive Strings over Alphabet ListsNeerja Mhaskar, Michael Soltys. 270-281 [doi]
- Dichotomy Theorems for Homomorphism Polynomials of Graph ClassesChristian Engels. 282-293 [doi]
- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller SolidYoshiaki Araki, Takashi Horiyama, Ryuhei Uehara. 294-305 [doi]
- Threshold Circuits for Global Patterns in 2-Dimensional MapsKei Uchizawa, Daiki Yashima, Xiao Zhou. 306-316 [doi]
- Superset Generation on Decision DiagramsTakahisa Toda, Shogo Takeuchi, Koji Tsuda, Shin-ichi Minato. 317-322 [doi]
- On Triangle Cover Contact GraphsMd. Iqbal Hossain, Shaheena Sultana, Nazmun Nessa Moon, Tahsina Hashem, Md. Saidur Rahman 0001. 323-328 [doi]
- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width GraphsBireswar Das, Murali Krishna Enduri, I. Vinod Reddy. 329-334 [doi]