Abstract is missing.
- A Separator Theorem for String Graphs and Its ApplicationsJacob Fox, János Pach. 1-14 [doi]
- Foundations of Exact RoundingChee-Keng Yap, Jihun Yu. 15-31 [doi]
- Approximating Shortest Paths in GraphsSandeep Sen. 32-43 [doi]
- Line Transversals and Pinning NumbersOtfried Cheong. 44-46 [doi]
- Algorithms for Computing Diffuse Reflection Paths in PolygonsSubir Kumar Ghosh, Partha P. Goswami, Anil Maheshwari, Subhas C. Nandy, Sudebkumar Prasant Pal, Swami Sarvattomananda. 47-58 [doi]
- Shortest Gently Descending PathsMustaq Ahmed, Anna Lubiw, Anil Maheshwari. 59-70 [doi]
- All Farthest Neighbors in the Presence of Highways and ObstaclesSang Won Bae, Matias Korman, Takeshi Tokuyama. 71-82 [doi]
- Improved Algorithm for a Widest 1-Corner CorridorGautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy. 83-92 [doi]
- Maximum Neighbour Voronoi GamesMd. Muhibur Rasheed, Masud Hasan, M. Sohel Rahman. 93-104 [doi]
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree ProblemSang Won Bae, Chunseok Lee, Sunghee Choi. 105-116 [doi]
- Colinear Coloring on GraphsKyriaki Ioannidou, Stavros D. Nikolopoulos. 117-128 [doi]
- Recursive Generation of 5-Regular Planar GraphsMahdieh Hasheminezhad, Brendan D. McKay, Tristan Reeves. 129-140 [doi]
- Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract)Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano. 141-150 [doi]
- Generating All Triangulations of Plane Graphs (Extended Abstract)Mohammad Tanvir Parvez, Md. Saidur Rahman, Shin-Ichi Nakano. 151-164 [doi]
- Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)Alessandro Borri, Tiziana Calamoneri, Rossella Petreschi. 165-176 [doi]
- Random Generation and Enumeration of Proper Interval GraphsToshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara. 177-189 [doi]
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval GraphsLouis Ibarra. 190-201 [doi]
- Minmax Tree Cover in the Euclidean SpaceSeigo Karakawa, Ehab Morsy, Hiroshi Nagamochi. 202-213 [doi]
- Network Design with Weighted Degree ConstraintsTakuro Fukunaga, Hiroshi Nagamochi. 214-225 [doi]
- Minimum Cuts of Simple Graphs in Almost Always Linear TimeMichael Brinkmeier. 226-237 [doi]
- The Generalized Stable Allocation ProblemBrian C. Dean, Namrata Swar. 238-249 [doi]
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book EmbeddingsTamara Mchedlidze, Antonios Symvonis. 250-261 [doi]
- Core and Conditional Core Path of Specified Length in Special Classes of GraphsBalasubramanian Sivan, S. Harini, C. Pandu Rangan. 262-273 [doi]
- The Planar k-Means Problem is NP-HardMeena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan. 274-285 [doi]
- On the Computational Complexity of Monotone Constraint Satisfaction ProblemsMiki Hermann, Florian Richoux. 286-297 [doi]
- Parameterized Complexity of Stabbing Rectangles and Squares in the PlaneMichael Dom, Michael R. Fellows, Frances A. Rosamond. 298-309 [doi]
- Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(nlogn) Area (Extended Abstract)Md. Rezaul Karim, Md. Jawaherul Alam, Md. Saidur Rahman. 310-321 [doi]
- Matched Drawability of Graph Pairs and of Graph TriplesLuca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath. 322-333 [doi]
- An Improved Upward Planarity Testing Algorithm and Related ApplicationsSarmad Abbasi, Patrick Healy, Aimal Rextin. 334-344 [doi]
- Spherical-Rectangular DrawingsMahdieh Hasheminezhad, S. Mehdi Hashemi, Brendan D. McKay. 345-356 [doi]
- The ExemplarBreakpointDistancefor Non-trivial Genomes Cannot Be ApproximatedGuillaume Blin, Guillaume Fertin, Florian Sikora, Stéphane Vialette. 357-368 [doi]
- The Minimal Manhattan Network Problem in Three DimensionsXavier Muñoz, Sebastian Seibert, Walter Unger. 369-380 [doi]
- Shape Matching by Random SamplingHelmut Alt, Ludmila Scharf. 381-393 [doi]
- Object Caching for Queries and UpdatesPhilip Little, Amitabh Chaudhary. 394-405 [doi]