Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Hiro Ito
@article{DBLP:journals/ieiceta/ChibaI22,
author = {Kyohei Chiba and
Hiro Ito},
title = {Sublinear Computation Paradigm: Constant-Time Algorithms and Sublinear
Progressive Algorithms},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {105-A},
number = {3},
pages = {131--141},
year = {2022},
url = {https://doi.org/10.1587/transfun.2021eai0003},
doi = {10.1587/TRANSFUN.2021EAI0003},
timestamp = {Thu, 12 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieiceta/ChibaI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DemaineILU22,
author = {Erik D. Demaine and
Hiro Ito and
Jayson Lynch and
Ryuhei Uehara},
editor = {Yeganeh Bahoo and
Konstantinos Georgiou},
title = {Computational Complexity of Flattening Fixed-Angle Orthogonal Chains},
booktitle = {Proceedings of the 34th Canadian Conference on Computational Geometry,
{CCCG} 2022, Toronto Metropolitan University, Toronto, Ontario, Canada,
August 25-27, 2022},
pages = {98--104},
year = {2022},
timestamp = {Wed, 23 Nov 2022 15:41:57 +0100},
biburl = {https://dblp.org/rec/conf/cccg/DemaineILU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-12450,
author = {Erik D. Demaine and
Hiro Ito and
Jayson Lynch and
Ryuhei Uehara},
title = {Computational Complexity of Flattening Fixed-Angle Orthogonal Chains},
journal = {CoRR},
volume = {abs/2212.12450},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.12450},
doi = {10.48550/ARXIV.2212.12450},
eprinttype = {arXiv},
eprint = {2212.12450},
timestamp = {Wed, 04 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-12450.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GreenblattHHHIK21,
author = {Aster Greenblatt and
Oscar Hernandez and
Robert A. Hearn and
Yichao Hou and
Hiro Ito and
Minwoo Kang and
Aaron Williams and
Andrew Winslow},
editor = {Meng He and
Don Sheehy},
title = {Turning Around and Around: Motion Planning through Thick and Thin
Turnstiles},
booktitle = {Proceedings of the 33rd Canadian Conference on Computational Geometry,
{CCCG} 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova
Scotia, Canada},
pages = {377--387},
year = {2021},
timestamp = {Fri, 24 Sep 2021 13:55:36 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GreenblattHHHIK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ItoKN20,
author = {Hiro Ito and
Areej Khoury and
Ilan Newman},
title = {On the characterization of 1-sided error strongly testable graph properties
for bounded-degree graphs},
journal = {Comput. Complex.},
volume = {29},
number = {1},
pages = {1},
year = {2020},
url = {https://doi.org/10.1007/s00037-019-00191-6},
doi = {10.1007/S00037-019-00191-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ItoKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AkiyamaISU20,
author = {Jin Akiyama and
Hiro Ito and
Toshinori Sakai and
Yushi Uno},
title = {Twenty Years of Progress of {\textdollar}\{JCDCG\}{\^{}}3{\textdollar}},
journal = {Graphs Comb.},
volume = {36},
number = {2},
pages = {181--203},
year = {2020},
url = {https://doi.org/10.1007/s00373-020-02133-4},
doi = {10.1007/S00373-020-02133-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AkiyamaISU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/DemaineILLRX20,
author = {Erik D. Demaine and
Hiro Ito and
Stefan Langerman and
Jayson Lynch and
Mikhail Rudoy and
Kai Xiao},
title = {Cookie Clicker},
journal = {Graphs Comb.},
volume = {36},
number = {2},
pages = {269--302},
year = {2020},
url = {https://doi.org/10.1007/s00373-019-02093-4},
doi = {10.1007/S00373-019-02093-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/DemaineILLRX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/Ito20,
author = {Hiro Ito},
title = {Editor's Message for Special Issue of Discrete and Computational Geometry,
Graphs, and Games},
journal = {J. Inf. Process.},
volume = {28},
pages = {744},
year = {2020},
url = {https://doi.org/10.2197/ipsjjip.28.744},
doi = {10.2197/IPSJJIP.28.744},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/Ito20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/DemaineDINSTT20,
author = {Erik D. Demaine and
Martin L. Demaine and
Hiro Ito and
Chie Nara and
Izumi Shirahama and
Tomohiro Tachi and
Mizuho Tomura},
title = {Flat Folding a Strip with Parallel or Nonacute Zigzag Creases with
Mountain-Valley Assignment},
journal = {J. Inf. Process.},
volume = {28},
pages = {825--833},
year = {2020},
url = {https://doi.org/10.2197/ipsjjip.28.825},
doi = {10.2197/IPSJJIP.28.825},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/DemaineDINSTT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/ChibaBILNO20,
author = {Kyohei Chiba and
R{\'{e}}my Belmonte and
Hiro Ito and
Michael Lampis and
Atsuki Nagao and
Yota Otachi},
title = {\emph{K}\({}_{\mbox{3}}\) Edge Cover Problem in a Wide Sense},
journal = {J. Inf. Process.},
volume = {28},
pages = {849--858},
year = {2020},
url = {https://doi.org/10.2197/ipsjjip.28.849},
doi = {10.2197/IPSJJIP.28.849},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jip/ChibaBILNO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoLPP20,
author = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {{FUN} editorial},
journal = {Theor. Comput. Sci.},
volume = {842},
pages = {131},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.06.026},
doi = {10.1016/J.TCS.2020.06.026},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoLPP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/access/KishiKICO19,
author = {Yuto Kishi and
Nattapong Kitsuwan and
Hiro Ito and
Bijoy Chand Chatterjee and
Eiji Oki},
title = {Modulation-Adaptive Link-Disjoint Path Selection Model for 1 + 1 Protected
Elastic Optical Networks},
journal = {{IEEE} Access},
volume = {7},
pages = {25422--25437},
year = {2019},
url = {https://doi.org/10.1109/ACCESS.2019.2901018},
doi = {10.1109/ACCESS.2019.2901018},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/access/KishiKICO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/ItoNP19,
author = {Hiro Ito and
Atsuki Nagao and
Teagun Park},
title = {Generalized Shogi, Chess, and Xiangqi are Constant-Time Testable},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {102-A},
number = {9},
pages = {1126--1133},
year = {2019},
url = {https://doi.org/10.1587/transfun.E102.A.1126},
doi = {10.1587/TRANSFUN.E102.A.1126},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/ItoNP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/information/Andro-VaskoBI19,
author = {James Andro{-}Vasko and
Wolfgang W. Bein and
Hiro Ito},
title = {Energy Efficiency and Renewable Energy Management with Multi-State
Power-Down Systems},
journal = {Inf.},
volume = {10},
number = {2},
pages = {44},
year = {2019},
url = {https://doi.org/10.3390/info10020044},
doi = {10.3390/INFO10020044},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/information/Andro-VaskoBI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rss/KatohHIKKSSTU19,
author = {Naoki Katoh and
Yuya Higashikawa and
Hiro Ito and
Shun Kataoka and
Takuya Kida and
Toshiki Saitoh and
Tetsuo Shibuya and
Kazuyuki Tanaka and
Yushi Uno},
title = {Preface for the Special Issue on the Project "Foundation of Innovative
Algorithms for Big Data"},
journal = {Rev. Socionetwork Strateg.},
volume = {13},
number = {2},
pages = {99--100},
year = {2019},
url = {https://doi.org/10.1007/s12626-019-00058-w},
doi = {10.1007/S12626-019-00058-W},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rss/KatohHIKKSSTU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rss/Ito19,
author = {Hiro Ito},
title = {What Graph Properties Are Constant-Time Testable?},
journal = {Rev. Socionetwork Strateg.},
volume = {13},
number = {2},
pages = {101--121},
year = {2019},
url = {https://doi.org/10.1007/s12626-019-00054-0},
doi = {10.1007/S12626-019-00054-0},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rss/Ito19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rss/HondaIISTU19,
author = {Yutaro Honda and
Yoshitaka Inoue and
Hiro Ito and
Munehiko Sasajima and
Junichi Teruyama and
Yushi Uno},
title = {Hyperfiniteness of Real-World Networks},
journal = {Rev. Socionetwork Strateg.},
volume = {13},
number = {2},
pages = {123--141},
year = {2019},
url = {https://doi.org/10.1007/s12626-019-00051-3},
doi = {10.1007/S12626-019-00051-3},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rss/HondaIISTU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-09984,
author = {Hiro Ito and
Areej Khoury and
Ilan Newman},
title = {On the Characterization of 1-sided error Strongly-Testable Graph Properties
for bounded-degree graphs, including an appendix},
journal = {CoRR},
volume = {abs/1909.09984},
year = {2019},
url = {http://arxiv.org/abs/1909.09984},
eprinttype = {arXiv},
eprint = {1909.09984},
timestamp = {Fri, 27 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-09984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AbelDDISU18,
author = {Zachary Abel and
Erik D. Demaine and
Martin L. Demaine and
Hiro Ito and
Jack Snoeyink and
Ryuhei Uehara},
title = {Bumpy pyramid folding},
journal = {Comput. Geom.},
volume = {75},
pages = {22--31},
year = {2018},
url = {https://doi.org/10.1016/j.comgeo.2018.06.007},
doi = {10.1016/J.COMGEO.2018.06.007},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/AbelDDISU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fun/2018,
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-067-5},
isbn = {978-3-95977-067-5},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fun/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-07540,
author = {Erik D. Demaine and
Hiro Ito and
Stefan Langerman and
Jayson Lynch and
Mikhail Rudoy and
Kai Xiao},
title = {Cookie Clicker},
journal = {CoRR},
volume = {abs/1808.07540},
year = {2018},
url = {http://arxiv.org/abs/1808.07540},
eprinttype = {arXiv},
eprint = {1808.07540},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-07540.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/Ito17,
author = {Hiro Ito},
title = {Editor's Message for Special Issue of Discrete and Computational Geometry,
Graphs, and Games},
journal = {J. Inf. Process.},
volume = {25},
pages = {514},
year = {2017},
url = {https://doi.org/10.2197/ipsjjip.25.514},
doi = {10.2197/IPSJJIP.25.514},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/Ito17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/AbelBDD0HIKLU17,
author = {Zachary Abel and
Brad Ballinger and
Erik D. Demaine and
Martin L. Demaine and
Jeff Erickson and
Adam Hesterberg and
Hiro Ito and
Irina Kostitsyna and
Jayson Lynch and
Ryuhei Uehara},
title = {Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly
Covered Squares},
journal = {J. Inf. Process.},
volume = {25},
pages = {610--615},
year = {2017},
url = {https://doi.org/10.2197/ipsjjip.25.610},
doi = {10.2197/IPSJJIP.25.610},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/AbelBDD0HIKLU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/BeregI17,
author = {Sergey Bereg and
Hiro Ito},
title = {Transforming Graphs with the Same Graphic Sequence},
journal = {J. Inf. Process.},
volume = {25},
pages = {627--633},
year = {2017},
url = {https://doi.org/10.2197/ipsjjip.25.627},
doi = {10.2197/IPSJJIP.25.627},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/BeregI17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/TomitaMNIW17,
author = {Etsuji Tomita and
Sora Matsuzaki and
Atsuki Nagao and
Hiro Ito and
Mitsuo Wakatsuki},
title = {A Much Faster Algorithm for Finding a Maximum Clique with Computational
Experiments},
journal = {J. Inf. Process.},
volume = {25},
pages = {667--677},
year = {2017},
url = {https://doi.org/10.2197/ipsjjip.25.667},
doi = {10.2197/IPSJJIP.25.667},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jip/TomitaMNIW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06063,
author = {Jean Cardinal and
Hiro Ito and
Matias Korman and
Stefan Langerman},
title = {Helly Numbers of Polyominoes},
journal = {CoRR},
volume = {abs/1708.06063},
year = {2017},
url = {http://arxiv.org/abs/1708.06063},
eprinttype = {arXiv},
eprint = {1708.06063},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06063.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DemaineEHILUU16,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Hiro Ito and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
title = {Folding a paper strip to minimize thickness},
journal = {J. Discrete Algorithms},
volume = {36},
pages = {18--26},
year = {2016},
url = {https://doi.org/10.1016/j.jda.2015.09.003},
doi = {10.1016/J.JDA.2015.09.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DemaineEHILUU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Ito16,
author = {Hiro Ito},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Every Property Is Testable on a Natural Class of Scale-Free Multigraphs},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {51:1--51:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.51},
doi = {10.4230/LIPICS.ESA.2016.51},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/Ito16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/TomitaYHNIW16,
author = {Etsuji Tomita and
Kohei Yoshida and
Takuro Hatta and
Atsuki Nagao and
Hiro Ito and
Mitsuo Wakatsuki},
editor = {Daming Zhu and
Sergey Bereg},
title = {A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique},
booktitle = {Frontiers in Algorithmics, 10th International Workshop, {FAW} 2016,
Qingdao, China, June 30- July 2, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9711},
pages = {215--226},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-39817-4\_21},
doi = {10.1007/978-3-319-39817-4\_21},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/TomitaYHNIW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ItoU16,
author = {Hiro Ito and
Takahiro Ueda},
editor = {Erik D. Demaine and
Fabrizio Grandoni},
title = {How to Solve the Cake-Cutting Problem in Sublinear Time},
booktitle = {8th International Conference on Fun with Algorithms, {FUN} 2016, June
8-10, 2016, La Maddalena, Italy},
series = {LIPIcs},
volume = {49},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FUN.2016.21},
doi = {10.4230/LIPICS.FUN.2016.21},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fun/ItoU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/jcdcg/2015,
editor = {Jin Akiyama and
Hiro Ito and
Toshinori Sakai and
Yushi Uno},
title = {Discrete and Computational Geometry and Graphs - 18th Japan Conference,
{JCDCGG} 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9943},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48532-4},
doi = {10.1007/978-3-319-48532-4},
isbn = {978-3-319-48531-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BurkeDGHHHIKLLS16,
author = {Kyle Burke and
Erik D. Demaine and
Harrison Gregg and
Robert A. Hearn and
Adam Hesterberg and
Michael Hoffmann and
Hiro Ito and
Irina Kostitsyna and
Jody Leonard and
Maarten L{\"{o}}ffler and
Aaron Santiago and
Christiane Schmidt and
Ryuhei Uehara and
Yushi Uno and
Aaron Williams},
title = {Single-Player and Two-Player Buttons {\&} Scissors Games},
journal = {CoRR},
volume = {abs/1607.01826},
year = {2016},
url = {http://arxiv.org/abs/1607.01826},
eprinttype = {arXiv},
eprint = {1607.01826},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BurkeDGHHHIKLLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YoshidaI15,
author = {Yuichi Yoshida and
Hiro Ito},
title = {Testing Outerplanarity of Bounded Degree Graphs},
journal = {Algorithmica},
volume = {73},
number = {1},
pages = {1--20},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9897-1},
doi = {10.1007/S00453-014-9897-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/YoshidaI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/Ito15a,
author = {Hiro Ito},
title = {Editor's Message for Special Issue on Recreational Discrete Mathematics},
journal = {J. Inf. Process.},
volume = {23},
number = {3},
pages = {238},
year = {2015},
url = {https://doi.org/10.2197/ipsjjip.23.238},
doi = {10.2197/IPSJJIP.23.238},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/Ito15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/CardinalCIKLST15,
author = {Jean Cardinal and
S{\'{e}}bastien Collette and
Hiro Ito and
Matias Korman and
Stefan Langerman and
Hikaru Sakaidani and
Perouz Taslakian},
title = {Cannibal Animal Games: a new variant of Tic-Tac-Toe},
journal = {J. Inf. Process.},
volume = {23},
number = {3},
pages = {265--271},
year = {2015},
url = {https://doi.org/10.2197/ipsjjip.23.265},
doi = {10.2197/IPSJJIP.23.265},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/CardinalCIKLST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ItoLY15,
author = {Hiro Ito and
Stefan Langerman and
Yuichi Yoshida},
title = {Generalized River Crossing Problems},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {418--435},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9562-8},
doi = {10.1007/S00224-014-9562-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ItoLY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/itng/Andro-VaskoBNI15,
author = {James Andro{-}Vasko and
Wolfgang Bein and
Dara Nyknahad and
Hiro Ito},
editor = {Shahram Latifi},
title = {Evaluation of Online Power-Down Algorithms},
booktitle = {12th International Conference on Information Technology - New Generations,
{ITNG} 2015, Las Vegas, NV, USA, April 13-15, 2015},
pages = {473--478},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/ITNG.2015.82},
doi = {10.1109/ITNG.2015.82},
timestamp = {Sun, 26 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/itng/Andro-VaskoBNI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/BurkeDGHHHIKLLS15,
author = {Kyle Burke and
Erik D. Demaine and
Harrison Gregg and
Robert A. Hearn and
Adam Hesterberg and
Michael Hoffmann and
Hiro Ito and
Irina Kostitsyna and
Jody Leonard and
Maarten L{\"{o}}ffler and
Aaron Santiago and
Christiane Schmidt and
Ryuhei Uehara and
Yushi Uno and
Aaron Williams},
editor = {Jin Akiyama and
Hiro Ito and
Toshinori Sakai and
Yushi Uno},
title = {Single-Player and Two-Player Buttons {\&} Scissors Games - (Extended
Abstract)},
booktitle = {Discrete and Computational Geometry and Graphs - 18th Japan Conference,
{JCDCGG} 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9943},
pages = {60--72},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-48532-4\_6},
doi = {10.1007/978-3-319-48532-4\_6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/BurkeDGHHHIKLLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/ItoS15,
author = {Hiro Ito and
Yoshinao Shiono},
editor = {Jin Akiyama and
Hiro Ito and
Toshinori Sakai and
Yushi Uno},
title = {Number of Ties and Undefeated Signs in a Generalized Janken},
booktitle = {Discrete and Computational Geometry and Graphs - 18th Japan Conference,
{JCDCGG} 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9943},
pages = {143--154},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-48532-4\_13},
doi = {10.1007/978-3-319-48532-4\_13},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/ItoS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/DemaineEHILUU15,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Hiro Ito and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
editor = {M. Sohel Rahman and
Etsuji Tomita},
title = {Folding a Paper Strip to Minimize Thickness},
booktitle = {{WALCOM:} Algorithms and Computation - 9th International Workshop,
{WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8973},
pages = {113--124},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15612-5\_11},
doi = {10.1007/978-3-319-15612-5\_11},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/DemaineEHILUU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Ito15,
author = {Hiro Ito},
title = {Every property is testable on a natural class of scale-free multigraphs},
journal = {CoRR},
volume = {abs/1504.00766},
year = {2015},
url = {http://arxiv.org/abs/1504.00766},
eprinttype = {arXiv},
eprint = {1504.00766},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Ito15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ItoU15,
author = {Hiro Ito and
Takahiro Ueda},
title = {How to solve the cake-cutting problem in sublinear time},
journal = {CoRR},
volume = {abs/1504.00774},
year = {2015},
url = {http://arxiv.org/abs/1504.00774},
eprinttype = {arXiv},
eprint = {1504.00774},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ItoU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AbelDDISU14,
author = {Zachary Abel and
Erik D. Demaine and
Martin L. Demaine and
Hiro Ito and
Jack Snoeyink and
Ryuhei Uehara},
title = {Bumpy Pyramid Folding},
booktitle = {Proceedings of the 26th Canadian Conference on Computational Geometry,
{CCCG} 2014, Halifax, Nova Scotia, Canada, 2014},
publisher = {Carleton University, Ottawa, Canada},
year = {2014},
url = {http://www.cccg.ca/proceedings/2014/papers/paper38.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/AbelDDISU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/jcdcg/2013,
editor = {Jin Akiyama and
Hiro Ito and
Toshinori Sakai},
title = {Discrete and Computational Geometry and Graphs - 16th Japanese Conference,
{JCDCGG} 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8845},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13287-7},
doi = {10.1007/978-3-319-13287-7},
isbn = {978-3-319-13286-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DemaineEHILUU14,
author = {Erik D. Demaine and
David Eppstein and
Adam Hesterberg and
Hiro Ito and
Anna Lubiw and
Ryuhei Uehara and
Yushi Uno},
title = {Folding a Paper Strip to Minimize Thickness},
journal = {CoRR},
volume = {abs/1411.6371},
year = {2014},
url = {http://arxiv.org/abs/1411.6371},
eprinttype = {arXiv},
eprint = {1411.6371},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DemaineEHILUU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CardinalIKL13,
author = {Jean Cardinal and
Hiro Ito and
Matias Korman and
Stefan Langerman},
title = {Helly Numbers of Polyominoes},
journal = {Graphs Comb.},
volume = {29},
number = {5},
pages = {1221--1234},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1203-x},
doi = {10.1007/S00373-012-1203-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CardinalIKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijnc/KusumotoYI13,
author = {Mitsuru Kusumoto and
Yuichi Yoshida and
Hiro Ito},
title = {Constant-Time Approximation Algorithms for the Optimum Branching Problem
on Sparse Graphs},
journal = {Int. J. Netw. Comput.},
volume = {3},
number = {2},
pages = {205--216},
year = {2013},
url = {http://www.ijnc.org/index.php/ijnc/article/view/63},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijnc/KusumotoYI13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nc/FazekasIOST13,
author = {Szil{\'{a}}rd Zsolt Fazekas and
Hiro Ito and
Yasushi Okuno and
Shinnosuke Seki and
Kei Taneishi},
title = {On computational complexity of graph inference from counting},
journal = {Nat. Comput.},
volume = {12},
number = {4},
pages = {589--603},
year = {2013},
url = {https://doi.org/10.1007/s11047-012-9349-2},
doi = {10.1007/S11047-012-9349-2},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nc/FazekasIOST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/UmesatoSUIO13,
author = {Takuya Umesato and
Toshiki Saitoh and
Ryuhei Uehara and
Hiro Ito and
Yoshio Okamoto},
title = {The complexity of the stamp folding problem},
journal = {Theor. Comput. Sci.},
volume = {497},
pages = {13--19},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.08.006},
doi = {10.1016/J.TCS.2012.08.006},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/UmesatoSUIO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CardinalCIKLST13,
author = {Jean Cardinal and
S{\'{e}}bastien Collette and
Hiro Ito and
Matias Korman and
Stefan Langerman and
Hikaru Sakaidani and
Perouz Taslakian},
title = {Cannibal Animal Games: a new variant of Tic-Tac-Toe},
journal = {CoRR},
volume = {abs/1306.4884},
year = {2013},
url = {http://arxiv.org/abs/1306.4884},
eprinttype = {arXiv},
eprint = {1306.4884},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CardinalCIKLST13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YoshidaI12,
author = {Yuichi Yoshida and
Hiro Ito},
title = {Property Testing on k-Vertex-Connectivity of Graphs},
journal = {Algorithmica},
volume = {62},
number = {3-4},
pages = {701--712},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9477-y},
doi = {10.1007/S00453-010-9477-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/YoshidaI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/YoshidaYI12,
author = {Yuichi Yoshida and
Masaki Yamamoto and
Hiro Ito},
title = {Improved Constant-Time Approximation Algorithms for Maximum Matchings
and Other Optimization Problems},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {4},
pages = {1074--1093},
year = {2012},
url = {https://doi.org/10.1137/110828691},
doi = {10.1137/110828691},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/YoshidaYI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ItoLY12,
author = {Hiro Ito and
Stefan Langerman and
Yuichi Yoshida},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Algorithms and Complexity of Generalized River Crossing Problems},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {235--244},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_24},
doi = {10.1007/978-3-642-30347-0\_24},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/ItoLY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ic-nc/KusumotoYI12,
author = {Mitsuru Kusumoto and
Yuichi Yoshida and
Hiro Ito},
title = {Constant-Time Approximation Algorithms for the Optimum Branching Problem
on Sparse Graphs},
booktitle = {Third International Conference on Networking and Computing, {ICNC}
2012, Okinawa, Japan, December 5-7, 2012},
pages = {407--413},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/ICNC.2012.78},
doi = {10.1109/ICNC.2012.78},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ic-nc/KusumotoYI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ItoTY12,
author = {Hiro Ito and
Shin{-}ichi Tanigawa and
Yuichi Yoshida},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Constant-Time Algorithms for Sparsity Matroids},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {498--509},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_42},
doi = {10.1007/978-3-642-31594-7\_42},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ItoTY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ItoKY12,
author = {Hiro Ito and
Susumu Kiyoshima and
Yuichi Yoshida},
editor = {Manindra Agrawal and
S. Barry Cooper and
Angsheng Li},
title = {Constant-Time Approximation Algorithms for the Knapsack Problem},
booktitle = {Theory and Applications of Models of Computation - 9th Annual Conference,
{TAMC} 2012, Beijing, China, May 16-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7287},
pages = {131--142},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29952-0\_17},
doi = {10.1007/978-3-642-29952-0\_17},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/ItoKY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tjjccgg/Ito12,
author = {Hiro Ito},
editor = {Jin Akiyama and
Mikio Kano and
Toshinori Sakai},
title = {How to Generalize Janken - Rock-Paper-Scissors-King-Flea},
booktitle = {Computational Geometry and Graphs - Thailand-Japan Joint Conference,
{TJJCCGG} 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8296},
pages = {85--94},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-45281-9\_8},
doi = {10.1007/978-3-642-45281-9\_8},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/tjjccgg/Ito12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Ito11,
author = {Hiro Ito},
title = {Preface},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {305--306},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1013-6},
doi = {10.1007/S00373-011-1013-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Ito11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AkiyamaIKN11,
author = {Jin Akiyama and
Hiro Ito and
Midori Kobayashi and
Gisaku Nakamura},
title = {Arrangements of \emph{n} Points whose Incident-Line-Numbers are at
most \emph{n}/2},
journal = {Graphs Comb.},
volume = {27},
number = {3},
pages = {321--326},
year = {2011},
url = {https://doi.org/10.1007/s00373-011-1023-4},
doi = {10.1007/S00373-011-1023-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AkiyamaIKN11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/CardinalIKL11,
author = {Jean Cardinal and
Hiro Ito and
Matias Korman and
Stefan Langerman},
title = {Helly Numbers of Polyominoes},
booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational
Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
year = {2011},
url = {http://www.cccg.ca/proceedings/2011/papers/paper104.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/CardinalIKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/UmesatoSUI11,
author = {Takuya Umesato and
Toshiki Saitoh and
Ryuhei Uehara and
Hiro Ito},
editor = {Weifan Wang and
Xuding Zhu and
Ding{-}Zhu Du},
title = {Complexity of the Stamp Folding Problem},
booktitle = {Combinatorial Optimization and Applications - 5th International Conference,
{COCOA} 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6831},
pages = {311--321},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22616-8\_25},
doi = {10.1007/978-3-642-22616-8\_25},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoa/UmesatoSUI11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BeinHHIKK11,
author = {Wolfgang W. Bein and
Naoki Hatta and
Nelson Hernandez{-}Cons and
Hiro Ito and
Shoji Kasahara and
Jun Kawahara},
editor = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {An Online Algorithm Optimally Self-tuning to Congestion for Power
Management Problems},
booktitle = {Approximation and Online Algorithms - 9th International Workshop,
{WAOA} 2011, Saarbr{\"{u}}cken, Germany, September 8-9, 2011,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7164},
pages = {35--48},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-29116-6\_4},
doi = {10.1007/978-3-642-29116-6\_4},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BeinHHIKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-2581,
author = {Hiro Ito and
Shin{-}ichi Tanigawa and
Yuichi Yoshida},
title = {Constant-Time Algorithms for Sparsity Matroids},
journal = {CoRR},
volume = {abs/1103.2581},
year = {2011},
url = {http://arxiv.org/abs/1103.2581},
eprinttype = {arXiv},
eprint = {1103.2581},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-2581.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/YoshidaI10,
author = {Yuichi Yoshida and
Hiro Ito},
title = {Query-Number Preserving Reductions and Linear Lower Bounds for Testing},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {93-D},
number = {2},
pages = {233--240},
year = {2010},
url = {https://doi.org/10.1587/transinf.E93.D.233},
doi = {10.1587/TRANSINF.E93.D.233},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/YoshidaI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jossac/YoshidaI10,
author = {Yuichi Yoshida and
Hiro Ito},
title = {Testing \emph{k}-edge-connectivity of digraphs},
journal = {J. Syst. Sci. Complex.},
volume = {23},
number = {1},
pages = {91--101},
year = {2010},
url = {https://doi.org/10.1007/s11424-010-9280-5},
doi = {10.1007/S11424-010-9280-5},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jossac/YoshidaI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/YoshidaI10,
author = {Yuichi Yoshida and
Hiro Ito},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Testing Outerplanarity of Bounded Degree Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {642--655},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_48},
doi = {10.1007/978-3-642-15369-3\_48},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/YoshidaI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cgga/DemaineDHILMS10,
author = {Erik D. Demaine and
Martin L. Demaine and
Andrea Hawksley and
Hiro Ito and
Po{-}Ru Loh and
Shelly Manber and
Omari Stephens},
editor = {Jin Akiyama and
Bo Jiang and
Mikio Kano and
Xuehou Tan},
title = {Making Polygons by Simple Folds and One Straight Cut},
booktitle = {Computational Geometry, Graphs and Applications - 9th International
Conference, {CGGA} 2010, Dalian, China, November 3-6, 2010, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7033},
pages = {27--43},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-24983-9\_4},
doi = {10.1007/978-3-642-24983-9\_4},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/cgga/DemaineDHILMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/ItoPS09,
author = {Hiro Ito and
Mike Paterson and
Kenya Sugihara},
title = {The Multi-Commodity Source Location Problems and the Price of Greed},
journal = {J. Graph Algorithms Appl.},
volume = {13},
number = {1},
pages = {55--73},
year = {2009},
url = {https://doi.org/10.7155/jgaa.00176},
doi = {10.7155/JGAA.00176},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/ItoPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/SugiharaI09,
author = {Kenya Sugihara and
Hiro Ito},
title = {Maximum-cover source location problems with objective edge-connectivity
three},
journal = {Math. Methods Oper. Res.},
volume = {70},
number = {1},
pages = {183--193},
year = {2009},
url = {https://doi.org/10.1007/s00186-008-0266-1},
doi = {10.1007/S00186-008-0266-1},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/SugiharaI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ItoI09,
author = {Hiro Ito and
Kazuo Iwama},
title = {Enumeration of isolated cliques and pseudo-cliques},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {4},
pages = {40:1--40:21},
year = {2009},
url = {https://doi.org/10.1145/1597036.1597044},
doi = {10.1145/1597036.1597044},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ItoI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/YoshidaYI09,
author = {Yuichi Yoshida and
Masaki Yamamoto and
Hiro Ito},
editor = {Michael Mitzenmacher},
title = {An improved constant-time approximation algorithm for maximum matchings},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {225--234},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536447},
doi = {10.1145/1536414.1536447},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/YoshidaYI09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/TamuraI08,
author = {Takeyuki Tamura and
Hiro Ito},
title = {Inferring Pedigree Graphs from Genetic Distances},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {91-D},
number = {2},
pages = {162--169},
year = {2008},
url = {https://doi.org/10.1093/ietisy/e91-d.2.162},
doi = {10.1093/IETISY/E91-D.2.162},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/TamuraI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/YoshidaI08,
author = {Yuichi Yoshida and
Hiro Ito},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Property Testing on k-Vertex-Connectivity of Graphs},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {539--550},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_44},
doi = {10.1007/978-3-540-70575-8\_44},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/YoshidaI08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/ItoPS08,
author = {Hiro Ito and
Mike Paterson and
Kenya Sugihara},
editor = {Shin{-}Ichi Nakano and
Md. Saidur Rahman},
title = {Multi-commodity Source Location Problems and Price of Greed},
booktitle = {{WALCOM:} Algorithms and Computation, Second International Workshop,
{WALCOM} 2008, Dhaka, Bangladesh, February 7-8, 2008},
series = {Lecture Notes in Computer Science},
volume = {4921},
pages = {169--179},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-77891-2\_16},
doi = {10.1007/978-3-540-77891-2\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/ItoPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/jcdcg/2007,
editor = {Hiro Ito and
Mikio Kano and
Naoki Katoh and
Yushi Uno},
title = {Computational Geometry and Graph Theory - International Conference,
KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4535},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-89550-3},
doi = {10.1007/978-3-540-89550-3},
isbn = {978-3-540-89549-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ItoKN07,
author = {Hiro Ito and
Midori Kobayashi and
Gisaku Nakamura},
title = {Semi-Distance Codes and Steiner Systems},
journal = {Graphs Comb.},
volume = {23},
number = {Supplement-1},
pages = {283--290},
year = {2007},
url = {https://doi.org/10.1007/s00373-007-0718-z},
doi = {10.1007/S00373-007-0718-Z},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ItoKN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ItoNT07,
author = {Hiro Ito and
Gisaku Nakamura and
Satoshi Takata},
title = {Winning Ways of Weighted Poset Games},
journal = {Graphs Comb.},
volume = {23},
number = {Supplement-1},
pages = {291--306},
year = {2007},
url = {https://doi.org/10.1007/s00373-007-0710-7},
doi = {10.1007/S00373-007-0710-7},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ItoNT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/BeregI07,
author = {Sergey Bereg and
Hiro Ito},
editor = {Hiro Ito and
Mikio Kano and
Naoki Katoh and
Yushi Uno},
title = {Transforming Graphs with the Same Degree Sequence},
booktitle = {Computational Geometry and Graph Theory - International Conference,
KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4535},
pages = {25--32},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-89550-3\_3},
doi = {10.1007/978-3-540-89550-3\_3},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/BeregI07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KatohI06,
author = {Naoki Katoh and
Hiro Ito},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {154},
number = {16},
pages = {2239--2240},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2006.04.027},
doi = {10.1016/J.DAM.2006.04.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KatohI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ItoN06,
author = {Hiro Ito and
Hiroshi Nagamochi},
title = {Two equivalent measures on weighted hypergraphs},
journal = {Discret. Appl. Math.},
volume = {154},
number = {16},
pages = {2330--2334},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2006.04.013},
doi = {10.1016/J.DAM.2006.04.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ItoN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/SugiharaI06,
author = {Kenya Sugihara and
Hiro Ito},
title = {Maximum-Cover Source-Location Problem with Objective Edge-Connectivity
Three},
journal = {Electron. Notes Discret. Math.},
volume = {25},
pages = {165--171},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.06.073},
doi = {10.1016/J.ENDM.2006.06.073},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/SugiharaI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/ItoIT06,
author = {Hiro Ito and
Kazuo Iwama and
Takeyuki Tamura},
title = {Efficient Methods for Determining {DNA} Probe Orders},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {89-A},
number = {5},
pages = {1292--1298},
year = {2006},
url = {https://doi.org/10.1093/ietfec/e89-a.5.1292},
doi = {10.1093/IETFEC/E89-A.5.1292},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/ItoIT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/SugiharaI06,
author = {Kenya Sugihara and
Hiro Ito},
title = {Maximum-Cover Source-Location Problems},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {89-A},
number = {5},
pages = {1370--1377},
year = {2006},
url = {https://doi.org/10.1093/ietfec/e89-a.5.1370},
doi = {10.1093/IETFEC/E89-A.5.1370},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/SugiharaI06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoIOY05,
author = {Hiro Ito and
Kazuo Iwama and
Yasuo Okabe and
Takuya Yoshihiro},
title = {Single backup table schemes for shortest-path routing},
journal = {Theor. Comput. Sci.},
volume = {333},
number = {3},
pages = {347--353},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.06.033},
doi = {10.1016/J.TCS.2004.06.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoIOY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cjcdgcgt/AkiyamaFIN05,
author = {Jin Akiyama and
Hiroshi Fukuda and
Hiro Ito and
Gisaku Nakamura},
editor = {Jin Akiyama and
William Y. C. Chen and
Mikio Kano and
Xueliang Li and
Qinglin Yu},
title = {Infinite Series of Generalized Gosper Space Filling Curves},
booktitle = {Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan
Conference, {CJCDGCGT} 2005, Tianjin, China, November 18-20, 2005,
Xi'an, China, November 22-24, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4381},
pages = {1--9},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-70666-3\_1},
doi = {10.1007/978-3-540-70666-3\_1},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/cjcdgcgt/AkiyamaFIN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cjcdgcgt/Ito05,
author = {Hiro Ito},
editor = {Jin Akiyama and
William Y. C. Chen and
Mikio Kano and
Xueliang Li and
Qinglin Yu},
title = {Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving
the Cut-Size Order},
booktitle = {Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan
Conference, {CJCDGCGT} 2005, Tianjin, China, November 18-20, 2005,
Xi'an, China, November 22-24, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4381},
pages = {59--69},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-70666-3\_7},
doi = {10.1007/978-3-540-70666-3\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cjcdgcgt/Ito05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ItoIO05,
author = {Hiro Ito and
Kazuo Iwama and
Tsuyoshi Osumi},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Linear-Time Enumeration of Isolated Cliques},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {119--130},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_13},
doi = {10.1007/11561071\_13},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/ItoIO05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/UejimaI04,
author = {Akihiro Uejima and
Hiro Ito},
title = {Subdivision of the hierarchy of H-colorable graph classes by circulant
graphs},
journal = {Electron. Notes Discret. Math.},
volume = {17},
pages = {269--274},
year = {2004},
url = {https://doi.org/10.1016/j.endm.2004.03.050},
doi = {10.1016/J.ENDM.2004.03.050},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/UejimaI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/UejimaI04,
author = {Akihiro Uejima and
Hiro Ito},
editor = {Leo Liberti and
Francesco Maffioli},
title = {Subdivision of the Hierarchy of H-colorable Graph Classes by Circulant
Graphs},
booktitle = {{CTW04} Workshop on Graphs and Combinatorial Optimization, Scientific
Program, Villa Vigoni, Menaggio (CO), Italy, 31st May to 2nd June
2004},
pages = {232--236},
year = {2004},
timestamp = {Tue, 09 Nov 2010 19:23:16 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/UejimaI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/ItoIT04,
author = {Hiro Ito and
Kazuo Iwama and
Takeyuki Tamura},
editor = {Jean{-}Jacques L{\'{e}}vy and
Ernst W. Mayr and
John C. Mitchell},
title = {Imperfectness of Data for STS-Based Physical Mapping},
booktitle = {Exploring New Frontiers of Theoretical Informatics, {IFIP} 18th World
Computer Congress, {TC1} 3rd International Conference on Theoretical
Computer Science (TCS2004), 22-27 August 2004, Toulouse, France},
series = {{IFIP}},
volume = {155},
pages = {279--292},
publisher = {Kluwer/Springer},
year = {2004},
url = {https://doi.org/10.1007/1-4020-8141-3\_23},
doi = {10.1007/1-4020-8141-3\_23},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/ItoIT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/Ito04,
author = {Hiro Ito},
editor = {Jin Akiyama and
Mikio Kano and
Xuehou Tan},
title = {Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn
on a Convex Polygon},
booktitle = {Discrete and Computational Geometry, Japanese Conference, {JCDCG}
2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3742},
pages = {123--130},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11589440\_13},
doi = {10.1007/11589440\_13},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/Ito04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Ito03,
author = {Hiro Ito},
title = {Sum of edge lengths of a multigraph drawn on a convex polygon},
journal = {Comput. Geom.},
volume = {24},
number = {1},
pages = {41--47},
year = {2003},
url = {https://doi.org/10.1016/S0925-7721(02)00048-2},
doi = {10.1016/S0925-7721(02)00048-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Ito03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieiceta/Ito03,
author = {Hiro Ito},
title = {Foreword},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {86-A},
number = {5},
pages = {977},
year = {2003},
url = {http://search.ieice.org/bin/summary.php?id=e86-a\_5\_977},
timestamp = {Tue, 08 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieiceta/Ito03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ItoIOY03,
author = {Hiro Ito and
Kazuo Iwama and
Yasuo Okabe and
Takuya Yoshihiro},
title = {Avoiding Routing Loops on the Internet},
journal = {Theory Comput. Syst.},
volume = {36},
number = {6},
pages = {597--609},
year = {2003},
url = {https://doi.org/10.1007/s00224-003-1119-1},
doi = {10.1007/S00224-003-1119-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ItoIOY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/ItoMAHIF03,
author = {Hiro Ito and
Kazuhisa Makino and
Kouji Arata and
Shoji Honami and
Yuichiro Itatsu and
Satoru Fujishige},
title = {Source location problem with flow requirements in directed networks},
journal = {Optim. Methods Softw.},
volume = {18},
number = {4},
pages = {427--435},
year = {2003},
url = {https://doi.org/10.1080/1055-6780309510593},
doi = {10.1080/1055-6780309510593},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/ItoMAHIF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ItoIOY03,
author = {Hiro Ito and
Kazuo Iwama and
Yasuo Okabe and
Takuya Yoshihiro},
editor = {Jop F. Sibeyn},
title = {Polynomial-Time Computable Backup Tables for Shortest-Path Routing},
booktitle = {{SIROCCO} 10: Proceedings of the 10th Internaltional Colloquium on
Structural Information Complexity, June 18-20, 2003, Ume{\aa} Sweden},
series = {Proceedings in Informatics},
volume = {17},
pages = {163--177},
publisher = {Carleton Scientific},
year = {2003},
timestamp = {Thu, 05 Feb 2004 10:15:25 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/ItoIOY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieiceta/UejimaI02,
author = {Akihiro Uejima and
Hiro Ito},
title = {On \emph{H}-Coloring Problems with \emph{H} Expressed by Complements
of Cycles, Bipartite Graphs, and Chordal Graphs},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {85-A},
number = {5},
pages = {1026--1030},
year = {2002},
url = {http://search.ieice.org/bin/summary.php?id=e85-a\_5\_1026},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieiceta/UejimaI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ItoIINUY02,
author = {Hiro Ito and
Motoyasu Ito and
Yuichiro Itatsu and
Kazuhiro Nakai and
Hideyuki Uehara and
Mitsuo Yokoyama},
title = {Source location problems considering vertex-connectivity and edge-connectivity
simultaneously},
journal = {Networks},
volume = {40},
number = {2},
pages = {63--70},
year = {2002},
url = {https://doi.org/10.1002/net.10034},
doi = {10.1002/NET.10034},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ItoIINUY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ItoNSF02,
author = {Hiro Ito and
Hiroshi Nagamochi and
Yosuke Sugiyama and
Masato Fujita},
editor = {Prosenjit Bose and
Pat Morin},
title = {File Transfer Tree Problems},
booktitle = {Algorithms and Computation, 13th International Symposium, {ISAAC}
2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {441--452},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36136-7\_39},
doi = {10.1007/3-540-36136-7\_39},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ItoNSF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/ItoN02,
author = {Hiro Ito and
Hiroshi Nagamochi},
editor = {Jin Akiyama and
Mikio Kano},
title = {Comparing Hypergraphs by Areas of Hyperedges Drawn on a Convex Polygon},
booktitle = {Discrete and Computational Geometry, Japanese Conference, {JCDCG}
2002, Tokyo, Japan, December 6-9, 2002, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2866},
pages = {176--181},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/978-3-540-44400-8\_18},
doi = {10.1007/978-3-540-44400-8\_18},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/ItoN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/ItoIOY02,
author = {Hiro Ito and
Kazuo Iwama and
Yasuo Okabe and
Takuya Yoshihiro},
editor = {Christos Kaklamanis and
Lefteris M. Kirousis},
title = {Avoiding Routing Loops on the Internet},
booktitle = {{SIROCCO} 9, Proceedings of the 9th International Colloquium on Structural
Information and Communication Complexity, Andros, Greece, June 10-12,
2002},
series = {Proceedings in Informatics},
volume = {13},
pages = {197--210},
publisher = {Carleton Scientific},
year = {2002},
timestamp = {Thu, 05 Feb 2004 10:15:20 +0100},
biburl = {https://dblp.org/rec/conf/sirocco/ItoIOY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HiroHM01,
author = {Hiro Ito and
Hideyuki Uehara and
Mitsuo Yokoyama},
title = {Lengths of tours and permutations on a vertex set of a convex polygon},
journal = {Discret. Appl. Math.},
volume = {115},
number = {1-3},
pages = {63--71},
year = {2001},
url = {https://doi.org/10.1016/S0166-218X(01)00215-3},
doi = {10.1016/S0166-218X(01)00215-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HiroHM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/NagamochiII01,
author = {Hiroshi Nagamochi and
Toshimasa Ishii and
Hiro Ito},
title = {Minimum cost source location problem with vertex-connectivity requirements
in digraphs},
journal = {Inf. Process. Lett.},
volume = {80},
number = {6},
pages = {287--293},
year = {2001},
url = {https://doi.org/10.1016/S0020-0190(01)00183-1},
doi = {10.1016/S0020-0190(01)00183-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/NagamochiII01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ItoIUYI00,
author = {Hiro Ito and
Yuichiro Itatsu and
Hideyuki Uehara and
Mitsuo Yokoyama and
Motoyasu Ito},
editor = {D. T. Lee and
Shang{-}Hua Teng},
title = {Location Problems Based on Node-Connectivity and Edge-Connectivity
between Nodes and Node-Subsets},
booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC}
2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1969},
pages = {338--349},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40996-3\_29},
doi = {10.1007/3-540-40996-3\_29},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ItoIUYI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/ItoUY00,
author = {Hiro Ito and
Hideyuki Uehara and
Mitsuo Yokoyama},
editor = {Jin Akiyama and
Mikio Kano and
Masatsugu Urabe},
title = {Sum of Edge Lengths of a Graph Drawn on a Convex Polygon},
booktitle = {Discrete and Computational Geometry, Japanese Conference, {JCDCG}
2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2098},
pages = {160--166},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-47738-1\_14},
doi = {10.1007/3-540-47738-1\_14},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/ItoUY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pimrc/UeharaFYI00,
author = {Hideyuki Uehara and
Masato Fujihara and
Mitsuo Yokoyama and
Hiro Ito},
title = {Slot assignment scheme for integrated voice and data traffic in reservation-type
packet radio networks},
booktitle = {The 11th {IEEE} International Symposium on Personal, Indoor and Mobile
Radio Communications, {PIMRC} 2000, London, UK, September 18-21, 2000},
pages = {222--226},
publisher = {{IEEE}},
year = {2000},
url = {https://doi.org/10.1109/PIMRC.2000.881422},
doi = {10.1109/PIMRC.2000.881422},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/pimrc/UeharaFYI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ItoY98,
author = {Hiro Ito and
Mitsuo Yokoyama},
title = {Linear Time Algorithms for Graph Search and Connectivity Determination
on Complement Graphs},
journal = {Inf. Process. Lett.},
volume = {66},
number = {4},
pages = {209--213},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00071-4},
doi = {10.1016/S0020-0190(98)00071-4},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/ItoY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/ItoY98,
author = {Hiro Ito and
Mitsuo Yokoyama},
title = {Edge connectivity between nodes and node-subsets},
journal = {Networks},
volume = {31},
number = {3},
pages = {157--163},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0037(199805)31:3\&\#60;157::AID-NET2\&\#62;3.0.CO;2-E},
doi = {10.1002/(SICI)1097-0037(199805)31:3\&\#60;157::AID-NET2\&\#62;3.0.CO;2-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/ItoY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AsanoIKS98,
author = {Tetsuo Asano and
Hiro Ito and
Souichi Kimura and
Shigeaki Shimazu},
editor = {Kyung{-}Yong Chwa and
Oscar H. Ibarra},
title = {Repairing Flaws in a Picture Based on a Geometric Representation of
a Digital Image},
booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
Taejon, Korea, December 14-16, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1533},
pages = {149--158},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49381-6\_17},
doi = {10.1007/3-540-49381-6\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AsanoIKS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/ItoUY98,
author = {Hiro Ito and
Hideyuki Uehara and
Mitsuo Yokoyama},
editor = {Jin Akiyama and
Mikio Kano and
Masatsugu Urabe},
title = {2-Dimension Ham Sandwich Theorem for Partitioning into Three Convex
Pieces},
booktitle = {Discrete and Computational Geometry, Japanese Conference, JCDCG'98,
Tokyo, Japan, December 9-12, 1998, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {1763},
pages = {129--157},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/978-3-540-46515-7\_11},
doi = {10.1007/978-3-540-46515-7\_11},
timestamp = {Sun, 02 Jun 2019 21:21:33 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/ItoUY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/ItoUY98a,
author = {Hiro Ito and
Hideyuki Uehara and
Mitsuo Yokoyama},
editor = {Jin Akiyama and
Mikio Kano and
Masatsugu Urabe},
title = {NP-Completeness of Stage Illumination Problems},
booktitle = {Discrete and Computational Geometry, Japanese Conference, JCDCG'98,
Tokyo, Japan, December 9-12, 1998, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {1763},
pages = {158--165},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/978-3-540-46515-7\_12},
doi = {10.1007/978-3-540-46515-7\_12},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/ItoUY98a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/camad/SatakeII94,
author = {Takashi Satake and
Hiro Ito and
Akiya Inoue},
title = {Network topology construction method and its support system},
booktitle = {Fifth {IEEE} International Workshop on Computer-Aided Modeling, Analysis,
and Design of Communication Links and Networks, {CAMAD} '94, Princeton,
NJ, USA, April 24-27, 1994},
publisher = {{IEEE}},
year = {1994},
url = {https://doi.org/10.1109/CAMAD.1994.765671},
doi = {10.1109/CAMAD.1994.765671},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/camad/SatakeII94.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:58 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:
