default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTaisuke Izumi
- > Home > Persons > Taisuke Izumi
Publications
- 2024
[c75]Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles. ESA 2024: 65:1-65:18- [c74]Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi:
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. SODA 2024: 4062-4082 - [i31]Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Constructing Approximate Single-Source Distance Sensitivity Oracles in Nearly Linear Time. CoRR abs/2401.01103 (2024) - [i30]Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa:
Independent Set Reconfiguration Under Bounded-Hop Token. CoRR abs/2407.11768 (2024) - 2023
- [j41]Rongcheng Dong, Taisuke Izumi, Naoki Kitamura, Yuichi Sudo, Toshimitsu Masuzawa:
Loosely-Stabilizing Algorithm on Almost Maximal Independent Set. IEICE Trans. Inf. Syst. 106(11): 1762-1771 (2023) - [i29]Taisuke Izumi, Naoki Kitamura, Yutaro Yamaguchi:
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching. CoRR abs/2311.04140 (2023) - 2022
- [j40]Ryota Eguchi, Naoki Kitamura, Taisuke Izumi:
Fast Neighborhood Rendezvous. IEICE Trans. Inf. Syst. 105-D(3): 597-610 (2022) - [j39]Naoki Kitamura, Taisuke Izumi:
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. IEICE Trans. Inf. Syst. 105-D(3): 634-645 (2022) - [c71]Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. OPODIS 2022: 11:1-11:18 - [c70]Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman:
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. SPAA 2022: 11-22 - [i28]Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman:
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. CoRR abs/2205.14897 (2022) - [i26]Taisuke Izumi, Kazuki Kakizawa, Yuya Kawabata, Naoki Kitamura, Toshimitsu Masuzawa:
Deciding a Graph Property by a Single Mobile Agent: One-Bit Memory Suffices. CoRR abs/2209.01906 (2022) - [i25]Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa:
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs. CoRR abs/2211.00332 (2022) - 2021
- [j36]Naoki Kitamura
, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-congestion shortcut and graph parameters. Distributed Comput. 34(5): 349-365 (2021) - [i24]Naoki Kitamura, Taisuke Izumi:
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching. CoRR abs/2104.12057 (2021) - [i23]Ryota Eguchi, Naoki Kitamura, Taisuke Izumi:
Fast Neighborhood Rendezvous. CoRR abs/2105.03638 (2021) - 2020
- [j34]Naoki Kitamura, Yuya Kawabata, Taisuke Izumi:
Uniform distribution for Pachinko. Theor. Comput. Sci. 839: 103-121 (2020) - [c66]Ryota Eguchi, Naoki Kitamura, Taisuke Izumi:
Fast Neighborhood Rendezvous. ICDCS 2020: 168-178 - 2019
- [j30]Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue:
A Population Protocol for Uniform $k$-partition under Global Fairness. Int. J. Netw. Comput. 9(1): 97-110 (2019) - [c57]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-Congestion Shortcut and Graph Parameters. DISC 2019: 25:1-25:17 - [i19]Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, Taisuke Izumi:
Low-Congestion Shortcut and Graph Parameters. CoRR abs/1908.09473 (2019) - 2018
- [c56]Naoki Kitamura, Yuya Kawabata, Taisuke Izumi:
Uniform Distribution On Pachinko. FUN 2018: 26:1-26:14 - [c55]Hiroto Yasumi, Naoki Kitamura, Fukuhito Ooshita, Taisuke Izumi, Michiko Inoue:
A Population Protocol for Uniform k-Partition Under Global Fairness. IPDPS Workshops 2018: 813-819 - [c54]Naoki Kitamura, Kazuki Kakizawa, Yuya Kawabata, Taisuke Izumi:
Brief Announcement: Graph Exploration Using Constant-Size Memory and Storage. PODC 2018: 241-243
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-09-26 01:53 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:
