default search action
Hiroshi Eto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara:
Reconfiguration of vertex-disjoint shortest paths on graphs. J. Graph Algorithms Appl. 28(3): 87-101 (2024) - [c13]Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir:
Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA 2024: 314-326 - 2023
- [j10]Hiroshi Eto, Takehiro Ito, Eiji Miyano, Akira Suzuki, Yuma Tamura:
Happy Set Problem on Subclasses of Co-comparability Graphs. Algorithmica 85(11): 3327-3347 (2023) - [j9]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. 975: 114114 (2023) - [c12]Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue:
Independent Set Under a Change Constraint from an Initial Solution. CIAC 2023: 37-51 - [c11]Yuichi Asahiro, Hiroshi Eto, Mingyang Gong
, Jesper Jansson
Approximation Algorithms for the Longest Run Subsequence Problem. CPM 2023: 2:1-2:12 - [c10]Rin Saito
Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. WALCOM 2023: 191-201 - 2022
- [j8]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano:
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9): 1211-1222 (2022) - [c9]Hiroshi Eto, Takehiro Ito
Reconfiguration of Regular Induced Subgraphs. WALCOM 2022: 35-46 - [c8]Hiroshi Eto, Takehiro Ito, Eiji Miyano
Happy Set Problem on Subclasses of Co-comparability Graphs. WALCOM 2022: 149-160 - 2021
- [j7]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka
Computing the Largest Bond and the Maximum Connected Cut of a Graph. Algorithmica 83(5): 1421-1458 (2021) - [j6]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304: 32-44 (2021) - [j5]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866: 123-144 (2021) - [i3]Hiroshi Eto, Takehiro Ito, Yasuaki Kobayashi, Yota Otachi, Kunihiro Wasa:
Reconfiguration of Regular Induced Subgraphs. CoRR abs/2111.13476 (2021) - 2020
- [c7]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano
Graph Classes and Approximability of the Happy Set Problem. COCOON 2020: 335-346 - [c6]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka
Parameterized Algorithms for the Happy Set Problem. WALCOM 2020: 323-328 - [i2]Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi
Computing the Largest Bond and the Maximum Connected Cut of a Graph. CoRR abs/2007.04513 (2020)
2010 – 2019
- 2019
- [c5]Hiroshi Eto, Tesshu Hanaka
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. IPEC 2019: 13:1-13:15 - [i1]Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi:
Parameterized Algorithms for Maximum Cut with Connectivity Constraints. CoRR abs/1908.03389 (2019) - 2018
- [j4]Hiroshi Eto, Hiroyuki Kawahara, Eiji Miyano
Complexity of the Minimum Single Dominating Cycle Problem for Graph Classes. IEICE Trans. Inf. Syst. 101-D(3): 574-581 (2018) - 2017
- [c4]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs. WALCOM 2017: 228-240 - 2016
- [c3]Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. COCOA 2016: 270-284 - 2014
- [j3]Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance- $$d$$ independent set problems for bipartite and chordal graphs. J. Comb. Optim. 27(1): 88-99 (2014) - [j2]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of finding maximum regular induced subgraphs with prescribed degree. Theor. Comput. Sci. 550: 21-35 (2014) - 2013
- [j1]Yuichi Asahiro, Hiroshi Eto, Eiji Miyano
Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems. IEICE Trans. Inf. Syst. 96-D(3): 443-449 (2013) - [c2]Yuichi Asahiro, Hiroshi Eto, Takehiro Ito, Eiji Miyano
Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree. FCT 2013: 28-39 - 2012
- [c1]Hiroshi Eto, Fengrui Guo, Eiji Miyano
Distance-d Independent Set Problems for Bipartite and Chordal Graphs. COCOA 2012: 234-244
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-16 20:32 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: