蓮沼 徹

Independent spanning cycle-rooted trees in the cartesian product of digraphs 

Electronic Notes in Discrete Mathematics, Proceedings of Brazilian Symposium on Graphs, Algorithms and Combinatiorics 7 2001年3月

Finding completely independent spanning trees in maximal planar graphs 

2001年1月

On edge-disjoint spanning trees with small depths 

Information Processing Letters 75(1/2) 71 - 74 2000年7月

Completely independent spanning trees in the underlying graph of a line digraph 

41 - 48 2000年1月

The pagenumber of de Bruijn and Kautz digraphs 

Australian Computer Science Communications Vol. 21, NO. 3 Combinatorics, Computation and Logic (Proceedings of DMTCS'99 and CATS'99), Springer-Verlag 21(3) 232 - 246 1999年

An efficient NC algorithm for a sparse k-edge-connectivity certificate(共著) 

Lecture Notes in Computer Science 1533, Algorithms and Computation(Proceedings of ISAAC'98), Springer-Verlag 447 - 456 1998年

Independent spanning trees with small depths in iterated line digraphs(共著) 

Australian Computer Communications Vol. 20, No. 3 Computing Theory (Proceedings of CATS'98), Springer-Verlag 20(3) 21 - 35 1998年

Embedding de Bruijn, Kautz and shuffle-exchange networks in books(共著) 

Discrete Applied Mathematics 78 103 - 116 1997年

Containment of butterflies in networks constructed by the line digraph operation(共著) 

Information Processing Letters 61(1) 25 - 30 1997年

Counting small cycles in generalized de Bruijn digraphs(共著) 

Networks 29(1) 39 - 47 1997年

The number of labeled graphs placeable by a given permutation(共著) 

Journal of Graph Theory 21 11 - 19 1996年