Abstract is missing.
- Geometry and Topology from Point Cloud DataTamal Krishna Dey. 1 [doi]
- The Disjoint Paths Problem: Algorithm and StructureKen-ichi Kawarabayashi. 2-7 [doi]
- The Physarum ComputerKurt Mehlhorn. 8 [doi]
- Maximum Betweenness Centrality: Approximability and Tractable CasesMartin Fink, Joachim Spoerhase. 9-20 [doi]
- Approximation Algorithms for Minimum Chain Vertex DeletionMrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh. 21-32 [doi]
- Oblivious Buy-at-Bulk in Planar GraphsSrinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar. 33-44 [doi]
- The Complexity of Acyclic Subhypergraph ProblemsDavid Duris, Yann Strozecki. 45-56 [doi]
- Inapproximability of ::::b::::-Matching in ::::k::::-Uniform HypergraphsMourad El Ouali, Antje Fretwurst, Anand Srivastav. 57-69 [doi]
- ::::k::::-Level Crossing Minimization Is NP-Hard for TreesMartin Harrigan, Patrick Healy. 70-76 [doi]
- Efficient Computation of Time-Dependent Centralities in Air Transportation NetworksAnnabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock. 77-88 [doi]
- Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in LatticesMichael Schneider 0002. 89-97 [doi]
- Minimum Enclosing Circle of a Set of Fixed Points and a Mobile PointAritra Banik, Bhaswar B. Bhattacharya, Sandip Das. 98-109 [doi]
- Efficient Top-::::k:::: Queries for Orthogonal RangesSaladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan. 110-121 [doi]
- Range-Aggregate Queries Involving Geometric Aggregation OperationsSaladi Rahul, Ananda Swarup Das, K. S. Rajan, Kannan Srinathan. 122-133 [doi]
- Multi Cover of a Polygon Minimizing the Sum of AreasA. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern. 134-145 [doi]
- On the Discrete Unit Disk Cover ProblemGautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson. 146-157 [doi]
- Clustering with Internal ConnectednessNeelima Gupta, Aditya Pancholi, Yogish Sabharwal. 158-169 [doi]
- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer SystemsSebastian Kniesburges, Christian Scheideler. 170-181 [doi]
- De Bruijn Sequences for the Binary Strings with Maximum DensityJoe Sawada, Brett Stevens, Aaron Williams. 182-190 [doi]
- A Polynomial Time Algorithm for Longest Paths in Biconvex GraphsEsha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan. 191-201 [doi]
- Counting Spanning Trees in Graphs Using Modular DecompositionStavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos. 202-213 [doi]
- On Graceful Labelings of Trees - (Extended Abstract)Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman. 214-220 [doi]
- Minimum-Layer Drawings of Trees - (Extended Abstract)Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman. 221-232 [doi]