default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunichi Teruyama
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni
:
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights. J. Comb. Optim. 48(2): 15 (2024)- [j13]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges. J. Comb. Optim. 48(3): 18 (2024) - [j12]Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink location problems in dynamic flow grid networks. Theor. Comput. Sci. 1019: 114812 (2024) - 2023
- [c18]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges. COCOA (1) 2023: 29-42 - [c17]Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink Location Problems in Dynamic Flow Grid Networks. COCOON (1) 2023: 155-167 - [c16]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu:
Red-Black Spanners for Mixed-Charging Vehicular Networks. COCOON (1) 2023: 220-231 - [c15]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CPAIOR 2023: 167-183 - [c14]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - [c13]Takahisa Toda, Takehiro Ito, Jun Kawahara, Takehide Soh, Akira Suzuki, Junichi Teruyama:
Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability. ICTAI 2023: 294-302 - [i12]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges. CoRR abs/2301.06857 (2023) - [i11]Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink Location Problems in Dynamic Flow Grid Networks. CoRR abs/2308.12651 (2023) - 2022
- [j11]Tomu Makita, Atsuki Nagao, Tatsuki Okada, Kazuhisa Seto, Junichi Teruyama:
A Satisfiability Algorithm for Deterministic Width-2 Branching Programs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1298-1308 (2022) - [i10]Takehiro Ito, Jun Kawahara, Yu Nakahata, Takehide Soh, Akira Suzuki, Junichi Teruyama, Takahisa Toda:
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems. CoRR abs/2207.13959 (2022) - 2021
- [j10]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase:
Almost linear time algorithms for minsum k-sink problems on dynamic flow path networks. Theor. Comput. Sci. 873: 87-113 (2021) - [c12]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. ATMOS 2021: 13:1-13:19 - [c11]Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. WALCOM 2021: 52-64 - 2020
- [j9]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs. Theory Comput. Syst. 64(8): 1392-1407 (2020) - [j8]Kazuo Iwama, Junichi Teruyama:
Improved average complexity for comparison-based sorting. Theor. Comput. Sci. 807: 201-219 (2020) - [c10]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase:
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. COCOA 2020: 198-213 - [i9]Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Koji Watase:
Almost Linear Time Algorithms for Minsum k-Sink Problems on Dynamic Flow Path Networks. CoRR abs/2010.05729 (2020) - [i8]Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni:
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights. CoRR abs/2011.13569 (2020)
2010 – 2019
- 2019
- [j7]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. J. Comput. Syst. Sci. 105: 87-103 (2019) - [j6]Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno:
Hyperfiniteness of Real-World Networks. Rev. Socionetwork Strateg. 13(2): 123-141 (2019) - [i7]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. CoRR abs/1910.01753 (2019) - 2018
- [j5]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. Algorithmica 80(10): 2725-2741 (2018) - [c9]Shogo Ehara, Kazuo Iwama, Junichi Teruyama:
Small Complexity Gaps for Comparison-Based Sorting. Adventures Between Lower Bounds and Higher Altitudes 2018: 280-296 - [i6]Kazuo Iwama, Junichi Teruyama, Shuntaro Tsuyama:
Reconstructing Strings from Substrings: Optimal Randomized and Average-Case Algorithms. CoRR abs/1808.00674 (2018) - 2017
- [j4]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved exact algorithms for mildly sparse instances of Max SAT. Theor. Comput. Sci. 697: 58-68 (2017) - [c8]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs. ISAAC 2017: 58:1-58:10 - [c7]Kazuo Iwama, Junichi Teruyama:
Improved Average Complexity for Comparison-Based Sorting. WADS 2017: 485-496 - [i5]Kazuo Iwama, Junichi Teruyama:
Improved Average Complexity for Comparison-Based Sorting. CoRR abs/1705.00849 (2017) - 2016
- [j3]Kazuhisa Seto, Junichi Teruyama:
An Exact Algorithm for Oblivious Read-Twice Branching Program Satisfiability. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1019-1024 (2016) - [c6]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. MFCS 2016: 82:1-82:16 - [i4]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Bounded Depth Circuits with Weighted Symmetric Gates: Satisfiability, Lower Bounds and Compression. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j2]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Efficient Algorithms for Sorting k-Sets in Bins. IEICE Trans. Inf. Syst. 98-D(10): 1736-1743 (2015) - [c5]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT. IPEC 2015: 90-101 - [c4]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability. WADS 2015: 554-565 - [i3]Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama:
A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c3]Atsuki Nagao, Kazuhisa Seto, Junichi Teruyama:
Efficient Algorithms for Sorting k-Sets in Bins. WALCOM 2014: 225-236 - 2012
- [j1]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum counterfeit coin problems. Theor. Comput. Sci. 456: 51-64 (2012) - [c2]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. SWAT 2012: 388-397 - [i2]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012) - 2010
- [c1]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. ISAAC (1) 2010: 85-96 - [i1]Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Junichi Teruyama:
Quantum Counterfeit Coin Problems. CoRR abs/1009.0416 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
