List of accepted papers

  • Yung Tsin. Decomposing a Multigraph into Split Components
  • Franz J. Brandenburg. On the Curve Complexity of Upward Planar Drawings
  • Chuzo Iwamoto, Kento Sasaki and Kenichi Morita. Computational Complexity of String Puzzles
  • Cong Zhang and Hiroshi Nagamochi. The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
  • Martin Olsen. On Defining and Computing Communities
  • Tadao Takaoka. Efficient Algorithms for the All Pairs Shortest Path Problem with Limited Edge Costs
  • Toshihiro Fujito and Takayoshi Sakamaki. How to guard a graph against tree movements
  • Naonori Kakimura and Mizuyo Takamatsu. Matching Problems with Delta-Matroid Constraints
  • Lee Naish, Harald Sondergaard and Benjamin Horsfall. Logic Programming: From Underspecification to Undefinedness
  • Stefan Edelkamp, Amr Elmasry and Jyrki Katajainen. Weak-Heap Family of Priority Queues in Theory and Praxis
  • Radwa El Shawi, Joachim Gudmundsson and Christos Levcopoulos. Quickest Path queries on transportation network
  • Kewen Liao and Hong Shen. Approximating The Reliable Resource Allocation Problem Using Inverse Dual Fitting
  • Toshimasa Ishii. Augmenting Outerplanar Graphs to Meet Diameter Requirements
  • Ken-Ichi Kawarabayashi and David R. Wood. Cliques in Odd-Minor-Free Graphs
  • Meena Mahajan, Nitin Saurabh and Karteek Sreenivasaiah. Counting paths in planar width 2 branching programs
  • Aniruddh Gandhi, Bakhadyr Khoussainov and Jiamou Liu. Solving infinite games on trees with back-edges
  • Yuichi Asahiro, Jesper Jansson, Eiji Miyano and Hirotaka Ono. Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty
  • Pavel Valtr. On empty pentagons and hexagons in planar point sets