Toru Hasunuma - RankMe

46 papers A 2B 3C 5Journal 33Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Connectivity Preserving Hamiltonian Cycles in k-Connected Dirac Graphs. Graphs Comb. Toru Hasunuma
2025	J	`jnl`	Exponentiation of Graphs. Math. Comput. Sci. Toru Hasunuma
2023	J	`jnl`	Completely Independent Spanning Trees in Line Graphs. Graphs Comb. Toru Hasunuma
2023	J	`jnl`	Connectivity preserving trees in J. Graph Theory Toru Hasunuma
2021	C	`conf`	Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k. IWOCA Toru Hasunuma
2021	J	`jnl`	Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. Algorithmica Toru Hasunuma
2020	C	`conf`	Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. IWOCA Toru Hasunuma
2020	J	`jnl`	Connectivity keeping trees in 2-connected graphs. J. Graph Theory Toru Hasunuma, Kosuke Ono
2017	J	`jnl`	Constructions of universalized Sierpiński graphs based on labeling manipulations. Electron. Notes Discret. Math. Toru Hasunuma
2015	C	`conf`	Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. IWOCA Toru Hasunuma
2015	J	`jnl`	Structural properties of subdivided-line graphs. J. Discrete Algorithms Toru Hasunuma
2014	J	`jnl`	Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. Toru Hasunuma, 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	C	`conf`	Structural Properties of Subdivided-Line Graphs. IWOCA Toru Hasunuma
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`	Completely independent spanning trees in torus networks. Networks Toru Hasunuma, Chie Morisaka
2012	J	`jnl`	On the (h, k)-domination numbers of iterated line digraphs. Discret. Appl. Math. Toru Hasunuma, Mayu Otani
2012	J	`jnl`	The (p, q)-total labeling problem for trees. Discret. Math. Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
2011	B	`conf`	Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. WG Toru Hasunuma, Hiroshi Nagamochi
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
2009	A	`conf`	A Linear Time Algorithm for ESA Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno
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`	Improved book-embeddings of incomplete hypercubes. Discret. Appl. Math. Toru Hasunuma
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
2007	J	`jnl`	An improved upper bound on the queuenumber of the hypercube. Inf. Process. Lett. Toru Hasunuma, Misa Hirota
2007	J	`jnl`	Queue layouts of iterated line directed graphs. Discret. Appl. Math. Toru Hasunuma
2004	J	`jnl`	On the number of cycles in generalized Kautz digraphs. Discret. Math. Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata
2003	A	`conf`	Laying Out Iterated Line Digraphs Using Queues. GD Toru Hasunuma
2002	B	`conf`	Completely Independent Spanning Trees in Maximal Planar Graphs. WG Toru Hasunuma
2002	J	`jnl`	Embedding iterated line digraphs in books. Networks Toru Hasunuma
2001	J	`jnl`	An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms Hiroshi Nagamochi, Toru Hasunuma
2001	J	`jnl`	Completely independent spanning trees in the underlying graph of a line digraph. Discret. Math. Toru Hasunuma
2001	J	`jnl`	Independent spanning cycle-rooted trees in the cartesian product of digraphs. Electron. Notes Discret. Math. Toru Hasunuma
2001	J	`jnl`	Independent spanning trees with small depths in iterated line digraphs. Discret. Appl. Math. Toru Hasunuma, Hiroshi Nagamochi
2000	J	`jnl`	Isomorphic factorization of de Bruijn digraphs. Discret. Math. Yukio Shibata, Toru Hasunuma, Sanae Fukuda
2000	J	`jnl`	On edge-disjoint spanning trees with small depths. Inf. Process. Lett. Toru Hasunuma
1998	B	`conf`	An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ISAAC Hiroshi Nagamochi, Toru Hasunuma
1998	—	`conf`	Independent Spanning Trees with Small Depths in Iterated Line Digraphs. CATS Toru Hasunuma, Hiroshi Nagamochi
1997	J	`jnl`	Containment of Butterflies in Networks Constructed by the Line Digraph Operation. Inf. Process. Lett. Toru Hasunuma, Yukio Shibata
1997	J	`jnl`	Counting small cycles in generalized de Bruijn digraphs. Networks Toru Hasunuma, Yukio Shibata
1997	J	`jnl`	Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. Discret. Appl. Math. Toru Hasunuma, Yukio Shibata
1996	J	`jnl`	Remarks on the placeability of isomorphic trees in a complete graph. J. Graph Theory Toru Hasunuma, Yukio Shibata
1996	J	`jnl`	The number of labeled graphs placeable by a given permutation. J. Graph Theory Toru Hasunuma, Yukio Shibata