Accepted Papers

  • Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara and Takeaki Uno. Sequentially Swapping Colored Tokens on Graphs
  • Parinya Chalermsook and Andreas Schmid. Finding Triangles for Maximum Planar Subgraphs
  • Koji Ouchi and Ryuhei Uehara. Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
  • Asahi Takaoka. Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
  • Kengo Nakamura and Kunihiko Sadakane. A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs
  • Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen Kobourov and Giuseppe Liotta. An Experimental Study on the Ply Number of Straight-line Drawings
  • Jun Kawahara, Toshiki Saitoh and Ryo Yoshinaka. The Time Complexity of the Token Swapping Problem and Its Parallel Variants
  • Zhi-Zhong Chen, Youta Harada and Lusheng Wang. An Approximation Algorithm for Maximum Internal Spanning Tree
  • Nicolas Blanchard and Nicolas Schabanel. Dynamic Sum-Radii Clustering
  • Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher and Wolfgang Mulzer. Time-Space Trade-off for Finding the k-Visibility Region of a Point in a Polygon
  • Fritz Bokler and Petra Mutzel. Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
  • Arash Vaezi and Mohammad Ghodsi. Extending Visibility Polygons by Mirrors to Cover Invisible Segments
  • Yang Jiao, Ramamoorthi Ravi and Wolfgang Gatterbauer. Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest
  • Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani and Hamideh Vosoughpour. On Guarding Orthogonal Polygons with Sliding Cameras
  • Koichi Yamazaki. Tangle and maximal ideal
  • Chun Chen, Francis Lau, Sheung-Hung Poon, Yong Zhang and Rong Zhou. Online Inserting Points Uniformly on Sphere
  • Jongmin Choi, Dongwoo Park and Hee-Kap Ahn. Bundling Two Simple Polygons to Minimize Their Convex Hull
  • Eunjin Oh and Hee-Kap Ahn. Computing the Center Region and Its Variants
  • Dong Yeup Kang, O-Joung Kwon, Torstein Stromme and Jan Arne Telle. A width parameter useful for chordal and co-comparability graphs
  • Yuko Kuroki and Tomomi Matsui. Approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problem
  • Toshiki Saitoh and David Kirkpatrick. Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
  • Duc Hoang, Eli Fox-Epstein and Ryuhei Uehara. Sliding tokens on block graphs
  • Masashi Tsuchida, Fukuhito Ooshita and Michiko Inoue. Byzantine gathering in networks with authenticated whiteboards
  • Quirijn Bouts, Bettina Speckmann and Kevin Verbeek. Complexity Measures for Mosaic Drawings
  • Klaus Jansen and Malin Rau. Improved approximation for two dimensional strip packing with polynomial bounded width
  • Ei Ando. An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
  • Hiroki Osawa, Akira Suzuki, Takehiro Ito and Xiao Zhou. The Complexity of (List) Edge-Coloring Reconfiguration Problem
  • Jun Kawahara, Takashi Horiyama, Keisuke Hotta and Shin-Ichi Minato. Generating All Patterns of Graph Partitions within a Disparity Bound
  • Mohammad Ali Abam, Fatemeh Baharifard, Mohammad Sadegh Borouny and Hamid Zarrabi-Zadeh. Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas
  • Subhash Bhagat and Krishnendu Mukhopadhyaya. Gathering Asynchronous Robots in the Presence of Obstacles
  • Rafael Cano, Cid de Souza and Pedro de Rezende. Efficient Optimal Labelings for Rotating Maps
  • Hugo Akitaya, R. Inkulu, Torrie Nichols, Diane Souvaine, Csaba Toth and Charles Winston. Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs
  • Miroslaw Kowaluk and Andrzej Lingas. A fast deterministic detection of small pattern graphs in graphs without large cliques
  • Kensuke Imanishi. An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances
  • Hiroshi Eto, Takehiro Ito, Zhilong Liu and Eiji Miyano. Approximation algorithm for the distance-3 independent set problem on cubic graphs