Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Hiroshi Eto
@article{DBLP:journals/algorithmica/EtoIMST23,
author = {Hiroshi Eto and
Takehiro Ito and
Eiji Miyano and
Akira Suzuki and
Yuma Tamura},
title = {Happy Set Problem on Subclasses of Co-comparability Graphs},
journal = {Algorithmica},
volume = {85},
number = {11},
pages = {3327--3347},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01081-0},
doi = {10.1007/S00453-022-01081-0},
timestamp = {Wed, 08 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EtoIMST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AsahiroEHLMT23,
author = {Yuichi Asahiro and
Hiroshi Eto and
Tesshu Hanaka and
Guohui Lin and
Eiji Miyano and
Ippei Terabaru},
title = {Corrigendum to "Complexity and approximability of the happy set
problem" [Theor. Comput. Sci. 866 {(2021)} 123-144]},
journal = {Theor. Comput. Sci.},
volume = {975},
pages = {114114},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.114114},
doi = {10.1016/J.TCS.2023.114114},
timestamp = {Tue, 10 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AsahiroEHLMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AsahiroEKLMN23,
author = {Yuichi Asahiro and
Hiroshi Eto and
Kana Korenaga and
Guohui Lin and
Eiji Miyano and
Reo Nonoue},
editor = {Marios Mavronicolas},
title = {Independent Set Under a Change Constraint from an Initial Solution},
booktitle = {Algorithms and Complexity - 13th International Conference, {CIAC}
2023, Larnaca, Cyprus, June 13-16, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13898},
pages = {37--51},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_4},
doi = {10.1007/978-3-031-30448-4\_4},
timestamp = {Fri, 28 Apr 2023 19:21:51 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AsahiroEKLMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/AsahiroEG0LMOT23,
author = {Yuichi Asahiro and
Hiroshi Eto and
Mingyang Gong and
Jesper Jansson and
Guohui Lin and
Eiji Miyano and
Hirotaka Ono and
Shunichi Tanaka},
editor = {Laurent Bulteau and
Zsuzsanna Lipt{\'{a}}k},
title = {Approximation Algorithms for the Longest Run Subsequence Problem},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2023,
June 26-28, 2023, Marne-la-Vall{\'{e}}e, France},
series = {LIPIcs},
volume = {259},
pages = {2:1--2:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CPM.2023.2},
doi = {10.4230/LIPICS.CPM.2023.2},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cpm/AsahiroEG0LMOT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/SaitoEIU23,
author = {Rin Saito and
Hiroshi Eto and
Takehiro Ito and
Ryuhei Uehara},
editor = {Chun{-}Cheng Lin and
Bertrand M. T. Lin and
Giuseppe Liotta},
title = {Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 17th International Conference
and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13973},
pages = {191--201},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-27051-2\_17},
doi = {10.1007/978-3-031-27051-2\_17},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/SaitoEIU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieiceta/EtoILM22,
author = {Hiroshi Eto and
Takehiro Ito and
Zhilong Liu and
Eiji Miyano},
title = {Approximability of the Distance Independent Set Problem on Regular
Graphs and Planar Graphs},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {105-A},
number = {9},
pages = {1211--1222},
year = {2022},
url = {https://doi.org/10.1587/transfun.2021dmp0017},
doi = {10.1587/TRANSFUN.2021DMP0017},
timestamp = {Thu, 11 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieiceta/EtoILM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/EtoIKOW22,
author = {Hiroshi Eto and
Takehiro Ito and
Yasuaki Kobayashi and
Yota Otachi and
Kunihiro Wasa},
editor = {Petra Mutzel and
Md. Saidur Rahman and
Slamin},
title = {Reconfiguration of Regular Induced Subgraphs},
booktitle = {{WALCOM:} Algorithms and Computation - 16th International Conference
and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13174},
pages = {35--46},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-96731-4\_4},
doi = {10.1007/978-3-030-96731-4\_4},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/EtoIKOW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/EtoIMST22,
author = {Hiroshi Eto and
Takehiro Ito and
Eiji Miyano and
Akira Suzuki and
Yuma Tamura},
editor = {Petra Mutzel and
Md. Saidur Rahman and
Slamin},
title = {Happy Set Problem on Subclasses of Co-comparability Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 16th International Conference
and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13174},
pages = {149--160},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-96731-4\_13},
doi = {10.1007/978-3-030-96731-4\_13},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/EtoIMST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DuarteEHKKLPSS21,
author = {Gabriel L. Duarte and
Hiroshi Eto and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Daniel Lokshtanov and
Lehilton L. C. Pedrosa and
Rafael C. S. Schouery and
U{\'{e}}verton S. Souza},
title = {Computing the Largest Bond and the Maximum Connected Cut of a Graph},
journal = {Algorithmica},
volume = {83},
number = {5},
pages = {1421--1458},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00789-1},
doi = {10.1007/S00453-020-00789-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DuarteEHKKLPSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AsahiroEHLMT21,
author = {Yuichi Asahiro and
Hiroshi Eto and
Tesshu Hanaka and
Guohui Lin and
Eiji Miyano and
Ippei Terabaru},
title = {Parameterized algorithms for the Happy Set problem},
journal = {Discret. Appl. Math.},
volume = {304},
pages = {32--44},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.07.005},
doi = {10.1016/J.DAM.2021.07.005},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/AsahiroEHLMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AsahiroEHLMT21,
author = {Yuichi Asahiro and
Hiroshi Eto and
Tesshu Hanaka and
Guohui Lin and
Eiji Miyano and
Ippei Terabaru},
title = {Complexity and approximability of the happy set problem},
journal = {Theor. Comput. Sci.},
volume = {866},
pages = {123--144},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.03.023},
doi = {10.1016/J.TCS.2021.03.023},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AsahiroEHLMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-13476,
author = {Hiroshi Eto and
Takehiro Ito and
Yasuaki Kobayashi and
Yota Otachi and
Kunihiro Wasa},
title = {Reconfiguration of Regular Induced Subgraphs},
journal = {CoRR},
volume = {abs/2111.13476},
year = {2021},
url = {https://arxiv.org/abs/2111.13476},
eprinttype = {arXiv},
eprint = {2111.13476},
timestamp = {Wed, 01 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-13476.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AsahiroEHLMT20,
author = {Yuichi Asahiro and
Hiroshi Eto and
Tesshu Hanaka and
Guohui Lin and
Eiji Miyano and
Ippei Terabaru},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {Graph Classes and Approximability of the Happy Set Problem},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {335--346},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_27},
doi = {10.1007/978-3-030-58150-3\_27},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AsahiroEHLMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/AsahiroEHLMT20,
author = {Yuichi Asahiro and
Hiroshi Eto and
Tesshu Hanaka and
Guohui Lin and
Eiji Miyano and
Ippei Terabaru},
editor = {M. Sohel Rahman and
Kunihiko Sadakane and
Wing{-}Kin Sung},
title = {Parameterized Algorithms for the Happy Set Problem},
booktitle = {{WALCOM:} Algorithms and Computation - 14th International Conference,
{WALCOM} 2020, Singapore, March 31 - April 2, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12049},
pages = {323--328},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-39881-1\_27},
doi = {10.1007/978-3-030-39881-1\_27},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/AsahiroEHLMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-04513,
author = {Gabriel L. Duarte and
Hiroshi Eto and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Daniel Lokshtanov and
Lehilton L. C. Pedrosa and
Rafael C. S. Schouery and
U{\'{e}}verton S. Souza},
title = {Computing the Largest Bond and the Maximum Connected Cut of a Graph},
journal = {CoRR},
volume = {abs/2007.04513},
year = {2020},
url = {https://arxiv.org/abs/2007.04513},
eprinttype = {arXiv},
eprint = {2007.04513},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-04513.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/EtoHK019,
author = {Hiroshi Eto and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi},
editor = {Bart M. P. Jansen and
Jan Arne Telle},
title = {Parameterized Algorithms for Maximum Cut with Connectivity Constraints},
booktitle = {14th International Symposium on Parameterized and Exact Computation,
{IPEC} 2019, September 11-13, 2019, Munich, Germany},
series = {LIPIcs},
volume = {148},
pages = {13:1--13:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2019.13},
doi = {10.4230/LIPICS.IPEC.2019.13},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/EtoHK019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-03389,
author = {Hiroshi Eto and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi},
title = {Parameterized Algorithms for Maximum Cut with Connectivity Constraints},
journal = {CoRR},
volume = {abs/1908.03389},
year = {2019},
url = {http://arxiv.org/abs/1908.03389},
eprinttype = {arXiv},
eprint = {1908.03389},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-03389.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/EtoKMN18,
author = {Hiroshi Eto and
Hiroyuki Kawahara and
Eiji Miyano and
Natsuki Nonoue},
title = {Complexity of the Minimum Single Dominating Cycle Problem for Graph
Classes},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {101-D},
number = {3},
pages = {574--581},
year = {2018},
url = {https://doi.org/10.1587/transinf.2017FCP0007},
doi = {10.1587/TRANSINF.2017FCP0007},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/EtoKMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/EtoILM17,
author = {Hiroshi Eto and
Takehiro Ito and
Zhilong Liu and
Eiji Miyano},
editor = {Sheung{-}Hung Poon and
Md. Saidur Rahman and
Hsu{-}Chun Yen},
title = {Approximation Algorithm for the Distance-3 Independent Set Problem
on Cubic Graphs},
booktitle = {{WALCOM:} Algorithms and Computation, 11th International Conference
and Workshops, {WALCOM} 2017, Hsinchu, Taiwan, March 29-31, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10167},
pages = {228--240},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53925-6\_18},
doi = {10.1007/978-3-319-53925-6\_18},
timestamp = {Tue, 21 Mar 2023 20:55:51 +0100},
biburl = {https://dblp.org/rec/conf/walcom/EtoILM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/EtoILM16,
author = {Hiroshi Eto and
Takehiro Ito and
Zhilong Liu and
Eiji Miyano},
editor = {T.{-}H. Hubert Chan and
Minming Li and
Lusheng Wang},
title = {Approximability of the Distance Independent Set Problem on Regular
Graphs and Planar Graphs},
booktitle = {Combinatorial Optimization and Applications - 10th International Conference,
{COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10043},
pages = {270--284},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48749-6\_20},
doi = {10.1007/978-3-319-48749-6\_20},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/EtoILM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/EtoGM14,
author = {Hiroshi Eto and
Fengrui Guo and
Eiji Miyano},
title = {Distance- {\textdollar}{\textdollar}d{\textdollar}{\textdollar} independent
set problems for bipartite and chordal graphs},
journal = {J. Comb. Optim.},
volume = {27},
number = {1},
pages = {88--99},
year = {2014},
url = {https://doi.org/10.1007/s10878-012-9594-4},
doi = {10.1007/S10878-012-9594-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/EtoGM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AsahiroEIM14,
author = {Yuichi Asahiro and
Hiroshi Eto and
Takehiro Ito and
Eiji Miyano},
title = {Complexity of finding maximum regular induced subgraphs with prescribed
degree},
journal = {Theor. Comput. Sci.},
volume = {550},
pages = {21--35},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.07.008},
doi = {10.1016/J.TCS.2014.07.008},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AsahiroEIM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/AsahiroEM13,
author = {Yuichi Asahiro and
Hiroshi Eto and
Eiji Miyano},
title = {Inapproximability of Maximum \emph{r}-Regular Induced Connected Subgraph
Problems},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {96-D},
number = {3},
pages = {443--449},
year = {2013},
url = {https://doi.org/10.1587/transinf.E96.D.443},
doi = {10.1587/TRANSINF.E96.D.443},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/AsahiroEM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AsahiroEIM13,
author = {Yuichi Asahiro and
Hiroshi Eto and
Takehiro Ito and
Eiji Miyano},
editor = {Leszek Gasieniec and
Frank Wolter},
title = {Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed
Degree},
booktitle = {Fundamentals of Computation Theory - 19th International Symposium,
{FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8070},
pages = {28--39},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40164-0\_6},
doi = {10.1007/978-3-642-40164-0\_6},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/AsahiroEIM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/EtoGM12,
author = {Hiroshi Eto and
Fengrui Guo and
Eiji Miyano},
editor = {Guohui Lin},
title = {Distance-d Independent Set Problems for Bipartite and Chordal Graphs},
booktitle = {Combinatorial Optimization and Applications - 6th International Conference,
{COCOA} 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7402},
pages = {234--244},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31770-5\_21},
doi = {10.1007/978-3-642-31770-5\_21},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/EtoGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:51 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:
