Yushi Uno

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 44

Top Venues

CoRR

Theor. Comput. Sci.

Discret. Appl. Math.

FUN

Publications

Shota Nose, Hirotsugu Shiroma, Takuji Yamada, Yushi Uno
QNetDiff: a quantitative measurement of network rewiring. BMC Bioinform. 25 (1) (2024)
Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno
On Minimal Transversals of Maximal Cliques in Graphs. CoRR (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. SWAT (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. CoRR (2024)
Martin Milanic, Yushi Uno
Upper Clique Transversals in Graphs. WG (2023)
Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno
Dually conformal hypergraphs. CoRR (2023)
Martin Milanic, Yushi Uno
Upper clique transversals in graphs. CoRR (2023)
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
Linear-Time Recognition of Double-Threshold Graphs. Algorithmica 84 (4) (2022)
Tatsuya Inoha, Kunihiko Sadakane, Yushi Uno, Yuma Yonebayashi
Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks. IEICE Trans. Inf. Syst. (3) (2022)
Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams
Rolling Polyhedra on Tessellations. FUN (2022)
Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno
Reconfiguration of Non-crossing Spanning Trees. CoRR (2022)
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
Yin-Yang Puzzles are NP-complete. CoRR (2021)
Mutsunori Banbara, Kenji Hashimoto, Takashi Horiyama, Shin-ichi Minato, Kakeru Nakamura, Masaaki Nishino, Masahiko Sakai, Ryuhei Uehara, Yushi Uno, Norihito Yasuda
Solving Rep-tile by Computers: Performance of Solvers and Analyses of Solutions. CoRR (2021)
Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno
Yin-Yang Puzzles are NP-complete. CCCG (2021)
Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno
Twenty Years of Progress of ${JCDCG}^3$. Graphs Comb. 36 (2) (2020)
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
Linear-Time Recognition of Double-Threshold Graphs. WG (2020)
Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden
Gourds: a sliding-block puzzle with turning. CoRR (2020)
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
Symmetric assembly puzzles are hard, beyond a few pieces. Comput. Geom. 90 (2020)
Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden
Gourds: A Sliding-Block Puzzle with Turning. ISAAC (2020)
Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno
Hyperfiniteness of Real-World Networks. Rev. Socionetwork Strateg. 13 (2) (2019)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Reconfiguring Undirected Paths. CoRR (2019)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Reconfiguring Undirected Paths. WADS (2019)
Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno
Linear-Time Recognition of Double-Threshold Graphs. CoRR (2019)
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Settlement fund circulation problem. Discret. Appl. Math. 265 (2019)
Naoki Katoh, Yuya Higashikawa, Hiro Ito, Shun Kataoka, Takuya Kida, Toshiki Saitoh, Tetsuo Shibuya, Kazuyuki Tanaka, Yushi Uno
Preface for the Special Issue on the Project "Foundation of Innovative Algorithms for Big Data". Rev. Socionetwork Strateg. 13 (2) (2019)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping colored tokens on graphs. Theor. Comput. Sci. 729 (2018)
Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. CoRR (2018)
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
Parameterized Edge Hamiltonicity. Discret. Appl. Math. 248 (2018)
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow
Packing Cube Nets into Rectangles with O(1) Holes. JCDCGGG (2018)
Stefan Langerman, Yushi Uno
Threes!, Fives, 1024!, and 2048 are hard. Theor. Comput. Sci. 748 (2018)
Akitoshi Kawamura, Yuichi Tatsu, Yushi Uno, Masahide Yamato
Morpion Solitaire 5D: A new upper bound of 121 on the maximum score. Inf. Process. Lett. 121 (2017)
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. CoRR (2017)
Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Settlement Fund Circulation Problem. ISAAC (2017)
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
Hanabi is NP-hard, even for cheaters who look at their cards. Theor. Comput. Sci. 675 (2017)
Takashi Horiyama, Takashi Iizuka, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-tori: An Old Western-Japanese Game Played on a Point Set. J. Inf. Process. 25 (2017)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207 (2016)
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. FUN (2016)
Jean-François Baffier, Man-Kwun Chiu, Yago Diez, Matias Korman, Valia Mitsou, André van Renssen, Marcel Roeloffzen, Yushi Uno
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards. CoRR (2016)
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. 51 (2016)
Takeaki Uno, Yushi Uno
Mining preserving structures in a graph sequence. Theor. Comput. Sci. 654 (2016)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. 22 (2016)
Stefan Langerman, Yushi Uno
Threes!, Fives, 1024!, and 2048 are Hard. FUN (2016)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Folding a paper strip to minimize thickness. J. Discrete Algorithms 36 (2016)
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
Single-Player and Two-Player Buttons & Scissors Games. CoRR (2016)
Yushi Uno
Foreword. IEICE Trans. Inf. Syst. (3) (2015)
Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno
Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces. JCDCGG (2015)
Stefan Langerman, Yushi Uno
Threes!, Fives, 1024!, and 2048 are Hard. CoRR (2015)
Takeaki Uno, Yushi Uno
Mining Preserving Structures in a Graph Sequence. COCOON (2015)
Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno
Swapping Colored Tokens on Graphs. WADS (2015)
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
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG (2015)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Folding a Paper Strip to Minimize Thickness. WALCOM (2015)
Erik D. Demaine, Martin L. Demaine, Nicholas J. A. Harvey, Ryuhei Uehara, Takeaki Uno, Yushi Uno
UNO is hard, even for a single player. Theor. Comput. Sci. 521 (2014)
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
Computational Complexity and an Integer Programming Model of Shakashaka. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2014)
Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno
Folding a Paper Strip to Minimize Thickness. CoRR (2014)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(Total) Vector Domination for Graphs with Bounded Branchwidth. LATIN (2014)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO (2014)
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
Approximating the path-distance-width for AT-free graphs and graphs in related classes. Discret. Appl. Math. 168 (2014)
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
Parameterized Edge Hamiltonicity. WG (2014)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4 (2) (2014)
Takashi Horiyama, Masashi Kiyomi, Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno, Yushi Uno, Yukiko Yamauchi
Sankaku-Tori: An Old Western-Japanese Game Played on a Point Set. FUN (2014)
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544 (2014)
Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno
Parameterized Edge Hamiltonicity. CoRR (2014)
Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato
Morpion Solitaire 5D: a new upper bound of 121 on the maximum score. CoRR (2013)
Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno
Computational complexity and an integer programming model of Shakashaka. CCCG (2013)
Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato
Morpion Solitaire 5D: a new upper bound 121 on the maximum score. CCCG (2013)
Yushi Uno, Fumiya Oguri
Contracted Webgraphs - Scale-Freeness and Structure Mining -. IEICE Trans. Commun. (11) (2013)
Yoshio Okamoto, Yuichi Tatsu, Yushi Uno
Exact and fixed-parameter algorithms for metro-line crossing minimization problems. CoRR (2013)
Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(Total) Vector Domination for Graphs with Bounded Branchwidth. CoRR (2013)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66 (3) (2013)
Fumika Kino, Yushi Uno
Solving Tantrix via Integer Programming CoRR (2012)
Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG (2012)
Takeaki Uno, Yushi Uno
Mining Preserving Structures in a Graph Sequence CoRR (2012)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms 14 (2012)
Fumika Kino, Yushi Uno
Solving Tantrix via Integer Programming. FUN (2012)
Fumika Kino, Yushi Uno
An Integer Programming Approach to Solving Tantrix on Fixed Boards. Algorithms 5 (1) (2012)
Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno
On Complexity of Flooding Games on Graphs with Interval Representations CoRR (2012)
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. ISAAC (2012)
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares. SWAT (2012)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
The (p, q)-total labeling problem for trees. Discret. Math. 312 (8) (2012)
Takeya Shigezumi, Yushi Uno, Osamu Watanabe
A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. J. Graph Algorithms Appl. 15 (5) (2011)
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
On the complexity of reconfiguration problems. Theor. Comput. Sci. 412 (12-14) (2011)
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
Approximability of the Path-Distance-Width for AT-free Graphs. WG (2011)
Yushi Uno, Fumiya Oguri
Contracted Webgraphs: Structure Mining and Scale-Freeness. FAW-AAIM (2011)
Takeya Shigezumi, Yushi Uno, Osamu Watanabe
A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. WALCOM (2010)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
)-total Labeling Problem for Trees. ISAAC (2) (2010)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA (2010)
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
The complexity of UNO CoRR (2010)
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno
UNO Is Hard, Even for a Single Player. FUN (2010)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs CoRR (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
(2, 1)-Labeling of Trees. ESA (2009)
Ryuhei Uehara, Yushi Uno
Laminar structure of ptolemaic graphs with applications. Discret. Appl. Math. 157 (7) (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410 (38-40) (2009)
Takeya Shigezumi, Yushi Uno, Osamu Watanabe
A Replacement Model for a Scale-Free Property of Cliques. CTW (2009)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
A linear time algorithm for L(2,1)-labeling of trees CoRR (2008)
Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
On the Complexity of Reconfiguration Problems. ISAAC (2008)
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
An Algorithm for L(2, 1)-Labeling of Trees. SWAT (2008)
Yushi Uno, Yoshinobu Ota, Akio Uemichi
Web Structure Mining by Isolated Cliques. IEICE Trans. Inf. Syst. (12) (2007)
Ryuhei Uehara, Yushi Uno
On Computing Longest Paths in Small Graph Classes. Int. J. Found. Comput. Sci. 18 (5) (2007)
Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
Minimum edge ranking spanning trees of split graphs. Discret. Appl. Math. 154 (16) (2006)
Yushi Uno, Yoshinobu Ota, Akio Uemichi
Web Structure Mining by Isolated Stars. WAW (2006)

Yushi Uno.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Yushi Uno