5. WALCOM 2011: New Delhi, India

Naoki Katoh, Amit Kumar (Eds.): WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Lecture Notes in Computer Science 6552 Springer 2011, ISBN 978-3-642-19093-3

Invited Talks

Tamal Krishna Dey:
Geometry and Topology from Point Cloud Data. 1
Ken-ichi Kawarabayashi:
The Disjoint Paths Problem: Algorithm and Structure. 2-7
Kurt Mehlhorn:
The Physarum Computer. 8

Approximation Algorithms

Martin Fink, Joachim Spoerhase:
Maximum Betweenness Centrality: Approximability and Tractable Cases. 9-20
Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh:
Approximation Algorithms for Minimum Chain Vertex Deletion. 21-32
Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar:
Oblivious Buy-at-Bulk in Planar Graphs. 33-44

Hardness

David Duris, Yann Strozecki:
The Complexity of Acyclic Subhypergraph Problems. 45-56
Mourad El Ouali, Antje Fretwurst, Anand Srivastav:
Inapproximability of b-Matching in k-Uniform Hypergraphs. 57-69
Martin Harrigan, Patrick Healy:
k-Level Crossing Minimization Is NP-Hard for Trees. 70-76

Algorithm Engineering

Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner, Alexander Zock:
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks. 77-88
Michael Schneider:
Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices. 89-97

Computational Geometry

Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das:
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point. 98-109
Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan:
Efficient Top-k Queries for Orthogonal Ranges. 110-121
Saladi Rahul, Ananda Swarup Das, K. S. Rajan, Kannan Srinathan:
Range-Aggregate Queries Involving Geometric Aggregation Operations. 122-133

Approximation Algorithms

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern:
Multi Cover of a Polygon Minimizing the Sum of Areas. 134-145
Gautam K. Das, Robert Fraser, Alejandro López-Ortiz, Bradford G. Nickerson:
On the Discrete Unit Disk Cover Problem. 146-157
Neelima Gupta, Aditya Pancholi, Yogish Sabharwal:
Clustering with Internal Connectedness. 158-169

String Algorithms

Sebastian Kniesburges, Christian Scheideler:
Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. 170-181
Joe Sawada, Brett Stevens, Aaron Williams:
De Bruijn Sequences for the Binary Strings with Maximum Density. 182-190

Graph Algorithms

Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan:
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs. 191-201
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Counting Spanning Trees in Graphs Using Modular Decomposition. 202-213
Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman:
On Graceful Labelings of Trees - (Extended Abstract). 214-220
Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman:
Minimum-Layer Drawings of Trees - (Extended Abstract). 221-232

Last update Sat May 18 19:55:13 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page