Junichi Teruyama

According to our database, Junichi Teruyama authored at least 27 papers between 2010 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

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

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

Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability.

Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama

Proceedings of the 35th IEEE International Conference on Tools with Artificial Intelligence, 2023

On Computing a Center Persistence Diagram.

Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.

Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2023

Sink Location Problems in Dynamic Flow Grid Networks.

Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Red-Black Spanners for Mixed-Charging Vehicular Networks.

Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

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

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

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., September, 2022

2021

Almost linear time algorithms for minsum <i>k</i>-sink problems on dynamic flow path networks.

Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase

Theor. Comput. Sci., 2021

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.

Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni

Proceedings of the WALCOM: Algorithms and Computation, 2021

Locating Evacuation Centers Optimally in Path and Cycle Networks.

Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama

Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020

Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.

Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

Hyperfiniteness of Real-World Networks.

Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno

Rev. Socionetwork Strateg., 2019

2018

Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms.

Kazuo Iwama, Junichi Teruyama, Shuntaro Tsuyama

CoRR, 2018

Small Complexity Gaps for Comparison-Based Sorting.

Shogo Ehara, Kazuo Iwama, Junichi Teruyama

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Improved Average Complexity for Comparison-Based Sorting.

Kazuo Iwama, Junichi Teruyama

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability.

Kazuhisa Seto, Junichi Teruyama

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.

Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Efficient Algorithms for Sorting <i>k</i>-Sets in Bins.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

IEICE Trans. Inf. Syst., 2015

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

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Improved Exact Algorithms for Mildly Sparse Instances of Max SAT.

Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

2014

Efficient Algorithms for Sorting k-Sets in Bins.

Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama

Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

2012

Reconstructing Strings from Substrings with Quantum Queries.

Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita

Proceedings of the Algorithm Theory - SWAT 2012, 2012

2010

Quantum Counterfeit Coin Problems.

Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010