default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYuya Higashikawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. IEICE Trans. Inf. Syst. 107(6): 732-740 (2024)- [j19]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) - [j18]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) - [j17]Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink location problems in dynamic flow grid networks. Theor. Comput. Sci. 1019: 114812 (2024) - 2023
- [j16]Yuya Higashikawa, Naoki Katoh, Yuki Kobayashi:
Efficient algorithms and edge crossing properties of Euclidean minimum weight Laman graphs. Int. J. Comput. Math. Comput. Syst. Theory 8(1): 67-79 (2023) - [c24]Yuki Kawakami, Shun Takahashi, Kazuhisa Seto, Takashi Horiyama, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Lower Bounds for the Thickness and the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs and (2,2)-Tight Graphs. CCCG 2023: 191-196 - [c23]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 - [c22]Hiroki Maegawa, Naoki Katoh, Yuki Tokuni, Yuya Higashikawa:
The Line-Constrained Maximum Coverage Facility Location Problem. COCOA (1) 2023: 406-418 - [c21]Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink Location Problems in Dynamic Flow Grid Networks. COCOON (1) 2023: 155-167 - [c20]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 - [c19]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - [i15]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) - [i14]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Manuel Lafond, Yuki Tokuni, Binhai Zhu:
The Two-Squirrel Problem and Its Relatives. CoRR abs/2302.05937 (2023) - [i13]Yuya Higashikawa, Ayano Nishii, Junichi Teruyama, Yuki Tokuni:
Sink Location Problems in Dynamic Flow Grid Networks. CoRR abs/2308.12651 (2023) - [i12]Sergio Cabello, Éva Czabarka, Ruy Fabila Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek:
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. CoRR abs/2312.01935 (2023) - 2021
- [j15]Yuya Higashikawa, Keiko Imai, Takeharu Shiraga, Noriyoshi Sukegawa, Yusuke Yokosuka:
Minimum point-overlap labelling. Optim. Methods Softw. 36(2-3): 316-325 (2021) - [j14]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) - [c18]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 - [c17]Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh:
Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs. COCOON 2021: 244-256 - [c16]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
- [j13]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-sink problem on path networks. Theor. Comput. Sci. 806: 388-401 (2020) - [c15]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 - [i11]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) - [i10]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
- [j12]Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno:
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13(2): 99-100 (2019) - [j11]Yuya Higashikawa, Naoki Katoh:
A Survey on Facility Location Problems in Dynamic Flow Networks. Rev. Socionetwork Strateg. 13(2): 163-208 (2019) - [c14]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax-Regret Evacuation Planning for Cycle Networks. TAMC 2019: 42-58 - [i9]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
- [j10]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The mixed evacuation problem. J. Comb. Optim. 36(4): 1299-1314 (2018) - [j9]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. Theory Comput. Syst. 62(6): 1392-1408 (2018) - [c13]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. ISAAC 2018: 14:1-14:13 - [c12]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Dynamic Flow Path Networks. IWOCA 2018: 78-89 - [i8]Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks. CoRR abs/1806.00814 (2018) - [i7]Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minsum k-Sink Problem on Path Networks. CoRR abs/1810.10631 (2018) - 2017
- [c11]Yuya Higashikawa, Keiko Imai, Yusuke Matsumoto, Noriyoshi Sukegawa, Yusuke Yokosuka:
Minimum Point-Overlap Labeling. CIAC 2017: 334-344 - [c10]Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS 2017: 133-144 - 2016
- [j8]Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Adnan Sljoka:
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs. Inf. Process. Lett. 116(2): 175-178 (2016) - [c9]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The Mixed Evacuation Problem. COCOA 2016: 18-32 - [c8]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. IWOCA 2016: 122-134 - [i6]Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh, Prashanth Srikanthan:
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. CoRR abs/1606.07208 (2016) - [i5]Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR abs/1609.01373 (2016) - 2015
- [j7]Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu:
Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588: 24-36 (2015) - [j6]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple sink location problems in dynamic path networks. Theor. Comput. Sci. 607: 2-15 (2015) - [j5]Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell:
Optimally bracing grid frameworks with holes. Theor. Comput. Sci. 607: 337-350 (2015) - [c7]Binay Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric p-Center Problems with Centers Constrained to Two Lines. JCDCGG 2015: 24-36 - [i4]Rémy Belmonte, Yuya Higashikawa, Naoki Katoh, Yoshio Okamoto:
Polynomial-time approximability of the k-Sink Location problem. CoRR abs/1503.02835 (2015) - [i3]Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda, Naoki Katoh, Shun Saburi:
Minimax Regret 1-Median Problem in Dynamic Path Networks. CoRR abs/1509.07600 (2015) - [i2]Binay K. Bhattacharya, Ante Custic, Sandip Das, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Geometric k-Center Problems with Centers Constrained to Two Lines. CoRR abs/1512.07533 (2015) - 2014
- [j4]Yuya Higashikawa, Naoki Katoh, Stefan Langerman, Shin-ichi Tanigawa:
Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. 28(2): 480-495 (2014) - [j3]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. J. Graph Algorithms Appl. 18(4): 539-555 (2014) - [j2]Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Naoyuki Kamiyama:
An inductive construction of minimally rigid body-hinge simple graphs. Theor. Comput. Sci. 556: 2-12 (2014) - [c6]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple Sink Location Problems in Dynamic Path Networks. AAIM 2014: 149-161 - [c5]Yoshihiko Ito, Yuki Kobayashi, Yuya Higashikawa, Naoki Katoh, Sheung-Hung Poon, Maria Saumell:
Optimally Bracing Grid Frameworks with Holes. COCOA 2014: 474-489 - [c4]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. WALCOM 2014: 125-137 - [i1]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. CoRR abs/1405.5613 (2014) - 2013
- [j1]Yuya Higashikawa, Naoki Katoh:
Online Vertex Exploration Problems in a Simple Polygon. IEICE Trans. Inf. Syst. 96-D(3): 489-497 (2013) - [c3]Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Yuki Kobayashi:
An Inductive Construction of Minimally Rigid Body-Hinge Simple Graphs. COCOA 2013: 165-177 - [c2]Siu-Wing Cheng, Yuya Higashikawa, Naoki Katoh, Guanqun Ni, Bing Su, Yinfeng Xu:
Minimax Regret 1-Sink Location Problems in Dynamic Path Networks. TAMC 2013: 121-132 - 2012
- [c1]Yuya Higashikawa, Naoki Katoh:
Online Exploration of All Vertices in a Simple Polygon. FAW-AAIM 2012: 315-326
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 20:34 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:
