Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Yushi Uno
2010 – today
- 2013
[j12]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66(3): 654-681 (2013)- 2012
- [j11]Fumika Kino, Yushi Uno: An Integer Programming Approach to Solving Tantrix on Fixed Boards. Algorithms 5(1): 158-175 (2012)
- [j10]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (p, q)-total labeling problem for trees. Discrete Mathematics 312(8): 1407-1420 (2012)
- [j9]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: 189-206 (2012)
- [c19]
- [c18]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: 372-381
- [c17]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: 24-35
- [i6]
- [i5]Hiroyuki Fukui, Ryuhei Uehara, Takeaki Uno, Yushi Uno: On Complexity of Flooding Games on Graphs with Interval Representations. CoRR abs/1206.6201 (2012)
- [i4]
- 2011
- [j8]Takeya Shigezumi, Yushi Uno, Osamu Watanabe: A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. J. Graph Algorithms Appl. 15(5): 661-682 (2011)
- [j7]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): 1054-1065 (2011)
- [c16]Yushi Uno, Fumiya Oguri: Contracted Webgraphs: Structure Mining and Scale-Freeness. FAW-AAIM 2011: 287-299
- [c15]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: 271-282
- 2010
- [c14]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: UNO Is Hard, Even for a Single Player. FUN 2010: 133-144
- [c13]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60
- [c12]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA 2010: 103-106
- [c11]Takeya Shigezumi, Yushi Uno, Osamu Watanabe: A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques. WALCOM 2010: 216-227
- [i3]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno: The complexity of UNO. CoRR abs/1003.2851 (2010)
2000 – 2009
- 2009
- [j6]Ryuhei Uehara, Yushi Uno: Laminar structure of ptolemaic graphs with applications. Discrete Applied Mathematics 157(7): 1533-1543 (2009)
- [j5]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An O(n1.75) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410(38-40): 3702-3710 (2009)
- [c10]Takeya Shigezumi, Yushi Uno, Osamu Watanabe: A Replacement Model for a Scale-Free Property of Cliques. CTW 2009: 285-289
- [c9]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A Linear Time Algorithm for L(2, 1)-Labeling of Trees. ESA 2009: 35-46
- [i2]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. CoRR abs/0911.4590 (2009)
- 2008
- [c8]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: 28-39
- [c7]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197
- [e1]Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno (Eds.): Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers. Lecture Notes in Computer Science 4535, Springer 2008, ISBN 978-3-540-89549-7
- [i1]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno: A linear time algorithm for L(2,1)-labeling of trees. CoRR abs/0810.0906 (2008)
- 2007
- [j4]Yushi Uno, Yoshinobu Ota, Akio Uemichi: Web Structure Mining by Isolated Cliques. IEICE Transactions 90-D(12): 1998-2006 (2007)
- [j3]Ryuhei Uehara, Yushi Uno: On Computing Longest Paths in Small Graph Classes. Int. J. Found. Comput. Sci. 18(5): 911-930 (2007)
- 2006
- [j2]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: Minimum edge ranking spanning trees of split graphs. Discrete Applied Mathematics 154(16): 2373-2386 (2006)
- [c6]
- 2005
- [c5]Ryuhei Uehara, Yushi Uno: Laminar Structure of Ptolemaic Graphs and Its Applications. ISAAC 2005: 186-195
- 2004
- [c4]
- 2002
- [c3]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: Minimum Edge Ranking Spanning Trees of Threshold Graphs. ISAAC 2002: 428-440
- 2001
- [j1]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: On Minimum Edge Ranking Spanning Trees. J. Algorithms 38(2): 411-437 (2001)
- [c2]Jianming Deng, Motohide Umano, Tetsuhisa Oda, Yushi Uno: Several Results on De Morgan Algebra and Kleene Algebra of Fuzzy Logic. FUZZ-IEEE 2001: 1144-1147
1990 – 1999
- 1999
- [c1]Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki: On Minimum Edge Ranking Spanning Trees. MFCS 1999: 398-409
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-27 01:22 CEST by the dblp team