Yushi Uno

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