情報処理学会

人工知能学会

ACM(Association for Computing Machinery)

Rolling Polyhedra on Tessellations 査読

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 査読

Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

Algorithmica   84 ( 4 )   1163 - 1181   2022年04月（ ISSN:0178-4617 ）

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

Tatsuya Inoha, Kunihiko Sadakane, Yushi Uno, Yuma Yonebayashi

IEICE Transactions 雑誌   2022年03月

Yin-Yang puzzles are NP-complete 査読

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

97 - 104   2021年08月

Packing Cube Nets into Rectangles with O(1) Holes 査読

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 ）

Discrete and Computational Geometry, Graphs, and Games

Lecture Notes in Computer Science   2021年（ ISSN:0302-9743 ） （ ISBN:9783030900472 ）

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

宇野 裕之

arXiv   -   2021年

Gourds: a sliding-block puzzle with turning 査読

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 査読

Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno

Graphs and Combinatorics 雑誌   36 ( 2 )   2020年10月

Symmetric assembly puzzles are hard, beyond a few pieces 査読

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 ）

Linear-Time Recognition of Double-Threshold Graphs 査読

Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

Lecture Notes in Computer Science 雑誌   12301 ( 12301 )   2020年06月

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 ）

Hyperfiniteness of Real-World Networks 査読

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

The Review of Socionetwork Strategies 雑誌   13 ( 1 )   2019年12月

Reconfiguring Undirected Paths 査読

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 ）

Settlement fund circulation problem 査読

Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Discrete Applied Mathematics 雑誌   265   2019年05月

Threes!, Fives, 1024!, and 2048 are hard 査読

Stefan Langerman, Yushi Uno

Theoretical Computer Science 雑誌   748   2018年04月

Swapping colored tokens on graphs 査読

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

Theoretical Computer Science 雑誌   729   2018年01月

Parameterized edge hamiltonicity 査読

Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno

Discrete Applied Mathematics 雑誌   248   2018年01月

Settlement fund circulation problem 査読

Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono and Yushi Uno

Leibniz International Proceedings in Informatics   2017年12月

Using matchstick puzzles to help elementary school students to learn and teachers to teach simple calculations 査読

Heng Brendon, Yoshitaka Inoue and Yushi Uno

Proceedings of the 6th Asian Conference on Information Systems   2017年12月

Packing developments of cubes 査読

Tatsuya Inoha, Yoshitaka Inoue, Takayuki Ozawa and Yushi Uno

Proceedings of the 20th Japan Conference on Discrete and Computational Geometry and Graphs   2017年09月

Sankaku-Tori: An old Western-Japanese game played on a point set 査読

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

Journal of Information Processing 雑誌   25   2017年04月

Hanabi is NP-complete, even for cheaters who look at their cards 査読

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月

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

Akitoshi Kawamura, Yuichi Tatsu, Yushi Uno and Masahide Yamato

Information Processing Letters 雑誌   121   2017年01月

Single-player and two-player buttons&scissors games— (extended abstract) 査読

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月

Symmetric assembly puzzles are hard, beyond a few pieces 査読

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月

Hanabi is NP-complete, even for cheaters who look at their cards 査読

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月

Threes!, Fives, 1024!, and 2048 are hard 査読

Stefan Langerman and Yushi Uno

Leibniz International Proceedings in Informatics   49   2016年06月

(Total) Vector domination for graphs with bounded branchwidth 査読

Toshimasa Ishii, Hirotaka Ono and Yushi Uno

Discrete Applied Mathematics 雑誌   207   2016年04月

Subexponential fixed-parameter algorithms for partial vector domination 査読

Toshimasa Ishii, Hirotaka Ono and Yushi Uno

Discrete Optimization 雑誌   22   2016年04月

Folding a paper strip to minimize thickness 査読

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

Journal of Discrete Algorithms 雑誌   36   2016年02月

Mining preserving structures in a graph sequence 査読

Takeaki Uno and Yushi Uno

Theoretical Computer Science 雑誌   64   2016年02月

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

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

Computational Geometry: Theory and Applications 雑誌   51   2016年01月

Singleplayer and two-player buttons and scissors games 査読

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月

Symmetric assembly puzzles are hard, beyond a few pieces 査読

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月

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月

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月

Swapping colored tokens on graphs 査読

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

Lecture Notes in Computer Science 雑誌   2015年08月

Mining preserving structures in a graph sequence 査読

T. Uno, Y. Uno

Lecture Notes in Computer Science 雑誌   2015年08月

Folding a paper strip to minimize thickness 査読

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

Lecture Notes in Computer Science 雑誌   8973   2015年02月

Parameterized edge hamiltonicity 査読

Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno

Lecture Notes in Computer Science 雑誌   8748   2014年10月

Subexponential fixed-parameter algorithms for partial vector domination 査読

Toshimasa Ishii, Hirotaka Uno, Yushi Uno

Lecture Notes in Computer Science 雑誌   8596   2014年10月

Algorithmic aspects of distance constrained labeling: a survey 査読

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

International Journal of Networking and Computing 雑誌   4 ( 2 )   2014年09月

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

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

Theoretical Computer Science 雑誌   544   2014年07月

Sankaku-Tori: An old western-Japanese game played on a point set 査読

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

Lecture Notes in Computer Science 雑誌   8496   2014年06月

Computational complexity and an integer programming model of Shakashaka 査読

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月

(Total) Vector domination for graphs with bounded branchwidth 査読

Toshimasa Ishii, Hirotaka Uno, Yushi Uno

Lecture Notes in Computer Science   8392   2014年04月

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 査読

Discrete Mathematics   312 ( 8 )   1407 - 1420   2012年

Solving Tantrix via integer programming

FUN Springer   7288   186 - 197   2012年

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

ISAAC Springer   7676   271 - 282   2012年

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

SWAT Springer   7357   24 - 35   2012年

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

Journal of Discrete Algorithms   14   189 - 206   2012年

An integer programming approach to solving Tantrix on fixed boards 査読

Algorithms   5 ( 1 )   158 - 175   2012年

The complexity of flood-filling games 査読

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 査読

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 査読

Y. Uno, F. Oguri

Lecture Notes in Computer Science 著書   Vol. 6681   287 - 299   2011年05月

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

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 査読

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

Lecture Notes in Computer Science   Vol. 6460   103 - 106   2011年03月

Approximability of the path-distance width for AT-free graphs 査読

WG Springer   6986   271 - 282   2011年

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

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

Lecture Notes in Computer Science Springer   Vol. 6507   49 - 60   2010年12月

UNO is hard, even for a single player 査読

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

Lecture Notes in Computer Science Springer   Vol. 6099   133 - 144   2010年06月

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

T. Shigezumi, Y. Uno and O. Watanabe

Lecture Notes in Computer Science 著書   Vol. 5942   216 - 227   2010年02月

Investigating the Web structure by isolated stars 査読

Y. Uno, Y. Ota, A. Uemichi

Transactions of JSAI 著書   Vol. 25 ( No. 1 )   2010年01月

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

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

Proc. 7th JCCGG 著書   71 - 72   2009年11月

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

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

Theoretical Computer Science 著書   Vol. 410   3702 - 3710   2009年09月

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

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

Lecture Notes in Computer Science 著書   Vol. 5757   35 - 46   2009年09月

A replacement model for a scale-free property of cliques 査読

T. Shigezumi, Y. Uno and O. Watanabe

Proc. 8th Cologne-Twente Workshop   285 - 289   2009年06月

Laminar structure of ptolemaic graphs and its applications 査読

R. Uehara, Y. Uno

Discrete Applied Mathematics 著書   Vol. 157 ( No. 7 )   1533 - 1543   2009年04月

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

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

Proc. 2nd AAAC Meeting   2009年04月

Investigating web structures by cliques and stars

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

RIMS Technical Report 著書   2009年03月

On the complexity of reconfiguration problems 査読

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月

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

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

Proc. 7th Forum on informaion Technology 著書   2008年09月

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

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

Lecture Notes in Computer Science 著書 Springer   5124   185 - 197   2008年07月

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

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

Proc. 1st AAAC Conference 著書   2008年05月

On computing longest paths in small graph classes 査読

R. Uehara, Y. Uno

International Journal of Foundations of Computer Science 雑誌   18 ( 5 )   911 - 930   2007年12月

Web structure mining by isolated cliques 査読

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

IEICE Transactions 雑誌   E90-D ( 12 )   1998 - 2006   2007年12月

Web structure mining by isolated stars 査読

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

Proc. Workshop on Models and Algorithms for the Web Graph 著書   2006年12月

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

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

Knowledge and Decision Technologies 著書   179 - 187   2006年05月

An experimental study of the webgraph---stuructural properties and web mining 査読

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

Proc. 19th Workshop on Circuits and Systems 著書   301 - 306   2006年04月

Laminar structure of ptolemaic graphs and its applications 査読

R. Uehara, Y. Uno

Lecture Notes in Computer Science 著書 Springer   Vol. 3827   186 - 195   2005年12月

Efficient algorithms for the longest path problem 査読

R. Uehara, Y. Uno

Lecture Notes in Computer Science 著書 Springer   3341   2004年12月

Minimum edge ranking spannig trees of split graphs 査読

K. Makino, Y. Uno, T. Ibaraki

Discrete Applied Mathematics 雑誌 Elsevier   154   2373 - 2386   2004年06月

Minimum edge ranking spannig trees of threshold graphs 査読

K. Makino, Y. Uno and T. Ibaraki

Lecture Notes in Computer Science 著書 Springer   Vol. 2518   428 - 440   2002年12月

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

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

Proc. 11th IEEE International Conference on Fuzzy Systems 著書   809 - 814   2002年07月

Ranking of graphs

Y. Uno

Proc. 2nd Japanese-Sino Optimization Meeting 著書   65 - 66   2002年06月

On minimum edge ranking spannig trees 査読

K. Makino, Y. Uno, T. Ibaraki

Journal of Algorithms 雑誌   Vol. 38   411 - 437   2001年06月

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

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

Proc. 4th Asian Fuzzy Systems Symposium 著書   881 - 884   2000年06月

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

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

Proc. 4th Asian Fuzzy Systems Symposium 著書   244 - 247   2000年06月

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

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

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

Reachability problems of random digraphs 査読

Y. Uno, T. Ibaraki

IEICE Transactions 雑誌   Vol. E81-A ( No. 12 )   2694 - 2702   1998年06月

関係の推移閉包の大きさの近似的推定法 査読

宇野 裕之, 茨木 俊秀

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

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

宇野 裕之, 茨木 俊秀

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

Complexity of the optimum join order problem in relational databases 査読

Y. Uno, T. Ibaraki

IEICE Transactions 雑誌   Vol. E-74 ( No. 7 )   2067 - 2075   1991年06月

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 ）

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

Jin Akiyama, Hiro Ito, Toshinori Sakai and Yushi Uno（ 担当： 共著）

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月 

離散数学のすすめ

伊藤大雄，宇野裕之（ 担当： 共著）

現代数学社  2010年05月 

Combinatorial Geometry and Graph Theory

H. Ito, M. Kano, N. Katoh and Yushi Uno（ 担当： 共著）

Springer  2008年10月 

データ構造とアルゴリズム

2021年度    

離散数学

2021年度    

離散システムとアルゴリズム特別講義

2021年度