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
Uehara, Ryuhei The graph isomorphism problem on geometric graphs. (English) Zbl 1301.05236 Discrete Math. Theor. Comput. Sci. 16, No. 2, 87-96 (2014). MSC: 05C60 68Q25 PDFBibTeX XMLCite \textit{R. Uehara}, Discrete Math. Theor. Comput. Sci. 16, No. 2, 87--96 (2014; Zbl 1301.05236) Full Text: Link
Konagaya, Matsuo; Otachi, Yota; Uehara, Ryuhei Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs. (English) Zbl 1406.05104 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 11th annual conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-06088-0/pbk). Lecture Notes in Computer Science 8402, 216-228 (2014). MSC: 05C85 05C17 05C60 68Q17 68Q25 PDFBibTeX XMLCite \textit{M. Konagaya} et al., Lect. Notes Comput. Sci. 8402, 216--228 (2014; Zbl 1406.05104) Full Text: DOI
Ito, Takehiro; Miyamoto, Yuichiro; Ono, Hirotaka; Tamaki, Hisao; Uehara, Ryuhei Route-enabling graph orientation problems. (English) Zbl 1259.68079 Algorithmica 65, No. 2, 317-338 (2013). MSC: 68Q17 05C60 05C10 05C85 90C35 68W25 PDFBibTeX XMLCite \textit{T. Ito} et al., Algorithmica 65, No. 2, 317--338 (2013; Zbl 1259.68079) 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
Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei Bipartite permutation graphs are reconstructible. (English) Zbl 1258.05082 Wu, Weili (ed.) et al., Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18–20, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17460-5/pbk). Lecture Notes in Computer Science 6509, 362-373 (2010). Reviewer: Bernd Schroeder (Ruston) MSC: 05C60 05A05 PDFBibTeX XMLCite \textit{M. Kiyomi} et al., Lect. Notes Comput. Sci. 6509, 362--373 (2010; Zbl 1258.05082) Full Text: DOI
Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei Reconstruction of interval graphs. (English) Zbl 1198.05114 Theor. Comput. Sci. 411, No. 43, 3859-3866 (2010). MSC: 05C60 05C85 PDFBibTeX XMLCite \textit{M. Kiyomi} et al., Theor. Comput. Sci. 411, No. 43, 3859--3866 (2010; Zbl 1198.05114) Full Text: DOI
Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei Reconstruction algorithm for permutation graphs. (English) Zbl 1274.05451 Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10–12, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11439-7/pbk). Lecture Notes in Computer Science 5942, 125-135 (2010). MSC: 05C85 05C60 PDFBibTeX XMLCite \textit{M. Kiyomi} et al., Lect. Notes Comput. Sci. 5942, 125--135 (2010; Zbl 1274.05451) Full Text: DOI
Kiyomi, Masashi; Saitoh, Toshiki; Uehara, Ryuhei Reconstruction of interval graphs. (English) Zbl 1248.05125 Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 106-115 (2009). MSC: 05C60 05C62 05C85 68Q25 PDFBibTeX XMLCite \textit{M. Kiyomi} et al., Lect. Notes Comput. Sci. 5609, 106--115 (2009; Zbl 1248.05125) Full Text: DOI
Uehara, Ryuhei; Uno, Yushi Laminar structure of ptolemaic graphs with applications. (English) Zbl 1177.05122 Discrete Appl. Math. 157, No. 7, 1533-1543 (2009). MSC: 05C85 05C45 05C60 05C62 PDFBibTeX XMLCite \textit{R. Uehara} and \textit{Y. Uno}, Discrete Appl. Math. 157, No. 7, 1533--1543 (2009; Zbl 1177.05122) 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