Yamada, Takeshi; Uehara, Ryuhei Shortest reconfiguration of sliding tokens on subclasses of interval graphs. (English) Zbl 1497.68399 Theor. Comput. Sci. 863, 53-68 (2021). MSC: 68R10 05C62 05C69 68W40 PDFBibTeX XMLCite \textit{T. Yamada} and \textit{R. Uehara}, Theor. Comput. Sci. 863, 53--68 (2021; Zbl 1497.68399) 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
Yamada, Takeshi; Uehara, Ryuhei Shortest reconfiguration of sliding tokens on a caterpillar. (English) Zbl 1475.68254 Kaykobad, Mohammad (ed.) et al., WALCOM: algorithms and computation. 10th international workshop, WALCOM 2016, Kathmandu, Nepal, March 29–31, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9627, 236-248 (2016). MSC: 68R10 05C69 68W40 PDFBibTeX XMLCite \textit{T. Yamada} and \textit{R. Uehara}, Lect. Notes Comput. Sci. 9627, 236--248 (2016; Zbl 1475.68254) Full Text: DOI arXiv
Uehara, Ryuhei Tractabilities and intractabilities on geometric intersection graphs. (English) Zbl 1461.05148 Algorithms (Basel) 6, No. 1, 60-83 (2013). MSC: 05C62 PDFBibTeX XMLCite \textit{R. Uehara}, Algorithms (Basel) 6, No. 1, 60--83 (2013; Zbl 1461.05148) Full Text: DOI
Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei Bipartite permutation graphs are reconstructible. (English) Zbl 1255.05122 Discrete Math. Algorithms Appl. 4, No. 3, 1250039, 14 p. (2012). MSC: 05C60 05C75 PDFBibTeX XMLCite \textit{M. Kiyomi} et al., Discrete Math. Algorithms Appl. 4, No. 3, 1250039, 14 p. (2012; Zbl 1255.05122) 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
Saitoh, Toshiki; Yamanaka, Katsuhisa; Kiyomi, Masashi; Uehara, Ryuhei Random generation and enumeration of proper interval graphs. (English) Zbl 1211.68291 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, 177-189 (2009). MSC: 68R10 05C30 05C85 PDFBibTeX XMLCite \textit{T. Saitoh} et al., Lect. Notes Comput. Sci. 5431, 177--189 (2009; Zbl 1211.68291) Full Text: DOI
Uehara, Ryuhei Simple geometrical intersection graphs. (English) Zbl 1132.05320 Nakano, Shin-ichi (ed.) et al., WALCOM: Algorithms and computation. Second international workshop, WALCOM 2008, Dhaka, Bangladesh, February 7–8, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77890-5/pbk). Lecture Notes in Computer Science 4921, 25-33 (2008). MSC: 05C62 05C38 05C60 68R10 PDFBibTeX XMLCite \textit{R. Uehara}, Lect. Notes Comput. Sci. 4921, 25--33 (2008; Zbl 1132.05320) Full Text: DOI
Uehara, Ryuhei; Toda, Seinosuke; Nagoya, Takayuki Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs. (English) Zbl 1056.05099 Discrete Appl. Math. 145, No. 3, 479-482 (2005). MSC: 05C60 PDFBibTeX XMLCite \textit{R. Uehara} et al., Discrete Appl. Math. 145, No. 3, 479--482 (2005; Zbl 1056.05099) Full Text: DOI