default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatsuaki Higashimori
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c10]Akira Kawai, Shimpei Shimizu, Katsuaki Higashimori, Kohki Shibahara, Megumi Hoshi, Masanori Nakamura, Kazumitsu Sakamoto, Yosuke Fujino, Takayuki Kobayashi, Yutaka Miyamoto:
Over-3-Tb/s/λ Free-Space MIMO Transmission Under Diffraction with Geometric Mode-Division Multiplexing. OFC 2026: 1-3- [c9]Saki Sakurai, Katsuaki Higashimori, Takuya Ohara:
Regeneration-aware Provisioning for Multi-band Networks with Band Conversion: A Connectivity Graph Approach. OFC 2026: 1-3 - [c8]Shimpei Shimizu, Takushi Kazama, Akira Kawai, Katsuaki Higashimori, Masanori Nakamura, Masashi Abe, Koji Enbutsu, Kazumitsu Sakamoto, Yosuke Fujino, Takeshi Umeki, Takayuki Kobayashi, Yutaka Miyamoto:
Crosstalk Reduction in Bidirectional Transceiver Using Phase-Sensitive Parametric Amplifier. OFC 2026: 1-3 - 2025
- [c7]Katsuaki Higashimori, Takeru Inoue:
Low-Blocking Dynamic Topology Control for LEO Satellite Networks with Real-time Connectivity. ICC Workshops 2025: 1152-1157 - [c6]Saki Sakurai, Katsuaki Higashimori, Takuya Ohara:
Applying Auxiliary Graph for Multi-band Network Planning Based on Hierarchical Optical Cross-Connects. OFC 2025: 1-3 - [c5]Saki Sakurai, Katsuaki Higashimori, Takuya Ohara:
Cost-Efficient SDM/BDM Network Planning Based on Hierarchical Optical Cross-Connects. ONDM 2025: 1-6 - 2024
- [j4]Katsuaki Higashimori
, Takafumi Tanaka, Takeru Inoue:
Routing problem for reducing significant outages in optical networks and its system analysis. J. Opt. Commun. Netw. 16(9): 1 (2024) - [c4]Katsuaki Higashimori, Takeru Inoue:
Dynamic Topology Control of LEO Satellite Networks for Non-uniformly Distributed Traffic. GLOBECOM 2024: 3027-3032 - 2023
- [j3]Katsuaki Higashimori, Takafumi Tanaka, Fumikazu Inuzuka, Takuya Ohara, Takeru Inoue:
Key physical topology features for optical backbone networks via a multilayer correlation analysis. J. Opt. Commun. Netw. 15(5): B23-B32 (2023) - [c3]Katsuaki Higashimori, Takafumi Tanaka, Takeru Inoue:
Efficient Routing Method for Reducing Significant Outages in Optical Networks. GLOBECOM 2023: 2135-2140 - [c2]Katsuaki Higashimori:
Reconfiguration Penalty-Aware Topology Control in Optical Communication Satellite Networks. VCC 2023: 86-91 - 2022
- [j2]Katsuaki Higashimori, Fumikazu Inuzuka, Takuya Ohara:
Physical topology optimization for highly reliable and efficient wavelength-assignable optical networks. JOCN 14(3): 16-24 (2022) - [c1]Katsuaki Higashimori, Takeru Inoue, Takafumi Tanaka, Fumikazu Inuzuka, Takuya Ohara:
Impact of Physical Topology Features on Performance of Optical Backbone Networks. ONDM 2022: 1-6
2010 – 2019
- 2014
- [j1]Takanobu Amano, Katsuaki Higashimori, Keisuke Shirakawa:
A robust method for handling low density regions in hybrid simulations for collisionless plasmas. J. Comput. Phys. 275: 197-212 (2014)
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 2026-06-10 23:01 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
