default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. WALCOM 2009: Kolkata, India
- Sandip Das, Ryuhei Uehara:
WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings. Lecture Notes in Computer Science 5431, Springer 2009, ISBN 978-3-642-00201-4
Invited Talks
- Jacob Fox, János Pach:
A Separator Theorem for String Graphs and Its Applications. 1-14 - Chee-Keng Yap, Jihun Yu:
Foundations of Exact Rounding. 15-31 - Sandeep Sen:
Approximating Shortest Paths in Graphs. 32-43 - Otfried Cheong:
Line Transversals and Pinning Numbers. 44-46
Computational Geometry
- Subir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda:
Algorithms for Computing Diffuse Reflection Paths in Polygons. 47-58 - Mustaq Ahmed, Anna Lubiw, Anil Maheshwari:
Shortest Gently Descending Paths. 59-70 - Sang Won Bae
, Matias Korman, Takeshi Tokuyama:
All Farthest Neighbors in the Presence of Highways and Obstacles. 71-82 - Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy:
Improved Algorithm for a Widest 1-Corner Corridor. 83-92 - Md. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman:
Maximum Neighbour Voronoi Games. 93-104 - Sang Won Bae, Chunseok Lee, Sunghee Choi:
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem. 105-116
Graph Algorithms
- Kyriaki Ioannidou, Stavros D. Nikolopoulos:
Colinear Coloring on Graphs. 117-128 - Mahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves:
Recursive Generation of 5-Regular Planar Graphs. 129-140 - Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano:
Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract). 141-150 - Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano:
Generating All Triangulations of Plane Graphs (Extended Abstract). 151-164 - Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi:
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract). 165-176 - Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara:
Random Generation and Enumeration of Proper Interval Graphs. 177-189 - Louis Ibarra:
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs. 190-201 - Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space. 202-213 - Takuro Fukunaga, Hiroshi Nagamochi:
Network Design with Weighted Degree Constraints. 214-225 - Michael Brinkmeier:
Minimum Cuts of Simple Graphs in Almost Always Linear Time. 226-237 - Brian C. Dean, Namrata Swar:
The Generalized Stable Allocation Problem. 238-249 - Tamara Mchedlidze, Antonios Symvonis:
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. 250-261 - Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
Core and Conditional Core Path of Specified Length in Special Classes of Graphs. 262-273
Complexity
- Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The Planar k-Means Problem is NP-Hard. 274-285 - Miki Hermann, Florian Richoux:
On the Computational Complexity of Monotone Constraint Satisfaction Problems. 286-297 - Michael Dom, Michael R. Fellows, Frances A. Rosamond:
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane. 298-309
Graph Drawing
- Muhammad Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman:
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract). 310-321 - Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Matched Drawability of Graph Pairs and of Graph Triples. 322-333 - Sarmad Abbasi, Patrick Healy, Aimal Rextin:
An Improved Upward Planarity Testing Algorithm and Related Applications. 334-344 - Mahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay:
Spherical-Rectangular Drawings. 345-356
Approximation Algorithms
- Guillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette:
The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be Approximated. 357-368 - Xavier Muñoz, Sebastian Seibert, Walter Unger:
The Minimal Manhattan Network Problem in Three Dimensions. 369-380
Randomized Algorithms
- Helmut Alt, Ludmila Scharf:
Shape Matching by Random Sampling. 381-393 - Philip Little, Amitabh Chaudhary:
Object Caching for Queries and Updates. 394-405
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
