% csauthors.net - beta - BibTeX bibliography of Toru Hasunuma
@article{journals/jgt/HasunumaS96,
title = {The number of labeled graphs placeable by a given permutation.},
year = {1996},
journal = {J. Graph Theory},
author = {{Toru Hasunuma} and {Yukio Shibata}}
}
@article{journals/jgt/HasunumaS96a,
title = {Remarks on the placeability of isomorphic trees in a complete graph.},
year = {1996},
journal = {J. Graph Theory},
author = {{Toru Hasunuma} and {Yukio Shibata}}
}
@article{journals/dam/HasunumaS97,
title = {Embedding De Bruijn, Kautz and Shuffle-exchange Networks in Books.},
year = {1997},
journal = {Discret. Appl. Math.},
author = {{Toru Hasunuma} and {Yukio Shibata}}
}
@article{journals/ipl/HasunumaS97,
title = {Containment of Butterflies in Networks Constructed by the Line Digraph Operation.},
year = {1997},
journal = {Inf. Process. Lett.},
author = {{Toru Hasunuma} and {Yukio Shibata}}
}
@article{journals/networks/HasunumaS97,
title = {Counting small cycles in generalized de Bruijn digraphs.},
year = {1997},
journal = {Networks},
author = {{Toru Hasunuma} and {Yukio Shibata}}
}
@article{journals/dm/ShibataHF00,
title = {Isomorphic factorization of de Bruijn digraphs.},
year = {2000},
journal = {Discret. Math.},
author = {{Yukio Shibata} and {Toru Hasunuma} and {Sanae Fukuda}}
}
@article{journals/ipl/Hasunuma00,
title = {On edge-disjoint spanning trees with small depths.},
year = {2000},
journal = {Inf. Process. Lett.},
author = {{Toru Hasunuma}}
}
@article{journals/dam/HasunumaN01,
title = {Independent spanning trees with small depths in iterated line digraphs.},
year = {2001},
journal = {Discret. Appl. Math.},
author = {{Toru Hasunuma} and {Hiroshi Nagamochi}}
}
@article{journals/dm/Hasunuma01,
title = {Completely independent spanning trees in the underlying graph of a line digraph.},
year = {2001},
journal = {Discret. Math.},
author = {{Toru Hasunuma}}
}
@article{journals/endm/Hasunuma01,
title = {Independent spanning cycle-rooted trees in the cartesian product of digraphs.},
year = {2001},
journal = {Electron. Notes Discret. Math.},
author = {{Toru Hasunuma}}
}
@article{journals/jal/NagamochiH01,
title = {An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate.},
year = {2001},
journal = {J. Algorithms},
author = {{Hiroshi Nagamochi} and {Toru Hasunuma}}
}
@inproceedings{conf/wg/Hasunuma02,
title = {Completely Independent Spanning Trees in Maximal Planar Graphs.},
year = {2002},
booktitle = {WG},
author = {{Toru Hasunuma}},
publisher = {Springer},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers}
}
@article{journals/networks/Hasunuma02,
title = {Embedding iterated line digraphs in books.},
year = {2002},
journal = {Networks},
author = {{Toru Hasunuma}}
}
@inproceedings{conf/gd/Hasunuma03,
title = {Laying Out Iterated Line Digraphs Using Queues.},
year = {2003},
booktitle = {GD},
author = {{Toru Hasunuma}},
publisher = {Springer},
booktitle = {Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers}
}
@article{journals/dm/HasunumaKMS04,
title = {On the number of cycles in generalized Kautz digraphs.},
year = {2004},
journal = {Discret. Math.},
author = {{Toru Hasunuma} and {Yosuke Kikuchi} and {Takeshi Mori} and {Yukio Shibata}}
}
@article{journals/dam/Hasunuma07,
title = {Queue layouts of iterated line directed graphs.},
year = {2007},
journal = {Discret. Appl. Math.},
author = {{Toru Hasunuma}}
}
@article{journals/ipl/HasunumaH07,
title = {An improved upper bound on the queuenumber of the hypercube.},
year = {2007},
journal = {Inf. Process. Lett.},
author = {{Toru Hasunuma} and {Misa Hirota}}
}
@inproceedings{conf/swat/HasunumaIOU08,
title = {An Algorithm for L(2, 1)-Labeling of Trees.},
year = {2008},
booktitle = {SWAT},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}},
publisher = {Springer},
booktitle = {Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings}
}
@article{journals/corr/abs-0810-0906,
title = {A linear time algorithm for L(2,1)-labeling of trees},
year = {2008},
journal = {CoRR},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}}
}
@inproceedings{conf/esa/HasunumaIOU09,
title = {A Linear Time Algorithm for L(2, 1)-Labeling of Trees.},
year = {2009},
booktitle = {ESA},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}},
publisher = {Springer},
booktitle = {Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings}
}
@article{journals/corr/abs-0911-4590,
title = {A tight upper bound on the (2,1)-total labeling number of outerplanar graphs},
year = {2009},
journal = {CoRR},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}}
}
@article{journals/dam/Hasunuma09,
title = {Improved book-embeddings of incomplete hypercubes.},
year = {2009},
journal = {Discret. Appl. Math.},
author = {{Toru Hasunuma}}
}
@article{journals/tcs/HasunumaIOU09,
title = {An O(n1.75) algorithm for L(2, 1)-labeling of trees.},
year = {2009},
journal = {Theor. Comput. Sci.},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}}
}
@inproceedings{conf/isaac/HasunumaIOU10,
title = {The (p, q)-total Labeling Problem for Trees.},
year = {2010},
booktitle = {ISAAC (2)},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}},
publisher = {Springer},
booktitle = {Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II}
}
@inproceedings{conf/iwoca/HasunumaIOU10,
title = {The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2.},
year = {2010},
booktitle = {IWOCA},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}},
publisher = {Springer},
booktitle = {Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers}
}
@inproceedings{conf/wg/HasunumaN11,
title = {Improved Bounds for Minimum Fault-Tolerant Gossip Graphs.},
year = {2011},
booktitle = {WG},
author = {{Toru Hasunuma} and {Hiroshi Nagamochi}},
publisher = {Springer},
booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers}
}
@article{journals/dam/HasunumaO12,
title = {On the (h, k)-domination numbers of iterated line digraphs.},
year = {2012},
journal = {Discret. Appl. Math.},
author = {{Toru Hasunuma} and {Mayu Otani}}
}
@article{journals/dm/HasunumaIOU12,
title = {The (p, q)-total labeling problem for trees.},
year = {2012},
journal = {Discret. Math.},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}}
}
@article{journals/jda/HasunumaIOU12,
title = {A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs.},
year = {2012},
journal = {J. Discrete Algorithms},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}}
}
@article{journals/networks/HasunumaM12,
title = {Completely independent spanning trees in torus networks.},
year = {2012},
journal = {Networks},
author = {{Toru Hasunuma} and {Chie Morisaka}}
}
@article{journals/algorithmica/HasunumaIOU13,
title = {A Linear Time Algorithm for L(2, 1)-Labeling of Trees.},
year = {2013},
journal = {Algorithmica},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}}
}
@article{journals/ijnc/HasunumaIOU14,
title = {Algorithmic aspects of distance constrained labeling: a survey.},
year = {2014},
journal = {Int. J. Netw. Comput.},
author = {{Toru Hasunuma} and {Toshimasa Ishii} and {Hirotaka Ono 001} and {Yushi Uno}}
}
@inproceedings{conf/iwoca/Hasunuma15,
title = {Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees.},
year = {2015},
booktitle = {IWOCA},
author = {{Toru Hasunuma}},
publisher = {Springer},
booktitle = {Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers}
}
@article{journals/jda/Hasunuma15,
title = {Structural properties of subdivided-line graphs.},
year = {2015},
journal = {J. Discrete Algorithms},
author = {{Toru Hasunuma}}
}
@article{journals/endm/Hasunuma17,
title = {Constructions of universalized Sierpiński graphs based on labeling manipulations.},
year = {2017},
journal = {Electron. Notes Discret. Math.},
author = {{Toru Hasunuma}}
}
@article{journals/jgt/HasunumaO20,
title = {Connectivity keeping trees in 2-connected graphs.},
year = {2020},
journal = {J. Graph Theory},
author = {{Toru Hasunuma} and {Kosuke Ono}}
}
@inproceedings{conf/iwoca/Hasunuma21,
title = {Augmenting a Tree to a k-Arbor-Connected Graph with Pagenumber k.},
year = {2021},
booktitle = {IWOCA},
author = {{Toru Hasunuma}},
publisher = {Springer},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings}
}
@article{journals/algorithmica/Hasunuma21,
title = {Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions.},
year = {2021},
journal = {Algorithmica},
author = {{Toru Hasunuma}}
}
@article{journals/jgt/Hasunuma23,
title = {Connectivity preserving trees in k-connected or k-edge-connected graphs.},
year = {2023},
journal = {J. Graph Theory},
author = {{Toru Hasunuma}}
}
@article{journals/gc/Hasunuma23,
title = {Completely Independent Spanning Trees in Line Graphs.},
year = {2023},
month = {August},
journal = {Graphs Comb.},
author = {{Toru Hasunuma}}
}