International Conference and Workshops on Algorithms and Computation

WALCOM

CORE rank

CORE rank (raw)

Fields of research

Theory of Computation

Papers indexed

572

2007–2026

Best Theory of Computation conferences

Papers per year

200738 peak2026

Most published authors

WALCOM papers

572 records sourced from DBLP. Search titles, filter by year, sort by recency.

Year	Title	Authors
2012	Drawing Unordered Trees on k-Grids.	Christian Bachmaier, Marco Matzeder
2011	Oblivious Buy-at-Bulk in Planar Graphs.	Srinivasagopalan Srivathsan, Costas Busch, S. Sitharama Iyengar
2011	Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices.	Michael Schneider
2011	De Bruijn Sequences for the Binary Strings with Maximum Density.	Joe Sawada, Brett Stevens, Aaron Williams
2011	Efficient Top-	Saladi Rahul, Prosenjit Gupta, Ravi Janardan, Krishnan Sundara Rajan
2011	Range-Aggregate Queries Involving Geometric Aggregation Operations.	Saladi Rahul, Ananda Swarup Das, Krishnan Sundara Rajan, Kannan Srinathan
2011	Inapproximability of	Mourad El Ouali, Antje Fretwurst, Anand Srivastav
2011	Counting Spanning Trees in Graphs Using Modular Decomposition.	Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2011	Minimum-Layer Drawings of Trees - (Extended Abstract).	Debajyoti Mondal, Muhammad Jawaherul Alam, Md. Saidur Rahman
2011	The Physarum Computer.	Kurt Mehlhorn
2011	Approximation Algorithms for Minimum Chain Vertex Deletion.	Mrinal Kumar, Sounaka Mishra, N. Safina Devi, Saket Saurabh
2011	Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.	Sebastian Kniesburges, Christian Scheideler
2011	The Disjoint Paths Problem: Algorithm and Structure.	Ken-ichi Kawarabayashi
2011	Untitled record	Martin Harrigan, Patrick Healy
2011	Clustering with Internal Connectedness.	Neelima Gupta, Aditya Pancholi, Yogish Sabharwal
2011	A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.	Esha Ghosh, N. S. Narayanaswamy, C. Pandu Rangan
2011	Maximum Betweenness Centrality: Approximability and Tractable Cases.	Martin Fink, Joachim Spoerhase
2011	The Complexity of Acyclic Subhypergraph Problems.	David Duris, Yann Strozecki
2011	Geometry and Topology from Point Cloud Data.	Tamal Krishna Dey
2011	On the Discrete Unit Disk Cover Problem.	Gautam K. Das, Robert Fraser, Alejandro Lpez-Ortiz, Bradford G. Nickerson
2011	Efficient Computation of Time-Dependent Centralities in Air Transportation Networks.	Annabell Berger, Matthias Mller-Hannemann, Steffen Rechner, Alexander Zock
2011	Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point.	Aritra Banik, Bhaswar B. Bhattacharya, Sandip Das
2011	On Graceful Labelings of Trees - (Extended Abstract).	Sourabh Aryabhatta, Tonmoy Guha Roy, Md. Mohsin Uddin, Md. Saidur Rahman
2011	Multi Cover of a Polygon Minimizing the Sum of Areas.	A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Gila Morgenstern
2010	Small Grid Drawings of Planar Graphs with Balanced Bipartition.	Xiao Zhou, Takashi Hikino, Takao Nishizeki

451–475 of 572← Previous Next →

Comparable venues

Other A*/A conferences filed under the same field of research.