Yushi Uno

发表

Several results on de Morgan algebra and Kleene algebra of fuzzy logic

Motohide Umano, Yushi Uno, Jianming Deng, 2001, 10th IEEE International Conference on Fuzzy Systems. (Cat. No.01CH37297).

Efficient Algorithms for the Longest Path Problem

Ryuhei Uehara, Yushi Uno, Ryuhei Uehara, 2004, ISAAC.

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

Osamu Watanabe, Yushi Uno, Takeya Shigezumi, 2010, J. Graph Algorithms Appl..

On the complexity of reconfiguration problems

Takehiro Ito, Erik D. Demaine, Ryuhei Uehara, 2008, Theor. Comput. Sci..

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

Kazuhisa Seta, Motohide Umano, Yui Matsumoto, 2002, 2002 IEEE World Congress on Computational Intelligence. 2002 IEEE International Conference on Fuzzy Systems. FUZZ-IEEE'02. Proceedings (Cat. No.02CH37291).

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

Yota Otachi, Koichi Yamazaki, Yoshio Okamoto, 2011, WG.

On Computing Longest Paths in Small Graph Classes

Ryuhei Uehara, Yushi Uno, Ryuhei Uehara, 2007, Int. J. Found. Comput. Sci..

Minimum edge ranking spanning trees of split graphs

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2006, Discret. Appl. Math..

Laminar Structure of Ptolemaic Graphs and Its Applications

Ryuhei Uehara, Yushi Uno, Ryuhei Uehara, 2005, ISAAC.

Efficient Computation of Betweenness Centrality by Graph Decompositions and Their Applications to Real-World Networks

K. Sadakane, Yushi Uno, Tatsuya Inoha, 2022, IEICE Trans. Inf. Syst..

(Total) Vector domination for graphs with bounded branchwidth pdf

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2013, Discret. Appl. Math..

Settlement Fund Circulation Problem

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2019, ISAAC.

An O(n1.75) algorithm for L(2, 1)-labeling of trees

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2009, Theor. Comput. Sci..

Subexponential fixed-parameter algorithms for partial vector domination

Hirotaka Ono, Toshimasa Ishii, Yushi Uno, 2014, Discret. Optim..

Reconfiguring Undirected Paths

David Eppstein, Adam Hesterberg, Ryuhei Uehara, 2019, WADS.

Upper Clique Transversals in Graphs

Martin Milanič, Yushi Uno, 2023, WG.

Contracted Webgraphs: Structure Mining and Scale-Freeness

Yushi Uno, Fumiya Oguri, Yushi Uno, 2011, FAW-AAIM.

Twenty Years of Progress of JCDCG3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hbox {JCDCG}^3$$\end{document}

Toshinori Sakai, Jin Akiyama, Hiro Ito, 2020, Graphs and Combinatorics.

Geodesic Paths Passing Through All Faces on A Polyhedron

E. Demaine, M. Demaine, Yushi Uno, 2023 .

Web Structure Mining by Isolated Cliques

Yushi Uno, Yoshinobu Ota, Akio Uemichi, 2007, IEICE Trans. Inf. Syst..

Linear-Time Recognition of Double-Threshold Graphs

Y. Otachi, Y. Okamoto, Yushi Uno, 2019, Algorithmica.

An Integer Programming Approach to Solving Tantrix on Fixed Boards

Yushi Uno, Fumika Kino, Yushi Uno, 2012, Algorithms.

Yin-Yang Puzzles are NP-complete

Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, 2021, CCCG.

Solving Tantrix via Integer Programming pdf

Yushi Uno, Fumika Kino, Yushi Uno, 2012, FUN.

Hanabi is NP-hard, even for cheaters who look at their cards

Marcel Roeloffzen, André van Renssen, Matias Korman, 2016, Theor. Comput. Sci..

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards pdf

Marcel Roeloffzen, André van Renssen, Matias Korman, 2016, FUN.

Rolling Polyhedra on Tessellations

J. O'Rourke, E. Demaine, M. Demaine, 2022, FUN.

Minimum Edge Ranking Spanning Trees of Threshold Graphs

Toshihide Ibaraki, Kazuhisa Makino, Yushi Uno, 2002, ISAAC.

List of Late Breaking Papers accepted for poster presentation at the 17 th International Conference on Discovery Science (DS 2014)

Bidyut Kr. Patra, S. Džeroski, D. Kocev, 2014 .