Shuichi Ueno

According to our database1, Shuichi Ueno authored at least 60 papers between 1984 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Stable Matchings in Trees.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
On the Three-Dimensional Channel Routing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

On orthogonal ray trees.
Discret. Appl. Math., 2016

2015
A Note on Irreversible 2-Conversion Sets in Subcubic Graphs.
IEICE Trans. Inf. Syst., 2015

Dominating Sets in Two-Directional Orthogonal Ray Graphs.
IEICE Trans. Inf. Syst., 2015

OBDD Representation of Intersection Graphs.
IEICE Trans. Inf. Syst., 2015

A Note on Harmonious Coloring of Caterpillars.
IEICE Trans. Inf. Syst., 2015

On Evasion Games on Graphs.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

2014
Dominating Sets and Induced Matchings in Orthogonal Ray Graphs.
IEICE Trans. Inf. Syst., 2014

Weighted dominating sets and induced matchings in orthogonal ray graphs.
Proceedings of the International Conference on Control, 2014

A note on the energy-aware mapping for NoCs.
Proceedings of the 2014 IEEE Asia Pacific Conference on Circuits and Systems, 2014

2013
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs.
IEICE Trans. Inf. Syst., 2013

2012
Bandwidth of convex bipartite graphs and related graphs.
Inf. Process. Lett., 2012

On Minimum Feedback Vertex Sets in Graphs.
Proceedings of the Third International Conference on Networking and Computing, 2012

2011
On Two Problems of Nano-PLA Design.
IEICE Trans. Inf. Syst., 2011

Relay-Race Algorithm: A Novel Heuristic Approach to VLSI/PCB Placement.
Proceedings of the IEEE Computer Society Annual Symposium on VLSI, 2011

RRA-based multi-objective optimization to mitigate the worst cases of placement.
Proceedings of the 2011 IEEE 9th International Conference on ASIC, 2011

2010
On orthogonal ray graphs.
Discret. Appl. Math., 2010

On two-directional orthogonal ray graphs.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2010), May 30, 2010

Universal Test Sets for Reversible Circuits.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
On the two-dimensional orthogonal drawing of series-parallel graphs.
Discret. Appl. Math., 2009

On the Three-dimensional Orthogonal Drawing of Outerplanar Graphs.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

Orthogonal Ray Graphs and Nano-PLA Design.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2009), 2009

2008
Cost-Constrained Minimum-Delay Multicasting.
J. Interconnect. Networks, 2008

On Fault Testing for Reversible Circuits.
IEICE Trans. Inf. Syst., 2008

On the three-dimensional orthogonal drawing of series-parallel graphs (extended abstract).
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2008), 2008

2007
Classification of Landmine-Like Objects Buried under Rough Ground Surfaces Using a Ground Penetrating Radar.
IEICE Trans. Electron., 2007

On the Complexity of Three-Dimensional Channel Routing (Extended Abstract).
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2007), 2007

2005
A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

On the Orthogonal Drawing of Outerplanar Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

On sequential diagnosis of multiprocessor systems.
Discret. Appl. Math., 2005

On VLSI decompositions for d-ary de Bruijn graphs (extended abstract).
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

On the three-dimensional channel routing.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2005), 2005

2004
Sparse networks tolerating random faults.
Discret. Appl. Math., 2004

2003
Optimal fault-tolerant linear arrays.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Optimal adaptive parallel diagnosis for arrays.
Proceedings of the 2003 International Symposium on Circuits and Systems, 2003

2002
Optimal Layouts of Virtual Paths in Complete Binary Tree Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002

On three-dimensional layout of pyramid networks.
Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems 2002, 2002

2001
On Adaptive Fault Diagnosis for Multiprocessor Systems.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

On-Line Multicasting in All-Optical Networks.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1999
Small congestion embedding of graphs into hypercubes.
Networks, 1999

Sparse Networks Tolerating Random Faults.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

On VLSI decompositions for deBruijn graphs.
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

1998
Fault-tolerant graphs for tori.
Networks, 1998

Approximating Steiner trees in graphs with restricted weights.
Networks, 1998

1997
Fault-Tolerant Meshes with Efficient Layouts.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1997

Fault-Tolerant Hypercubes with Small Degree.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Optimal Realization of Hypercubes by Three-Dimensional Space-Invariant Optical Interconnections.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1995
Mixed Searching and Proper-Path-Width.
Theor. Comput. Sci., 1995

Fault-tolerant graphs for hypercubes and tori.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
Minimal acyclic forbidden minors for the family of graphs with bounded path-width.
Discret. Math., 1994

1993
Generalization of aTheorem on the Parametric Maximum Flow Problem.
Discret. Appl. Math., 1993

1992
Graph Spanners and Connectivity.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1988
Minimum augmentation of a tree to a K-edge-connected graph.
Networks, 1988

On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three.
Discret. Math., 1988

Ordering of the elements of a matroid such that its consecutive w elements are independent.
Discret. Math., 1988

1986
The minimum augmentation of a directed tree to a <i>k</i>-edge-connected directed graph.
Networks, 1986

Characterization of partial 3-trees in terms of three structures.
Graphs Comb., 1986

1984
A matroid generalization of theorems of Lewin and Gallai.
Discret. Appl. Math., 1984


  Loading...