Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Yota Otachi
@article{DBLP:journals/algorithmica/GimaO24,
author = {Tatsuya Gima and
Yota Otachi},
title = {Extended {MSO} Model Checking via Small Vertex Integrity},
journal = {Algorithmica},
volume = {86},
number = {1},
pages = {147--170},
year = {2024},
url = {https://doi.org/10.1007/s00453-023-01161-9},
doi = {10.1007/S00453-023-01161-9},
timestamp = {Thu, 11 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GimaO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicetd/HanakaDKOO24,
author = {Tesshu Hanaka and
Nicol{\'{a}}s Honorato Droguett and
Kazuhiro Kurita and
Hirotaka Ono and
Yota Otachi},
title = {Collecting Balls on a Line by Robots with Limited Energy},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {107},
number = {3},
pages = {325--327},
year = {2024},
url = {https://doi.org/10.1587/transinf.2023fcl0003},
doi = {10.1587/TRANSINF.2023FCL0003},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicetd/HanakaDKOO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicetd/GimaHNOO24,
author = {Tatsuya Gima and
Tesshu Hanaka and
Kohei Noro and
Hirotaka Ono and
Yota Otachi},
title = {On a Spectral Lower Bound of Treewidth},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {107},
number = {3},
pages = {328--330},
year = {2024},
url = {https://doi.org/10.1587/transinf.2023fcl0002},
doi = {10.1587/TRANSINF.2023FCL0002},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicetd/GimaHNOO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KanzakiOVU24,
author = {Masaaki Kanzaki and
Yota Otachi and
Giovanni Viglietta and
Ryuhei Uehara},
title = {Computational complexity of jumping block puzzles},
journal = {Theor. Comput. Sci.},
volume = {983},
pages = {114292},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114292},
doi = {10.1016/J.TCS.2023.114292},
timestamp = {Sat, 13 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KanzakiOVU24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/CourtielDGLO24,
author = {Julien Courtiel and
Paul Dorbec and
Tatsuya Gima and
Romain Lecoq and
Yota Otachi},
editor = {Ryuhei Uehara and
Katsuhisa Yamanaka and
Hsu{-}Chun Yen},
title = {Orientable Burning Number of Graphs},
booktitle = {{WALCOM:} Algorithms and Computation - 18th International Conference
and Workshops on Algorithms and Computation, {WALCOM} 2024, Kanazawa,
Japan, March 18-20, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14549},
pages = {377--391},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-981-97-0566-5\_27},
doi = {10.1007/978-981-97-0566-5\_27},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/CourtielDGLO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/GimaKKOO24,
author = {Tatsuya Gima and
Soh Kumabe and
Kazuhiro Kurita and
Yuto Okada and
Yota Otachi},
editor = {Ryuhei Uehara and
Katsuhisa Yamanaka and
Hsu{-}Chun Yen},
title = {Dichotomies for Tree Minor Containment with Structural Parameters},
booktitle = {{WALCOM:} Algorithms and Computation - 18th International Conference
and Workshops on Algorithms and Computation, {WALCOM} 2024, Kanazawa,
Japan, March 18-20, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14549},
pages = {392--405},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-981-97-0566-5\_28},
doi = {10.1007/978-981-97-0566-5\_28},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/GimaKKOO24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/GimaHKM0O24,
author = {Tatsuya Gima and
Tesshu Hanaka and
Yasuaki Kobayashi and
Ryota Murai and
Hirotaka Ono and
Yota Otachi},
editor = {Ryuhei Uehara and
Katsuhisa Yamanaka and
Hsu{-}Chun Yen},
title = {Structural Parameterizations of Vertex Integrity},
booktitle = {{WALCOM:} Algorithms and Computation - 18th International Conference
and Workshops on Algorithms and Computation, {WALCOM} 2024, Kanazawa,
Japan, March 18-20, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14549},
pages = {406--420},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-981-97-0566-5\_29},
doi = {10.1007/978-981-97-0566-5\_29},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/GimaHKM0O24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/GimaHKOSST024,
author = {Tatsuya Gima and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yota Otachi and
Tomohito Shirai and
Akira Suzuki and
Yuma Tamura and
Xiao Zhou},
editor = {Ryuhei Uehara and
Katsuhisa Yamanaka and
Hsu{-}Chun Yen},
title = {On the Complexity of List H-Packing for Sparse Graph Classes},
booktitle = {{WALCOM:} Algorithms and Computation - 18th International Conference
and Workshops on Algorithms and Computation, {WALCOM} 2024, Kanazawa,
Japan, March 18-20, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14549},
pages = {421--435},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-981-97-0566-5\_30},
doi = {10.1007/978-981-97-0566-5\_30},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/GimaHKOSST024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ItoOO23,
author = {Takehiro Ito and
Hirotaka Ono and
Yota Otachi},
title = {Reconfiguration of cliques in a graph},
journal = {Discret. Appl. Math.},
volume = {333},
pages = {43--58},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.01.026},
doi = {10.1016/J.DAM.2023.01.026},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ItoOO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoIKNOW23,
author = {Takehiro Ito and
Yuni Iwamasa and
Yasuaki Kobayashi and
Yu Nakahata and
Yota Otachi and
Kunihiro Wasa},
title = {Reconfiguring (non-spanning) arborescences},
journal = {Theor. Comput. Sci.},
volume = {943},
pages = {131--141},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2022.12.007},
doi = {10.1016/J.TCS.2022.12.007},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ItoIKNOW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoKMOSSUUYY23,
author = {Takehiro Ito and
Jun Kawahara and
Shin{-}ichi Minato and
Yota Otachi and
Toshiki Saitoh and
Akira Suzuki and
Ryuhei Uehara and
Takeaki Uno and
Katsuhisa Yamanaka and
Ryo Yoshinaka},
title = {Sorting balls and water: Equivalence and computational complexity},
journal = {Theor. Comput. Sci.},
volume = {978},
pages = {114158},
year = {2023},
url = {https://doi.org/10.1016/j.tcs.2023.114158},
doi = {10.1016/J.TCS.2023.114158},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoKMOSSUUYY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HanakaK0KKO23,
author = {Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {A Framework to Design Approximation Algorithms for Finding Diverse
Solutions in Combinatorial Problems},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {3968--3976},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i4.25511},
doi = {10.1609/AAAI.V37I4.25511},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HanakaK0KKO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HanakaOOU23,
author = {Tesshu Hanaka and
Hirotaka Ono and
Yota Otachi and
Saeki Uda},
editor = {Marios Mavronicolas},
title = {Grouped Domination Parameterized by Vertex Cover, Twin Cover, and
Beyond},
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 = {263--277},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-30448-4\_19},
doi = {10.1007/978-3-031-30448-4\_19},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/HanakaOOU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KiyaOOO23,
author = {Hironori Kiya and
Yuto Okada and
Hirotaka Ono and
Yota Otachi},
editor = {Leszek Gasieniec},
title = {Sequentially Swapping Tokens: Further on Graph Classes},
booktitle = {{SOFSEM} 2023: Theory and Practice of Computer Science - 48th International
Conference on Current Trends in Theory and Practice of Computer Science,
{SOFSEM} 2023, Nov{\'{y}} Smokovec, Slovakia, January 15-18,
2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13878},
pages = {222--235},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-23101-8\_15},
doi = {10.1007/978-3-031-23101-8\_15},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/KiyaOOO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-06983,
author = {Tesshu Hanaka and
Hirotaka Ono and
Yota Otachi and
Saeki Uda},
title = {Grouped Domination Parameterized by Vertex Cover, Twin Cover, and
Beyond},
journal = {CoRR},
volume = {abs/2302.06983},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.06983},
doi = {10.48550/ARXIV.2302.06983},
eprinttype = {arXiv},
eprint = {2302.06983},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-06983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-07259,
author = {Hiroki Arimura and
Tatsuya Gima and
Yasuaki Kobayashi and
Hiroomi Nochide and
Yota Otachi},
title = {Minimum Consistent Subset for Trees Revisited},
journal = {CoRR},
volume = {abs/2305.07259},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.07259},
doi = {10.48550/ARXIV.2305.07259},
eprinttype = {arXiv},
eprint = {2305.07259},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-07259.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-01066,
author = {Yuuki Aoike and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yota Otachi},
title = {Finding a reconfiguration sequence between longest increasing subsequences},
journal = {CoRR},
volume = {abs/2310.01066},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.01066},
doi = {10.48550/ARXIV.2310.01066},
eprinttype = {arXiv},
eprint = {2310.01066},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-01066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-03225,
author = {Tatsuya Gima and
Soh Kumabe and
Kazuhiro Kurita and
Yuto Okada and
Yota Otachi},
title = {Dichotomies for Tree Minor Containment with Structural Parameters},
journal = {CoRR},
volume = {abs/2311.03225},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.03225},
doi = {10.48550/ARXIV.2311.03225},
eprinttype = {arXiv},
eprint = {2311.03225},
timestamp = {Wed, 08 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-03225.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-05892,
author = {Tatsuya Gima and
Tesshu Hanaka and
Yasuaki Kobayashi and
Ryota Murai and
Hirotaka Ono and
Yota Otachi},
title = {Structural Parameterizations of Vertex Integrity},
journal = {CoRR},
volume = {abs/2311.05892},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.05892},
doi = {10.48550/ARXIV.2311.05892},
eprinttype = {arXiv},
eprint = {2311.05892},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-05892.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-13132,
author = {Julien Courtiel and
Paul Dorbec and
Tatsuya Gima and
Romain Lecoq and
Yota Otachi},
title = {Orientable Burning Number of Graphs},
journal = {CoRR},
volume = {abs/2311.13132},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.13132},
doi = {10.48550/ARXIV.2311.13132},
eprinttype = {arXiv},
eprint = {2311.13132},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-13132.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-08639,
author = {Tatsuya Gima and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yota Otachi and
Tomohito Shirai and
Akira Suzuki and
Yuma Tamura and
Xiao Zhou},
title = {On the complexity of list H-packing for sparse graph classes},
journal = {CoRR},
volume = {abs/2312.08639},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.08639},
doi = {10.48550/ARXIV.2312.08639},
eprinttype = {arXiv},
eprint = {2312.08639},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-08639.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteHKKKKLO22,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Masaaki Kanzaki and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of (A, {\(\mathscr{l}\)} )-Path Packing},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {871--895},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00875-y},
doi = {10.1007/S00453-021-00875-Y},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteHKKKKLO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KobayashiOOU22,
author = {Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Yushi Uno},
title = {Linear-Time Recognition of Double-Threshold Graphs},
journal = {Algorithmica},
volume = {84},
number = {4},
pages = {1163--1181},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00921-9},
doi = {10.1007/S00453-021-00921-9},
timestamp = {Fri, 13 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KobayashiOOU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KobayashiO22,
author = {Yasuaki Kobayashi and
Yota Otachi},
title = {Parameterized Complexity of Graph Burning},
journal = {Algorithmica},
volume = {84},
number = {8},
pages = {2379--2393},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00962-8},
doi = {10.1007/S00453-022-00962-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KobayashiO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AoikeGHKKKKO22,
author = {Yuuki Aoike and
Tatsuya Gima and
Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
title = {An Improved Deterministic Parameterized Algorithm for Cactus Vertex
Deletion},
journal = {Theory Comput. Syst.},
volume = {66},
number = {2},
pages = {502--515},
year = {2022},
url = {https://doi.org/10.1007/s00224-022-10076-x},
doi = {10.1007/S00224-022-10076-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AoikeGHKKKKO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BelmonteKLMO22,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi},
title = {Grundy Distinguishes Treewidth from Pathwidth},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {1761--1787},
year = {2022},
url = {https://doi.org/10.1137/20m1385779},
doi = {10.1137/20M1385779},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BelmonteKLMO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GimaHKKO22,
author = {Tatsuya Gima and
Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yota Otachi},
title = {Exploring the gap between treedepth and vertex cover through vertex
integrity},
journal = {Theor. Comput. Sci.},
volume = {918},
pages = {60--76},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.03.021},
doi = {10.1016/J.TCS.2022.03.021},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GimaHKKO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HanakaKKLO22,
author = {Tesshu Hanaka and
Yasuaki Kobayashi and
Kazuhiro Kurita and
See Woo Lee and
Yota Otachi},
title = {Computing Diverse Shortest Paths Efficiently: {A} Theoretical and
Experimental Study},
booktitle = {Thirty-Sixth {AAAI} Conference on Artificial Intelligence, {AAAI}
2022, Thirty-Fourth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2022, The Twelveth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2022 Virtual Event, February 22
- March 1, 2022},
pages = {3758--3766},
publisher = {{AAAI} Press},
year = {2022},
url = {https://doi.org/10.1609/aaai.v36i4.20290},
doi = {10.1609/AAAI.V36I4.20290},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HanakaKKLO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GimaIKO22,
author = {Tatsuya Gima and
Takehiro Ito and
Yasuaki Kobayashi and
Yota Otachi},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {61:1--61:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.61},
doi = {10.4230/LIPICS.ESA.2022.61},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/GimaIKO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/ItoKMOSSUUYY22,
author = {Takehiro Ito and
Jun Kawahara and
Shin{-}ichi Minato and
Yota Otachi and
Toshiki Saitoh and
Akira Suzuki and
Ryuhei Uehara and
Takeaki Uno and
Katsuhisa Yamanaka and
Ryo Yoshinaka},
editor = {Pierre Fraigniaud and
Yushi Uno},
title = {Sorting Balls and Water: Equivalence and Computational Complexity},
booktitle = {11th International Conference on Fun with Algorithms, {FUN} 2022,
May 30 to June 3, 2022, Island of Favignana, Sicily, Italy},
series = {LIPIcs},
volume = {226},
pages = {16:1--16:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.FUN.2022.16},
doi = {10.4230/LIPICS.FUN.2022.16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fun/ItoKMOSSUUYY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GimaO22,
author = {Tatsuya Gima and
Yota Otachi},
editor = {Sang Won Bae and
Heejin Park},
title = {Extended {MSO} Model Checking via Small Vertex Integrity},
booktitle = {33rd International Symposium on Algorithms and Computation, {ISAAC}
2022, December 19-21, 2022, Seoul, Korea},
series = {LIPIcs},
volume = {248},
pages = {20:1--20:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.20},
doi = {10.4230/LIPICS.ISAAC.2022.20},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GimaO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AbhinavBBKNOS22,
author = {Ankit Abhinav and
Susobhan Bandopadhyay and
Aritra Banik and
Yasuaki Kobayashi and
Shunsuke Nagano and
Yota Otachi and
Saket Saurabh},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Parameterized Complexity of Non-Separating and Non-Disconnecting Paths
and Sets},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {6:1--6:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.6},
doi = {10.4230/LIPICS.MFCS.2022.6},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AbhinavBBKNOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ItoIKNOTW22,
author = {Takehiro Ito and
Yuni Iwamasa and
Yasuaki Kobayashi and
Yu Nakahata and
Yota Otachi and
Masahiro Takahashi and
Kunihiro Wasa},
editor = {Stefan Szeider and
Robert Ganian and
Alexandra Silva},
title = {Independent Set Reconfiguration on Directed Graphs},
booktitle = {47th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
series = {LIPIcs},
volume = {241},
pages = {58:1--58:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2022.58},
doi = {10.4230/LIPICS.MFCS.2022.58},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ItoIKNOTW22.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}
}
@article{DBLP:journals/corr/abs-2201-08940,
author = {Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
title = {A Framework to Design Approximation Algorithms for Finding Diverse
Solutions in Combinatorial Problems},
journal = {CoRR},
volume = {abs/2201.08940},
year = {2022},
url = {https://arxiv.org/abs/2201.08940},
eprinttype = {arXiv},
eprint = {2201.08940},
timestamp = {Wed, 02 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08940.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-08445,
author = {Tatsuya Gima and
Yota Otachi},
title = {Extended {MSO} Model Checking via Small Vertex Integrity},
journal = {CoRR},
volume = {abs/2202.08445},
year = {2022},
url = {https://arxiv.org/abs/2202.08445},
eprinttype = {arXiv},
eprint = {2202.08445},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-08445.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-09495,
author = {Takehiro Ito and
Jun Kawahara and
Shin{-}ichi Minato and
Yota Otachi and
Toshiki Saitoh and
Akira Suzuki and
Ryuhei Uehara and
Takeaki Uno and
Katsuhisa Yamanaka and
Ryo Yoshinaka},
title = {Sorting Balls and Water: Equivalence and Computational Complexity},
journal = {CoRR},
volume = {abs/2202.09495},
year = {2022},
url = {https://arxiv.org/abs/2202.09495},
eprinttype = {arXiv},
eprint = {2202.09495},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-09495.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-09718,
author = {Yasuaki Kobayashi and
Shunsuke Nagano and
Yota Otachi},
title = {Finding shortest non-separating and non-disconnecting paths},
journal = {CoRR},
volume = {abs/2202.09718},
year = {2022},
url = {https://arxiv.org/abs/2202.09718},
eprinttype = {arXiv},
eprint = {2202.09718},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-09718.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-13435,
author = {Takehiro Ito and
Yuni Iwamasa and
Yasuaki Kobayashi and
Yu Nakahata and
Yota Otachi and
Masahiro Takahashi and
Kunihiro Wasa},
title = {Independent set reconfiguration on directed graphs},
journal = {CoRR},
volume = {abs/2203.13435},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.13435},
doi = {10.48550/ARXIV.2203.13435},
eprinttype = {arXiv},
eprint = {2203.13435},
timestamp = {Tue, 29 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-13435.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-01024,
author = {Tatsuya Gima and
Takehiro Ito and
Yasuaki Kobayashi and
Yota Otachi},
title = {Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited},
journal = {CoRR},
volume = {abs/2207.01024},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.01024},
doi = {10.48550/ARXIV.2207.01024},
eprinttype = {arXiv},
eprint = {2207.01024},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-01024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-02835,
author = {Hironori Kiya and
Yuto Okada and
Hirotaka Ono and
Yota Otachi},
title = {Sequentially Swapping Tokens: Further on Graph Classes},
journal = {CoRR},
volume = {abs/2210.02835},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.02835},
doi = {10.48550/ARXIV.2210.02835},
eprinttype = {arXiv},
eprint = {2210.02835},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-02835.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JakovacO21,
author = {Marko Jakovac and
Yota Otachi},
title = {On the security number of the Cartesian product of graphs},
journal = {Discret. Appl. Math.},
volume = {304},
pages = {119--128},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2021.07.030},
doi = {10.1016/J.DAM.2021.07.030},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JakovacO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/KitamuraKOI21,
author = {Naoki Kitamura and
Hirotaka Kitagawa and
Yota Otachi and
Taisuke Izumi},
title = {Low-congestion shortcut and graph parameters},
journal = {Distributed Comput.},
volume = {34},
number = {5},
pages = {349--365},
year = {2021},
url = {https://doi.org/10.1007/s00446-021-00401-x},
doi = {10.1007/S00446-021-00401-X},
timestamp = {Tue, 05 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dc/KitamuraKOI21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KiyomiHO21,
author = {Masashi Kiyomi and
Takashi Horiyama and
Yota Otachi},
title = {Longest common subsequence in sublinear space},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106084},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2020.106084},
doi = {10.1016/J.IPL.2020.106084},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KiyomiHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BelmonteKLMOS21,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi and
Florian Sikora},
title = {Token Sliding on Split Graphs},
journal = {Theory Comput. Syst.},
volume = {65},
number = {4},
pages = {662--686},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-09967-8},
doi = {10.1007/S00224-020-09967-8},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BelmonteKLMOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/HanakaKKO21,
author = {Tesshu Hanaka and
Yasuaki Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
title = {Finding Diverse Trees, Paths, and More},
booktitle = {Thirty-Fifth {AAAI} Conference on Artificial Intelligence, {AAAI}
2021, Thirty-Third Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2021, The Eleventh Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2021, Virtual Event, February 2-9,
2021},
pages = {3778--3786},
publisher = {{AAAI} Press},
year = {2021},
url = {https://doi.org/10.1609/aaai.v35i5.16495},
doi = {10.1609/AAAI.V35I5.16495},
timestamp = {Mon, 04 Sep 2023 12:29:24 +0200},
biburl = {https://dblp.org/rec/conf/aaai/HanakaKKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GimaHKKO21,
author = {Tatsuya Gima and
Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yota Otachi},
editor = {Tiziana Calamoneri and
Federico Cor{\`{o}}},
title = {Exploring the Gap Between Treedepth and Vertex Cover Through Vertex
Integrity},
booktitle = {Algorithms and Complexity - 12th International Conference, {CIAC}
2021, Virtual Event, May 10-12, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {271--285},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-75242-2\_19},
doi = {10.1007/978-3-030-75242-2\_19},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GimaHKKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ItoIKNOW21,
author = {Takehiro Ito and
Yuni Iwamasa and
Yasuaki Kobayashi and
Yu Nakahata and
Yota Otachi and
Kunihiro Wasa},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Reconfiguring Directed Trees in a Digraph},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {343--354},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_29},
doi = {10.1007/978-3-030-89543-3\_29},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/ItoIKNOW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KanzakiOU21,
author = {Masaaki Kanzaki and
Yota Otachi and
Ryuhei Uehara},
editor = {Chi{-}Yeh Chen and
Wing{-}Kai Hon and
Ling{-}Ju Hung and
Chia{-}Wei Lee},
title = {Computational Complexity of Jumping Block Puzzles},
booktitle = {Computing and Combinatorics - 27th International Conference, {COCOON}
2021, Tainan, Taiwan, October 24-26, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13025},
pages = {655--667},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-89543-3\_54},
doi = {10.1007/978-3-030-89543-3\_54},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/KanzakiOU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/YamauchiKO21,
author = {Yukiko Yamauchi and
Naoyuki Kamiyama and
Yota Otachi},
editor = {Colette Johnen and
Elad Michael Schiller and
Stefan Schmid},
title = {Distributed Reconfiguration of Spanning Trees},
booktitle = {Stabilization, Safety, and Security of Distributed Systems - 23rd
International Symposium, {SSS} 2021, Virtual Event, November 17-20,
2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13046},
pages = {516--520},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-91081-5\_40},
doi = {10.1007/978-3-030-91081-5\_40},
timestamp = {Wed, 10 Nov 2021 16:15:58 +0100},
biburl = {https://dblp.org/rec/conf/sss/YamauchiKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-09414,
author = {Tatsuya Gima and
Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yota Otachi},
title = {Exploring the Gap Between Treedepth and Vertex Cover Through Vertex
Integrity},
journal = {CoRR},
volume = {abs/2101.09414},
year = {2021},
url = {https://arxiv.org/abs/2101.09414},
eprinttype = {arXiv},
eprint = {2101.09414},
timestamp = {Sat, 30 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-09414.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-03092,
author = {Takehiro Ito and
Yuni Iwamasa and
Yasuaki Kobayashi and
Yu Nakahata and
Yota Otachi and
Kunihiro Wasa},
title = {Reconfiguring Directed Trees in a Digraph},
journal = {CoRR},
volume = {abs/2107.03092},
year = {2021},
url = {https://arxiv.org/abs/2107.03092},
eprinttype = {arXiv},
eprint = {2107.03092},
timestamp = {Tue, 20 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-03092.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-02213,
author = {Masaaki Kanzaki and
Yota Otachi and
Ryuhei Uehara},
title = {Computational Complexity of Jumping Block Puzzles},
journal = {CoRR},
volume = {abs/2109.02213},
year = {2021},
url = {https://arxiv.org/abs/2109.02213},
eprinttype = {arXiv},
eprint = {2109.02213},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-02213.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}
}
@article{DBLP:journals/corr/abs-2112-05403,
author = {Tesshu Hanaka and
Yasuaki Kobayashi and
Kazuhiro Kurita and
See Woo Lee and
Yota Otachi},
title = {Computing Diverse Shortest Paths Efficiently: {A} Theoretical and
Experimental Study},
journal = {CoRR},
volume = {abs/2112.05403},
year = {2021},
url = {https://arxiv.org/abs/2112.05403},
eprinttype = {arXiv},
eprint = {2112.05403},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-05403.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HanakaKLOS20,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
title = {Parameterized Orientable Deletion},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {1909--1938},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00679-6},
doi = {10.1007/S00453-020-00679-6},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HanakaKLOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteHLOO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Independent Set Reconfiguration Parameterized by Modular-Width},
journal = {Algorithmica},
volume = {82},
number = {9},
pages = {2586--2605},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00700-y},
doi = {10.1007/S00453-020-00700-Y},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteHLOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHKKOO20,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3566--3587},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00737-z},
doi = {10.1007/S00453-020-00737-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHKKOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DemaineKKMORRUU20,
author = {Erik D. Demaine and
Matias Korman and
Jason S. Ku and
Joseph S. B. Mitchell and
Yota Otachi and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Ryuhei Uehara and
Yushi Uno},
title = {Symmetric assembly puzzles are hard, beyond a few pieces},
journal = {Comput. Geom.},
volume = {90},
pages = {101648},
year = {2020},
url = {https://doi.org/10.1016/j.comgeo.2020.101648},
doi = {10.1016/J.COMGEO.2020.101648},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DemaineKKMORRUU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelmonteHKLOO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of Safe Set},
journal = {J. Graph Algorithms Appl.},
volume = {24},
number = {3},
pages = {215--245},
year = {2020},
url = {https://doi.org/10.7155/jgaa.00528},
doi = {10.7155/JGAA.00528},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelmonteHKLOO20.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/mst/KiyomiOOST20,
author = {Masashi Kiyomi and
Hirotaka Ono and
Yota Otachi and
Pascal Schweitzer and
Jun Tarui},
title = {Space-Efficient Algorithms for Longest Increasing Subsequence},
journal = {Theory Comput. Syst.},
volume = {64},
number = {3},
pages = {522--541},
year = {2020},
url = {https://doi.org/10.1007/s00224-018-09908-6},
doi = {10.1007/S00224-018-09908-6},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/KiyomiOOST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ConteKOUW20,
author = {Alessio Conte and
Mamadou Moustapha Kant{\'{e}} and
Yota Otachi and
Takeaki Uno and
Kunihiro Wasa},
title = {Efficient enumeration of maximal \emph{k}-degenerate induced subgraphs
of a chordal graph},
journal = {Theor. Comput. Sci.},
volume = {818},
pages = {2--11},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2018.08.009},
doi = {10.1016/J.TCS.2018.08.009},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ConteKOUW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BodlaenderHJOOZ20,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Lars Jaffke and
Hirotaka Ono and
Yota Otachi and
Tom C. van der Zanden},
editor = {Amal El Fallah Seghrouchni and
Gita Sukthankar and
Bo An and
Neil Yorke{-}Smith},
title = {Hedonic Seat Arrangement Problems},
booktitle = {Proceedings of the 19th International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} '20, Auckland, New Zealand, May 9-13,
2020},
pages = {1777--1779},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2020},
url = {https://dl.acm.org/doi/10.5555/3398761.3398979},
doi = {10.5555/3398761.3398979},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BodlaenderHJOOZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Otachi20,
author = {Yota Otachi},
editor = {Fedor V. Fomin and
Stefan Kratsch and
Erik Jan van Leeuwen},
title = {A Survey on Spanning Tree Congestion},
booktitle = {Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender
on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {12160},
pages = {165--172},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-42071-0\_12},
doi = {10.1007/978-3-030-42071-0\_12},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Otachi20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Belmonte0LMO20,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Grundy Distinguishes Treewidth from Pathwidth},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {14:1--14:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.14},
doi = {10.4230/LIPICS.ESA.2020.14},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/Belmonte0LMO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/IzumiO20,
author = {Taisuke Izumi and
Yota Otachi},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth
Graphs and Planar Graphs},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {67:1--67:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.67},
doi = {10.4230/LIPICS.ICALP.2020.67},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/icalp/IzumiO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BelmonteHKK0KLO20,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Masaaki Kanzaki and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
editor = {Leszek Gasieniec and
Ralf Klasing and
Tomasz Radzik},
title = {Parameterized Complexity of (A, {\(\mathscr{l}\)} )-Path Packing},
booktitle = {Combinatorial Algorithms - 31st International Workshop, {IWOCA} 2020,
Bordeaux, France, June 8-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12126},
pages = {43--55},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48966-3\_4},
doi = {10.1007/978-3-030-48966-3\_4},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/BelmonteHKK0KLO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/KobayashiO20,
author = {Yasuaki Kobayashi and
Yota Otachi},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Parameterized Complexity of Graph Burning},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {21:1--21:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.21},
doi = {10.4230/LIPICS.IPEC.2020.21},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/KobayashiO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KobayashiOOU20,
author = {Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Yushi Uno},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Linear-Time Recognition of Double-Threshold Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
pages = {286--297},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_23},
doi = {10.1007/978-3-030-60440-0\_23},
timestamp = {Sat, 14 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/KobayashiOOU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10898,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Lars Jaffke and
Hirotaka Ono and
Yota Otachi and
Tom C. van der Zanden},
title = {Hedonic Seat Arrangement Problems},
journal = {CoRR},
volume = {abs/2002.10898},
year = {2020},
url = {https://arxiv.org/abs/2002.10898},
eprinttype = {arXiv},
eprint = {2002.10898},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-10898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-08811,
author = {Yasuaki Kobayashi and
Yota Otachi},
title = {Parameterized Complexity of Graph Burning},
journal = {CoRR},
volume = {abs/2007.08811},
year = {2020},
url = {https://arxiv.org/abs/2007.08811},
eprinttype = {arXiv},
eprint = {2007.08811},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-08811.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-03448,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Masaaki Kanzaki and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of (A, {\unicode{120001}})-Path Packing},
journal = {CoRR},
volume = {abs/2008.03448},
year = {2020},
url = {https://arxiv.org/abs/2008.03448},
eprinttype = {arXiv},
eprint = {2008.03448},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-03448.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-07425,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi},
title = {Grundy Distinguishes Treewidth from Pathwidth},
journal = {CoRR},
volume = {abs/2008.07425},
year = {2020},
url = {https://arxiv.org/abs/2008.07425},
eprinttype = {arXiv},
eprint = {2008.07425},
timestamp = {Fri, 21 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-07425.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-03687,
author = {Tesshu Hanaka and
Yasuaki Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
title = {Finding Diverse Trees, Paths, and More},
journal = {CoRR},
volume = {abs/2009.03687},
year = {2020},
url = {https://arxiv.org/abs/2009.03687},
eprinttype = {arXiv},
eprint = {2009.03687},
timestamp = {Thu, 17 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-03687.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-08588,
author = {Masashi Kiyomi and
Takashi Horiyama and
Yota Otachi},
title = {Longest Common Subsequence in Sublinear Space},
journal = {CoRR},
volume = {abs/2009.08588},
year = {2020},
url = {https://arxiv.org/abs/2009.08588},
eprinttype = {arXiv},
eprint = {2009.08588},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-08588.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-04910,
author = {Yuuki Aoike and
Tatsuya Gima and
Tesshu Hanaka and
Masashi Kiyomi and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Kazuhiro Kurita and
Yota Otachi},
title = {An Improved Deterministic Parameterized Algorithm for Cactus Vertex
Deletion},
journal = {CoRR},
volume = {abs/2012.04910},
year = {2020},
url = {https://arxiv.org/abs/2012.04910},
eprinttype = {arXiv},
eprint = {2012.04910},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-04910.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlavikOS19,
author = {Pavel Klav{\'{\i}}k and
Yota Otachi and
Jir{\'{\i}} Sejnoha},
title = {On the Classes of Interval Graphs of Limited Nesting and Count of
Lengths},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1490--1511},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0481-y},
doi = {10.1007/S00453-018-0481-Y},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/KlavikOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/KawamuraMOP19,
author = {Akitoshi Kawamura and
Sonoko Moriyama and
Yota Otachi and
J{\'{a}}nos Pach},
title = {A lower bound on opaque sets},
journal = {Comput. Geom.},
volume = {80},
pages = {13--22},
year = {2019},
url = {https://doi.org/10.1016/j.comgeo.2019.01.002},
doi = {10.1016/J.COMGEO.2019.01.002},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/comgeo/KawamuraMOP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/ShirayamaSOMU19,
author = {Takumu Shirayama and
Takuto Shigemura and
Yota Otachi and
Shuichi Miyazaki and
Ryuhei Uehara},
title = {On Computational Complexity of Pipe Puzzles},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {102-A},
number = {9},
pages = {1134--1141},
year = {2019},
url = {https://doi.org/10.1587/transfun.E102.A.1134},
doi = {10.1587/TRANSFUN.E102.A.1134},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieicet/ShirayamaSOMU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BelmonteGKLO19,
author = {R{\'{e}}my Belmonte and
Mehdi Khosravian Ghadikolaei and
Masashi Kiyomi and
Michael Lampis and
Yota Otachi},
title = {How Bad is the Freedom to Flood-It?},
journal = {J. Graph Algorithms Appl.},
volume = {23},
number = {2},
pages = {111--134},
year = {2019},
url = {https://doi.org/10.7155/jgaa.00486},
doi = {10.7155/JGAA.00486},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BelmonteGKLO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoO19,
author = {Takehiro Ito and
Yota Otachi},
title = {Reconfiguration of colorable sets in classes of perfect graphs},
journal = {Theor. Comput. Sci.},
volume = {772},
pages = {111--122},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.11.024},
doi = {10.1016/J.TCS.2018.11.024},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/ItoO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DasEKMORY19,
author = {Bireswar Das and
Murali Krishna Enduri and
Masashi Kiyomi and
Neeldhara Misra and
Yota Otachi and
I. Vinod Reddy and
Shunya Yoshimura},
title = {On structural parameterizations of firefighting},
journal = {Theor. Comput. Sci.},
volume = {782},
pages = {79--90},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.02.032},
doi = {10.1016/J.TCS.2019.02.032},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DasEKMORY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BelmonteHKLOO19,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
editor = {Pinar Heggernes},
title = {Parameterized Complexity of Safe Set},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {38--49},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_4},
doi = {10.1007/978-3-030-17402-6\_4},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BelmonteHKLOO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BodlaenderHOOZ19,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
editor = {Pinar Heggernes},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {87--98},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_8},
doi = {10.1007/978-3-030-17402-6\_8},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BodlaenderHOOZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Belmonte0LMOS19,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi and
Florian Sikora},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Token Sliding on Split Graphs},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {13:1--13:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.13},
doi = {10.4230/LIPICS.STACS.2019.13},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Belmonte0LMOS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/KitamuraKOI19,
author = {Naoki Kitamura and
Hirotaka Kitagawa and
Yota Otachi and
Taisuke Izumi},
editor = {Jukka Suomela},
title = {Low-Congestion Shortcut and Graph Parameters},
booktitle = {33rd International Symposium on Distributed Computing, {DISC} 2019,
October 14-18, 2019, Budapest, Hungary},
series = {LIPIcs},
volume = {146},
pages = {25:1--25:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.DISC.2019.25},
doi = {10.4230/LIPICS.DISC.2019.25},
timestamp = {Wed, 09 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/KitamuraKOI19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BelmonteHLOO19,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Independent Set Reconfiguration Parameterized by Modular-Width},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {285--297},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_22},
doi = {10.1007/978-3-030-30786-8\_22},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BelmonteHLOO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-09434,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Parameterized Complexity of Safe Set},
journal = {CoRR},
volume = {abs/1901.09434},
year = {2019},
url = {http://arxiv.org/abs/1901.09434},
eprinttype = {arXiv},
eprint = {1901.09434},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-09434.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00340,
author = {R{\'{e}}my Belmonte and
Tesshu Hanaka and
Michael Lampis and
Hirotaka Ono and
Yota Otachi},
title = {Independent Set Reconfiguration Parameterized by Modular-Width},
journal = {CoRR},
volume = {abs/1905.00340},
year = {2019},
url = {http://arxiv.org/abs/1905.00340},
eprinttype = {arXiv},
eprint = {1905.00340},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00340.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-10670,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
journal = {CoRR},
volume = {abs/1905.10670},
year = {2019},
url = {http://arxiv.org/abs/1905.10670},
eprinttype = {arXiv},
eprint = {1905.10670},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-10670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-09473,
author = {Naoki Kitamura and
Hirotaka Kitagawa and
Yota Otachi and
Taisuke Izumi},
title = {Low-Congestion Shortcut and Graph Parameters},
journal = {CoRR},
volume = {abs/1908.09473},
year = {2019},
url = {http://arxiv.org/abs/1908.09473},
eprinttype = {arXiv},
eprint = {1908.09473},
timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-09473.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-09371,
author = {Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Yushi Uno},
title = {Linear-Time Recognition of Double-Threshold Graphs},
journal = {CoRR},
volume = {abs/1909.09371},
year = {2019},
url = {http://arxiv.org/abs/1909.09371},
eprinttype = {arXiv},
eprint = {1909.09371},
timestamp = {Tue, 24 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-09371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteOS18,
author = {R{\'{e}}my Belmonte and
Yota Otachi and
Pascal Schweitzer},
title = {Induced Minor Free Graphs: Isomorphism and Clique-Width},
journal = {Algorithmica},
volume = {80},
number = {1},
pages = {29--47},
year = {2018},
url = {https://doi.org/10.1007/s00453-016-0234-8},
doi = {10.1007/S00453-016-0234-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderOO18,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
title = {Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes
and Parameterized Complexity},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2160--2180},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0399-9},
doi = {10.1007/S00453-017-0399-9},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderOO18,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
title = {A faster parameterized algorithm for Pseudoforest Deletion},
journal = {Discret. Appl. Math.},
volume = {236},
pages = {42--56},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.10.018},
doi = {10.1016/J.DAM.2017.10.018},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/AguedaCFLMMMNOO18,
author = {Raquel {\'{A}}gueda and
Nathann Cohen and
Shinya Fujita and
Sylvain Legay and
Yannis Manoussakis and
Yasuko Matsui and
Leandro Montero and
Reza Naserasr and
Hirotaka Ono and
Yota Otachi and
Tadashi Sakuma and
Zsolt Tuza and
Renyu Xu},
title = {Safe sets in graphs: Graph classes and structural parameters},
journal = {J. Comb. Optim.},
volume = {36},
number = {4},
pages = {1221--1242},
year = {2018},
url = {https://doi.org/10.1007/s10878-017-0205-2},
doi = {10.1007/S10878-017-0205-2},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/AguedaCFLMMMNOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YamanakaHKKOSUU18,
author = {Katsuhisa Yamanaka and
Takashi Horiyama and
J. Mark Keil and
David G. Kirkpatrick and
Yota Otachi and
Toshiki Saitoh and
Ryuhei Uehara and
Yushi Uno},
title = {Swapping colored tokens on graphs},
journal = {Theor. Comput. Sci.},
volume = {729},
pages = {1--10},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.03.016},
doi = {10.1016/J.TCS.2018.03.016},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YamanakaHKKOSUU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/0001KOY18,
author = {Yixin Cao and
Yuping Ke and
Yota Otachi and
Jie You},
title = {Vertex deletion problems on chordal graphs},
journal = {Theor. Comput. Sci.},
volume = {745},
pages = {75--86},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.05.039},
doi = {10.1016/J.TCS.2018.05.039},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/0001KOY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/AkagiAHNOOSUUW18,
author = {Toshihiro Akagi and
Tetsuya Araki and
Takashi Horiyama and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Toshiki Saitoh and
Ryuhei Uehara and
Takeaki Uno and
Kunihiro Wasa},
editor = {Jianer Chen and
Pinyan Lu},
title = {Exact Algorithms for the Max-Min Dispersion Problem},
booktitle = {Frontiers in Algorithmics - 12th International Workshop, {FAW} 2018,
Guangzhou, China, May 8-10, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10823},
pages = {263--272},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-78455-7\_20},
doi = {10.1007/978-3-319-78455-7\_20},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/faw/AkagiAHNOOSUUW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BelmonteGKLO18,
author = {R{\'{e}}my Belmonte and
Mehdi Khosravian Ghadikolaei and
Masashi Kiyomi and
Michael Lampis and
Yota Otachi},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {How Bad is the Freedom to Flood-It?},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {5:1--5:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.5},
doi = {10.4230/LIPICS.FUN.2018.5},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/fun/BelmonteGKLO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/FengHOOSUU18,
author = {Tianfeng Feng and
Takashi Horiyama and
Yoshio Okamoto and
Yota Otachi and
Toshiki Saitoh and
Takeaki Uno and
Ryuhei Uehara},
editor = {Costas S. Iliopoulos and
Hon Wai Leong and
Wing{-}Kin Sung},
title = {Computational Complexity of Robot Arm Simulation Problems},
booktitle = {Combinatorial Algorithms - 29th International Workshop, {IWOCA} 2018,
Singapore, July 16-19, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10979},
pages = {177--188},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94667-2\_15},
doi = {10.1007/978-3-319-94667-2\_15},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/FengHOOSUU18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KiyomiOOST18,
author = {Masashi Kiyomi and
Hirotaka Ono and
Yota Otachi and
Pascal Schweitzer and
Jun Tarui},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Space-Efficient Algorithms for Longest Increasing Subsequence},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {44:1--44:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.44},
doi = {10.4230/LIPICS.STACS.2018.44},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KiyomiOOST18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HanakaKLOS18,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
editor = {David Eppstein},
title = {Parameterized Orientable Deletion},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {24:1--24:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.24},
doi = {10.4230/LIPICS.SWAT.2018.24},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/HanakaKLOS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ItoO18,
author = {Takehiro Ito and
Yota Otachi},
editor = {David Eppstein},
title = {Reconfiguration of Colorable Sets in Classes of Perfect Graphs},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {27:1--27:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.27},
doi = {10.4230/LIPICS.SWAT.2018.27},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ItoO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-06511,
author = {Takehiro Ito and
Yota Otachi},
title = {Reconfiguration of Colorable Sets in Classes of Perfect Graphs},
journal = {CoRR},
volume = {abs/1802.06511},
year = {2018},
url = {http://arxiv.org/abs/1802.06511},
eprinttype = {arXiv},
eprint = {1802.06511},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-06511.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-06816,
author = {Katsuhisa Yamanaka and
Takashi Horiyama and
J. Mark Keil and
David G. Kirkpatrick and
Yota Otachi and
Toshiki Saitoh and
Ryuhei Uehara and
Yushi Uno},
title = {Swapping Colored Tokens on Graphs},
journal = {CoRR},
volume = {abs/1803.06816},
year = {2018},
url = {http://arxiv.org/abs/1803.06816},
eprinttype = {arXiv},
eprint = {1803.06816},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-06816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-08236,
author = {R{\'{e}}my Belmonte and
Mehdi Khosravian Ghadikolaei and
Masashi Kiyomi and
Michael Lampis and
Yota Otachi},
title = {How Bad is the Freedom to Flood-It?},
journal = {CoRR},
volume = {abs/1804.08236},
year = {2018},
url = {http://arxiv.org/abs/1804.08236},
eprinttype = {arXiv},
eprint = {1804.08236},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-08236.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05322,
author = {R{\'{e}}my Belmonte and
Eun Jung Kim and
Michael Lampis and
Valia Mitsou and
Yota Otachi and
Florian Sikora},
title = {Token Sliding on Split Graphs},
journal = {CoRR},
volume = {abs/1807.05322},
year = {2018},
url = {http://arxiv.org/abs/1807.05322},
eprinttype = {arXiv},
eprint = {1807.05322},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-05322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-11518,
author = {Tesshu Hanaka and
Ioannis Katsikarelis and
Michael Lampis and
Yota Otachi and
Florian Sikora},
title = {Parameterized Orientable Deletion},
journal = {CoRR},
volume = {abs/1807.11518},
year = {2018},
url = {http://arxiv.org/abs/1807.11518},
eprinttype = {arXiv},
eprint = {1807.11518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-11518.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlavikKORSSV17,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tom{\'{a}}s Vyskocil},
title = {Extending Partial Representations of Proper and Unit Interval Graphs},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1071--1104},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0133-z},
doi = {10.1007/S00453-016-0133-Z},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KlavikKORSSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/KlavikKOSV17,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh and
Tom{\'{a}}s Vyskocil},
title = {Extending Partial Representations of Interval Graphs},
journal = {Algorithmica},
volume = {78},
number = {3},
pages = {945--967},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0186-z},
doi = {10.1007/S00453-016-0186-Z},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/KlavikKOSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChaplickHOSU17,
author = {Steven Chaplick and
Pavol Hell and
Yota Otachi and
Toshiki Saitoh and
Ryuhei Uehara},
title = {Ferrers dimension of grid intersection graphs},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {130--135},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.05.035},
doi = {10.1016/J.DAM.2015.05.035},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChaplickHOSU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HayashiKOSY17,
author = {Takashi Hayashi and
Akitoshi Kawamura and
Yota Otachi and
Hidehiro Shinohara and
Koichi Yamazaki},
title = {Thin strip graphs},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {203--210},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.01.018},
doi = {10.1016/J.DAM.2015.01.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HayashiKOSY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KiyomiO17,
author = {Masashi Kiyomi and
Yota Otachi},
title = {Alliances in graphs of bounded clique-width},
journal = {Discret. Appl. Math.},
volume = {223},
pages = {91--97},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.02.004},
doi = {10.1016/J.DAM.2017.02.004},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KiyomiO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jip/SuzukiKOUU17,
author = {Akira Suzuki and
Masashi Kiyomi and
Yota Otachi and
Kei Uchizawa and
Takeaki Uno},
title = {Hitori Numbers},
journal = {J. Inf. Process.},
volume = {25},
pages = {695--707},
year = {2017},
url = {https://doi.org/10.2197/ipsjjip.25.695},
doi = {10.2197/IPSJJIP.25.695},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jip/SuzukiKOUU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ConteKOUW17,
author = {Alessio Conte and
Mamadou Moustapha Kant{\'{e}} and
Yota Otachi and
Takeaki Uno and
Kunihiro Wasa},
editor = {Yixin Cao and
Jianer Chen},
title = {Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal
Graph},
booktitle = {Computing and Combinatorics - 23rd International Conference, {COCOON}
2017, Hong Kong, China, August 3-5, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10392},
pages = {150--161},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62389-4\_13},
doi = {10.1007/978-3-319-62389-4\_13},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/ConteKOUW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/CaoKOY17,
author = {Yixin Cao and
Yuping Ke and
Yota Otachi and
Jie You},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Vertex Deletion Problems on Chordal Graphs},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.22},
doi = {10.4230/LIPICS.FSTTCS.2017.22},
timestamp = {Fri, 03 Sep 2021 15:00:19 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/CaoKOY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DemaineKKMORRUU17,
author = {Erik D. Demaine and
Matias Korman and
Jason S. Ku and
Joseph S. B. Mitchell and
Yota Otachi and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Ryuhei Uehara and
Yushi Uno},
title = {Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces},
journal = {CoRR},
volume = {abs/1703.02671},
year = {2017},
url = {http://arxiv.org/abs/1703.02671},
eprinttype = {arXiv},
eprint = {1703.02671},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DemaineKKMORRUU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0001KOY17,
author = {Yixin Cao and
Yuping Ke and
Yota Otachi and
Jie You},
title = {Vertex Deletion Problems on Chordal Graphs},
journal = {CoRR},
volume = {abs/1707.08690},
year = {2017},
url = {http://arxiv.org/abs/1707.08690},
eprinttype = {arXiv},
eprint = {1707.08690},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0001KOY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-09230,
author = {Masashi Kiyomi and
Hirotaka Ono and
Yota Otachi and
Pascal Schweitzer and
Jun Tarui},
title = {Space-Efficient Algorithms for Longest Increasing Subsequence},
journal = {CoRR},
volume = {abs/1712.09230},
year = {2017},
url = {http://arxiv.org/abs/1712.09230},
eprinttype = {arXiv},
eprint = {1712.09230},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-09230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/ItoNOOUUU16,
author = {Takehiro Ito and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
title = {A polynomial-time approximation scheme for the geometric unique coverage
problem on unit squares},
journal = {Comput. Geom.},
volume = {51},
pages = {25--39},
year = {2016},
url = {https://doi.org/10.1016/j.comgeo.2015.10.004},
doi = {10.1016/J.COMGEO.2015.10.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/ItoNOOUUU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KiyomiOO16,
author = {Masashi Kiyomi and
Yoshio Okamoto and
Yota Otachi},
title = {On the treewidth of toroidal grids},
journal = {Discret. Appl. Math.},
volume = {198},
pages = {303--306},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.06.027},
doi = {10.1016/J.DAM.2015.06.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KiyomiOO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KonagayaOU16,
author = {Matsuo Konagaya and
Yota Otachi and
Ryuhei Uehara},
title = {Polynomial-time algorithms for Subgraph Isomorphism in small graph
classes of perfect graphs},
journal = {Discret. Appl. Math.},
volume = {199},
pages = {37--45},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.01.040},
doi = {10.1016/J.DAM.2015.01.040},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KonagayaOU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KiyomiO16,
author = {Masashi Kiyomi and
Yota Otachi},
title = {Finding a chain graph in a bipartite permutation graph},
journal = {Inf. Process. Lett.},
volume = {116},
number = {9},
pages = {569--573},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.04.006},
doi = {10.1016/J.IPL.2016.04.006},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KiyomiO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/AguedaCFLMMMNOS16,
author = {Raquel {\'{A}}gueda and
Nathann Cohen and
Shinya Fujita and
Sylvain Legay and
Yannis Manoussakis and
Yasuko Matsui and
Leandro Montero and
Reza Naserasr and
Yota Otachi and
Tadashi Sakuma and
Zsolt Tuza and
Renyu Xu},
editor = {T.{-}H. Hubert Chan and
Minming Li and
Lusheng Wang},
title = {Safe Sets in Graphs: Graph Classes and Structural Parameters},
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 = {241--253},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-48749-6\_18},
doi = {10.1007/978-3-319-48749-6\_18},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/AguedaCFLMMMNOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/KawamuraMOP16,
author = {Akitoshi Kawamura and
Sonoko Moriyama and
Yota Otachi and
J{\'{a}}nos Pach},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {A Lower Bound on Opaque Sets},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {46:1--46:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.46},
doi = {10.4230/LIPICS.SOCG.2016.46},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/KawamuraMOP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BodlaenderOO16,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
editor = {Seok{-}Hee Hong},
title = {Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes
and Parameterized Complexity},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {20:1--20:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.20},
doi = {10.4230/LIPICS.ISAAC.2016.20},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BodlaenderOO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KlavikOS16,
author = {Pavel Klav{\'{\i}}k and
Yota Otachi and
Jir{\'{\i}} Sejnoha},
editor = {Seok{-}Hee Hong},
title = {On the Classes of Interval Graphs of Limited Nesting and Count of
Lengths},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {45:1--45:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.45},
doi = {10.4230/LIPICS.ISAAC.2016.45},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KlavikOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderOO16,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
editor = {Jiong Guo and
Danny Hermelin},
title = {A Faster Parameterized Algorithm for Pseudoforest Deletion},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {7:1--7:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.7},
doi = {10.4230/LIPICS.IPEC.2016.7},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderOO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelmonteOS16,
author = {R{\'{e}}my Belmonte and
Yota Otachi and
Pascal Schweitzer},
title = {Induced Minor Free Graphs: Isomorphism and Clique-width},
journal = {CoRR},
volume = {abs/1605.08540},
year = {2016},
url = {http://arxiv.org/abs/1605.08540},
eprinttype = {arXiv},
eprint = {1605.08540},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelmonteOS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ArakiMO15,
author = {Toru Araki and
Masayoshi Matsushita and
Yota Otachi},
title = {Completely independent spanning trees in (partial) \emph{k}-trees},
journal = {Discuss. Math. Graph Theory},
volume = {35},
number = {3},
pages = {427--437},
year = {2015},
url = {https://doi.org/10.7151/dmgt.1806},
doi = {10.7151/DMGT.1806},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ArakiMO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/AmanoOOU15,
author = {Kazuyuki Amano and
Kyaw May Oo and
Yota Otachi and
Ryuhei Uehara},
title = {Secure Sets and Defensive Alliances in Graphs: {A} Faster Algorithm
and Improved Bounds},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {98-D},
number = {3},
pages = {486--489},
year = {2015},
url = {https://doi.org/10.1587/transinf.2014FCP0007},
doi = {10.1587/TRANSINF.2014FCP0007},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ieicet/AmanoOOU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KlavikKOS15,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh},
title = {Extending partial representations of subclasses of chordal graphs},
journal = {Theor. Comput. Sci.},
volume = {576},
pages = {85--101},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.02.007},
doi = {10.1016/J.TCS.2015.02.007},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KlavikKOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DemaineDFHIOOUY15,
author = {Erik D. Demaine and
Martin L. Demaine and
Eli Fox{-}Epstein and
Duc A. Hoang and
Takehiro Ito and
Hirotaka Ono and
Yota Otachi and
Ryuhei Uehara and
Takeshi Yamada},
title = {Linear-time algorithm for sliding tokens on trees},
journal = {Theor. Comput. Sci.},
volume = {600},
pages = {132--142},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.07.037},
doi = {10.1016/J.TCS.2015.07.037},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DemaineDFHIOOUY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Fox-EpsteinHOU15,
author = {Eli Fox{-}Epstein and
Duc A. Hoang and
Yota Otachi and
Ryuhei Uehara},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Sliding Token on Bipartite Permutation Graphs},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {237--247},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_21},
doi = {10.1007/978-3-662-48971-0\_21},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Fox-EpsteinHOU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/DemaineKKMORRUU15,
author = {Erik D. Demaine and
Matias Korman and
Jason S. Ku and
Joseph S. B. Mitchell and
Yota Otachi and
Andr{\'{e}} van Renssen and
Marcel Roeloffzen and
Ryuhei Uehara and
Yushi Uno},
editor = {Jin Akiyama and
Hiro Ito and
Toshinori Sakai and
Yushi Uno},
title = {Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces},
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 = {180--192},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-48532-4\_16},
doi = {10.1007/978-3-319-48532-4\_16},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/jcdcg/DemaineKKMORRUU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ItoOO15,
author = {Takehiro Ito and
Hirotaka Ono and
Yota Otachi},
editor = {Rahul Jain and
Sanjay Jain and
Frank Stephan},
title = {Reconfiguration of Cliques in a Graph},
booktitle = {Theory and Applications of Models of Computation - 12th Annual Conference,
{TAMC} 2015, Singapore, May 18-20, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9076},
pages = {212--223},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-17142-5\_19},
doi = {10.1007/978-3-319-17142-5\_19},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/ItoOO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ItoOSSSUUYZ15,
author = {Takehiro Ito and
Yota Otachi and
Toshiki Saitoh and
Hisayuki Satoh and
Akira Suzuki and
Kei Uchizawa and
Ryuhei Uehara and
Katsuhisa Yamanaka and
Xiao Zhou},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Competitive Diffusion on Weighted Graphs},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {422--433},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_35},
doi = {10.1007/978-3-319-21840-3\_35},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/ItoOSSSUUYZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/YamanakaHKOSUU15,
author = {Katsuhisa Yamanaka and
Takashi Horiyama and
David G. Kirkpatrick and
Yota Otachi and
Toshiki Saitoh and
Ryuhei Uehara and
Yushi Uno},
editor = {Frank Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Ulrike Stege},
title = {Swapping Colored Tokens on Graphs},
booktitle = {Algorithms and Data Structures - 14th International Symposium, {WADS}
2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9214},
pages = {619--628},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21840-3\_51},
doi = {10.1007/978-3-319-21840-3\_51},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/YamanakaHKOSUU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BelmonteOS15,
author = {R{\'{e}}my Belmonte and
Yota Otachi and
Pascal Schweitzer},
editor = {Ernst W. Mayr},
title = {Induced Minor Free Graphs: Isomorphism and Clique-width},
booktitle = {Graph-Theoretic Concepts in Computer Science - 41st International
Workshop, {WG} 2015, Garching, Germany, June 17-19, 2015, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {9224},
pages = {299--311},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-53174-7\_21},
doi = {10.1007/978-3-662-53174-7\_21},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BelmonteOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KlavikOS15,
author = {Pavel Klav{\'{\i}}k and
Yota Otachi and
Jir{\'{\i}} Sejnoha},
title = {On the Classes of Interval Graphs of Limited Nesting and Count of
Lengths},
journal = {CoRR},
volume = {abs/1510.03998},
year = {2015},
url = {http://arxiv.org/abs/1510.03998},
eprinttype = {arXiv},
eprint = {1510.03998},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KlavikOS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KozawaOY14,
author = {Kyohei Kozawa and
Yota Otachi and
Koichi Yamazaki},
title = {Lower bounds for treewidth of product graphs},
journal = {Discret. Appl. Math.},
volume = {162},
pages = {251--258},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.08.005},
doi = {10.1016/J.DAM.2013.08.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KozawaOY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/OtachiSYKOOUY14,
author = {Yota Otachi and
Toshiki Saitoh and
Katsuhisa Yamanaka and
Shuji Kijima and
Yoshio Okamoto and
Hirotaka Ono and
Yushi Uno and
Koichi Yamazaki},
title = {Approximating the path-distance-width for AT-free graphs and graphs
in related classes},
journal = {Discret. Appl. Math.},
volume = {168},
pages = {69--77},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2012.11.015},
doi = {10.1016/J.DAM.2012.11.015},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/OtachiSYKOOUY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoNOOUUU14,
author = {Takehiro Ito and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
title = {A 4.31-approximation for the geometric unique coverage problem on
unit disks},
journal = {Theor. Comput. Sci.},
volume = {544},
pages = {14--31},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.04.014},
doi = {10.1016/J.TCS.2014.04.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoNOOUUU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiOT14,
author = {Meng Li and
Yota Otachi and
Takeshi Tokuyama},
title = {Efficient algorithms for network localization using cores of underlying
graphs},
journal = {Theor. Comput. Sci.},
volume = {553},
pages = {18--26},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.02.020},
doi = {10.1016/J.TCS.2014.02.020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/LiOT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChunHIKOOTUU14,
author = {Jinhee Chun and
Takashi Horiyama and
Takehiro Ito and
Natsuda Kaothanthong and
Hirotaka Ono and
Yota Otachi and
Takeshi Tokuyama and
Ryuhei Uehara and
Takeaki Uno},
title = {Base-object location problems for base-monotone regions},
journal = {Theor. Comput. Sci.},
volume = {555},
pages = {71--84},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.11.030},
doi = {10.1016/J.TCS.2013.11.030},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChunHIKOOTUU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DemaineDFHIOOUY14,
author = {Erik D. Demaine and
Martin L. Demaine and
Eli Fox{-}Epstein and
Duc A. Hoang and
Takehiro Ito and
Hirotaka Ono and
Yota Otachi and
Ryuhei Uehara and
Takeshi Yamada},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Polynomial-Time Algorithm for Sliding Tokens on Trees},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {389--400},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_31},
doi = {10.1007/978-3-319-13075-0\_31},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DemaineDFHIOOUY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AsanoIKKOOSTU14,
author = {Tetsuo Asano and
Taisuke Izumi and
Masashi Kiyomi and
Matsuo Konagaya and
Hirotaka Ono and
Yota Otachi and
Pascal Schweitzer and
Jun Tarui and
Ryuhei Uehara},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Depth-First Search Using O(n) Bits},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {553--564},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_44},
doi = {10.1007/978-3-319-13075-0\_44},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/AsanoIKKOOSTU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KlavikKORSSV14,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tom{\'{a}}s Vyskocil},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Extending Partial Representations of Proper and Unit Interval Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {253--264},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_22},
doi = {10.1007/978-3-319-08404-6\_22},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/KlavikKORSSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/OtachiS14,
author = {Yota Otachi and
Pascal Schweitzer},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Reduction Techniques for Graph Isomorphism in the Context of Width
Parameters},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {368--379},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_32},
doi = {10.1007/978-3-319-08404-6\_32},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/OtachiS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/KonagayaOU14,
author = {Matsuo Konagaya and
Yota Otachi and
Ryuhei Uehara},
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph
Classes of Perfect Graphs},
booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
pages = {216--228},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7\_15},
doi = {10.1007/978-3-319-06089-7\_15},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/KonagayaOU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ChaplickHOSU14,
author = {Steven Chaplick and
Pavol Hell and
Yota Otachi and
Toshiki Saitoh and
Ryuhei Uehara},
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {Intersection Dimension of Bipartite Graphs},
booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
pages = {323--340},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7\_23},
doi = {10.1007/978-3-319-06089-7\_23},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/ChaplickHOSU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KawamuraMOP14,
author = {Akitoshi Kawamura and
Sonoko Moriyama and
Yota Otachi and
J{\'{a}}nos Pach},
title = {A lower bound on opaque sets},
journal = {CoRR},
volume = {abs/1403.3894},
year = {2014},
url = {http://arxiv.org/abs/1403.3894},
eprinttype = {arXiv},
eprint = {1403.3894},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KawamuraMOP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/OtachiS14,
author = {Yota Otachi and
Pascal Schweitzer},
title = {Reduction Techniques for Graph Isomorphism in the Context of Width
Parameters},
journal = {CoRR},
volume = {abs/1403.7238},
year = {2014},
url = {http://arxiv.org/abs/1403.7238},
eprinttype = {arXiv},
eprint = {1403.7238},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/OtachiS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DemaineDFHIOOUY14,
author = {Erik D. Demaine and
Martin L. Demaine and
Eli Fox{-}Epstein and
Duc A. Hoang and
Takehiro Ito and
Hirotaka Ono and
Yota Otachi and
Ryuhei Uehara and
Takeshi Yamada},
title = {Polynomial-Time Algorithm for Sliding Tokens on Trees},
journal = {CoRR},
volume = {abs/1406.6576},
year = {2014},
url = {http://arxiv.org/abs/1406.6576},
eprinttype = {arXiv},
eprint = {1406.6576},
timestamp = {Mon, 15 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DemaineDFHIOOUY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ItoOSSSUUYZ14,
author = {Takehiro Ito and
Yota Otachi and
Toshiki Saitoh and
Hisayuki Satoh and
Akira Suzuki and
Kei Uchizawa and
Ryuhei Uehara and
Katsuhisa Yamanaka and
Xiao Zhou},
title = {Computational Complexity of Competitive Diffusion on (Un)weighted
Graphs},
journal = {CoRR},
volume = {abs/1412.3334},
year = {2014},
url = {http://arxiv.org/abs/1412.3334},
eprinttype = {arXiv},
eprint = {1412.3334},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ItoOSSSUUYZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ItoOO14,
author = {Takehiro Ito and
Hirotaka Ono and
Yota Otachi},
title = {Reconfiguration of Cliques in a Graph},
journal = {CoRR},
volume = {abs/1412.3976},
year = {2014},
url = {http://arxiv.org/abs/1412.3976},
eprinttype = {arXiv},
eprint = {1412.3976},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ItoOO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/Otachi13,
author = {Yota Otachi},
title = {The path-distance-width of hypercubes},
journal = {Discuss. Math. Graph Theory},
volume = {33},
number = {2},
pages = {467--470},
year = {2013},
url = {https://doi.org/10.7151/dmgt.1682},
doi = {10.7151/DMGT.1682},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/Otachi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/OtachiS13,
author = {Yota Otachi and
Pascal Schweitzer},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Isomorphism on Subgraph-Closed Graph Classes: {A} Complexity Dichotomy
and Intermediate Graph Classes},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {111--118},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_11},
doi = {10.1007/978-3-642-45030-3\_11},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/OtachiS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BalkoKO13,
author = {Martin Balko and
Pavel Klav{\'{\i}}k and
Yota Otachi},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Bounded Representations of Interval and Proper Interval Graphs},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {535--546},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_50},
doi = {10.1007/978-3-642-45030-3\_50},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BalkoKO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/ChunHIKOOTUU13,
author = {Jinhee Chun and
Takashi Horiyama and
Takehiro Ito and
Natsuda Kaothanthong and
Hirotaka Ono and
Yota Otachi and
Takeshi Tokuyama and
Ryuhei Uehara and
Takeaki Uno},
editor = {Subir Kumar Ghosh and
Takeshi Tokuyama},
title = {Base Location Problems for Base-Monotone Regions},
booktitle = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
{WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7748},
pages = {53--64},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36065-7\_7},
doi = {10.1007/978-3-642-36065-7\_7},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/walcom/ChunHIKOOTUU13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KlavikKOSV13,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh and
Tom{\'{a}}s Vyskocil},
title = {Linear-time Algorithm for Partial Representation Extension of Interval
Graphs},
journal = {CoRR},
volume = {abs/1306.2182},
year = {2013},
url = {http://arxiv.org/abs/1306.2182},
eprinttype = {arXiv},
eprint = {1306.2182},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KlavikKOSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalkoKO13,
author = {Martin Balko and
Pavel Klav{\'{\i}}k and
Yota Otachi},
title = {Bounded Representations of Interval and Proper Interval Graphs},
journal = {CoRR},
volume = {abs/1309.1248},
year = {2013},
url = {http://arxiv.org/abs/1309.1248},
eprinttype = {arXiv},
eprint = {1309.1248},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalkoKO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderFGOL12,
author = {Hans L. Bodlaender and
Fedor V. Fomin and
Petr A. Golovach and
Yota Otachi and
Erik Jan van Leeuwen},
title = {Parameterized Complexity of the Spanning Tree Congestion Problem},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {85--111},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9565-7},
doi = {10.1007/S00453-011-9565-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderFGOL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KijimaOSU12,
author = {Shuji Kijima and
Yota Otachi and
Toshiki Saitoh and
Takeaki Uno},
title = {Subgraph isomorphism in graph classes},
journal = {Discret. Math.},
volume = {312},
number = {21},
pages = {3164--3173},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2012.07.010},
doi = {10.1016/J.DISC.2012.07.010},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KijimaOSU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/OkamotoOU12,
author = {Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara},
title = {On bipartite powers of bigraphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {14},
number = {2},
pages = {11--20},
year = {2012},
url = {https://doi.org/10.46298/dmtcs.576},
doi = {10.46298/DMTCS.576},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/OkamotoOU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/IshikawaYON12,
author = {Masanobu Ishikawa and
Katsuhisa Yamanaka and
Yota Otachi and
Shin{-}Ichi Nakano},
title = {Enumerating All Rooted Trees Including \emph{k} Leaves},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {95-D},
number = {3},
pages = {763--768},
year = {2012},
url = {https://doi.org/10.1587/transinf.E95.D.763},
doi = {10.1587/TRANSINF.E95.D.763},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/IshikawaYON12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/SaitohOYU12,
author = {Toshiki Saitoh and
Yota Otachi and
Katsuhisa Yamanaka and
Ryuhei Uehara},
title = {Random generation and enumeration of bipartite permutation graphs},
journal = {J. Discrete Algorithms},
volume = {10},
pages = {84--97},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.11.001},
doi = {10.1016/J.JDA.2011.11.001},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/SaitohOYU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/YamanakaON12,
author = {Katsuhisa Yamanaka and
Yota Otachi and
Shin{-}Ichi Nakano},
title = {Efficient enumeration of ordered trees with k leaves},
journal = {Theor. Comput. Sci.},
volume = {442},
pages = {22--27},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.01.017},
doi = {10.1016/J.TCS.2011.01.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/YamanakaON12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ItoNOOUUU12,
author = {Takehiro Ito and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {A 4.31-Approximation for the Geometric Unique Coverage Problem on
Unit Disks},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {372--381},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_40},
doi = {10.1007/978-3-642-35261-4\_40},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ItoNOOUUU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KlavikKOS12,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Extending Partial Representations of Subclasses of Chordal Graphs},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {444--454},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_47},
doi = {10.1007/978-3-642-35261-4\_47},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KlavikKOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Otachi12,
author = {Yota Otachi},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Isomorphism for Graphs of Bounded Connected-Path-Distance-Width},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {455--464},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_48},
doi = {10.1007/978-3-642-35261-4\_48},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Otachi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/ItoNOOUUU12,
author = {Takehiro Ito and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage
Problem on Unit Squares},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {24--35},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_3},
doi = {10.1007/978-3-642-31155-0\_3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/swat/ItoNOOUUU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tjjccgg/FukuiOUUU12,
author = {Hiroyuki Fukui and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno and
Yushi Uno},
editor = {Jin Akiyama and
Mikio Kano and
Toshinori Sakai},
title = {On Complexity of Flooding Games on Graphs with Interval Representations},
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 = {73--84},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-45281-9\_7},
doi = {10.1007/978-3-642-45281-9\_7},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tjjccgg/FukuiOUUU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-0255,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Toshiki Saitoh},
title = {Extending Partial Representations of Subclasses of Chordal Graphs},
journal = {CoRR},
volume = {abs/1207.0255},
year = {2012},
url = {http://arxiv.org/abs/1207.0255},
eprinttype = {arXiv},
eprint = {1207.0255},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-0255.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-6960,
author = {Pavel Klav{\'{\i}}k and
Jan Kratochv{\'{\i}}l and
Yota Otachi and
Ignaz Rutter and
Toshiki Saitoh and
Maria Saumell and
Tom{\'{a}}s Vyskocil},
title = {Extending Partial Representations of Proper and Unit Interval Graphs},
journal = {CoRR},
volume = {abs/1207.6960},
year = {2012},
url = {http://arxiv.org/abs/1207.6960},
eprinttype = {arXiv},
eprint = {1207.6960},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-6960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/OtachiS11,
author = {Yota Otachi and
Ryohei Suda},
title = {Bandwidth and pathwidth of three-dimensional grids},
journal = {Discret. Math.},
volume = {311},
number = {10-11},
pages = {881--887},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2011.02.019},
doi = {10.1016/J.DISC.2011.02.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/OtachiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BodlaenderKMO11,
author = {Hans L. Bodlaender and
Kyohei Kozawa and
Takayoshi Matsushima and
Yota Otachi},
title = {Spanning tree congestion of k-outerplanar graphs},
journal = {Discret. Math.},
volume = {311},
number = {12},
pages = {1040--1045},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2011.03.002},
doi = {10.1016/J.DISC.2011.03.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BodlaenderKMO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/KozawaO11,
author = {Kyohei Kozawa and
Yota Otachi},
title = {Spanning tree congestion of rook's graphs},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {4},
pages = {753--761},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1577},
doi = {10.7151/DMGT.1577},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/KozawaO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/OkamotoOUU11,
author = {Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno},
title = {Hardness Results and an Exact Exponential Algorithm for the Spanning
Tree Congestion Problem},
journal = {J. Graph Algorithms Appl.},
volume = {15},
number = {6},
pages = {727--751},
year = {2011},
url = {https://doi.org/10.7155/jgaa.00246},
doi = {10.7155/JGAA.00246},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/OkamotoOUU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/algosensors/LiOT11,
author = {Meng Li and
Yota Otachi and
Takeshi Tokuyama},
editor = {Thomas Erlebach and
Sotiris E. Nikoletseas and
Pekka Orponen},
title = {Efficient Algorithms for Network Localization Using Cores of Underlying
Graphs},
booktitle = {Algorithms for Sensor Systems - 7th International Symposium on Algorithms
for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile
Entities, {ALGOSENSORS} 2011, Saarbr{\"{u}}cken, Germany, September
8-9, 2011, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7111},
pages = {101--114},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28209-6\_9},
doi = {10.1007/978-3-642-28209-6\_9},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/algosensors/LiOT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/OkamotoOUU11,
author = {Yoshio Okamoto and
Yota Otachi and
Ryuhei Uehara and
Takeaki Uno},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {Hardness Results and an Exact Exponential Algorithm for the Spanning
Tree Congestion Problem},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {452--462},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_44},
doi = {10.1007/978-3-642-20877-5\_44},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/OkamotoOUU11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/OtachiSYKOOUY11,
author = {Yota Otachi and
Toshiki Saitoh and
Katsuhisa Yamanaka and
Shuji Kijima and
Yoshio Okamoto and
Hirotaka Ono and
Yushi Uno and
Koichi Yamazaki},
editor = {Petr Kolman and
Jan Kratochv{\'{\i}}l},
title = {Approximability of the Path-Distance-Width for AT-free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International
Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June
21-24, 2011. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6986},
pages = {271--282},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25870-1\_25},
doi = {10.1007/978-3-642-25870-1\_25},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/OtachiSYKOOUY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-0964,
author = {Yota Otachi and
Ryohei Suda},
title = {Bandwidth and pathwidth of three-dimensional grids},
journal = {CoRR},
volume = {abs/1101.0964},
year = {2011},
url = {http://arxiv.org/abs/1101.0964},
eprinttype = {arXiv},
eprint = {1101.0964},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-0964.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1304,
author = {Kyohei Kozawa and
Yota Otachi},
title = {On spanning tree congestion of Hamming graphs},
journal = {CoRR},
volume = {abs/1110.1304},
year = {2011},
url = {http://arxiv.org/abs/1110.1304},
eprinttype = {arXiv},
eprint = {1110.1304},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-1304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KozawaOY10,
author = {Kyohei Kozawa and
Yota Otachi and
Koichi Yamazaki},
title = {The carving-width of generalized hypercubes},
journal = {Discret. Math.},
volume = {310},
number = {21},
pages = {2867--2876},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2010.06.039},
doi = {10.1016/J.DISC.2010.06.039},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KozawaOY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/OtachiBL10,
author = {Yota Otachi and
Hans L. Bodlaender and
Erik Jan van Leeuwen},
editor = {Dimitrios M. Thilikos},
title = {Complexity Results for the Spanning Tree Congestion Problem},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {3--14},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_3},
doi = {10.1007/978-3-642-16926-7\_3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/OtachiBL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KozawaOY09,
author = {Kyohei Kozawa and
Yota Otachi and
Koichi Yamazaki},
title = {Security number of grid-like graphs},
journal = {Discret. Appl. Math.},
volume = {157},
number = {11},
pages = {2555--2561},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2009.03.020},
doi = {10.1016/J.DAM.2009.03.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KozawaOY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KozawaOY09,
author = {Kyohei Kozawa and
Yota Otachi and
Koichi Yamazaki},
title = {On spanning tree congestion of graphs},
journal = {Discret. Math.},
volume = {309},
number = {13},
pages = {4215--4224},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.12.021},
doi = {10.1016/J.DISC.2008.12.021},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KozawaOY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/SaitohOYU09,
author = {Toshiki Saitoh and
Yota Otachi and
Katsuhisa Yamanaka and
Ryuhei Uehara},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Random Generation and Enumeration of Bipartite Permutation Graphs},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {1104--1113},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_111},
doi = {10.1007/978-3-642-10631-6\_111},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/SaitohOYU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/YamanakaON09,
author = {Katsuhisa Yamanaka and
Yota Otachi and
Shin{-}Ichi Nakano},
editor = {Sandip Das and
Ryuhei Uehara},
title = {Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract)},
booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop,
{WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5431},
pages = {141--150},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00202-1\_13},
doi = {10.1007/978-3-642-00202-1\_13},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/YamanakaON09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/IshizekiOY08,
author = {Tetsuya Ishizeki and
Yota Otachi and
Koichi Yamazaki},
title = {An improved algorithm for the longest induced path problem on k-chordal
graphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {15},
pages = {3057--3059},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2008.01.019},
doi = {10.1016/J.DAM.2008.01.019},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/IshizekiOY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/OtachiY08,
author = {Yota Otachi and
Koichi Yamazaki},
title = {A lower bound for the vertex boundary-width of complete k-ary trees},
journal = {Discret. Math.},
volume = {308},
number = {12},
pages = {2389--2395},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.05.014},
doi = {10.1016/J.DISC.2007.05.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/OtachiY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/OtachiOY07,
author = {Yota Otachi and
Yoshio Okamoto and
Koichi Yamazaki},
title = {Relationships between the class of unit grid intersection graphs and
other classes of bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {155},
number = {17},
pages = {2383--2390},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.07.010},
doi = {10.1016/J.DAM.2007.07.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/OtachiOY07.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-15 20:47 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:
