List of Accepted Papers (Paper id in brackets):

  • (08) Tamara Mchedlidze and Antonios Symvonis. Crossing-Optimal Acyclic Hamiltonian Path Completion and its Application to Upward Topological Book Embeddings.
  • (12) Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi and Ryuhei Uehara. Random Generation and Enumeration of Proper Interval Graphs
  • (14) Alessandro Borri, Tiziana Calamoneri and Rossella Petreschi. Recognition of Unigraphs through Superposition of Graphs
  • (18) Helmut Alt and Ludmila Scharf. Shape Matching by Random Sampling
  • (19) Katsuhisa Yamanaka, Yota Otachi and Shin-Ichi Nakano. Efficient Enumeration of Ordered Trees with k Leaves
  • (23) Takuro Fukunaga and Hiroshi Nagamochi. Network Design with Weighted Degree Constraints
  • (32) Balasubramanian Sivan, S Harini and Pandu Rangan C. Core and conditional core path of specified length in special classes of graphs
  • (36) Subir Ghosh, Partha Goswami, Anil Maheshwari, Subhas Nandy, Sudebkumar Pal and Swami Sarvattomananda. Algorithms for computing diffuse reflection paths in polygons
  • (38) Md. Rezaul Karim, Md. Jawaherul Alam and Md. Saidur Rahman. Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with $O(n\log n)$ Area
  • (39) Walter Unger, Xavier Munoz and Sebastian Seibert. The Minimal Manhattan Network Problem in Three Dimensions
  • (41) Sarmad Abbasi, Patrick Healy and Aimal Rextin. An Improved Upward Planarity Testing Algorithm and Related Applications
  • (44) Kyriaki Ioannidou and Stavros Nikolopoulos. Colinear Coloring on Graphs
  • (47) Miki Hermann and Florian Richoux. On the Computational Complexity of Disjunctive Constraint Satisfaction Problems
  • (48) Luca Grilli, Seok-Hee Hong, Giuseppe Liotta, Henk Meijer and Steve Wismath. Matched Drawability of Graph Pairs and of Graph Triples
  • (49) Michael Brinkmeier. Minimum Cuts of Simple Graphs in Almost Always Linear Time
  • (51) Mohammad Tanvir Parvez, Md. Saidur Rahman and Shin-Ichi Nakano. Generating All Triangulations of Plane Graphs
  • (54) Guillaume Blin, Guillaume Fertin, Florian Sikora and Stephane Vialette. The Exemplar Breakpoint Distance for non-trivial genomes cannot be approximated
  • (57) Md. Muhibur Rasheed, Masud Hasan and M Sohel Rahman. Maximum Neighbour Voronoi Games
  • (63) Mustaq Ahmed, Anna Lubiw and Anil Maheshwari. Shortest Gently Descending Paths
  • (65) Sang Won Bae, Matias Korman and Takeshi Tokuyama. All Farthest Neighbors in the Presence of Highways and Obstacles
  • (69) Sang Won Bae, Chunseok Lee and Sunghee Choi. On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
  • (70) Seigo Karakawa, Ehab Morsy and Hiroshi Nagamochi. Minmax Tree Cover in the Euclidean Space
  • (73) Gautam Das, Debapriyay Mukhopadhyay and Subhas Nandy. Improved Algorithm for a Widest 1-corner Corridor
  • (76) Meena Mahajan, Prajakta Nimbhorkar and Kasturi Varadarajan. The planar k-means problem is NP-hard
  • (77) Mahdieh Hasheminezahd, S. Mehdi Hashemi and Brendan McKay. Spherical-Rectangular Drawings
  • (81) Michael Dom, Michael Fellows and Frances A. Rosamond. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
  • (90) Mahdieh Hasheminezahd, Brendan McKay and Tristan Reeves. Recursive generation of 5-regular planar graphs
  • (92) Philip Little and Amitabh Chaudhary. Object Caching for Queries and Updates
  • (97) Brian Dean and Namrata Swar. The Generalized Stable Allocation Problem
  • (98) Louis Ibarra. A fully dynamic graph algorithm for recognizing proper interval graphs