default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYushi Uno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j39]Shota Nose, Hirotsugu Shiroma, Takuji Yamada, Yushi Uno:
QNetDiff: a quantitative measurement of network rewiring. BMC Bioinform. 25(1): 118 (2024)- [c43]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. SWAT 2024: 1:1-1:19 - [i26]Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff:
Eliminating Crossings in Ordered Graphs. CoRR abs/2404.09771 (2024) - [i25]Endre Boros, Vladimir Gurvich, Martin Milanic, Dmitry Tikhanovsky, Yushi Uno:
On Minimal Transversals of Maximal Cliques in Graphs. CoRR abs/2405.10789 (2024) - 2023
- [c42]Martin Milanic
, Yushi Uno:
Upper Clique Transversals in Graphs. WG 2023: 432-446 - [i24]Endre Boros, Vladimir Gurvich, Martin Milanic, Yushi Uno:
Dually conformal hypergraphs. CoRR abs/2309.00098 (2023) - [i23]Martin Milanic, Yushi Uno:
Upper clique transversals in graphs. CoRR abs/2309.14103 (2023) - 2022
- [j38]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. Algorithmica 84(4): 1163-1181 (2022) - [j37]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. 105-D(3): 451-458 (2022) - [c41]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: 6:1-6:16 - [e4]Pierre Fraigniaud, Yushi Uno:
11th International Conference on Fun with Algorithms, FUN 2022, May 30 to June 3, 2022, Island of Favignana, Sicily, Italy. LIPIcs 226, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-232-7 [contents] - [i22]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 abs/2206.03879 (2022) - 2021
- [c40]Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno:
Yin-Yang Puzzles are NP-complete. CCCG 2021: 97-106 - [e3]Jin Akiyama, Reginaldo M. Marcelo, Mari-Jo P. Ruiz, Yushi Uno:
Discrete and Computational Geometry, Graphs, and Games - 21st Japanese Conference, JCDCGGG 2018, Quezon City, Philippines, September 1-3, 2018, Revised Selected Papers. Lecture Notes in Computer Science 13034, Springer 2021, ISBN 978-3-030-90047-2 [contents] - [i21]Erik D. Demaine, Jayson Lynch, Mikhail Rudoy, Yushi Uno:
Yin-Yang Puzzles are NP-complete. CoRR abs/2106.15585 (2021) - [i20]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 abs/2110.05184 (2021) - 2020
- [j36]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: 101648 (2020) - [j35]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Twenty Years of Progress of ${JCDCG}^3$. Graphs Comb. 36(2): 181-203 (2020) - [c39]Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden:
Gourds: A Sliding-Block Puzzle with Turning. ISAAC 2020: 33:1-33:16 - [c38]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. WG 2020: 286-297 - [i19]Joep Hamersma, Marc J. van Kreveld, Yushi Uno, Tom C. van der Zanden:
Gourds: a sliding-block puzzle with turning. CoRR abs/2011.00968 (2020)
2010 – 2019
- 2019
- [j34]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement fund circulation problem. Discret. Appl. Math. 265: 86-103 (2019) - [j33]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): 99-100 (2019) - [j32]Yutaro Honda, Yoshitaka Inoue, Hiro Ito, Munehiko Sasajima, Junichi Teruyama, Yushi Uno:
Hyperfiniteness of Real-World Networks. Rev. Socionetwork Strateg. 13(2): 123-141 (2019) - [c37]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. WADS 2019: 353-365 - [i18]Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Reconfiguring Undirected Paths. CoRR abs/1905.00518 (2019) - [i17]Yusuke Kobayashi, Yoshio Okamoto, Yota Otachi, Yushi Uno:
Linear-Time Recognition of Double-Threshold Graphs. CoRR abs/1909.09371 (2019) - 2018
- [j31]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. Discret. Appl. Math. 248: 68-78 (2018) - [j30]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: 1-10 (2018) - [j29]Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are hard. Theor. Comput. Sci. 748: 17-27 (2018) - [c36]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Yushi Uno, Andrew Winslow:
Packing Cube Nets into Rectangles with O(1) Holes. JCDCGGG 2018: 152-164 - [i16]Katsuhisa Yamanaka, Takashi Horiyama, J. Mark Keil, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. CoRR abs/1803.06816 (2018) - 2017
- [j28]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: 6-10 (2017) - [j27]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: 708-715 (2017) - [j26]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: 43-55 (2017) - [c35]Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Settlement Fund Circulation Problem. ISAAC 2017: 46:1-46:13 - [i15]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 abs/1703.02671 (2017) - 2016
- [j25]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: 25-39 (2016) - [j24]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector domination for graphs with bounded branchwidth. Discret. Appl. Math. 207: 80-89 (2016) - [j23]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential fixed-parameter algorithms for partial vector domination. Discret. Optim. 22: 111-121 (2016) - [j22]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: 18-26 (2016) - [j21]Takeaki Uno, Yushi Uno:
Mining preserving structures in a graph sequence. Theor. Comput. Sci. 654: 155-163 (2016) - [c34]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: 4:1-4:17 - [c33]Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are Hard. FUN 2016: 22:1-22:14 - [e2]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9943, Springer 2016, ISBN 978-3-319-48531-7 [contents] - [i14]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 abs/1603.01911 (2016) - [i13]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 abs/1607.01826 (2016) - 2015
- [j20]Yushi Uno:
Foreword. IEICE Trans. Inf. Syst. 98-D(3): 485 (2015) - [c32]Takeaki Uno, Yushi Uno:
Mining Preserving Structures in a Graph Sequence. COCOON 2015: 3-15 - [c31]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: 60-72 - [c30]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: 180-192 - [c29]Katsuhisa Yamanaka, Takashi Horiyama, David G. Kirkpatrick, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Yushi Uno:
Swapping Colored Tokens on Graphs. WADS 2015: 619-628 - [c28]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. WALCOM 2015: 113-124 - [i12]Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are Hard. CoRR abs/1505.04274 (2015) - 2014
- [j19]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: 69-77 (2014) - [j18]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. 97-A(6): 1213-1219 (2014) - [j17]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4(2): 251-259 (2014) - [j16]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: 51-61 (2014) - [j15]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: 14-31 (2014) - [c27]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: 230-239 - [c26]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. ISCO 2014: 292-304 - [c25]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. LATIN 2014: 238-249 - [c24]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. WG 2014: 348-359 - [i11]Michael Lampis, Kazuhisa Makino, Valia Mitsou, Yushi Uno:
Parameterized Edge Hamiltonicity. CoRR abs/1403.2041 (2014) - [i10]Erik D. Demaine, David Eppstein, Adam Hesterberg, Hiro Ito, Anna Lubiw, Ryuhei Uehara, Yushi Uno:
Folding a Paper Strip to Minimize Thickness. CoRR abs/1411.6371 (2014) - 2013
- [j14]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) - [j13]Yushi Uno, Fumiya Oguri:
Contracted Webgraphs - Scale-Freeness and Structure Mining -. IEICE Trans. Commun. 96-B(11): 2766-2773 (2013) - [c23]Erik D. Demaine, Yoshio Okamoto, Ryuhei Uehara, Yushi Uno:
Computational complexity and an integer programming model of Shakashaka. CCCG 2013 - [c22]Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: a new upper bound 121 on the maximum score. CCCG 2013 - [i9]Yoshio Okamoto, Yuichi Tatsu, Yushi Uno:
Exact and fixed-parameter algorithms for metro-line crossing minimization problems. CoRR abs/1306.3538 (2013) - [i8]Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
(Total) Vector Domination for Graphs with Bounded Branchwidth. CoRR abs/1306.5041 (2013) - [i7]Akitoshi Kawamura, Takuma Okamoto, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: a new upper bound of 121 on the maximum score. CoRR abs/1307.8192 (2013) - 2012
- [j12]Fumika Kino, Yushi Uno:
An Integer Programming Approach to Solving Tantrix on Fixed Boards. Algorithms 5(1): 158-175 (2012) - [j11]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total labeling problem for trees. Discret. Math. 312(8): 1407-1420 (2012) - [j10]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) - [c21]Fumika Kino, Yushi Uno:
Solving Tantrix via Integer Programming. FUN 2012: 245-257 - [c20]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 - [c19]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 - [c18]Hiroyuki Fukui, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
On Complexity of Flooding Games on Graphs with Interval Representations. TJJCCGG 2012: 73-84 - [i6]Fumika Kino, Yushi Uno:
Solving Tantrix via Integer Programming. CoRR abs/1202.6438 (2012) - [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]Takeaki Uno, Yushi Uno:
Mining Preserving Structures in a Graph Sequence. CoRR abs/1206.6202 (2012) - 2011
- [j9]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) - [j8]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) - [c17]Yushi Uno, Fumiya Oguri:
Contracted Webgraphs: Structure Mining and Scale-Freeness. FAW-AAIM 2011: 287-299 - [c16]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
- [j7]Yushi Uno, Yoshinobu Ota, Akio Uemichi:
Investigating the Web Structure by Isolated Stars. Inf. Media Technol. 5(1): 177-183 (2010) - [c15]Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, Yushi Uno:
UNO Is Hard, Even for a Single Player. FUN 2010: 133-144 - [c14]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60 - [c13]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 - [c12]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. Discret. Appl. Math. 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) - [c11]Takeya Shigezumi, Yushi Uno, Osamu Watanabe:
A Replacement Model for a Scale-Free Property of Cliques. CTW 2009: 285-289 - [c10]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
- [c9]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 - [c8]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:
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 [contents] - [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 Trans. Inf. Syst. 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. Discret. Appl. Math. 154(16): 2373-2386 (2006) - [c7]Yushi Uno, Yoshinobu Ota, Akio Uemichi:
Web Structure Mining by Isolated Stars. WAW 2006: 149-156 - 2005
- [c6]Ryuhei Uehara, Yushi Uno:
Laminar Structure of Ptolemaic Graphs and Its Applications. ISAAC 2005: 186-195 - 2004
- [c5]Ryuhei Uehara, Yushi Uno:
Efficient Algorithms for the Longest Path Problem. ISAAC 2004: 871-883 - 2002
- [c4]Motohide Umano, Yuji Matsumoto, Yushi Uno, Kazuhisa Seta:
Learning by switching generation and reasoning methods in several knowledge representations towards the simulation of human learning process. FUZZ-IEEE 2002: 809-814 - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 23:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
