Abstract is missing.
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their ApplicationsEtsuji Tomita. 3-15 [doi]
- Efficient Enumeration of Flat-Foldable Single Vertex Crease PatternsKoji Ouchi, Ryuhei Uehara. 19-29 [doi]
- Dynamic Sum-Radii ClusteringNicolas K. Blanchard, Nicolas Schabanel. 30-41 [doi]
- How to Extend Visibility Polygons by Mirrors to Cover Invisible SegmentsArash Vaezi, Mohammad Ghodsi. 42-53 [doi]
- On Guarding Orthogonal Polygons with Sliding CamerasTherese C. Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi 0001, Fabrizio Montecchiani, Hamideh Vosoughpour. 54-65 [doi]
- Bundling Two Simple Polygons to Minimize Their Convex HullJong Min Choi, Dongwoo Park, Hee-Kap Ahn. 66-77 [doi]
- Tangle and Maximal IdealKoichi Yamazaki. 81-92 [doi]
- A Width Parameter Useful for Chordal and Co-comparability GraphsDong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle. 93-105 [doi]
- Byzantine Gathering in Networks with Authenticated WhiteboardsMasashi Tsuchida, Fukuhito Ooshita, Michiko Inoue. 106-118 [doi]
- Generating All Patterns of Graph Partitions Within a Disparity BoundJun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato. 119-131 [doi]
- An Experimental Study on the Ply Number of Straight-Line DrawingsFelice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta. 135-148 [doi]
- Complexity Measures for Mosaic DrawingsQuirijn W. Bouts, Bettina Speckmann, Kevin Verbeek. 149-160 [doi]
- Fast Optimal Labelings for Rotating MapsRafael G. Cano, Cid C. de Souza, Pedro J. de Rezende. 161-173 [doi]
- Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph CoverAsahi Takaoka. 177-189 [doi]
- Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path ProblemFritz Bökler, Petra Mutzel. 190-203 [doi]
- Minimum Weight Connectivity Augmentation for Planar Straight-Line GraphsHugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston. 204-216 [doi]
- A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large CliquesMiroslaw Kowaluk, Andrzej Lingas. 217-227 [doi]
- Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic GraphsHiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano. 228-240 [doi]
- Online Inserting Points Uniformly on the SphereChun Chen, Francis C. M. Lau, Sheung-Hung Poon, Yong Zhang, Rong Zhou. 243-253 [doi]
- Computing the Center Region and Its VariantsEunjin Oh 0001, Hee-Kap Ahn. 254-265 [doi]
- Fault-Tolerant Spanners in Networks with Symmetric Directional AntennasMohammad Ali Abam, Fatemeh Baharifard, Mohammad Sadegh Borouny, Hamid Zarrabi-Zadeh. 266-278 [doi]
- Gathering Asynchronous Robots in the Presence of ObstaclesSubhash Bhagat, Krishnendu Mukhopadhyaya. 279-291 [doi]
- A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected GraphsKengo Nakamura, Kunihiko Sadakane. 295-307 [doi]
- k-Visibility Region of a Point in a PolygonYeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer. 308-319 [doi]
- Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on IntervalsToshiki Saitoh, David G. Kirkpatrick. 320-332 [doi]
- Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized ContestYang Jiao, R. Ravi, Wolfgang Gatterbauer. 335-346 [doi]
- The Complexity of (List) Edge-Coloring Reconfiguration ProblemHiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou. 347-358 [doi]
- An Upper Bound for Resolution Size: Characterization of Tractable SAT InstancesKensuke Imanishi. 359-369 [doi]
- Finding Triangles for Maximum Planar SubgraphsParinya Chalermsook, Andreas Schmid 0003. 373-384 [doi]
- An Approximation Algorithm for Maximum Internal Spanning TreeZhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang. 385-396 [doi]
- Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling ProblemsYuko Kuroki, Tomomi Matsui. 397-408 [doi]
- Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded WidthKlaus Jansen, Malin Rau. 409-420 [doi]
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge LengthsEi Ando. 421-432 [doi]
- Sequentially Swapping Colored Tokens on GraphsKatsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno. 435-447 [doi]
- The Time Complexity of the Token Swapping Problem and Its Parallel VariantsJun Kawahara, Toshiki Saitoh, Ryo Yoshinaka. 448-459 [doi]
- Sliding Tokens on Block GraphsDuc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara. 460-471 [doi]