| 2023 | FCT | On Computing a Center Persistence Diagram. | Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu |
| 2019 | IWOCA | An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number. | Yasuaki Kobayashi, Yusuke Kobayashi, Shuichi Miyazaki, Suguru Tamaki |
| 2017 | COCOON | Quantum Query Complexity of Unitary Operator Discrimination. | Akinori Kawachi, Kenichi Kawano, Franois Le Gall, Suguru Tamaki |
| 2017 | SODA | Beating Brute Force for Systems of Polynomial Equations over Finite Fields. | Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu |
| 2016 | MFCS | Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. | Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki |
| 2016 | MFCS | Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. | Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama |
| 2014 | SAT | Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction. | Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki |
| 2011 | COCOON | Derandomizing HSSW Algorithm for 3-SAT. | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
| 2010 | ISAAC | Improved Randomized Algorithms for 3-SAT. | Kazuo Iwama, Kazuhisa Seto, Tadashi Takai, Suguru Tamaki |
| 2010 | SAT | An Exact Algorithm for the Boolean Connectivity Problem for | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
| 2007 | SAT | On the Boolean Connectivity Problem for Horn Relations. | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto |
| 2004 | SODA | Improved upper bounds for 3-SAT. | Kazuo Iwama, Suguru Tamaki |