| 2017 | A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques. Miroslaw Kowaluk, Andrzej Lingas |
| 2017 | A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs. Kengo Nakamura, Kunihiko Sadakane |
| 2017 | A Width Parameter Useful for Chordal and Co-comparability Graphs. Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme, Jan Arne Telle |
| 2017 | Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest. Yang Jiao, R. Ravi, Wolfgang Gatterbauer |
| 2017 | An Approximation Algorithm for Maximum Internal Spanning Tree. Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang |
| 2017 | An Experimental Study on the Ply Number of Straight-Line Drawings. Felice De Luca, Emilio Di Giacomo, Walter Didimo, Stephen G. Kobourov, Giuseppe Liotta |
| 2017 | An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths. Ei Ando |
| 2017 | An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances. Kensuke Imanishi |
| 2017 | Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems. Yuko Kuroki, Tomomi Matsui |
| 2017 | Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano |
| 2017 | Bundling Two Simple Polygons to Minimize Their Convex Hull. Jong Min Choi, Dongwoo Park, Hee-Kap Ahn |
| 2017 | Byzantine Gathering in Networks with Authenticated Whiteboards. Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue |
| 2017 | Complexity Measures for Mosaic Drawings. Quirijn W. Bouts, Bettina Speckmann, Kevin Verbeek |
| 2017 | Computing the Center Region and Its Variants. Eunjin Oh, Hee-Kap Ahn |
| 2017 | Dynamic Sum-Radii Clustering. N. K. Blanchard, Nicolas Schabanel |
| 2017 | Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications. Etsuji Tomita |
| 2017 | Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns. Koji Ouchi, Ryuhei Uehara |
| 2017 | Fast Optimal Labelings for Rotating Maps. Rafael G. Cano, Cid C. de Souza, Pedro J. de Rezende |
| 2017 | Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas. Mohammad Ali Abam, Fatemeh Baharifard, Mohammad Sadegh Borouny, Hamid Zarrabi-Zadeh |
| 2017 | Finding Triangles for Maximum Planar Subgraphs. Parinya Chalermsook, Andreas Schmid |
| 2017 | Gathering Asynchronous Robots in the Presence of Obstacles. Subhash Bhagat, Krishnendu Mukhopadhyaya |
| 2017 | Generating All Patterns of Graph Partitions Within a Disparity Bound. Jun Kawahara, Takashi Horiyama, Keisuke Hotta, Shin-ichi Minato |
| 2017 | How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments. Arash Vaezi, Mohammad Ghodsi |
| 2017 | Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width. Klaus Jansen, Malin Rau |
| 2017 | Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs. Hugo A. Akitaya, Rajasekhar Inkulu, Torrie L. Nichols, Diane L. Souvaine, Csaba D. Tóth, Charles R. Winston |
| 2017 | On Guarding Orthogonal Polygons with Sliding Cameras. Therese Biedl, Timothy M. Chan, Stephanie Lee, Saeed Mehrabi, Fabrizio Montecchiani, Hamideh Vosoughpour |
| 2017 | Online Inserting Points Uniformly on the Sphere. Chun Chen, Francis C. M. Lau, Sheung-Hung Poon, Yong Zhang, Rong Zhou |
| 2017 | Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover. Asahi Takaoka |
| 2017 | Sequentially Swapping Colored Tokens on Graphs. Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, Takeaki Uno |
| 2017 | Sliding Tokens on Block Graphs. Duc A. Hoang, Eli Fox-Epstein, Ryuhei Uehara |
| 2017 | Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals. Toshiki Saitoh, David G. Kirkpatrick |
| 2017 | Tangle and Maximal Ideal. Koichi Yamazaki |
| 2017 | The Complexity of (List) Edge-Coloring Reconfiguration Problem. Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou |
| 2017 | The Time Complexity of the Token Swapping Problem and Its Parallel Variants. Jun Kawahara, Toshiki Saitoh, Ryo Yoshinaka |
| 2017 | Time-Space Trade-Off for Finding the Yeganeh Bahoo, Bahareh Banyassady, Prosenjit Bose, Stephane Durocher, Wolfgang Mulzer |
| 2017 | Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem. Fritz Bökler, Petra Mutzel |
| 2017 | WALCOM: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017, Proceedings. Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen |