Yushi Uno

According to our database, Yushi Uno authored at least 77 papers between 2001 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

QNetDiff: a quantitative measurement of network rewiring.

Shota Nose, Hirotsugu Shiroma, Takuji Yamada, Yushi Uno

BMC Bioinform., December, 2024

On Minimal Transversals of Maximal Cliques in Graphs.

Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno

CoRR, 2024

Eliminating Crossings in Ordered Graphs.

Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Dually conformal hypergraphs.

Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno

CoRR, 2023

Upper Clique Transversals in Graphs.

Martin Milanic, Yushi Uno

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

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

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

Linear-Time Recognition of Double-Threshold Graphs.

Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno

Algorithmica, 2022

Rolling Polyhedra on Tessellations.

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

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

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

Yin-Yang Puzzles are NP-complete.

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

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Twenty Years of Progress of ${JCDCG}^3$.

Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno

Graphs Comb., 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

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

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

Hyperfiniteness of Real-World Networks.

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

Rev. Socionetwork Strateg., 2019

Settlement fund circulation problem.

Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Discret. Appl. Math., 2019

Reconfiguring Undirected Paths.

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

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

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

Threes!, Fives, 1024!, and 2048 are hard.

Stefan Langerman, Yushi Uno

Theor. Comput. Sci., 2018

Parameterized Edge Hamiltonicity.

Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno

Discret. Appl. Math., 2018

Packing Cube Nets into Rectangles with O(1) Holes.

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

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

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

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

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

2016

Mining preserving structures in a graph sequence.

Takeaki Uno, Yushi Uno

Theor. Comput. Sci., 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

Subexponential fixed-parameter algorithms for partial vector domination.

Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Discret. Optim., 2016

(Total) Vector domination for graphs with bounded branchwidth.

Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Discret. Appl. Math., 2016

Single-Player and Two-Player Buttons & Scissors Games.

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

CoRR, 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

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

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Foreword.

Yushi Uno

IEICE Trans. Inf. Syst., 2015

Swapping Colored Tokens on Graphs.

Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

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öffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

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

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

Algorithmic aspects of distance constrained labeling: a survey.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Int. J. Netw. Comput., 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

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, Yushi Uno, Koichi Yamazaki

Discret. Appl. Math., 2014

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

Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013

Contracted Webgraphs - Scale-Freeness and Structure Mining -.

Yushi Uno, Fumiya Oguri

IEICE Trans. Commun., 2013

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

Yoshio Okamoto, Yuichi Tatsu, Yushi Uno

CoRR, 2013

A Linear Time Algorithm for L(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Algorithmica, 2013

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

Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

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

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

J. Discrete Algorithms, 2012

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

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Discret. Math., 2012

On Complexity of Flooding Games on Graphs with Interval Representations

Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno

CoRR, 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, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

Solving Tantrix via Integer Programming.

Fumika Kino, Yushi Uno

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

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

A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques.

Takeya Shigezumi, Yushi Uno, Osamu Watanabe

J. Graph Algorithms Appl., 2011

Approximability of the Path-Distance-Width for AT-free Graphs.

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

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2011

Contracted Webgraphs: Structure Mining and Scale-Freeness.

Yushi Uno, Fumiya Oguri

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Investigating the Web Structure by Isolated Stars.

Yushi Uno, Yoshinobu Ota, Akio Uemichi

Inf. Media Technol., 2010

The complexity of UNO

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

CoRR, 2010

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The (<i>p</i>, <i>q</i>)-total Labeling Problem for Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

UNO Is Hard, Even for a Single Player.

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

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

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

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Theor. Comput. Sci., 2009

Laminar structure of ptolemaic graphs with applications.

Ryuhei Uehara, Yushi Uno

Discret. Appl. Math., 2009

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

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

CoRR, 2009

A Linear Time Algorithm for <i>L</i>(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Algorithms, 2009

A Replacement Model for a Scale-Free Property of Cliques.

Takeya Shigezumi, Yushi Uno, Osamu Watanabe

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

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

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

CoRR, 2008

An Algorithm for L(2, 1)-Labeling of Trees.

Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Proceedings of the Algorithm Theory, 2008

2007

On Computing Longest Paths in Small Graph Classes.

Ryuhei Uehara, Yushi Uno

Int. J. Found. Comput. Sci., 2007

Web Structure Mining by Isolated Cliques.

Yushi Uno, Yoshinobu Ota, Akio Uemichi

IEICE Trans. Inf. Syst., 2007

2006

Minimum edge ranking spanning trees of split graphs.

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki

Discret. Appl. Math., 2006

Web Structure Mining by Isolated Stars.

Yushi Uno, Yoshinobu Ota, Akio Uemichi

Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

2005

Laminar Structure of Ptolemaic Graphs and Its Applications.

Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

Efficient Algorithms for the Longest Path Problem.

Ryuhei Uehara, Yushi Uno

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2002

Minimum Edge Ranking Spanning Trees of Threshold Graphs.

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Learning by switching generation and reasoning methods in several knowledge representations towards the simulation of human learning process.

Motohide Umano, Yuji Matsumoto, Yushi Uno, Kazuhisa Seta

Proceedings of the 2002 IEEE International Conference on Fuzzy Systems, 2002

2001

On Minimum Edge Ranking Spanning Trees.

Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki

J. Algorithms, 2001

Several Results on De Morgan Algebra and Kleene Algebra of Fuzzy Logic.

Jianming Deng, Motohide Umano, Tetsuhisa Oda, Yushi Uno

Proceedings of the 10th IEEE International Conference on Fuzzy Systems, 2001