|
|
1979 - 1994
A. Takahashi, S. Ueno and Y. Kajitani: Minimal Acyclic
Forbidden Minors for the Family of Graphs with Bounded
Path-Width; Discrete Mathematics, Vol.127, pp.293-304,
1994.
Ueno, Bagchi, Hakimi, Schmeichel: On Minimum Fault-Tolerant
Networks; SIAM J. on Discrete Mathematics, Vol.6, pp.565-574,
1993.
Arai, Ueno, Kajitani: Generalization of a Theorem on the
Parametric Maximum Flow Problem; Discrete Applied Mathematics,
Vol.41, pp.69-74, 1993.
S. Ueno, M. Yamazaki, and Y. Kajitani:
Graph Spanners and Connectivity;
Lecture Notes in Computer Science,
Vol.650, pp.126-134, 1992.
Ueno, Tsuji, Kajitani: A Note on Dual Trail Partition
of a Plane Graph; IEICE Trans. Fundamentals, Vol.E74,
pp.1915-1917, 1991.
Ueno, Tsuji, Kajitani: A Note on the Graph Augmentation
Problem; IEICE Trans. Fundamentals, Vol.E74, pp.679-680,
1991.
H. Miyano, T. Fukuhara, S. Ueno, and Y. Kajitani: Characterization
and Enumeration of Aspect Graphs of Convex Polygons; Trans.
IEICE, Vol.J74-A, No.4, pp.692-700, 1991(in Japanese).
H. Suzuki, N. Takahashi, T. Nishizeki, H. Miyano, and
S. Ueno: An Algorithm for Tripartitioning 3-Connected Graphs;
IPSJ Magazine, Vol.31, No.5, pp.584-592, 1990(in Japanese).
Ueno, Kajitani, Wada: Minimum Augmentation of a Tree to
a k-Edge-Connected Graph; Networks, Vol.18, pp.19-25,
1988.
Ueno, Kajitani, Gotoh: On the Nonseparating Independent
Set Problem and Feedback Set Problem for Graphs with no
Vertex Degree Exceeding Three; Discrete Mathematics, Vol.72,
pp.355-369, 1988.
Kajitani, Ueno, Miyano: Ordering of the Elements of a
Matroid such that Its Consecutive w Elements are Independent;
Discrete Mathematics, Vol.72, pp.187-194, 1988.
Y. Kajitani, S. Ueno, and K. Miyasaka: On the Minimum
Number of Edges of Survivable Networks with Minimum Cost;
Trans. IEICE, Vol.J70-A, No.2, pp.146-155, 1987(in Japanese).
Kajitani, Ueno: The Minimum Augmentation of a Directed
Tree to a k-Edge-Connected Directed Graph; Networks, Vol.16,
pp.181-197, 1986.
Kajitani, Ishizuka, Ueno: Characterization of Partial
3-Trees in Terms of Three Structures; Graphs and Combinatorics,
Vol.2, pp.233-246, 1986.
S. Ueno and Y. Kajitani: The Unique Solvability and State
Variables of an RCG Networks; Trans. IECE, Vol.J68-A,
No.9, pp.859-866, 1985(in Japanese).
S. Ueno and Y. Kajitani: A Matroid Generalization of Theorems
of Lewin and Gallai; Discrete Applied Mathematics, Vol.9,
pp.213-216, 1984.
Y. Kajitani and S. Ueno: The Principal Partition of Matroids
with Parity Conditions and Its Applications; Trans. IECE,
Vol.J66-A, No.6, pp.553-560, 1983(in Japanese).
Kajitani, Ueno, Chen: On the Number of Essential Complementary
Partitions; IEEE Trans. on Circuits and Systems, Vol.CAS-29,
pp.572-574, 1982.
Y. Kajitani and S. Ueno: On the Rank of Certain Classes
of Cut-Set and Tie-Set of a Graph; IEEE Trans. on Circuits
and Systems, Vol.CAS-26, pp.666--668, 1979.
Y. Kajitani and S. Ueno: On redundant Elements of a Fundamental
Tie Matrix of a Graph; Trans. IECE, Vol.62-A, No.1, pp.1-7,
1979(in Japanese).
|
