default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToru Hasunuma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j29]Toru Hasunuma
:
Completely Independent Spanning Trees in Line Graphs. Graphs Comb. 39(4): 90 (2023)- [j28]Toru Hasunuma:
Connectivity preserving trees in k-connected or k-edge-connected graphs. J. Graph Theory 102(3): 423-435 (2023) - 2021
- [j27]Toru Hasunuma:
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. Algorithmica 83(9): 2697-2718 (2021) - 2020
- [j26]Toru Hasunuma, Kosuke Ono:
Connectivity keeping trees in 2-connected graphs. J. Graph Theory 94(1): 20-29 (2020) - 2017
- [j25]Toru Hasunuma:
Constructions of universalized Sierpiński graphs based on labeling manipulations. Electron. Notes Discret. Math. 60: 47-54 (2017) - 2015
- [j24]Toru Hasunuma:
Structural properties of subdivided-line graphs. J. Discrete Algorithms 31: 69-86 (2015) - 2014
- [j23]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4(2): 251-259 (2014) - 2013
- [j22]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. Algorithmica 66(3): 654-681 (2013) - 2012
- [j21]Toru Hasunuma, Mayu Otani:
On the (h, k)-domination numbers of iterated line digraphs. Discret. Appl. Math. 160(12): 1859-1863 (2012) - [j20]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total labeling problem for trees. Discret. Math. 312(8): 1407-1420 (2012) - [j19]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs. J. Discrete Algorithms 14: 189-206 (2012) - [j18]Toru Hasunuma, Chie Morisaka:
Completely independent spanning trees in torus networks. Networks 60(1): 59-69 (2012) - 2009
- [j17]Toru Hasunuma:
Improved book-embeddings of incomplete hypercubes. Discret. Appl. Math. 157(7): 1423-1431 (2009) - [j16]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An O(n1.75) algorithm for L(2, 1)-labeling of trees. Theor. Comput. Sci. 410(38-40): 3702-3710 (2009) - 2007
- [j15]Toru Hasunuma:
Queue layouts of iterated line directed graphs. Discret. Appl. Math. 155(9): 1141-1154 (2007) - [j14]Toru Hasunuma, Misa Hirota:
An improved upper bound on the queuenumber of the hypercube. Inf. Process. Lett. 104(2): 41-44 (2007) - 2004
- [j13]Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata:
On the number of cycles in generalized Kautz digraphs. Discret. Math. 285(1-3): 127-140 (2004) - 2002
- [j12]Toru Hasunuma:
Embedding iterated line digraphs in books. Networks 40(2): 51-62 (2002) - 2001
- [j11]Toru Hasunuma, Hiroshi Nagamochi:
Independent spanning trees with small depths in iterated line digraphs. Discret. Appl. Math. 110(2-3): 189-211 (2001) - [j10]Toru Hasunuma:
Completely independent spanning trees in the underlying graph of a line digraph. Discret. Math. 234(1-3): 149-157 (2001) - [j9]Toru Hasunuma:
Independent spanning cycle-rooted trees in the cartesian product of digraphs. Electron. Notes Discret. Math. 7: 106-109 (2001) - [j8]Hiroshi Nagamochi, Toru Hasunuma:
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. J. Algorithms 38(2): 354-373 (2001) - 2000
- [j7]Yukio Shibata, Toru Hasunuma, Sanae Fukuda:
Isomorphic factorization of de Bruijn digraphs. Discret. Math. 218(1-3): 199-208 (2000) - [j6]Toru Hasunuma:
On edge-disjoint spanning trees with small depths. Inf. Process. Lett. 75(1-2): 71-74 (2000) - 1997
- [j5]Toru Hasunuma, Yukio Shibata:
Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books. Discret. Appl. Math. 78(1-3): 103-116 (1997) - [j4]Toru Hasunuma, Yukio Shibata:
Containment of Butterflies in Networks Constructed by the Line Digraph Operation. Inf. Process. Lett. 61(1): 25-30 (1997) - [j3]Toru Hasunuma, Yukio Shibata:
Counting small cycles in generalized de Bruijn digraphs. Networks 29(1): 39-47 (1997) - 1996
- [j2]Toru Hasunuma, Yukio Shibata:
The number of labeled graphs placeable by a given permutation. J. Graph Theory 21(1): 11-19 (1996) - [j1]Toru Hasunuma, Yukio Shibata:
Remarks on the placeability of isomorphic trees in a complete graph. J. Graph Theory 21(1): 41-42 (1996)
Conference and Workshop Papers
- 2021
- [c13]Toru Hasunuma:
Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k. IWOCA 2021: 356-369 - 2020
- [c12]Toru Hasunuma:
Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions. IWOCA 2020: 316-329 - 2015
- [c11]Toru Hasunuma:
Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees. IWOCA 2015: 260-273 - 2013
- [c10]Toru Hasunuma:
Structural Properties of Subdivided-Line Graphs. IWOCA 2013: 216-229 - 2011
- [c9]Toru Hasunuma, Hiroshi Nagamochi:
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. WG 2011: 203-214 - 2010
- [c8]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (p, q)-total Labeling Problem for Trees. ISAAC (2) 2010: 49-60 - [c7]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2. IWOCA 2010: 103-106 - 2009
- [c6]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. ESA 2009: 35-46 - 2008
- [c5]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
An Algorithm for L(2, 1)-Labeling of Trees. SWAT 2008: 185-197 - 2003
- [c4]Toru Hasunuma:
Laying Out Iterated Line Digraphs Using Queues. GD 2003: 202-213 - 2002
- [c3]Toru Hasunuma:
Completely Independent Spanning Trees in Maximal Planar Graphs. WG 2002: 235-245 - 1998
- [c2]Toru Hasunuma, Hiroshi Nagamochi:
Independent Spanning Trees with Small Depths in Iterated Line Digraphs. CATS 1998: 21-36 - [c1]Hiroshi Nagamochi, Toru Hasunuma:
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. ISAAC 1998: 447-456
Informal and Other Publications
- 2009
- [i2]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A tight upper bound on the (2,1)-total labeling number of outerplanar graphs. CoRR abs/0911.4590 (2009) - 2008
- [i1]Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A linear time algorithm for L(2,1)-labeling of trees. CoRR abs/0810.0906 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
