Junichi Teruyama

47 papers B 11C 2Journal 28Unranked 6
YearRankTypeTitle / Venue / Authors
2026 J jnl
Required-edge Cycle Cover Problem: an ASP-Completeness Framework for Graph Problems and Puzzles.
CoRR
Kosuke Susukita, Junichi Teruyama
2025 J jnl
Constructing red-black spanners for mixed-charging vehicular networks.
Theor. Comput. Sci.
Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu
2025 B conf
Exact Algorithms and Hardness Result for the Boolean Connectivity Problem of k-Horn Formulas.
IPEC
Takashi Horiyama, Yuto Okura, Kazuhisa Seto, Junichi Teruyama
2024 J jnl
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges.
J. Comb. Optim.
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2024 J jnl
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights.
J. Comb. Optim.
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2024 J jnl
Sink location problems in dynamic flow grid networks.
Theor. Comput. Sci.
Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni
2023 — conf
Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges.
COCOA (1)
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2023 J jnl
Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges.
CoRR
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2023 B conf
On Computing a Center Persistence Diagram.
FCT
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
2023 — conf
Red-Black Spanners for Mixed-Charging Vehicular Networks.
COCOON (1)
Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu
2023 — conf
Sink Location Problems in Dynamic Flow Grid Networks.
COCOON (1)
Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni
2023 J jnl
Sink Location Problems in Dynamic Flow Grid Networks.
CoRR
Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni
2023 B conf
Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability.
ICTAI
Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama
2023 B conf
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.
CPAIOR
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
2022 J jnl
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama
2022 J jnl
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems.
CoRR
Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda
2021 J jnl
Almost linear time algorithms for minsum
Theor. Comput. Sci.
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
2021 C conf
Locating Evacuation Centers Optimally in Path and Cycle Networks.
ATMOS
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama
2021 B conf
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.
WALCOM
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2020 C conf
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.
COCOA
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
2020 J jnl
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks.
CoRR
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase
2020 J jnl
Improved average complexity for comparison-based sorting.
Theor. Comput. Sci.
Kazuo Iwama, Junichi Teruyama
2020 J jnl
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights.
CoRR
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
2020 J jnl
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs.
Theory Comput. Syst.
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2019 J jnl
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression.
J. Comput. Syst. Sci.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2019 J jnl
Hyperfiniteness of Real-World Networks.
Rev. Socionetwork Strateg.
Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno
2019 J jnl
On Computing a Center Persistence Diagram.
CoRR
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
2018 J jnl
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
Algorithmica
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2018 J jnl
Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms.
CoRR
Kazuo Iwama, Junichi Teruyama, Shuntaro Tsuyama
2018 — conf
Small Complexity Gaps for Comparison-Based Sorting.
Adventures Between Lower Bounds and Higher Altitudes
Shogo Ehara, Kazuo Iwama, Junichi Teruyama
2017 B conf
Improved Average Complexity for Comparison-Based Sorting.
WADS
Kazuo Iwama, Junichi Teruyama
2017 J jnl
Improved Average Complexity for Comparison-Based Sorting.
CoRR
Kazuo Iwama, Junichi Teruyama
2017 J jnl
Improved exact algorithms for mildly sparse instances of Max SAT.
Theor. Comput. Sci.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2017 B conf
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.
ISAAC
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2016 J jnl
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Kazuhisa Seto, Junichi Teruyama
2016 B conf
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.
MFCS
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2016 J jnl
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression.
Electron. Colloquium Comput. Complex.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2015 B conf
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability.
WADS
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2015 J jnl
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom.
Electron. Colloquium Comput. Complex.
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2015 J jnl
Efficient Algorithms for Sorting
IEICE Trans. Inf. Syst.
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2015 B conf
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT.
IPEC
Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama
2014 B conf
Efficient Algorithms for Sorting k-Sets in Bins.
WALCOM
Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama
2012 J jnl
Quantum counterfeit coin problems.
Theor. Comput. Sci.
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
2012 J jnl
Reconstructing Strings from Substrings with Quantum Queries
CoRR
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
2012 — conf
Reconstructing Strings from Substrings with Quantum Queries.
SWAT
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
2010 J jnl
Quantum Counterfeit Coin Problems
CoRR
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama
2010 — conf
Quantum Counterfeit Coin Problems.
ISAAC (1)
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama