Updated on 2024/04/14

写真a

 
Uno Yushi
 
Organization
Graduate School of Informatics Department of Core Informatics Professor
School of Engineering Department of Information Science
Title
Professor
Affiliation
Institute of Informatics

Position

  • Graduate School of Informatics Department of Core Informatics 

    Professor  2022.04 - Now

  • School of Engineering Department of Information Science 

    Professor  2022.04 - Now

Degree

  • 博士(工学) ( Others )

Research Areas

  • Informatics / Theory of informatics

  • Informatics / Computational science

  • Informatics / Theory of informatics

Research Interests

  • 離散構造とアルゴリズム

  • 組合せ最適化

  • データ構造

  • グラフ・ネットワークアルゴリズム

  • オペレーションズ・リサーチ

  • ウェブ・マイニング

  • ウェブ・アルゴリズム

  • アルゴリズムの設計と解析

  • Operations Research

  • Design and Analysis of Algorithms

  • Combinatorial Optimization

Research subject summary

  • 離散構造をもつ現実問題に対する効率的なアルゴリズムの設計および解析

  • 大規模データからの知識獲得,データマイニング

  • インターネットの離散構造

  • 数理的なパズルやゲーム

Research Career

  •  

    データベース、インターネット、知識獲得、データマイニング、クラスタリング 

  •  

    インターネット、ウェブグラフ、スケールフリー・ネットワーク 

  •  

    グラフ・ネットワーク、アルゴリズム、離散構造、オペレーションズ・リサーチ、組合せ最適化 

Professional Memberships

  • ACM(Association for Computing Machinery)

    1999.07 - Now   Domestic

  • 電子情報通信学会

    1991.04 - Now   Domestic

  • 日本オペレーションズ・リサーチ学会

    1989.03 - Now   Domestic

  • 電子情報通信学会

  • 日本オペレーションズ・リサーチ学会

  • 情報処理学会

  • 人工知能学会

  • ACM(Association for Computing Machinery)

▼display all

Committee Memberships (off-campus)

  • コンピュテーション専門委員会 委員長   電子情報通信学会  

    2022.05 - Now 

      More details

    委員長

Papers

  • QNetDiff: a quantitative measurement of network rewiring

    Nose S.

    BMC Bioinformatics   25 ( 1 )   118   2024.12

  • Multifold Tiles of Polyominoes and Convex Lattice Polygons

    Chida K.

    Thai Journal of Mathematics   21 ( 4 )   957 - 978   2023.12( ISSN:16860209

  • Upper clique transversals in graphs Reviewed

    Martin Milanic, Yushi Uno

    Proceedings of the 49th International Workshop on Graph-Theoretic Concepts in Computer Science   2023.06

  • Geodesic paths passing through all faces on a polyherdon Reviewed

    Erik Demaine, Martin Demaine, David Eppstein, Hiro Ito, Yuta Katayama, Wataru Maruyama, Yushi Uno

    The 24th Japan Conference on Discrete and Computational Geometry, Graphs, and Games   2022.09

  • Metamorphosis of a Tiling Font

    Erik D. Demaine, Martin L. Demaine, Scott Kim, Yushi Uno

    The 5th International Conference on Mathematics of Various Entertaining Subjects   2022.08

  • Rolling Polyhedra on Tessellations Reviewed

    Akira Baes, an, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, and, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams

    11th International Conference on Fun with Algorithms, {FUN} 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy   6:1 - 6:16   2022.06

  • Linear-Time Recognition of Double-Threshold Graphs Reviewed

    Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

    Algorithmica   84 ( 4 )   1163 - 1181   2022.04( ISSN:0178-4617

     More details

    Publishing type:Research paper (scientific journal)  

    Abstract

    A graph $$G = (V,E)$$ is a double-threshold graph if there exist a vertex-weight function $$w :V \rightarrow \mathbb {R}$$ and two real numbers $$\mathtt {lb}, \mathtt {ub}\in \mathbb {R}$$ such that $$uv \in E$$ if and only if $$\mathtt {lb}\le \mathtt {w}(u) + \mathtt {w}(v) \le \mathtt {ub}$$. In the literature, those graphs are studied also as the pairwise compatibility graphs that have stars as their underlying trees. We give a new characterization of double-threshold graphs that relates them to bipartite permutation graphs. Using the new characterization, we present a linear-time algorithm for recognizing double-threshold graphs. Prior to our work, the fastest known algorithm by Xiao and Nagamochi [Algorithmica 2020] ran in $$O(n^{3} m)$$ time, where n and m are the numbers of vertices and edges, respectively.

    DOI: 10.1007/s00453-021-00921-9

    Other URL: https://link.springer.com/article/10.1007/s00453-021-00921-9/fulltext.html

  • Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks Reviewed

    Tatsuya Inoha, Kunihiko Sadakane, Yushi Uno, Yuma Yonebayashi

    IEICE Transactions 雑誌   2022.03

     More details

    Kind of work:Joint Work  

  • Yin-Yang puzzles are NP-complete Reviewed

    Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno

    Proceedings of the 33rd Canadian Conference on Computational Geometry   97 - 104   2021.08

  • Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions

    宇野 裕之

    arXiv   -   2021

  • Packing Cube Nets into Rectangles with O(1) Holes Reviewed

    Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow

    Discrete and Computational Geometry, Graphs, and Games   152 - 164   2021( ISSN:0302-9743 ( ISBN:9783030900472

     More details

    Publishing type:Part of collection (book)  

    DOI: 10.1007/978-3-030-90048-9_12

  • Discrete and Computational Geometry, Graphs, and Games

    Lecture Notes in Computer Science   2021( ISSN:0302-9743 ( ISBN:9783030900472

  • Gourds: a sliding-block puzzle with turning Reviewed

    Joep Hamersma, Marc J, van Kreveld, Yushi Uno, Tom C. van, der Zanden

    Proceedings of the 31st International Symposium on Algorithms and Computation   2020.12

  • Twenty Years of Progress of JCDCG3 Reviewed

    Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno

    Graphs and Combinatorics   36 ( 2 )   2020.10

     More details

    Kind of work:Joint Work  

  • Symmetric assembly puzzles are hard, beyond a few pieces Reviewed

    Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S.B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno

    Computational Geometry   90   101648 - 101648   2020.10( ISSN:0925-7721

     More details

    Publishing type:Research paper (scientific journal)  

    DOI: 10.1016/j.comgeo.2020.101648

  • Linear-Time Recognition of Double-Threshold Graphs Reviewed

    Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

    Lecture Notes in Computer Science   12301 ( 12301 )   2020.06

     More details

    Kind of work:Joint Work  

  • Twenty Years of Progress of $$\hbox {JCDCG}^3$$

    Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno

    Graphs and Combinatorics   36 ( 2 )   181 - 203   2020.03( ISSN:0911-0119

     More details

    Publishing type:Research paper (scientific journal)  

    DOI: 10.1007/s00373-020-02133-4

    Other URL: http://link.springer.com/article/10.1007/s00373-020-02133-4/fulltext.html

  • Hyperfiniteness of Real-World Networks Reviewed

    Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno

    The Review of Socionetwork Strategies   13 ( 1 )   2019.12

     More details

    Kind of work:Joint Work  

  • Reconfiguring Undirected Paths Reviewed

    Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno

    Lecture Notes in Computer Science   353 - 365   2019.08( ISSN:0302-9743 ( ISBN:9783030247652

     More details

    Publishing type:Part of collection (book)  

    DOI: 10.1007/978-3-030-24766-9_26

  • Settlement fund circulation problem Reviewed

    Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

    Discrete Applied Mathematics 雑誌   265   2019.05

     More details

    Kind of work:Joint Work  

  • Threes!, Fives, 1024!, and 2048 are hard Reviewed

    Stefan Langerman, Yushi Uno

    Theoretical Computer Science 雑誌   748   2018.04

     More details

    Kind of work:Joint Work  

  • Parameterized edge hamiltonicity Reviewed

    Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno

    Discrete Applied Mathematics 雑誌   248   2018.01

     More details

    Kind of work:Joint Work  

  • Swapping colored tokens on graphs Reviewed

    Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara and Yushi Uno

    Theoretical Computer Science 雑誌   729   2018.01

     More details

    Kind of work:Joint Work  

  • Using matchstick puzzles to help elementary school students to learn and teachers to teach simple calculations Reviewed

    Heng Brendon, Yoshitaka Inoue and Yushi Uno

    Proceedings of the 6th Asian Conference on Information Systems   2017.12

     More details

    Kind of work:Joint Work  

  • Settlement fund circulation problem Reviewed

    Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono and Yushi Uno

    Leibniz International Proceedings in Informatics   2017.12

     More details

    Kind of work:Joint Work  

  • Packing developments of cubes Reviewed

    Tatsuya Inoha, Yoshitaka Inoue, Takayuki Ozawa and Yushi Uno

    Proceedings of the 20th Japan Conference on Discrete and Computational Geometry and Graphs   2017.09

     More details

    Kind of work:Joint Work  

  • Sankaku-Tori: An old Western-Japanese game played on a point set Reviewed

    Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi

    Journal of Information Processing 雑誌   25   2017.04

     More details

    Kind of work:Joint Work  

  • Hanabi is NP-complete, even for cheaters who look at their cards Reviewed

    Jean-Franc¸ois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, Andr´e van Renssen, Marcel Roeloffzen, Yushi Uno

    Theoretical Computer Science 雑誌   675   2017.03

     More details

    Kind of work:Joint Work  

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

    Akitoshi Kawamura, Yuichi Tatsu, Yushi Uno and Masahide Yamato

    Information Processing Letters 雑誌   121   2017.01

     More details

    Kind of work:Joint Work  

  • Single-player and two-player buttons&scissors games— (extended abstract) Reviewed

    Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten L¨offler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno and AaronWilliams

    Lecture Notes in Computer Science 雑誌   9943   2016.08

     More details

    Kind of work:Joint Work  

  • Symmetric assembly puzzles are hard, beyond a few pieces Reviewed

    Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andr´e van Renssen, Marcel Roeloffzen, Ryuhei Uehara and Yushi Uno

    Lecture Notes in Computer Science 雑誌   9943   2016.08

     More details

    Kind of work:Joint Work  

  • Hanabi is NP-complete, even for cheaters who look at their cards Reviewed

    Jean-Franc¸ois Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, Andr´e van Renssen, Marcel Roeloffzen, Yushi Uno

    Leibniz International Proceedings in Informatics   49   2016.06

     More details

    Kind of work:Joint Work  

  • Threes!, Fives, 1024!, and 2048 are hard Reviewed

    Stefan Langerman and Yushi Uno

    Leibniz International Proceedings in Informatics   49   2016.06

     More details

    Kind of work:Joint Work  

  • (Total) Vector domination for graphs with bounded branchwidth Reviewed

    Toshimasa Ishii, Hirotaka Ono and Yushi Uno

    Discrete Applied Mathematics 雑誌   207   2016.04

     More details

    Kind of work:Joint Work  

  • Subexponential fixed-parameter algorithms for partial vector domination Reviewed

    Toshimasa Ishii, Hirotaka Ono and Yushi Uno

    Discrete Optimization 雑誌   22   2016.04

     More details

    Kind of work:Joint Work  

  • Mining preserving structures in a graph sequence Reviewed

    Takeaki Uno and Yushi Uno

    Theoretical Computer Science 雑誌   64   2016.02

     More details

    Kind of work:Joint Work  

  • Folding a paper strip to minimize thickness Reviewed

    Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara and Yushi Uno

    Journal of Discrete Algorithms 雑誌   36   2016.02

     More details

    Kind of work:Joint Work  

  • A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares Reviewed

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

    Computational Geometry: Theory and Applications 雑誌   51   2016.01

     More details

    Kind of work:Joint Work  

  • Singleplayer and two-player buttons and scissors games Reviewed

    Kyle Burke, Erik D. Demaine, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Maarten L¨offler, Yushi Uno

    Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs   2015.09

     More details

    Kind of work:Joint Work  

  • Symmetric assembly puzzles are hard, beyond a few pieces Reviewed

    Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, Andr´e van Renssen, Marcel Roeloffzen, Ryuhei Uehara, and Yushi Uno

    Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs   2015.09

     More details

    Kind of work:Joint Work  

  • Bounds on the number of hint squares for Shakashaka

    Michael Biro, Tomohisa Hamamoto, Christiane Schmidt and Yushi Uno

    Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs   2015.09

     More details

    Kind of work:Joint Work  

  • Shortest spanning closed walks in extended theta graphs

    Kazuya Sakata and Yushi Uno

    Proceedings of the 18th Japan Conference on Discrete and Computational Geometry and Graphs   2015.09

     More details

    Kind of work:Joint Work  

  • Swapping colored tokens on graphs Reviewed

    K. Yamanaka, T. Horiyama, D. Kirkpatrick, Y. Otachi, T. Saitoh, R. Uehara

    Lecture Notes in Computer Science 雑誌   2015.08

     More details

    Kind of work:Joint Work  

  • Mining preserving structures in a graph sequence Reviewed

    T. Uno, Y. Uno

    Lecture Notes in Computer Science 雑誌   2015.08

     More details

    Kind of work:Joint Work  

  • Folding a paper strip to minimize thickness Reviewed

    Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno

    Lecture Notes in Computer Science 雑誌   8973   2015.02

     More details

    Kind of work:Joint Work  

  • Subexponential fixed-parameter algorithms for partial vector domination Reviewed

    Toshimasa Ishii, Hirotaka Uno, Yushi Uno

    Lecture Notes in Computer Science 雑誌   8596   2014.10

  • Parameterized edge hamiltonicity Reviewed

    Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno

    Lecture Notes in Computer Science 雑誌   8748   2014.10

     More details

    Kind of work:Joint Work  

  • Algorithmic aspects of distance constrained labeling: a survey Reviewed

    Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

    International Journal of Networking and Computing 雑誌   4 ( 2 )   2014.09

     More details

    Kind of work:Joint Work  

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

    akehiro Ito, Shin-ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

    Theoretical Computer Science 雑誌   544   2014.07

     More details

    Kind of work:Joint Work  

  • Sankaku-Tori: An old western-Japanese game played on a point set Reviewed

    Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi

    Lecture Notes in Computer Science 雑誌   8496   2014.06

     More details

    Kind of work:Joint Work  

  • Computational complexity and an integer programming model of Shakashaka Reviewed

    Erik D. Demaine, Yoshi Okamoto, Ryuhei Uehara, Yushi Uno

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science 雑誌   E97-A ( 6 )   2014.06

  • Approximating the path-distance-width for AT-free graphs and graphs in related classes

    Yota Otachi, Toshiki Saito, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki

    Discrete Applied Mathematics 雑誌   168   2014.05

     More details

    Kind of work:Joint Work  

  • (Total) Vector domination for graphs with bounded branchwidth Reviewed

    Toshimasa Ishii, Hirotaka Uno, Yushi Uno

    Lecture Notes in Computer Science   8392   2014.04

     More details

    Kind of work:Joint Work  

  • UNO is hard, even for a single player

     

    Theoretical Computer Science   Vol. 521   51 - 61   2014

  • ZDD-based approach to soloving Tantrix

     

    AAAC   2013

  • On complexity of flooding games on graphs with interval representations

     

    TJJCCGG Springer   8296   72 - 84   2013

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

     

    IEICE Transactions   E96-B ( 11 )   2766 - 2733   2013

  • Morpion solitaire: a new upper bounds on the maximum score

     

    JCDCGG   2013

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

     

    GD Springer   8242   301 - 302   2013

  • Morpion solitaire 5D: a new upper bound of 121 on the maximum score

     

    CCCG   25 - 29   2013

  • Computational complexity and an integer programming model of Shakashaka

     

    CCCG   31 - 36   2013

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

     

    Algorithmica   654 - 681   2013

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

     

    Discrete Mathematics   312 ( 8 )   1407 - 1420   2012

     More details

    Kind of work:Joint Work  

  • Solving Tantrix via integer programming

     

    FUN Springer   7288   186 - 197   2012

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

     

    ISAAC Springer   7676   271 - 282   2012

     More details

    Kind of work:Joint Work  

  • A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares

     

    SWAT Springer   7357   24 - 35   2012

     More details

    Kind of work:Joint Work  

  • A tight upper bound on the (2,1)-total labeling number of outerplanar graphs Reviewed

     

    Journal of Discrete Algorithms   14   189 - 206   2012

     More details

    Kind of work:Joint Work  

  • An integer programming approach to solving Tantrix on fixed boards Reviewed

     

    Algorithms   5 ( 1 )   158 - 175   2012

     More details

    Kind of work:Joint Work  

  • The complexity of flood-filling games Reviewed

    H. Fukui, A. Nakanishi, R. Uehara, T. Uno, Y. Uno

    Proc. 14th Korea-Japan Joing Workshop on Algorithms and Computation 著書   51 - 56   2011.07

  • Approximability of the path-distance-width of AT-free graphs Reviewed

    Y. Otachi, T. Saito, K. Yamanaka, S. Kijima, Y. Okamoto, T. Ono, Y. Uno, K. Yamazaki

    Lecture Notes in Computer Science 著書   Vol. 6986   271 - 282   2011.06

  • Contracted webgraphs: structure mining and scale-freeness Reviewed

    Y. Uno, F. Oguri

    Lecture Notes in Computer Science 著書   Vol. 6681   287 - 299   2011.05

     More details

    Kind of work:Joint Work  

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

    T. Shigezumi, Y. Uno and O. Watanabe

    Journal of Graph Algorithms and Applications 著書   Vol. 15 ( No. 7 )   661 - 682   2011.05

  • The (2,1)-total labeling number of outerplanar graph is at most \Delta+2 Reviewed

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Lecture Notes in Computer Science   Vol. 6460   103 - 106   2011.03

     More details

    Kind of work:Joint Work  

  • Approximability of the path-distance width for AT-free graphs Reviewed

     

    WG Springer   6986   271 - 282   2011

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

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Lecture Notes in Computer Science Springer   Vol. 6507   49 - 60   2010.12

     More details

    Kind of work:Joint Work  

  • UNO is hard, even for a single player Reviewed

    E. D. Demaine, M. L. Demaine, R. Uehara, T. Uno, Y. Uno

    Lecture Notes in Computer Science Springer   Vol. 6099   133 - 144   2010.06

     More details

    Kind of work:Joint Work  

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

    T. Shigezumi, Y. Uno and O. Watanabe

    Lecture Notes in Computer Science 著書   Vol. 5942   216 - 227   2010.02

     More details

    Kind of work:Joint Work  

  • Investigating the Web structure by isolated stars Reviewed

    Y. Uno, Y. Ota, A. Uemichi

    Transactions of JSAI 著書   Vol. 25 ( No. 1 )   2010.01

     More details

    Kind of work:Joint Work  

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

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Proc. 7th JCCGG 著書   71 - 72   2009.11

     More details

    Kind of work:Joint Work  

  • An O(n^1.75)-time algorithm for L(2,1)-labeling of trees Reviewed

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Theoretical Computer Science 著書   Vol. 410   3702 - 3710   2009.09

     More details

    Kind of work:Joint Work  

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

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Lecture Notes in Computer Science 著書   Vol. 5757   35 - 46   2009.09

     More details

    Kind of work:Joint Work  

  • A replacement model for a scale-free property of cliques Reviewed

    T. Shigezumi, Y. Uno and O. Watanabe

    Proc. 8th Cologne-Twente Workshop   285 - 289   2009.06

     More details

    Kind of work:Joint Work  

  • Laminar structure of ptolemaic graphs and its applications Reviewed

    R. Uehara, Y. Uno

    Discrete Applied Mathematics 著書   Vol. 157 ( No. 7 )   1533 - 1543   2009.04

     More details

    Kind of work:Joint Work  

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

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Proc. 2nd AAAC Meeting   2009.04

     More details

    Kind of work:Joint Work  

  • Investigating web structures by cliques and stars

    Y. Uno, T. Kiyotani, F. Oguri,

    RIMS Technical Report 著書   2009.03

     More details

    Kind of work:Joint Work  

  • On the complexity of reconfiguration problems Reviewed

    T. Ito, E. D. Demaine, N. J. A. Harvey, C. H. Papadimitriou, M. Sideri, R. Uehara, Y. Uno

    Lecture Notes in Computer Science 著書 Springer   5369   28 - 39   2008.12

     More details

    Kind of work:Joint Work  

  • An O(n \log^2 n)-time algorithm for L(2,1)-labeling of trees Reviewed

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Proc. 7th Forum on informaion Technology 著書   2008.09

     More details

    Kind of work:Joint Work  

  • An O(n^1.75)-time algorithm for L(2,1)-labeling of trees Reviewed

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Lecture Notes in Computer Science 著書 Springer   5124   185 - 197   2008.07

     More details

    Kind of work:Joint Work  

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

    T. Hasunuma, T.. Ishii, H. Ono, Y. Uno

    Proc. 1st AAAC Conference 著書   2008.05

     More details

    Kind of work:Joint Work  

  • On computing longest paths in small graph classes Reviewed

    R. Uehara, Y. Uno

    International Journal of Foundations of Computer Science 雑誌   18 ( 5 )   911 - 930   2007.12

     More details

    Kind of work:Joint Work  

  • Web structure mining by isolated cliques Reviewed

    Y. Uno, Y. Ota, A. Uemichi, M. Umano

    IEICE Transactions 雑誌   E90-D ( 12 )   1998 - 2006   2007.12

     More details

    Kind of work:Joint Work  

  • Web structure mining by isolated stars Reviewed

    Y. Uno, Y. Ota, A. Uemichi, M. Umano

    Proc. Workshop on Models and Algorithms for the Web Graph 著書   2006.12

     More details

    Kind of work:Joint Work  

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

    Y. Uno, Y. Ota, A. Uemichi, M. Umano

    Knowledge and Decision Technologies 著書   179 - 187   2006.05

     More details

    Kind of work:Joint Work  

  • An experimental study of the webgraph---stuructural properties and web mining Reviewed

    Y. Uno, Y. Ota, A. Uemichi, M. Umano

    Proc. 19th Workshop on Circuits and Systems 著書   301 - 306   2006.04

     More details

    Kind of work:Joint Work  

  • Laminar structure of ptolemaic graphs and its applications Reviewed

    R. Uehara, Y. Uno

    Lecture Notes in Computer Science 著書 Springer   Vol. 3827   186 - 195   2005.12

     More details

    Kind of work:Joint Work  

  • Efficient algorithms for the longest path problem Reviewed

    R. Uehara, Y. Uno

    Lecture Notes in Computer Science 著書 Springer   3341   2004.12

     More details

    Kind of work:Joint Work  

  • Minimum edge ranking spannig trees of split graphs Reviewed

    K. Makino, Y. Uno, T. Ibaraki

    Discrete Applied Mathematics 雑誌 Elsevier   154   2373 - 2386   2004.06

     More details

    Kind of work:Joint Work  

  • Minimum edge ranking spannig trees of threshold graphs Reviewed

    K. Makino, Y. Uno and T. Ibaraki

    Lecture Notes in Computer Science 著書 Springer   Vol. 2518   428 - 440   2002.12

     More details

    Kind of work:Joint Work  

  • Learning by switching generation and reasoning methods in several knowledge representation towards the simulation of human learning process Reviewed

    M. Umano, Y. Matsumoto, Y. Uno, K. Seta

    Proc. 11th IEEE International Conference on Fuzzy Systems 著書   809 - 814   2002.07

     More details

    Kind of work:Joint Work  

  • Ranking of graphs

    Y. Uno

    Proc. 2nd Japanese-Sino Optimization Meeting 著書   65 - 66   2002.06

     More details

    Kind of work:Single Work  

  • On minimum edge ranking spannig trees Reviewed

    K. Makino, Y. Uno, T. Ibaraki

    Journal of Algorithms 雑誌   Vol. 38   411 - 437   2001.06

     More details

    Kind of work:Joint Work  

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

    K. Hori, M. Umano, H. Satoh, Y. Uno

    Proc. 4th Asian Fuzzy Systems Symposium 著書   881 - 884   2000.06

     More details

    Kind of work:Joint Work  

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

    J. Deng, M. Umano, T. Oda, Y. Uno

    Proc. 4th Asian Fuzzy Systems Symposium 著書   244 - 247   2000.06

     More details

    Kind of work:Joint Work  

  • ド・モルガン代数とクリーネ代数に関するいくつかの性質 Reviewed

    J. Deng, 馬野元秀, 小田哲久, 宇野裕之

    日本ファジィ学会誌 雑誌   Vol. 12 ( No. 2 )   341 - 350   2000.06

     More details

    Kind of work:Joint Work  

  • Reachability problems of random digraphs Reviewed

    Y. Uno, T. Ibaraki

    IEICE Transactions 雑誌   Vol. E81-A ( No. 12 )   2694 - 2702   1998.06

     More details

    Kind of work:Joint Work  

  • 関係の推移閉包の大きさの近似的推定法 Reviewed

    宇野 裕之, 茨木 俊秀

    情報処理学会論文誌 雑誌   Vol. 35 ( No. 7 )   1493 - 1500   1994.06

     More details

    Kind of work:Joint Work  

  • 演えきデータベースにおける質問処理コストの近似的評価法 Reviewed

    宇野 裕之, 茨木 俊秀

    電子情報通信学会論文誌 雑誌   Vol. J75-D-1 ( No. 9 )   855 - 863   1992.06

     More details

    Kind of work:Joint Work  

  • Complexity of the optimum join order problem in relational databases Reviewed

    Y. Uno, T. Ibaraki

    IEICE Transactions 雑誌   Vol. E-74 ( No. 7 )   2067 - 2075   1991.06

     More details

    Kind of work:Joint Work  

▼display all

Books and Other Publications

  • Fun with Algorithms

    Pierre Fraigniaud, Yushi Uno

    2022.06 

     More details

    Total pages:2 v.  

    CiNii Books

  • 理論計算機科学事典

    徳山豪ほか

    朝倉書店  2022.01 

  • Sublinear computation paradigm : algorithmic revolution in the big data era

    Katoh Naoki, Yuya Higashikawa, Ito Hiro, Nagao Atsuki, Shibuya Tetsuo, Sljoka Adnan, Tanaka Kazuyuki, Uno Yushi

    Springer  2022  ( ISBN:9789811640940

     More details

  • Discrete and Computational Geometry and Graphs (Lecture Notes in Computer Science, Vol. 13034)

    Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo Ruiz, Yushi Uno

    Springer  2021.10 

  • Sublinear Computation Paradigm;Algorithmic Revolution;in;he Big;Data Era

    Naoki Katoh, Yuya Higashikawa, Hiro Ito, Atsuki Nagao, Tetsuo Shibuya, Adnan Sljoka, Kazuyuki Tanaka, Yushi Uno

    2021.10  ( ISBN:9789811640940

  • Discrete and computational geometry, graphs, and games : 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018 : revised selected papers

    Japan Conference on Discrete and Computational Geometry Graphs and Games, 秋山 仁 , Marcelo Reginaldo M., Ruiz Mari-Jo P., 宇野 裕之

    Springer  2021  ( ISBN:9783030900472

     More details

  • Discrete and Computational Geometry and Graphs (Lecture Notes in Computer Science, Vol. 9943)

    Jin Akiyama, Hiro Ito, Toshinori Sakai and Yushi Uno( Role: Joint author)

    Springer  2016.03 

  • IEICE Transactions on Information and Systems, Special Section on Foundations of Computer Science

    Yushi Uno

    The Institute of Electronics, Information and Communication Engineering  2015.03 

  • 離散数学のすすめ

    伊藤大雄,宇野裕之( Role: Joint author)

    現代数学社  2010.05 

  • Combinatorial Geometry and Graph Theory

    H. Ito, M. Kano, N. Katoh and Yushi Uno( Role: Joint author)

    Springer  2008.10 

▼display all

Grant-in-Aid for Scientific Research

  • 数理的パズルやゲームが持つ計算原理の解明とそれらの汎用問題解決手法と しての体系化

    2021

Charge of on-campus class subject

  • Fundamentals in Electrical and Electronic Engineering I

    2021    

  • Fundamentals in Electrical and Electronic Engineering I

    2021    

  • Computational Theory

    2021    

  • Advanced Intelligent Information Systems I

    2021    

  • Advanced Systems Engineering

    2021    

  • Data Structures and Algorithms

    2021    

  • Discrete Mathematics

    2021    

  • Selected Topics in Discrete Systems and Algorithms

    2021    

▼display all