Gima, Tatsuya; Otachi, Yota Extended MSO model checking via small vertex integrity. (English) Zbl 07785278 Algorithmica 86, No. 1, 147-170 (2024). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{T. Gima} and \textit{Y. Otachi}, Algorithmica 86, No. 1, 147--170 (2024; Zbl 07785278) Full Text: DOI arXiv
Kanzaki, Masaaki; Otachi, Yota; Viglietta, Giovanni; Uehara, Ryuhei Computational complexity of jumping block puzzles. (English) Zbl 07784207 Theor. Comput. Sci. 983, Article ID 114292, 19 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{M. Kanzaki} et al., Theor. Comput. Sci. 983, Article ID 114292, 19 p. (2024; Zbl 07784207) Full Text: DOI
Hanaka, Tesshu; Ono, Hirotaka; Otachi, Yota; Uda, Saeki Grouped domination parameterized by vertex cover, twin cover, and beyond. (English) Zbl 07745712 Mavronicolas, Marios (ed.), Algorithms and complexity. 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13–16, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13898, 263-277 (2023). MSC: 68Wxx PDFBibTeX XMLCite \textit{T. Hanaka} et al., Lect. Notes Comput. Sci. 13898, 263--277 (2023; Zbl 07745712) Full Text: DOI arXiv
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota Grundy distinguishes treewidth from pathwidth. (English) Zbl 07572601 SIAM J. Discrete Math. 36, No. 3, 1761-1787 (2022). MSC: 68Q27 68Q17 68Q25 PDFBibTeX XMLCite \textit{R. Belmonte} et al., SIAM J. Discrete Math. 36, No. 3, 1761--1787 (2022; Zbl 07572601) Full Text: DOI arXiv
Kobayashi, Yasuaki; Otachi, Yota Parameterized complexity of graph burning. (English) Zbl 07567468 Algorithmica 84, No. 8, 2379-2393 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{Y. Otachi}, Algorithmica 84, No. 8, 2379--2393 (2022; Zbl 07567468) Full Text: DOI arXiv
Eto, Hiroshi; Ito, Takehiro; Kobayashi, Yasuaki; Otachi, Yota; Wasa, Kunihiro Reconfiguration of regular induced subgraphs. (English) Zbl 07556559 Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 35-46 (2022). MSC: 68Wxx PDFBibTeX XMLCite \textit{H. Eto} et al., Lect. Notes Comput. Sci. 13174, 35--46 (2022; Zbl 07556559) Full Text: DOI arXiv
Gima, Tatsuya; Hanaka, Tesshu; Kiyomi, Masashi; Kobayashi, Yasuaki; Otachi, Yota Exploring the gap between treedepth and vertex cover through vertex integrity. (English) Zbl 07524431 Theor. Comput. Sci. 918, 60-76 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{T. Gima} et al., Theor. Comput. Sci. 918, 60--76 (2022; Zbl 07524431) Full Text: DOI arXiv
Aoike, Yuuki; Gima, Tatsuya; Hanaka, Tesshu; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Kurita, Kazuhiro; Otachi, Yota An improved deterministic parameterized algorithm for cactus vertex deletion. (English) Zbl 1487.05250 Theory Comput. Syst. 66, No. 2, 502-515 (2022). MSC: 05C85 05C40 68Q25 68W25 PDFBibTeX XMLCite \textit{Y. Aoike} et al., Theory Comput. Syst. 66, No. 2, 502--515 (2022; Zbl 1487.05250) Full Text: DOI arXiv
Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; Uno, Yushi Linear-time recognition of double-threshold graphs. (English) Zbl 07495638 Algorithmica 84, No. 4, 1163-1181 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{Y. Kobayashi} et al., Algorithmica 84, No. 4, 1163--1181 (2022; Zbl 07495638) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07495627 Algorithmica 84, No. 4, 871-895 (2022). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 84, No. 4, 871--895 (2022; Zbl 07495627) Full Text: DOI
Kanzaki, Masaaki; Otachi, Yota; Uehara, Ryuhei Computational complexity of jumping block puzzles. (English) Zbl 07670500 Chen, Chi-Yeh (ed.) et al., Computing and combinatorics. 27th international conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13025, 655-667 (2021). MSC: 68Rxx PDFBibTeX XMLCite \textit{M. Kanzaki} et al., Lect. Notes Comput. Sci. 13025, 655--667 (2021; Zbl 07670500) Full Text: DOI arXiv
Gima, Tatsuya; Hanaka, Tesshu; Kiyomi, Masashi; Kobayashi, Yasuaki; Otachi, Yota Exploring the gap between treedepth and vertex cover through vertex integrity. (English) Zbl 07667136 Calamoneri, Tiziana (ed.) et al., Algorithms and complexity. 12th international conference, CIAC 2021, virtual event, May 10–12, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12701, 271-285 (2021). MSC: 68Wxx PDFBibTeX XMLCite \textit{T. Gima} et al., Lect. Notes Comput. Sci. 12701, 271--285 (2021; Zbl 07667136) Full Text: DOI
Kitamura, Naoki; Kitagawa, Hirotaka; Otachi, Yota; Izumi, Taisuke Low-congestion shortcut and graph parameters. (English) Zbl 1522.68410 Distrib. Comput. 34, No. 5, 349-365 (2021). MSC: 68R10 68W15 PDFBibTeX XMLCite \textit{N. Kitamura} et al., Distrib. Comput. 34, No. 5, 349--365 (2021; Zbl 1522.68410) Full Text: DOI arXiv
Jakovac, Marko; Otachi, Yota On the security number of the Cartesian product of graphs. (English) Zbl 1473.05256 Discrete Appl. Math. 304, 119-128 (2021). MSC: 05C76 68R10 PDFBibTeX XMLCite \textit{M. Jakovac} and \textit{Y. Otachi}, Discrete Appl. Math. 304, 119--128 (2021; Zbl 1473.05256) Full Text: DOI
Kobayashi, Yasuaki; Otachi, Yota Parameterized complexity of graph burning. (English) Zbl 07764112 Cao, Yixin (ed.) et al., 15th international symposium on parameterized and exact computation, IPEC 2020, Hong Kong, China, virtual conference, December 14–18, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 180, Article 21, 10 p. (2020). MSC: 68Q25 68Q27 68Wxx PDFBibTeX XMLCite \textit{Y. Kobayashi} and \textit{Y. Otachi}, LIPIcs -- Leibniz Int. Proc. Inform. 180, Article 21, 10 p. (2020; Zbl 07764112) Full Text: DOI
Belmonte, Rémy; Kim, Eun Jung; Lampis, Michael; Mitsou, Valia; Otachi, Yota Grundy distinguishes treewidth from pathwidth. (English) Zbl 07651153 Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 14, 19 p. (2020). MSC: 68Wxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 173, Article 14, 19 p. (2020; Zbl 07651153) Full Text: DOI
Belmonte, Rémy; Hanaka, Tesshu; Kanzaki, Masaaki; Kiyomi, Masashi; Kobayashi, Yasuaki; Kobayashi, Yusuke; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of \((A,\ell)\)-path packing. (English) Zbl 07600997 Gąsieniec, Leszek (ed.) et al., Combinatorial algorithms. 31st international workshop, IWOCA 2020, Bordeaux, France, June 8–10, 2020, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12126, 43-55 (2020). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 12126, 43--55 (2020; Zbl 07600997) Full Text: DOI arXiv
Bodlaender, Hans L.; Hanaka, Tesshu; Kobayashi, Yasuaki; Kobayashi, Yusuke; Okamoto, Yoshio; Otachi, Yota; van der Zanden, Tom C. Subgraph isomorphism on graph classes that exclude a substructure. (English) Zbl 1492.68102 Algorithmica 82, No. 12, 3566-3587 (2020). MSC: 68R10 05C60 05C83 68Q27 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 82, No. 12, 3566--3587 (2020; Zbl 1492.68102) Full Text: DOI arXiv
Belmonte, Rémy; Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Ono, Hirotaka; Otachi, Yota Parameterized complexity of safe set. (English) Zbl 1447.05200 J. Graph Algorithms Appl. 24, No. 3, 215-245 (2020). MSC: 05C99 05C85 68Q27 68R10 PDFBibTeX XMLCite \textit{R. Belmonte} et al., J. Graph Algorithms Appl. 24, No. 3, 215--245 (2020; Zbl 1447.05200) Full Text: DOI
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian Parameterized orientable deletion. (English) Zbl 1441.68186 Algorithmica 82, No. 7, 1909-1938 (2020). MSC: 68R10 05C20 68Q17 68Q27 68W25 68W40 PDFBibTeX XMLCite \textit{T. Hanaka} et al., Algorithmica 82, No. 7, 1909--1938 (2020; Zbl 1441.68186) Full Text: DOI arXiv Link
Conte, Alessio; Kanté, Mamadou Moustapha; Otachi, Yota; Uno, Takeaki; Wasa, Kunihiro Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph. (English) Zbl 1437.05102 Theor. Comput. Sci. 818, 2-11 (2020). MSC: 05C30 05C60 05C05 05C42 PDFBibTeX XMLCite \textit{A. Conte} et al., Theor. Comput. Sci. 818, 2--11 (2020; Zbl 1437.05102) Full Text: DOI
Kawamura, Akitoshi; Moriyama, Sonoko; Otachi, Yota; Pach, János A lower bound on opaque sets. (English) Zbl 1428.52003 Comput. Geom. 80, 13-22 (2019). Reviewer: Pedro Martín Jiménez (Badajoz) MSC: 52A10 PDFBibTeX XMLCite \textit{A. Kawamura} et al., Comput. Geom. 80, 13--22 (2019; Zbl 1428.52003) Full Text: DOI Link
Ito, Takehiro; Otachi, Yota Reconfiguration of colorable sets in classes of perfect graphs. (English) Zbl 1421.68135 Theor. Comput. Sci. 772, 111-122 (2019). MSC: 68R10 05C15 05C17 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Ito} and \textit{Y. Otachi}, Theor. Comput. Sci. 772, 111--122 (2019; Zbl 1421.68135) Full Text: DOI arXiv Link
Klavík, Pavel; Otachi, Yota; Šejnoha, Jiří On the classes of interval graphs of limited nesting and count of lengths. (English) Zbl 1423.05109 Algorithmica 81, No. 4, 1490-1511 (2019). MSC: 05C62 05C85 PDFBibTeX XMLCite \textit{P. Klavík} et al., Algorithmica 81, No. 4, 1490--1511 (2019; Zbl 1423.05109) Full Text: DOI Link
Belmonte, Rémy; Ghadikolaei, Mehdi Khosravian; Kiyomi, Masashi; Lampis, Michael; Otachi, Yota How bad is the freedom to Flood-It? (English) Zbl 1405.05112 J. Graph Algorithms Appl. 23, No. 2, 111-134 (2019). MSC: 05C57 05C85 91A46 91A43 PDFBibTeX XMLCite \textit{R. Belmonte} et al., J. Graph Algorithms Appl. 23, No. 2, 111--134 (2019; Zbl 1405.05112) Full Text: DOI arXiv
Cao, Yixin; Ke, Yuping; Otachi, Yota; You, Jie Vertex deletion problems on chordal graphs. (English) Zbl 1491.68084 Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 22, 14 p. (2018). MSC: 68Q25 05C85 68Q17 68R10 PDFBibTeX XMLCite \textit{Y. Cao} et al., LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 22, 14 p. (2018; Zbl 1491.68084) Full Text: DOI
Ito, Takehiro; Otachi, Yota Reconfiguration of colorable sets in classes of perfect graphs. (English) Zbl 1477.68231 Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 27, 13 p. (2018). MSC: 68R10 05C15 05C17 68Q17 68Q25 PDFBibTeX XMLCite \textit{T. Ito} and \textit{Y. Otachi}, LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 27, 13 p. (2018; Zbl 1477.68231) Full Text: DOI
Hanaka, Tesshu; Katsikarelis, Ioannis; Lampis, Michael; Otachi, Yota; Sikora, Florian Parameterized orientable deletion. (English) Zbl 1477.68229 Eppstein, David (ed.), 16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 101, Article 24, 13 p. (2018). MSC: 68R10 05C20 68Q17 68Q27 68W25 68W40 PDFBibTeX XMLCite \textit{T. Hanaka} et al., LIPIcs -- Leibniz Int. Proc. Inform. 101, Article 24, 13 p. (2018; Zbl 1477.68229) Full Text: DOI
Belmonte, Rémy; Khosravian Ghadikolaei, Mehdi; Kiyomi, Masashi; Lampis, Michael; Otachi, Yota How bad is the freedom to Flood-It? (English) Zbl 1489.05102 Ito, Hiro (ed.) et al., 9th international conference on fun with algorithms, FUN 2018, June 13–15, 2018, La Maddalena Island, Italy. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 100, Article 5, 13 p. (2018). MSC: 05C57 05C85 68Q27 PDFBibTeX XMLCite \textit{R. Belmonte} et al., LIPIcs -- Leibniz Int. Proc. Inform. 100, Article 5, 13 p. (2018; Zbl 1489.05102) Full Text: DOI
Águeda, Raquel; Cohen, Nathann; Fujita, Shinya; Legay, Sylvain; Manoussakis, Yannis; Matsui, Yasuko; Montero, Leandro; Naserasr, Reza; Ono, Hirotaka; Otachi, Yota; Sakuma, Tadashi; Tuza, Zsolt; Xu, Renyu Safe sets in graphs: graph classes and structural parameters. (English) Zbl 1412.90156 J. Comb. Optim. 36, No. 4, 1221-1242 (2018). MSC: 90C35 PDFBibTeX XMLCite \textit{R. Águeda} et al., J. Comb. Optim. 36, No. 4, 1221--1242 (2018; Zbl 1412.90156) Full Text: DOI HAL
Cao, Yixin; Ke, Yuping; Otachi, Yota; You, Jie Vertex deletion problems on chordal graphs. (English) Zbl 1401.68114 Theor. Comput. Sci. 745, 75-86 (2018). MSC: 68Q25 05C85 68R10 PDFBibTeX XMLCite \textit{Y. Cao} et al., Theor. Comput. Sci. 745, 75--86 (2018; Zbl 1401.68114) Full Text: DOI arXiv Link
Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity. (English) Zbl 1393.68067 Algorithmica 80, No. 7, 2160-2180 (2018). MSC: 68Q25 05C07 05C20 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 80, No. 7, 2160--2180 (2018; Zbl 1393.68067) Full Text: DOI Link
Belmonte, Rémy; Otachi, Yota; Schweitzer, Pascal Induced minor free graphs: isomorphism and clique-width. (English) Zbl 1380.05183 Algorithmica 80, No. 1, 29-47 (2018). MSC: 05C83 05C60 05C69 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Algorithmica 80, No. 1, 29--47 (2018; Zbl 1380.05183) Full Text: DOI arXiv
Kiyomi, Masashi; Otachi, Yota Alliances in graphs of bounded clique-width. (English) Zbl 1465.05178 Discrete Appl. Math. 223, 91-97 (2017). MSC: 05C85 05C70 05C69 68Q17 PDFBibTeX XMLCite \textit{M. Kiyomi} and \textit{Y. Otachi}, Discrete Appl. Math. 223, 91--97 (2017; Zbl 1465.05178) Full Text: DOI
Klavík, Pavel; Kratochvíl, Jan; Otachi, Yota; Rutter, Ignaz; Saitoh, Toshiki; Saumell, Maria; Vyskočil, Tomáš Extending partial representations of proper and unit interval graphs. (English) Zbl 1360.05167 Algorithmica 77, No. 4, 1071-1104 (2017). MSC: 05C85 05C62 68Q17 PDFBibTeX XMLCite \textit{P. Klavík} et al., Algorithmica 77, No. 4, 1071--1104 (2017; Zbl 1360.05167) Full Text: DOI arXiv
Hayashi, Takashi; Kawamura, Akitoshi; Otachi, Yota; Shinohara, Hidehiro; Yamazaki, Koichi Thin strip graphs. (English) Zbl 1350.05122 Discrete Appl. Math. 216, Part 1, 203-210 (2017). MSC: 05C69 PDFBibTeX XMLCite \textit{T. Hayashi} et al., Discrete Appl. Math. 216, Part 1, 203--210 (2017; Zbl 1350.05122) Full Text: DOI
Chaplick, Steven; Hell, Pavol; Otachi, Yota; Saitoh, Toshiki; Uehara, Ryuhei Ferrers dimension of grid intersection graphs. (English) Zbl 1350.05142 Discrete Appl. Math. 216, Part 1, 130-135 (2017). MSC: 05C75 05C99 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Discrete Appl. Math. 216, Part 1, 130--135 (2017; Zbl 1350.05142) Full Text: DOI
Águeda, Raquel; Cohen, Nathann; Fujita, Shinya; Legay, Sylvain; Manoussakis, Yannis; Matsui, Yasuko; Montero, Leandro; Naserasr, Reza; Otachi, Yota; Sakuma, Tadashi; Tuza, Zsolt; Xu, Renyu Safe sets in graphs: graph classes and structural parameters. (English) Zbl 1483.68245 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 241-253 (2016). MSC: 68R10 05C69 05C85 68Q25 68Q27 PDFBibTeX XMLCite \textit{R. Águeda} et al., Lect. Notes Comput. Sci. 10043, 241--253 (2016; Zbl 1483.68245) Full Text: DOI HAL
Belmonte, Rémy; Otachi, Yota; Schweitzer, Pascal Induced minor free graphs: isomorphism and clique-width. (English) Zbl 1417.05196 Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 299-311 (2016). MSC: 05C83 05C60 05C69 PDFBibTeX XMLCite \textit{R. Belmonte} et al., Lect. Notes Comput. Sci. 9224, 299--311 (2016; Zbl 1417.05196) Full Text: DOI arXiv
Kiyomi, Masashi; Otachi, Yota Finding a chain graph in a bipartite permutation graph. (English) Zbl 1358.05283 Inf. Process. Lett. 116, No. 9, 569-573 (2016). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{M. Kiyomi} and \textit{Y. Otachi}, Inf. Process. Lett. 116, No. 9, 569--573 (2016; Zbl 1358.05283) Full Text: DOI
Ito, Takehiro; Nakano, Shin-ichi; Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki; Uno, Yushi A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. (English) Zbl 1333.65021 Comput. Geom. 51, 25-39 (2016). Reviewer: Laurian Ioan Piscoran (Baia Mare) MSC: 65D18 PDFBibTeX XMLCite \textit{T. Ito} et al., Comput. Geom. 51, 25--39 (2016; Zbl 1333.65021) Full Text: DOI
Konagaya, Matsuo; Otachi, Yota; Uehara, Ryuhei Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs. (English) Zbl 1326.05095 Discrete Appl. Math. 199, 37-45 (2016). MSC: 05C60 05C17 05C85 68Q17 PDFBibTeX XMLCite \textit{M. Konagaya} et al., Discrete Appl. Math. 199, 37--45 (2016; Zbl 1326.05095) Full Text: DOI
Kiyomi, Masashi; Okamoto, Yoshio; Otachi, Yota On the treewidth of toroidal grids. (English) Zbl 1327.05091 Discrete Appl. Math. 198, 303-306 (2016). MSC: 05C12 05C05 PDFBibTeX XMLCite \textit{M. Kiyomi} et al., Discrete Appl. Math. 198, 303--306 (2016; Zbl 1327.05091) Full Text: DOI
Demaine, Erik D.; Demaine, Martin L.; Fox-Epstein, Eli; Hoang, Duc A.; Ito, Takehiro; Ono, Hirotaka; Otachi, Yota; Uehara, Ryuhei; Yamada, Takeshi Linear-time algorithm for sliding tokens on trees. (English) Zbl 1329.68135 Theor. Comput. Sci. 600, 132-142 (2015). MSC: 68Q25 05C05 05C69 05C85 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Theor. Comput. Sci. 600, 132--142 (2015; Zbl 1329.68135) Full Text: DOI arXiv
Matsushita, Masayoshi; Otachi, Yota; Araki, Toru Completely independent spanning trees in (partial) \(k\)-trees. (English) Zbl 1317.05029 Discuss. Math., Graph Theory 35, No. 3, 427-437 (2015). MSC: 05C05 05C38 PDFBibTeX XMLCite \textit{M. Matsushita} et al., Discuss. Math., Graph Theory 35, No. 3, 427--437 (2015; Zbl 1317.05029) Full Text: DOI
Klavík, Pavel; Kratochvíl, Jan; Otachi, Yota; Saitoh, Toshiki Extending partial representations of subclasses of chordal graphs. (English) Zbl 1311.05133 Theor. Comput. Sci. 576, 85-101 (2015). MSC: 05C62 PDFBibTeX XMLCite \textit{P. Klavík} et al., Theor. Comput. Sci. 576, 85--101 (2015; Zbl 1311.05133) Full Text: DOI
Chun, Jinhee; Horiyama, Takashi; Ito, Takehiro; Kaothanthong, Natsuda; Ono, Hirotaka; Otachi, Yota; Tokuyama, Takeshi; Uehara, Ryuhei; Uno, Takeaki Base-object location problems for base-monotone regions. (English) Zbl 1360.68871 Theor. Comput. Sci. 555, 71-84 (2014). MSC: 68U05 68Q25 68U10 PDFBibTeX XMLCite \textit{J. Chun} et al., Theor. Comput. Sci. 555, 71--84 (2014; Zbl 1360.68871) Full Text: DOI
Li, Meng; Otachi, Yota; Tokuyama, Takeshi Efficient algorithms for network localization using cores of underlying graphs. (English) Zbl 1360.68649 Theor. Comput. Sci. 553, 18-26 (2014). MSC: 68R10 05C62 05C69 05C85 PDFBibTeX XMLCite \textit{M. Li} et al., Theor. Comput. Sci. 553, 18--26 (2014; Zbl 1360.68649) Full Text: DOI
Kozawa, Kyohei; Otachi, Yota; Yamazaki, Koichi Lower bounds for treewidth of product graphs. (English) Zbl 1300.05270 Discrete Appl. Math. 162, 251-258 (2014). MSC: 05C76 PDFBibTeX XMLCite \textit{K. Kozawa} et al., Discrete Appl. Math. 162, 251--258 (2014; Zbl 1300.05270) Full Text: DOI
Otachi, Yota; Saitoh, Toshiki; Yamanaka, Katsuhisa; Kijima, Shuji; Okamoto, Yoshio; Ono, Hirotaka; Uno, Yushi; Yamazaki, Koichi Approximating the path-distance-width for AT-free graphs and graphs in related classes. (English) Zbl 1285.05048 Discrete Appl. Math. 168, 69-77 (2014). MSC: 05C12 68R10 68W25 68Q17 PDFBibTeX XMLCite \textit{Y. Otachi} et al., Discrete Appl. Math. 168, 69--77 (2014; Zbl 1285.05048) Full Text: DOI
Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; van Leeuwen, Erik Jan Parameterized complexity of the spanning tree congestion problem. (English) Zbl 1253.68163 Algorithmica 64, No. 1, 85-111 (2012). MSC: 68Q25 68Q17 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Algorithmica 64, No. 1, 85--111 (2012; Zbl 1253.68163) Full Text: DOI
Kijima, Shuji; Otachi, Yota; Saitoh, Toshiki; Uno, Takeaki Subgraph isomorphism in graph classes. (English) Zbl 1251.05109 Discrete Math. 312, No. 21, 3164-3173 (2012). MSC: 05C60 05C75 05C85 PDFBibTeX XMLCite \textit{S. Kijima} et al., Discrete Math. 312, No. 21, 3164--3173 (2012; Zbl 1251.05109) Full Text: DOI
Yamanaka, Katsuhisa; Otachi, Yota; Nakano, Shin-Ichi Efficient enumeration of ordered trees with \(k\) leaves. (English) Zbl 1246.05077 Theor. Comput. Sci. 442, 22-27 (2012). MSC: 05C30 05C85 05C05 PDFBibTeX XMLCite \textit{K. Yamanaka} et al., Theor. Comput. Sci. 442, 22--27 (2012; Zbl 1246.05077) Full Text: DOI
Saitoh, Toshiki; Otachi, Yota; Yamanaka, Katsuhisa; Uehara, Ryuhei Random generation and enumeration of bipartite permutation graphs. (English) Zbl 1241.05050 J. Discrete Algorithms 10, 84-97 (2012). MSC: 05C30 05C70 05C60 PDFBibTeX XMLCite \textit{T. Saitoh} et al., J. Discrete Algorithms 10, 84--97 (2012; Zbl 1241.05050) Full Text: DOI
Otachi, Yota; Saitoh, Toshiki; Yamanaka, Katsuhisa; Kijima, Shuji; Okamoto, Yoshio; Ono, Hirotaka; Uno, Yushi; Yamazaki, Koichi Approximability of the path-distance-width for AT-free graphs. (English) Zbl 1341.05054 Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 271-282 (2011). MSC: 05C12 05C38 68Q17 PDFBibTeX XMLCite \textit{Y. Otachi} et al., Lect. Notes Comput. Sci. 6986, 271--282 (2011; Zbl 1341.05054) Full Text: DOI
Okamoto, Yoshio; Otachi, Yota; Uehara, Ryuhei; Uno, Takeaki Hardness results and an exact exponential algorithm for the spanning tree congestion problem. (English) Zbl 1331.68094 Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 452-462 (2011). MSC: 68Q17 05C85 68Q25 68R10 68W25 PDFBibTeX XMLCite \textit{Y. Okamoto} et al., Lect. Notes Comput. Sci. 6648, 452--462 (2011; Zbl 1331.68094) Full Text: DOI
Bodlaender, Hans L.; Kozawa, Kyohei; Matsushima, Takayoshi; Otachi, Yota Spanning tree congestion of \(k\)-outerplanar graphs. (English) Zbl 1223.05017 Discrete Math. 311, No. 12, 1040-1045 (2011). MSC: 05C05 68R10 PDFBibTeX XMLCite \textit{H. L. Bodlaender} et al., Discrete Math. 311, No. 12, 1040--1045 (2011; Zbl 1223.05017) Full Text: DOI
Otachi, Yota; Suda, Ryohei Bandwidth and pathwidth of three-dimensional grids. (English) Zbl 1223.05142 Discrete Math. 311, No. 10-11, 881-887 (2011). MSC: 05C38 05C40 PDFBibTeX XMLCite \textit{Y. Otachi} and \textit{R. Suda}, Discrete Math. 311, No. 10--11, 881--887 (2011; Zbl 1223.05142) Full Text: DOI
Otachi, Yota; Bodlaender, Hans L.; van Leeuwen, Erik Jan Complexity results for the spanning tree congestion problem. (English) Zbl 1308.68067 Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 3-14 (2010). MSC: 68Q25 05C05 05C10 68Q17 PDFBibTeX XMLCite \textit{Y. Otachi} et al., Lect. Notes Comput. Sci. 6410, 3--14 (2010; Zbl 1308.68067) Full Text: DOI
Kozawa, Kyohei; Otachi, Yota; Yamazaki, Koichi The carving-width of generalized hypercubes. (English) Zbl 1222.05041 Discrete Math. 310, No. 21, 2867-2876 (2010). MSC: 05C12 05C65 05C70 PDFBibTeX XMLCite \textit{K. Kozawa} et al., Discrete Math. 310, No. 21, 2867--2876 (2010; Zbl 1222.05041) Full Text: DOI
Kozawa, Kyohei; Otachi, Yota; Yamazaki, Koichi Security number of grid-like graphs. (English) Zbl 1211.05118 Discrete Appl. Math. 157, No. 11, 2555-2561 (2009). MSC: 05C69 PDFBibTeX XMLCite \textit{K. Kozawa} et al., Discrete Appl. Math. 157, No. 11, 2555--2561 (2009; Zbl 1211.05118) Full Text: DOI
Kozawa, Kyohei; Otachi, Yota; Yamazaki, Koichi On spanning tree congestion of graphs. (English) Zbl 1232.05116 Discrete Math. 309, No. 13, 4215-4224 (2009). MSC: 05C40 05C05 PDFBibTeX XMLCite \textit{K. Kozawa} et al., Discrete Math. 309, No. 13, 4215--4224 (2009; Zbl 1232.05116) Full Text: DOI
Yamanaka, Katsuhisa; Otachi, Yota; Nakano, Shin-ichi Efficient enumeration of ordered trees with \(k\) leaves (extended abstract). (English) Zbl 1211.05170 Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 141-150 (2009). MSC: 05C85 05C05 05C30 68Q25 PDFBibTeX XMLCite \textit{K. Yamanaka} et al., Lect. Notes Comput. Sci. 5431, 141--150 (2009; Zbl 1211.05170) Full Text: DOI
Ishizeki, Tetsuya; Otachi, Yota; Yamazaki, Koichi An improved algorithm for the longest induced path problem on \(k\)-chordal graphs. (English) Zbl 1186.05114 Discrete Appl. Math. 156, No. 15, 3057-3059 (2008). MSC: 05C85 05C35 05C38 68R10 PDFBibTeX XMLCite \textit{T. Ishizeki} et al., Discrete Appl. Math. 156, No. 15, 3057--3059 (2008; Zbl 1186.05114) Full Text: DOI
Otachi, Yota; Yamazaki, Koichi A lower bound for the vertex boundary-width of complete \(k\)-ary trees. (English) Zbl 1145.05031 Discrete Math. 308, No. 12, 2389-2395 (2008). Reviewer: William G. Brown (Montréal) MSC: 05C35 05C05 05C12 PDFBibTeX XMLCite \textit{Y. Otachi} and \textit{K. Yamazaki}, Discrete Math. 308, No. 12, 2389--2395 (2008; Zbl 1145.05031) Full Text: DOI
Otachi, Yota; Okamoto, Yoshio; Yamazaki, Koichi Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. (English) Zbl 1128.05036 Discrete Appl. Math. 155, No. 17, 2383-2390 (2007). MSC: 05C50 PDFBibTeX XMLCite \textit{Y. Otachi} et al., Discrete Appl. Math. 155, No. 17, 2383--2390 (2007; Zbl 1128.05036) Full Text: DOI