Yushi Uno

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem (available as arXiv preprint)	N/A	Paper
Geodesic paths passing through all faces on a polyhedron	2026-01-28	Paper
Eliminating crossings in ordered graphs	2025-12-02	Paper
Conformality of minimal transversals of maximal cliques Discrete Mathematics	2025-09-16	Paper
Conformal hypergraphs: duality and implications for the upper clique transversal problem Journal of Graph Theory	2025-07-08	Paper
Reconfiguration of non-crossing spanning trees Journal of Computational Geometry	2024-12-19	Paper
Rolling polyhedra on tessellations	2024-05-16	Paper
Upper Clique Transversals in Graphs	2024-05-03	Paper
Multifold tiles of polyominoes and convex lattice polygons	2024-04-09	Paper
On Minimal Transversals of Maximal Cliques in Graphs (available as arXiv preprint)	2024-01-01	Paper
scientific article; zbMATH DE number 7765391 (Why is no real title available?) (available as arXiv preprint)	2023-11-14	Paper
Packing cube nets into rectangles with O(1) holes	2023-03-31	Paper
Linear-time recognition of double-threshold graphs Graph-Theoretic Concepts in Computer Science	2022-12-21	Paper
Linear-time recognition of double-threshold graphs Algorithmica	2022-03-22	Paper
Settlement Fund Circulation Problem	2020-11-25	Paper
Symmetric assembly puzzles are hard, beyond a few pieces Computational Geometry	2020-10-23	Paper
Twenty years of progress of $\mathrm{JCDCG}^3$ Graphs and Combinatorics	2020-04-03	Paper
Reconfiguring undirected paths (available as arXiv preprint)	2020-01-16	Paper
Reconfiguring undirected paths	2020-01-16	Paper
Linear-Time Recognition of Double-Threshold Graphs (available as arXiv preprint)	2019-09-20	Paper
Settlement fund circulation problem Discrete Applied Mathematics	2019-07-17	Paper
An integer programming approach to solving Tantrix on fixed boards Algorithms	2019-03-26	Paper
Threes!, Fives, 1024!, and 2048 are hard Theoretical Computer Science	2018-11-23	Paper
Parameterized edge Hamiltonicity Discrete Applied Mathematics	2018-09-17	Paper
Subexponential fixed-parameter algorithms for partial vector domination Discrete Optimization	2018-05-24	Paper
Swapping colored tokens on graphs Theoretical Computer Science	2018-05-17	Paper
Hanabi is NP-complete, even for cheaters who look at their cards	2017-07-17	Paper
Threes!, Fives, 1024!, and 2048 are hard	2017-07-17	Paper
Hanabi is NP-hard, even for cheaters who look at their cards Theoretical Computer Science	2017-05-12	Paper
Morpion solitaire 5D: a new upper bound of 121 on the maximum score Information Processing Letters	2017-02-21	Paper
Symmetric assembly puzzles are hard, beyond a few pieces Lecture Notes in Computer Science	2017-02-01	Paper
Symmetric assembly puzzles are hard, beyond a few pieces Lecture Notes in Computer Science	2017-02-01	Paper
Mining preserving structures in a graph sequence Theoretical Computer Science	2016-11-24	Paper
(Total) vector domination for graphs with bounded branchwidth Discrete Applied Mathematics	2016-06-01	Paper
Folding a paper strip to minimize thickness Journal of Discrete Algorithms	2016-02-18	Paper
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares Computational Geometry	2016-01-18	Paper
Swapping Colored Tokens on Graphs Lecture Notes in Computer Science	2015-10-30	Paper
Mining preserving structures in a graph sequence Lecture Notes in Computer Science	2015-10-29	Paper
Subexponential fixed-parameter algorithms for partial vector domination Lecture Notes in Computer Science	2015-10-16	Paper
Parameterized edge Hamiltonicity Lecture Notes in Computer Science	2015-09-09	Paper
Folding a paper strip to minimize thickness WALCOM: Algorithms and Computation	2015-02-27	Paper
A 4.31-approximation for the geometric unique coverage problem on unit disks Theoretical Computer Science	2014-07-07	Paper
Approximating the path-distance-width for AT-free graphs and graphs in related classes Discrete Applied Mathematics	2014-04-02	Paper
(Total) vector domination for graphs with bounded branchwidth LATIN 2014: Theoretical Informatics	2014-03-31	Paper
UNO is hard, even for a single player Theoretical Computer Science	2014-01-22	Paper
On complexity of flooding games on graphs with interval representations Computational Geometry and Graphs	2013-12-06	Paper
A new model for a scale-free hierarchical structure of isolated cliques Journal of Graph Algorithms and Applications	2013-11-28	Paper
A linear time algorithm for L(2,1)-labeling of trees Algorithmica	2013-06-25	Paper
A 4.31-approximation for the geometric unique coverage problem on unit disks Algorithms and Computation	2013-03-21	Paper
A tight upper bound on the ($2,1$)-total labeling number of outerplanar graphs Journal of Discrete Algorithms	2012-09-13	Paper
A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares Algorithm Theory – SWAT 2012	2012-08-14	Paper
The (p,q)-total labeling problem for trees Discrete Mathematics	2012-03-29	Paper
Approximability of the path-distance-width for AT-free graphs Graph-Theoretic Concepts in Computer Science	2011-12-16	Paper
Contracted webgraphs: structure mining and scale-freeness Frontiers in Algorithmics and Algorithmic Aspects in Information and Management	2011-06-03	Paper
The $(2,1)$-total labeling number of outerplanar graphs is at most $\Delta + 2$ Lecture Notes in Computer Science	2011-05-19	Paper
On the complexity of reconfiguration problems Theoretical Computer Science	2011-03-14	Paper
On computing longest paths in small graph classes International Journal of Foundations of Computer Science	2011-01-06	Paper
The (p,q)-total Labeling Problem for Trees Algorithms and Computation	2010-12-09	Paper
A new model for a scale-free hierarchical structure of isolated cliques WALCOM: Algorithms and Computation	2010-02-09	Paper
A Linear Time Algorithm for L(2,1)-Labeling of Trees Lecture Notes in Computer Science	2009-10-29	Paper
An O$(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees Theoretical Computer Science	2009-09-10	Paper
Laminar structure of ptolemaic graphs with applications Discrete Applied Mathematics	2009-06-30	Paper
On the Complexity of Reconfiguration Problems Algorithms and Computation	2009-01-29	Paper
Web Structure Mining by Isolated Stars Algorithms and Models for the Web-Graph	2008-08-19	Paper
An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees Algorithm Theory – SWAT 2008	2008-07-15	Paper
Minimum edge ranking spanning trees of split graphs Discrete Applied Mathematics	2007-01-09	Paper
Algorithms and Computation Lecture Notes in Computer Science	2006-11-14	Paper
Algorithms and Computation Lecture Notes in Computer Science	2005-12-22	Paper
scientific article; zbMATH DE number 1979519 (Why is no real title available?)	2003-09-14	Paper
On minimum edge ranking spanning trees Journal of Algorithms	2001-07-23	Paper

Research outcomes over time

This page was built for person: Yushi Uno