Home｜
Profile｜
**Research**｜
Education｜
Computer｜
Hobbies｜
Links｜
Update｜
Site Map

Books

- Hiro Ito, Mikio Kano, Naoki Katoh and Yushi Uno (eds.).

Combinatorial Geometry and Graph Theory (KyotoCGGT 2007), Lecture Notes in Computer Science, Vol. 4535, ISBN: 978-3-540-89549-7.

Springer, 2008.

Recent Publications

- Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

(Total) Vector domination for graphs with bounded branchwidth.

Lecture Notes in Computer Science, Vol. 8392, pp. 238--249, Springer, 2014.

- Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno and Yushi Uno.

UNO is hard, even for a single player.

Theoretical Computer Science, Vol. 521, pp. 51--61, 2014.

- Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno.

On complexity of flooding games on graphs with interval representations.

Lecture Notes in Computer Science, Vol. 8296, pp. 72--84, Springer, 2013.

- Yushi Uno and Fumiya Oguri.

Contracted webgraphs---scale-freeness and structure mining---.

IEICE Transactions on Information and Network Science (Special Section on Progress in Information Network Science), Vol. E96-B(11), pp. 2766--2773, 2013.

- Yoshio Okamoto, Yuichi Tatsu and Yushi Uno.

Exact and fixed-parameter algorithms for metro-line crossing minimization problems.

Lecture Notes in Computer Science, Vol. 8242, pp. 271--282, Springer, 2013.

- Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno and Masahide Yamato.

Morpion Solitaire 5D: a new upper bound of 121 on the maximum score.

Proceedings of the 25th Canadian Conference on Computational Geometry, pp. 25--29, 2013.

- Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara and Yushi Uno.

Computational complexity and an integer programming model of Shakashaka.

Proceedings of the 25th Canadian Conference on Computational Geometry, pp. 31--36, 2013.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

A linear time algorithm for $L(2.1)$-labeling of trees.

Algorithmica, Vol. 66(3), pp. 654--681, 2013.

- Yuki Hagiwara, Takashi Horiyama and Yushi Uno.

ZDD-based approach to solving Tantrix.

Proceedings of the 6th Asian Association for Algorithms and Computation Meeting}, p. 15, 2013.

- Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno.

A 4.31 approximation for the geometric unique coverage problem on unit disks.

Lecture Notes in Computer Science, Vol. 7676, pp. 271--282, Springer, 2012.

- Takehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno.

A polynomial-time approximation scheme for the gemoetric unique coverage problem on unit squares.

Lecture Notes in Computer Science, Vol. 7357, pp. 24--35, Springer, 2012.

- Fumika Kino and Yushi Uno.

Solving Tantrix via integer programming.

Lecture Notes in Computer Science, Vol. 7288, pp. 271--282, E. Kranakis, D. Krizanc and F. Luccio (Eds.), Springer, 2012.

- Fumika Kino and Yushi Uno.

An integer programming approach to solving Tantrix on fixed boards.

Algorithms, Vol. 5 (1), pp. 158--175, 2012.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

The (p,q)-total labeling problem for trees.

Discrete Mathematics, Vol. 312, pp. 1407--1420, 2012.

- Yota Otachi, Toshiki Saito, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Takahiro Ono, Yushi Uno and Koichi Yamazaki.

Approximability of the path-distance-width for AT-free graphs.

Lecture Notes in Computer Science, Vol. 6986, pp. 271--282, P. Kolman and J. Kratochv\'{i}l (Eds.), Springer, 2011.

- Hiroyuki Fukui, Akihiro Nakanishi, Ryuhei Uehara, Takeaki Uno and Yushi Uno.

The complexity of Free Flood Filling games.

Proceedings of the 14th Korea-Japan Joint Workshop on Algorithms and Computation, p. 51--56, 2011.

- Yushi Uno and Fumiya Oguri.

Contracted webgraphs: structure mining and scale-freeness.

Lecture Notes in Computer Science, Vol. 6681, pp. 287--299, M. Atallah, X.-Y. Li and B. Zhu (Eds.), Springer, 2011.

- Takeya Shigezumi, Yushi Uno and Osamu Watanabe.

A new model for a scale-free hierarchical structure of isolated cliques.

Journal of Graph Algorithms and Applications, Vol. 15 (5), pp . 661--682, 2011.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

The $(2,1)$-total labeling number of outerplanar graphs is at most $\Delta+2$.

Lecture Notes in Computer Science, Vol. 6460, pp. 103--106, C. S.Iliopoulos and W. F. Smyth (Eds.), Springer, 2011.

- Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno.

On the complexity of reconfiguration problems.

Theoretical Computer Science, Vol. 412, pp. 1054--1065, 2011.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

The $(p,q)$-total labeling problem for trees.

Lecture Notes in Computer Science, Vol. 6507, pp. 49--60, O. Cheong, K. Y. Chwa and K. Park (Eds.), Springer, 2010.

- Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno and Yushi Uno.

UNO is hard, even for a single player.

Lecture Notes in Computer Science, Vol. 6099, pp. 133--144, P. Boldi and L. Gargano (Eds.), Springer, 2010.

- Takeya Shigezumi, Yushi Uno and Osamu Watanabe.

A new model for a scale-free hierarchical structure of isolated cliques.

Lecture Notes in Computer Science, Vol. 5942, pp. 216--227, R. Md. Saidur and S. Fujita (Eds.), Springer, 2010.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

Recent advances on the L(2,1)-labeling problem.

Proceedings of the 7th Japan Conference on Computational Geometry and Graphs, pp. 71--72, 2009.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

A linear time algorithm for L(2,1)-labeling of trees.

Lecture Notes in Computer Science, Vol. 5757, pp. 35--46, A. Fiat and P. Sanders (Eds.), Springer, 2009.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

An O(n^{1.75}) algorithm for L(2,1)-labeling of trees.

Theoretical Computer Science, Vol. 410, pp. 3702--3710, 2009.

- Takeya Shigezumi, Yushi Uno and Osamu Watanabe.

A replacement model for a scale-free property of cliques.

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization}, pp. 285--289, 2009.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

A faster algorithm for L(2,1)-labeling of trees.

Proceedings of the 2nd Asian Association for Algorithms and Computation Meeting, p. 12, 2009.

- Ryuhei Uehara and Yushi Uno.

Laminar structure of Ptolemaic graphs with applications.

Discrete Applied Mathematics, Vol. 157 (7), pp. 1533--1543, 2009.

- Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara and Yushi Uno.

On the complexity of reconfiguration problems.

Lecture Notes in Computer Science, Vol. 5369, pp. 28--39, S.-H. Hong, et al. (Eds.), Springer, 2008.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

An O(n log^2 n) algorithm for L(2,1)-labeling of trees.

Proceedings of the 7th Forum on Information Technology, pp. 5--6, 2008.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

An O(n^{1.75}) algorithm for L(2,1)-labeling of trees.

Lecture Notes in Computer Science, Vol. 5124, pp. 185--197, J. Gudmundsson (Ed.), Springer, 2008.

- Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno.

An efficient algorithm for L(2,1)-labeling of trees.

Proceedings of the 1st Asian Association for Algorithms and Computation Meeting}, p. 22, 2008.

- Yushi Uno, Yoshinobu Ota and Akio Uemichi.

Web structure mining by isolated stars.

Lecture Notes in Computer Science, Vol. 4936, pp. 149--156, W. Aiello, A. Broder, J. Janssen and E. Milios (Eds.), Springer, 2008.

- Yushi Uno, Yoshinobu Ota and Akio Uemichi.

Web structure mining by isolated cliques.

IEICE Transactions on Information and Systems, Vol. E90-D (12), pp. 1998--2006, 2007.

- Ryuhei Uehara and Yushi Uno.

On computing longest paths in small graph classes.

International Journal of Foundations of Computer Science, Vol. 18 (5), pp. 911--930, 2007.

- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki.

Minimum edge ranking spanning trees of split graphs.

Discrete Applied Mathematics, Vol. 154 (16), pp. 2373--2386, 2006.

- Yushi Uno, Yoshinobu Ota, Akio Uemichi and Motohide Umano.

Mining communities and detecting link farms in the Web by isolated cliques.

Knowledge and Decision Technologies, pp. 179--187, Z. Vale, C. Ramos and L. Faria (Eds.), 2006.

- Yushi Uno, Yoshinobu Ota, Akio Uemichi and Motohide Umano.

An experimental study of the webgraph ---structural properties and web mining---.

Proceedings of the 19th Workshop on Circuits and Systems, pp. 301--306, 2006.

- Ryuhei Uehara and Yushi Uno.

Laminar structure of Ptolemaic graphs and its applications.

Lecture Notes in Computer Science, Vol. 3827, pp. 186--195, X. Deng and D. Du (Eds.), Springer, 2005.- Ryuhei Uehara and Yushi Uno,

Efficient algorithms for the longest path problems,

Lecture Notes in Computer Science, Vol. 3341, 871-883, R. Fleischer and G. Trippen (Eds.), Springer, 2004.- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

Minimum edge ranking spannig trees of split graphs,

to appear in Discrete Applied Mathematics (DIMACS Technical Report 2003-27, 2003).- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

Minimum edge ranking spannig trees of threshold graphs,

Lecture Notes in Computer Science, Vol. 2518, 424-449, P. Bose and P. Morin (Eds.), Springer, 2002.- Motohide Umano, Yuji Matsumoto, Yushi Uno and Kazuhisa Seta,

Learning by switching generation and reasoning methods in several knowlege representation towards the simulation of hyman learning process, Proceedings of the 11th IEEE International Conference on Fuzzy Systems, 809-814, 2002.

- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

On minimum edge ranking spannig trees,

Journal of Algorithms 38, 411-437, 2001.- Deng Jianming, Motohide Umano, Tetsuhisa Oda and Yushi Uno,

Some properties of fuzzy logical operations in the two-dimensional logical space,

Proceedings of the 4th Asian Fuzzy Systems Symposium, 244-247, 2000.- Kazunori Hori, Hiroshi Satoh, Motohide Umano and Yushi Uno,

Fuzzy C4.5 for generating fuzzy decision trees and its improvement,

Proceedings of the 4th Asian Fuzzy Systems Symposium, 881-884, 2000.- Deng Jianming, Motohide Umano, Tetsuhisa Oda and Yushi Uno,

Properties on de Morgan Algebra and Kleene Algebra (in Japanase),

Journal of Japan Society for Fuzzy Theory and Systems, Vol. 12, No. 2, pp. 341-350, 2000.- Yushi Uno and Toshihide Ibaraki,

Reachability problems of random digraphs,

IEICE Transactions, Vol. E81-A, No. 12, pp. 2694-2702, 1998.- Yushi Uno and Toshihide Ibaraki,

Approximate evaluation to the sizes of transitive closures of relations (in Japanase),

IPSJ Transactions, Vol. 35, No. 7, pp. 1493-1500, 1994.- Yushi Uno and Toshihide Ibaraki,

Approximate evaluation of the computing cost for answering queries in deductive databases (in Japanese),

IEICE Transactions, Vol. J75-D-1, No. 9, pp. 855-863, 1992.- Yushi Uno and Toshihide Ibaraki,

Complexity of the optimum join order problem in relational databases,

IEICE Transactions, Vol. E-74, No. 7, pp. 2067-2075, 1991.

Proceedings, Technical Reports, Presentations (Excerpts)

- Yushi Uno,

An experimental study on the Web graphs, The IFORS triennial 2005 Conference, 2005.- Ryuhei Uehara and Yushi Uno,

On the laminar structure of ptolemaic and distance hereditary graphs,

Scientific Research on Priority Areas, -New Horizons in Computing-, Mini-seminar, Nihon University, 2005.- Ryuhei Uehara and Yushi Uno,

Efficient algorithms for the longest path problems,

Scientific Research on Priority Areas, Workshop on New Horizons in Computing, 2005.- Ryuhei Uehara and Yushi Uno,

Efficient algorithms for the longest path problems,

Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC04) (appeared in Lecture Notes in Computer Science, Vol. 2518, 424-449, P. Bose and P. Morin (Eds.), Springer), 2004.- Ryuhei Uehara and Yushi Uno,

Longest paths in small graph classes,

COMA (Combinatorial Mathematics) Seminar, 2004.- Ryuhei Uehara and Yushi Uno,

Longest paths in small graph classes,

LA Symposium (Summer), Awajishima, 2004.- Ryuhei Uehara and Yushi Uno,

Longest paths in small graph classes,

Proc. IEICE SIG-COMP. 2004.- Yushi Uno,

Mining communities from the Web,

International Symposium on Discrete Algorithms and Optimization, 2004.- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

Minimum edge ranking spannig trees of split graphs,

DIMACS Technical Report 2003-27, 2003.- Yushi Uno, Kazuhisa Makino and Toshihide Ibaraki,

Minimum edge ranking spannig trees of split graphs,

KIDS Seminar, 2003.- Motohide Umano, Shin-ichi Murakami, Yushi Uno, Kazuhisa Seta and Makoto Okada,

Improvenent of extraction method of fuzzy rules with fuzzy qualifiers,

Proc. 19th Fuzzy System Symposium, pp. 323-327, 2003.- Motohide Umano, Yuu Hosoya, Yushi Uno, Kazuhisa Seta and Makoto Okada, Incremental learning of fuzzy rules by fuzzy neural network (in Japanese),

Proc. 19th Fuzzy System Symposium, pp. 665-558, 2003.- Tadayoshi Yamamura, Motohide Umano, Yushi Uno, Kazuhisa Seta and Makoto Okada,

Reinforcement learning of multi-agents by a staged view in distance and direction (2),

Proc. 19th Fuzzy System Symposium, pp. 307-310, 2003.- Motohide Umano, Masahiro Tomaru, Kazuhisa Seta, Yushi Uno and Makoto Okada,

Extension of learning by switching rule generation and reasoning methods, -Introduction of new switching methods and their evaluation-,

Proc. 19th Fuzzy System Symposium, pp. 345-348, 2003.- Motohide Umano, Takeaki Matsuo, Kazuhisa Seta, Makoto Okada and Yushi Uno,

Retrieval from databases by fuzzy queries in the Internet with fuzzy operations in the browser,

Proc. 19th Fuzzy System Symposium, pp. 631-634, 2003.- Motohide Umano, Toshikatsu Masui, Yushi Uno, Kazuhisa Seta and Makoto Okada,

Improvement of genetic algorithm by several crossover operations (2),

Proc. 19th Fuzzy System Symposium, pp. 489-492, 2003.- Motohide Umano, Kazuki Kita, Kazunori Hori, Kazuhisa Seta, Yushi Uno and Makoto Okada,

Improvement of generation meghod of fzzy decision tree by genetic algorithm, Proc. 19th Fuzzy System Symposium, pp. 449-452, 2003.- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

Minimum edge ranking spannig trees of threshold graphs,

Proceedings of the 13th Internatinal Symposium on Algorithms and Computation (ISAAC02) (appeared Lecture Notes in Computer Science, Vol. 2518, 424-449, P. Bose and P. Morin (Eds.), Springer), 2002.- Yushi Uno, Kazuhisa Makino and Toshihide Ibaraki,

Minimum edge ranking spannig trees of threshold graphs,

Operations Research Society of Japan, Seminar at Chubu-branch, 2002.- Yushi Uno, Kazuhisa Makino and Toshihide Ibaraki,

Minimum edge ranking spannig trees of threshold graphs,

Operations Research Society of Japan, KSMAP Seminar at Kansai-branch, 2002.- Yushi Uno,

Rankings of graphs: a survey,

Proceedings of the 2nd Japanese-Sino Optimization Meeting, 2001.- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

On minimum edge ranking spanning trees,

IPSJ SIG Notes, 99-AL-70-3, pp. 17-24, 1999.- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

On minimum edge ranking spanning trees,

Proc. 1999 Autumn National Conference of Operations Research Society of Japan, 1999.- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

On minimum edge ranking spannig trees,

Proceedings of the 24th International Symposium on Mathematical Foundations on Computer Science (MFCS99) (appeared in Lecture Notes in Computer Science, Vol. 1672, pp. 398-409, M. Kutylowski, L. Pacholski and T. Wierzbicki (Eds.), Springer), 1999. (Technical Report of Kyoto University, #99004)- Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki,

On minimum edge ranking spannig trees,

Technical Report No. 99008, Department of Applied Mathematics and Physics, Kyoto University, 1999.- Motohide Umano, Satoshi Gotoh, Chuta Funayama, Yushi Uno, Naoshi Noda, Hiroshi Satoh and Naoko Nakamura,

Semantic frame determination system useing cognitive attribute and fuzzy logic,

JSAI, SIG-LSE-9902, pp, 30-37, 1999.- Deng Jianming, Motohide Umano, Tetsuhisa Oda, Yushi Uno and Hiroshi Satoh,

A point on de Morgan Algebra and Kleene Algebra,

Proc, 15th Fuzzy System Symposium, pp. 257-260, 1999.- Kazunori Hori, Motohide Umano, Hiroshi Satoh and Yushi Uno,

Fuzzy C4.5 for Generating Fuzzy Decision Trees and its Improvement,

Proc, 15th Fuzzy System Symposium, pp. 515-518, 1999.- Motohide Umano, Chuta Funayama, Yushi Uno, Naoshi Noda, Hiroshi Satoh and Naoko Nakamura,

Semantic Frame Determination System using Cognitive Component and Fuzzy Logic - Application to Semantic Frame Determination -,

Proc. 14th Fuzzy System Symposium, pp. 331-334, 1998.- Yushi Uno and Toshihide Ibaraki,

Reachability and the Size of Tramsitive Closure of a Random Digraph,

Technical Report of IEICE, COMP95-22, 1995.- Yushi Uno and Toshihide Ibaraki,

Approximate Evaluation of the Computing Cost for Answering Queries in Deductive Databases,

Technical Report of IEICE, COMP91-43, 1991.- Yushi Uno and Toshihide Ibaraki,

Approximate evaluation to the sizes of transitive closures of relations,

3rd Information System Group Seminar, Horoshima, 1991.- Yushi Uno and Toshihide Ibaraki,

Complexity of the optimum join order problem in deductive databases,

Kyoto University Research Institute of Mathematical Research Report 695, 1989.- Yushi Uno and Toshihide Ibaraki,

Complexity of the optimum join order problem in deductive databases,

Technical Report of IEICE, COMP88-81, 1989.

Commentary, Dissertations, etc.

- Yushi Uno,

NP-completeness (in Japanese),

Journal of Japan Society for Fuzzy Theory and Systems, Vol. 9, No. 3, pp. 332-336, 1997.- Yushi Uno,

Studies on Optimization of Query Processing in Deductive Databases,

Doctoral Dissertation, Kyoto University, 1995.- Yushi Uno and Toshihide Ibaraki,

Approximate evaluation of the computing cost for answering queries in deductive databases,

Systems and Computers in Japan, Vol. 24, No. 11, pp.1-12, 1993.- Yushi Uno,

Complexity of the optimum join order problem in relational databases,

Master Thesis, Dept. of Mathematics and Physics, Faculty of Engineering, Kyoto University, 1989.

[Home]
[Profile]
**Research**
[Classes]
[Computer]
[Hobbies]
[Links]
[Update]
[Site Map]

[Osaka Pref. Univ.]
[Graduate School of Science]
[Dept. Math & Infomation Sci.]