| 2018 | On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract). | Suri Dipannita Sayeed, M. Sohel Rahman, Atif Rahman |
| 2018 | Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph. | Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone |
| 2018 | Random Popular Matchings with Incomplete Preference Lists. | Suthee Ruangwises, Toshiya Itoh |
| 2018 | An Improvement of the Algorithm of Hertli for the Unique 3SAT Problem. | Tong Qin, Osamu Watanabe |
| 2018 | A Simple Algorithm for r-gatherings on the Line. | Shin-Ichi Nakano |
| 2018 | Complexity of the Maximum k-Path Vertex Cover Problem. | Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden |
| 2018 | Faster Network Algorithms Based on Graph Decomposition. | Manas Jyoti Kashyop, Tsunehiko Nagayama, Kunihiko Sadakane |
| 2018 | Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian Relaxation Approach. | Hanyu Gu, Julia Memar, Yakov Zinder |
| 2018 | Approximating Partially Bounded Degree Deletion on Directed Graphs. | Toshihiro Fujito, Kei Kimura, Yuki Mizuno |
| 2018 | Boosting over Non-deterministic ZDDs. | Takahiro Fujita, Kohei Hatano, Eiji Takimoto |
| 2018 | A Note on Online Colouring Problems in Overlap Graphs and Their Complements. | Marc Demange, Martin Olsen |
| 2018 | On the Parallel Parameterized Complexity of the Graph Isomorphism Problem. | Bireswar Das, Murali Krishna Enduri, I. Vinod Reddy |
| 2018 | On Structural Parameterizations of Happy Coloring, Empire Coloring and Boxicity. | Jayesh Choudhari, I. Vinod Reddy |
| 2018 | Computing Periods ... . | Junhee Cho, Sewon Park, Martin Ziegler |
| 2018 | Two New Schemes in the Bitprobe Model. | Mirza Galib Anwarul Husain Baig, Deepanjan Kesh |
| 2018 | A Simple, Fast, Filter-Based Algorithm for Circular Sequence Comparison. | Md. Aashikur Rahman Azim, Mohimenul Kabir, M. Sohel Rahman |
| 2018 | Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement. | Aisha Aljohani, Pavan Poudel, Gokarna Sharma |
| 2018 | Minimum-Width Square Annulus Intersecting Polygons. | Hee-Kap Ahn, Taehoon Ahn, Jong Min Choi, Mincheol Kim, Eunjin Oh |
| 2018 | Minimum-Width Annulus with Outliers: Circular, Square, and Rectangular Cases. | Hee-Kap Ahn, Taehoon Ahn, Sang Won Bae, Jong Min Choi, Mincheol Kim, Eunjin Oh, Chan-Su Shin, Sang Duk Yoon |
| 2018 | Online Facility Assignment. | Abu Reyan Ahmed, Md. Saidur Rahman, Stephen G. Kobourov |
| 2017 | Tangle and Maximal Ideal. | Koichi Yamazaki |
| 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 | How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments. | Arash Vaezi, Mohammad Ghodsi |
| 2017 | Byzantine Gathering in Networks with Authenticated Whiteboards. | Masashi Tsuchida, Fukuhito Ooshita, Michiko Inoue |
| 2017 | Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications. | Etsuji Tomita |