Skip to content

International Conference and Workshops on Algorithms and Computation

WALCOM

B

CORE rank

CORE rank (raw)

B

Fields of research

Theory of Computation

Papers indexed

572

2007–2026

Papers per year

200738 peak2026

WALCOM papers

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

YearTitleAuthors
2010On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost.Syed Ishtiaque Ahmed, Md. Mansurul Alam Bhuiyan, Masud Hasan, Ishita Kamal Khan
2009Foundations of Exact Rounding.Chee-Keng Yap, Jihun Yu
2009Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract).Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
2009Approximating Shortest Paths in Graphs.Sandeep Sen
2009Random Generation and Enumeration of Proper Interval Graphs.Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara
2009Maximum Neighbour Voronoi Games.Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman
2009Generating All Triangulations of Plane Graphs (Extended Abstract).Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano
2009The Minimal Manhattan Network Problem in Three Dimensions.Xavier Muoz, Sebastian Seibert, Walter Unger
2009Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.Tamara Mchedlidze, Antonios Symvonis
2009The Planar k-Means Problem is NP-Hard.Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan
2009Object Caching for Queries and Updates.Philip Little, Amitabh Chaudhary
2009Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract).Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman
2009Minmax Tree Cover in the Euclidean Space.Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
2009Colinear Coloring on Graphs.Kyriaki Ioannidou, Stavros D. Nikolopoulos
2009A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs.Louis Ibarra
2009On the Computational Complexity of Monotone Constraint Satisfaction Problems.Miki Hermann, Florian Richoux
2009Recursive Generation of 5-Regular Planar Graphs.Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves
2009Spherical-Rectangular Drawings.Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay
2009Matched Drawability of Graph Pairs and of Graph Triples.Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2009Algorithms for Computing Diffuse Reflection Paths in Polygons.Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda
2009Network Design with Weighted Degree Constraints.Takuro Fukunaga, Hiroshi Nagamochi
2009A Separator Theorem for String Graphs and Its Applications.Jacob Fox, Jnos Pach
2009Parameterized Complexity of Stabbing Rectangles and Squares in the Plane.Michael Dom, Michael R. Fellows, Frances A. Rosamond
2009The Generalized Stable Allocation Problem.Brian C. Dean, Namrata Swar
2009Improved Algorithm for a Widest 1-Corner Corridor.Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy
501525 of 572← PreviousNext →

Comparable venues

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