Reconstructing Strings from Substrings with Quantum Queries. - Richard Cleve; Kazuo Iwama; François Le Gall; Harumichi Nishimura; Seiichiro Tani; Junichi Teruyama; Shigeru Yamashita (SWAT, 2012)

Quantum counterfeit coin problems. - Kazuo Iwama; Harumichi Nishimura; Rudy Raymond; Junichi Teruyama (Theor. Comput. Sci., 2012)

Efficient Algorithms for Sorting k-Sets in Bins. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (WALCOM, 2014)

A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. - Takayuki Sakai; Kazuhisa Seto; Suguru Tamaki; Junichi Teruyama (Electron. Colloquium Comput. Complex., 2015)

Efficient Algorithms for Sorting k-Sets in Bins. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (IEICE Trans. Inf. Syst., 2015)

An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability. - Kazuhisa Seto; Junichi Teruyama (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Improved exact algorithms for mildly sparse instances of Max SAT. - Takayuki Sakai; Kazuhisa Seto; Suguru Tamaki; Junichi Teruyama (Theor. Comput. Sci., 2017)

Small Complexity Gaps for Comparison-Based Sorting. - Shogo Ehara; Kazuo Iwama; Junichi Teruyama (Adventures Between Lower Bounds and Higher Altitudes, 2018)

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (Algorithmica, 2018)

Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms. - Kazuo Iwama; Junichi Teruyama; Shuntaro Tsuyama (CoRR, 2018)

Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. - Takayuki Sakai; Kazuhisa Seto; Suguru Tamaki; Junichi Teruyama (J. Comput. Syst. Sci., 2019)

Hyperfiniteness of Real-World Networks. - Yutaro Honda; Yoshitaka Inoue; Hiro Ito; Munehiko Sasajima; Junichi Teruyama; Yushi Uno (Rev. Socionetwork Strateg., 2019)

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Koji Watase (COCOA, 2020)

Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. - Atsuki Nagao; Kazuhisa Seto; Junichi Teruyama (Theory Comput. Syst., 2020)

Improved average complexity for comparison-based sorting. - Kazuo Iwama; Junichi Teruyama (Theor. Comput. Sci., 2020)

Locating Evacuation Centers Optimally in Path and Cycle Networks. - Robert Benkoczi; Binay Bhattacharya; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh; Junichi Teruyama (ATMOS, 2021)

Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Koji Watase (Theor. Comput. Sci., 2021)

A Satisfiability Algorithm for Deterministic Width-2 Branching Programs. - Tomu Makita; Atsuki Nagao; Tatsuki Okada; Kazuhisa Seto; Junichi Teruyama (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Red-Black Spanners for Mixed-Charging Vehicular Networks. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni; Binhai Zhu (COCOON (1), 2023)

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. - Takehiro Ito; Jun Kawahara; Yu Nakahata; Takehide Soh; Akira Suzuki 001; Junichi Teruyama; Takahisa Toda (CPAIOR, 2023)

On Computing a Center Persistence Diagram. - Yuya Higashikawa; Naoki Katoh; Guohui Lin; Eiji Miyano; Suguru Tamaki; Junichi Teruyama; Binhai Zhu (FCT, 2023)

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. - Takahisa Toda; Takehiro Ito; Jun Kawahara; Takehide Soh; Akira Suzuki 001; Junichi Teruyama (ICTAI, 2023)

Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni (CoRR, 2023)

Sink location problems in dynamic flow grid networks. - Yuya Higashikawa; Ayano Nishii; Junichi Teruyama; Yuki Tokuni (Theor. Comput. Sci., 2024)

Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights. - Tetsuya Fujie; Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni (J. Comb. Optim., 2024)

Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges. - Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni (J. Comb. Optim., 2024)

Constructing red-black spanners for mixed-charging vehicular networks. - Sergey Bereg; Yuya Higashikawa; Naoki Katoh; Junichi Teruyama; Yuki Tokuni; Binhai Zhu (Theor. Comput. Sci., 2025)