Several Results on De Morgan Algebra and Kleene Algebra of Fuzzy Logic. - Jianming Deng; Motohide Umano; Tetsuhisa Oda; Yushi Uno (FUZZ-IEEE, 2001)

On Minimum Edge Ranking Spanning Trees. - Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki (J. Algorithms, 2001)

Learning by switching generation and reasoning methods in several knowledge representations towards the simulation of human learning process. - Motohide Umano; Yuji Matsumoto 001; Yushi Uno; Kazuhisa Seta (FUZZ-IEEE, 2002)

Minimum Edge Ranking Spanning Trees of Threshold Graphs. - Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki (ISAAC, 2002)

Efficient Algorithms for the Longest Path Problem. - Ryuhei Uehara; Yushi Uno (ISAAC, 2004)

Laminar Structure of Ptolemaic Graphs and Its Applications. - Ryuhei Uehara; Yushi Uno (ISAAC, 2005)

Web Structure Mining by Isolated Stars. - Yushi Uno; Yoshinobu Ota; Akio Uemichi (WAW, 2006)

Minimum edge ranking spanning trees of split graphs. - Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki (Discret. Appl. Math., 2006)

Web Structure Mining by Isolated Cliques. - Yushi Uno; Yoshinobu Ota; Akio Uemichi (IEICE Trans. Inf. Syst., 2007)

On Computing Longest Paths in Small Graph Classes. - Ryuhei Uehara; Yushi Uno (Int. J. Found. Comput. Sci., 2007)

An Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (SWAT, 2008)

A linear time algorithm for L(2,1)-labeling of trees - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2008)

A Replacement Model for a Scale-Free Property of Cliques. - Takeya Shigezumi; Yushi Uno; Osamu Watanabe 001 (CTW, 2009)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ESA, 2009)

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (CoRR, 2009)

Laminar structure of ptolemaic graphs with applications. - Ryuhei Uehara; Yushi Uno (Discret. Appl. Math., 2009)

An O(n1.75) algorithm for L(2, 1)-labeling of trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Theor. Comput. Sci., 2009)

UNO Is Hard, Even for a Single Player. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (FUN, 2010)

The (p, q)-total Labeling Problem for Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (ISAAC (2), 2010)

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (IWOCA, 2010)

The complexity of UNO - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Takeaki Uno; Yushi Uno (CoRR, 2010)

Investigating the Web Structure by Isolated Stars. - Yushi Uno; Yoshinobu Ota; Akio Uemichi (Inf. Media Technol., 2010)

Contracted Webgraphs: Structure Mining and Scale-Freeness. - Yushi Uno; Fumiya Oguri (FAW-AAIM, 2011)

Approximability of the Path-Distance-Width for AT-free Graphs. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (WG, 2011)

A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. - Takeya Shigezumi; Yushi Uno; Osamu Watanabe 001 (J. Graph Algorithms Appl., 2011)

On the complexity of reconfiguration problems. - Takehiro Ito; Erik D. Demaine; Nicholas J. A. Harvey; Christos H. Papadimitriou; Martha Sideri; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2011)

Solving Tantrix via Integer Programming. - Fumika Kino; Yushi Uno (FUN, 2012)

On Complexity of Flooding Games on Graphs with Interval Representations. - Hiroyuki Fukui; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (TJJCCGG, 2012)

An Integer Programming Approach to Solving Tantrix on Fixed Boards. - Fumika Kino; Yushi Uno (Algorithms, 2012)

On Complexity of Flooding Games on Graphs with Interval Representations - Hiroyuki Fukui; Ryuhei Uehara; Takeaki Uno; Yushi Uno (CoRR, 2012)

The (p, q)-total labeling problem for trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Math., 2012)

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (J. Discrete Algorithms, 2012)

Morpion Solitaire 5D: a new upper bound 121 on the maximum score. - Akitoshi Kawamura; Takuma Okamoto; Yuichi Tatsu; Yushi Uno; Masahide Yamato (CCCG, 2013)

A Linear Time Algorithm for L(2, 1)-Labeling of Trees. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Algorithmica, 2013)

Exact and fixed-parameter algorithms for metro-line crossing minimization problems. - Yoshio Okamoto; Yuichi Tatsu; Yushi Uno (CoRR, 2013)

Contracted Webgraphs - Scale-Freeness and Structure Mining -. - Yushi Uno; Fumiya Oguri (IEICE Trans. Commun., 2013)

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 (FUN, 2014)

Approximating the path-distance-width for AT-free graphs and graphs in related classes. - Yota Otachi; Toshiki Saitoh; Katsuhisa Yamanaka; Shuji Kijima; Yoshio Okamoto; Hirotaka Ono 001; Yushi Uno; Koichi Yamazaki (Discret. Appl. Math., 2014)

Computational Complexity and an Integer Programming Model of Shakashaka. - Erik D. Demaine; Yoshio Okamoto; Ryuhei Uehara; Yushi Uno (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Algorithmic aspects of distance constrained labeling: a survey. - Toru Hasunuma; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Int. J. Netw. Comput., 2014)

UNO is hard, even for a single player. - Erik D. Demaine; Martin L. Demaine; Nicholas J. A. Harvey; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2014)

A 4.31-approximation for the geometric unique coverage problem on unit disks. - Takehiro Ito; Shin-Ichi Nakano; Yoshio Okamoto; Yota Otachi; Ryuhei Uehara; Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2014)

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

Swapping Colored Tokens on Graphs. - Katsuhisa Yamanaka; Takashi Horiyama; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (WADS, 2015)

Foreword. - Yushi Uno (IEICE Trans. Inf. Syst., 2015)

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. - Jean-François Baffier; Man-Kwun Chiu; Yago Diez; Matias Korman; Valia Mitsou; André van Renssen; Marcel Roeloffzen; Yushi Uno (FUN, 2016)

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; Yushi Uno (Comput. Geom., 2016)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

(Total) Vector domination for graphs with bounded branchwidth. - Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Appl. Math., 2016)

Subexponential fixed-parameter algorithms for partial vector domination. - Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Optim., 2016)

Folding a paper strip to minimize thickness. - Erik D. Demaine; David Eppstein; Adam Hesterberg; Hiro Ito; Anna Lubiw; Ryuhei Uehara; Yushi Uno (J. Discrete Algorithms, 2016)

Mining preserving structures in a graph sequence. - Takeaki Uno; Yushi Uno (Theor. Comput. Sci., 2016)

Morpion Solitaire 5D: A new upper bound of 121 on the maximum score. - Akitoshi Kawamura; Yuichi Tatsu; Yushi Uno; Masahide Yamato (Inf. Process. Lett., 2017)

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 (J. Inf. Process., 2017)

Hanabi is NP-hard, even for cheaters who look at their cards. - Jean-François Baffier; Man-Kwun Chiu; Yago Diez; Matias Korman; Valia Mitsou; André van Renssen; Marcel Roeloffzen; Yushi Uno (Theor. Comput. Sci., 2017)

Packing Cube Nets into Rectangles with O(1) Holes. - Erik D. Demaine; Martin L. Demaine; Ryuhei Uehara; Yushi Uno; Andrew Winslow (JCDCGGG, 2018)

Parameterized Edge Hamiltonicity. - Michael Lampis; Kazuhisa Makino; Valia Mitsou; Yushi Uno (Discret. Appl. Math., 2018)

Threes!, Fives, 1024!, and 2048 are hard. - Stefan Langerman; Yushi Uno (Theor. Comput. Sci., 2018)

Swapping colored tokens on graphs. - Katsuhisa Yamanaka; Takashi Horiyama; J. Mark Keil; David G. Kirkpatrick; Yota Otachi; Toshiki Saitoh; Ryuhei Uehara; Yushi Uno (Theor. Comput. Sci., 2018)

Reconfiguring Undirected Paths. - Erik D. Demaine; David Eppstein; Adam Hesterberg; Kshitij Jain 001; Anna Lubiw; Ryuhei Uehara; Yushi Uno (WADS, 2019)

Settlement fund circulation problem. - Hitoshi Hayakawa; Toshimasa Ishii; Hirotaka Ono 001; Yushi Uno (Discret. Appl. Math., 2019)

Hyperfiniteness of Real-World Networks. - Yutaro Honda; Yoshitaka Inoue; Hiro Ito; Munehiko Sasajima; Junichi Teruyama; Yushi Uno (Rev. Socionetwork Strateg., 2019)

Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". - Naoki Katoh; Yuya Higashikawa; Hiro Ito; Shun Kataoka; Takuya Kida; Toshiki Saitoh; Tetsuo Shibuya; Kazuyuki Tanaka; Yushi Uno (Rev. Socionetwork Strateg., 2019)

Gourds: A Sliding-Block Puzzle with Turning. - Joep Hamersma; Marc J. van Kreveld; Yushi Uno; Tom C. van der Zanden (ISAAC, 2020)

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 (Comput. Geom., 2020)

Twenty Years of Progress of ${JCDCG}^3$. - Jin Akiyama; Hiro Ito; Toshinori Sakai; Yushi Uno (Graphs Comb., 2020)

Yin-Yang Puzzles are NP-complete. - Erik D. Demaine; Jayson Lynch; Mikhail Rudoy; Yushi Uno (CCCG, 2021)

Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. - Mutsunori Banbara; Kenji Hashimoto; Takashi Horiyama; Shin-ichi Minato; Kakeru Nakamura; Masaaki Nishino; Masahiko Sakai; Ryuhei Uehara; Yushi Uno; Norihito Yasuda (CoRR, 2021)

Rolling Polyhedra on Tessellations. - Akira Baes; Erik D. Demaine; Martin L. Demaine; Elizabeth J. Hartung; Stefan Langerman; Joseph O'Rourke; Ryuhei Uehara; Yushi Uno; Aaron Williams 001 (FUN, 2022)

Geodesic Paths Passing Through All Faces on A Polyhedron. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Hiro Ito; Yuta Katayama; Wataru Maruyama; Yushi Uno (JCDCGGG, 2022)

Linear-Time Recognition of Double-Threshold Graphs. - Yusuke Kobayashi 001; Yoshio Okamoto; Yota Otachi; Yushi Uno (Algorithmica, 2022)

Reconfiguration of Non-crossing Spanning Trees. - Oswin Aichholzer; Brad Ballinger; Therese Biedl; Mirela Damian; Erik D. Demaine; Matias Korman; Anna Lubiw; Jayson Lynch; Josef Tkadlec; Yushi Uno (CoRR, 2022)

Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks. - Tatsuya Inoha; Kunihiko Sadakane; Yushi Uno; Yuma Yonebayashi (IEICE Trans. Inf. Syst., 2022)

Upper Clique Transversals in Graphs. - Martin Milanic; Yushi Uno (WG, 2023)

Dually conformal hypergraphs. - Endre Boros; Vladimir Gurvich; Martin Milanic; Yushi Uno (CoRR, 2023)

Eliminating Crossings in Ordered Graphs. - Akanksha Agrawal 001; Sergio Cabello; Michael Kaufmann 001; Saket Saurabh 001; Roohani Sharma; Yushi Uno; Alexander Wolff 001 (SWAT, 2024)

On Minimal Transversals of Maximal Cliques in Graphs. - Endre Boros; Vladimir Gurvich; Martin Milanic; Dmitry Tikhanovsky; Yushi Uno (CoRR, 2024)

QNetDiff: a quantitative measurement of network rewiring. - Shota Nose; Hirotsugu Shiroma; Takuji Yamada; Yushi Uno (BMC Bioinform., 2024)

Enumeration of Ordered Trees with Leaf Restrictions. - Yasuaki Kobayashi; Dominik Köppl; Yasuko Matsui; Hirotaka Ono 001; Toshiki Saitoh; Yushi Uno (From Strings to Graphs, and Back Again, 2025)

Conformality of minimal transversals of maximal cliques. - Endre Boros; Vladimir Gurvich; Martin Milanic; Dmitry Tikhanovsky; Yushi Uno (Discret. Math., 2026)