WALCOM 2011 Accepted Papers
David Duris and Yann Strozecki.
The complexity of acyclic subhypergraph problems
Neelima Gupta, Aditya Pancholi and Yogish Sabharwal.
Clustering with Internal Connectedness
Esha Ghosh, N.S. Narayanaswamy and C. Pandu Rangan.
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
Aritra Banik, Bhaswar Bhattacharya and Sandip Das.
Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point
Mourad El Ouali, Antje Fretwurst, Volkmar Sauerland and Anand Srivastav.
Inapproximability of b-Matching in k-uniform Hypergraphs
Saladi Rahul, Prosenjit Gupta, Ravi Janardan and K.S. Rajan.
Efficient top-k queries for orthognal ranges
Saladi Rahul, Ananda Swarup Das, K.S. Rajan and Kannan Srinathan.
Range-Aggregate Queries Involving Geometric Aggregation Operations
Annabell Berger, Matthias Müller-Hannemann, Steffen Rechner and Alexander Zock.
Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
Martin Harrigan and Patrick Healy.
k-Level Crossing Minimization is NP-Hard for Trees
Tonmoy Guha Roy, Sourabh Aryabhatta, Md. Mohsin Uddin and Md. Saidur Rahman.
On Graceful Labelings of Trees
Martin Fink and Joachim Spoerhase.
Maximum Betweenness Centrality: Approximability and Tractable Cases
Michael Schneider.
Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
Debajyoti Mondal, Jawaherul Alam and Md. Saidur Rahman.
Minimum-Layer Drawings of Trees
Sounaka Mishra, Mrinal Kumar, N. Safina Devi and Saket Saurabh.
Approximation Algorithms for Minimum Chain Vertex Deletion