『徳島大学 教育・研究者情報データベース (EDB)』---[学外] /
〔閲覧〕【著作】
--- テーブル「著作」（著作（著書，論文，レター，国際会議など））は研究業績にかかる著作（著書，論文，レター，国際会議など）を登録するテーブルです．
登録情報
抽出条件
| [組織]= | (未定義) | |
|---|---|---|
| OWN= |  蓮沼 徹 ([徳島大学.大学院社会産業理工学研究部.理工学域.数理科学系.数理情報分野]/[徳島大学.理工学部.理工学科.数理科学コース.数理情報講座])
|
登録情報の数
有効な情報: 48件 + 無効な情報: 1件 = 全ての情報: 49件
全ての有効な情報 (48件)
条件追加
[種別](著作の種別)による分類 : | ||||||||||||||||||||
[言語](著作の言語)による分類 : | ||||||||||||||||||||
[カテゴリ](著作のカテゴリ)による分類 : | ||||||||||||||||||||
[共著種別](共著の種別)による分類 : | ||||||||||||||||||||
[学究種別](著作の学究種別)による分類 : | ||||||||||||||||||||
[年月日](発行年月日)による分類
| ||||||||||||||||||||
抽出結果のリスト
-
排列順: 項目表示: Toru Hasunuma and Yukio Shibata : The number of labeled graphs placeable by a given permutation, Journal of Graph Theory, Vol.21, (号), 11-19, 1996. ... Toru Hasunuma and Yukio Shibata : Remarks on the placeability of isomorphic trees in a complete graph, Journal of Graph Theory, Vol.21, (号), 41-42, 1996. ... Toru Hasunuma and Yukio Shibata : Counting small cycles in generalized de Bruijn digraphs, Networks, Vol.29, (号), 39-47, 1997. ... Toru Hasunuma and Yukio Shibata : Embedding de Bruijn, Kautz and shuffle-exchange networks in books, Discrete Applied Mathematics, Vol.78, (号), 103-116, 1997. ... Toru Hasunuma and Hiroshi Nagamochi : Independent spanning trees with small depths in iterated line digraphs, Proceedings of 4th Australasian Theory Symposium (Perth, Australia, Feb. 2-3, 1998), Australian Computer Science Communications, Vol.20, No.3, 21-35, Perth, Feb. 1998. ... Hiroshi Nagamochi and Toru Hasunuma : An efficient NC algorithm for a sparse k-edge-connectivity certificate, Proceedings of 9th International Symposium on Algorithms and Computation (Taejon, Korea, Dec.14-16, 1998) Lecture Notes in Computer Science, Vol.1533, (号), 447-456, Taejon, Dec. 1998. ... Toru Hasunuma : The pagenumber of de Bruijn and Kautz digraphs, Proceedings of 5th Australasian Theory Symposium (Jan.18-21, 1999), Australian Computer Science Communications, Vol.21, No.3, 232-246, Auckland, Jan. 1999. ... Yukio Shibata, Toru Hasunuma and Sanae Fukuda : Isomorphic factorization of de Bruijn digraphs, Discrete Mathematics, Vol.218, No.1-3, 199-208, 2000. ... Hiroshi Nagamochi and Toru Hasunuma : An efficient NC algorithm for a sparse k-edge-connectivity certificate, Journal of Algorithms, Vol.38, No.2, 354-373, 2001. ... Toru Hasunuma : Independent spanning cycle-rooted trees in the cartesian product of digraphs, Proceedings of Brazilizan Symposium on Graphs, Algorithms and Combinatorics (March 17-19, 2001) Electronic Notes in Discrete Mathematics, Vol.7, (号), 106-109, Fortaleza, Brazil, March 2001. ... Toru Hasunuma : Completely independent spanning trees in the underlying graph of a line digraph, Discrete Mathematics, Vol.234, No.1-3, 149-157, 2001. ... Toru Hasunuma and Hiroshi Nagamochi : Independent spanning trees with small depths in iterated line digraphs, Discrete Applied Mathematics, Vol.110, No.2-3, 189-211, 2001. ... Toru Hasunuma : Completely independent spanning trees in maximal planar graphs, Proceedings of 28th International Workshop on Graph-Theoretic Concepts in Computer Science (June 13-15, 2002), Lecture Notes in Computer Science, Vol.2573, (号), 235-245, Chesky Krumlov, Czech Republic, June 2002. ... Toru Hasunuma : Embedding iterated line digraphs in books, Networks, Vol.40, No.2, 51-62, 2002. ... Toru Hasunuma : Laying out iterated line digraphs using queues, Proceedings of 11th International Symposium on Graph Drawing (Sep. 21-24, 2003), Lecture Notes in Computer Science, Vol.2912, (号), 202-213, Perugia, Italy, Sep. 2003. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : An O(n^{1.75}) algorithm for L(2,1)-labeling of trees, Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT2008), Lecture Notes in Computer Science, Vol.5124, (号), 185-197, Gothenburg, Sweden, July 2008. ... Toru Hasunuma : Improved book-embeddings of incomplete hypercubes, Discrete Applied Mathematics, Vol.157, No.7, 1423-1431, 2009. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : An O(n1.75) algorithm for L(2,1)-labeling of trees, Theoretical Computer Science, Vol.410, No.38-40, 3702-3710, 2009. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : A linear time algorithm for L(2,1)-labeling of trees, Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009), Lecture Notes in Computer Science vol. 5757, pp. 35-46., (巻), (号), (頁), Copenhagen, Denmark, Sep. 2009. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : The (2,1)-total labeling number of outerplanar graphs is at mot Δ+2, Proceedings of 21th International Workshop on Combinatorial Algorithms (IWOCA 2010), Lecture Notes in Computer Science, Vol.6460, 103-107, London, July 2010. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : The (p,q)-total labeling problem for trees, Proceedings of 21th International Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Computer Science, Vol.6507, 49-60, Jeju Island, Korea, Dec. 2010. ... Toru Hasunuma and Hiroshi Nagamochi : Improved bounds for minimum fault-tolerant gossip graphs, Proceedings of 37th International Workshop on Graph-Theoretic Concepts in Computer Science (June 21-24, 2011), Lecture Notes in Computer Science, Vol.6986, (号), 203-214, Tepla, Czech Republic, June 2011. ... Toru Hasunuma and Ayane Haruna : A linear time algorithm for the queue-numbers of maximal outerplanar graphs, Proceedings of 28th European Workshop on Computational Geometry (March 19-21, 2012), (巻), (号), 37-40, Assisi, Italy, March 2012. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : The (p,q)-total labeling problem for trees, Discrete Mathematics, Vol.312, (号), 1407-1420, 2012. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : A tight upper bound on the (2,1)-total labeling number of outerplanar graphs, Journal of Discrete Algorithms, Vol.14, (号), 189-206, 2012. ... Toru Hasunuma and Mayu Otani : On the (h,k)-domination numbers of iterated line digraphs, Discrete Applied Mathematics, Vol.160, No.12, 1859-1863, 2012. ... Toru Hasunuma and Chie Morisaka : Completely independent spanning trees in torus networks, Networks, Vol.60, No.1, 59-69, 2012. ... Toru Hasunuma : Book-embeddings of iterated subdivided-line graphs, Proceedings of 29th European Workshop on Computational Geometry (March 17-20, 2013), 131-134, Braunschweig, Germany, March 2013. ... Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono and Yushi Uno : A linear time algorithm for L(2,1)-labeling of trees, Algorithmica, Vol.66, No.3, 654-681, 2013. ... Toru Hasunuma : Structural properties of subdivided-line graphs, Proceedings of 24th International Workshop on Combinatorial Algorithms (July 10-12, 2013), Lecture Notes in Computer Science, Vol.8288, 216-229, Rouen, France, July 2013. ... Toru Hasunuma : Global defensive t-alliances in iterated subdivided-line graphs, Abstracts of the Second Gdansk Workshop on Graph Theory (June 26-28, 2014), 14, Gdansk, Poland, June 2014. ... Toru Hasunuma : Colorings of iterated subdivided-line graphs, Abstracts of Bordeaux Graph Workshop 2014 (November 19-22, 2014), (巻), (号), 53-54, Bordeaux, France, Nov. 2014. ... Toru Hasunuma : Structural properties of subdivided-line graphs, Journal of Discrete Algorithms, Vol.31, 69-86, 2015. ... Toru Hasunuma : A linear-time algorithm for the queue-numbers of proper triangulated cacti, Proceedings of 31st European Workshop on Computational Geometry (March 16-18, 2015), 61-64, Ljubljana, Slovenia, March 2015. ... Toru Hasunuma : Minimum degree conditions and optimal graphs for completely independent spanning trees, Proceedings of 26th International Workshop on Combinatorial Algorithms (October 5-7, 2015), Lecture Notes in Computer Science, Vol.9538, 260-273, Verona, Italy, Oct. 2015. ... Toru Hasunuma : Constructions of universalized Sierpinski graphs based on labeling manipulations, Proceedings of the 9th International Workshop on Graph Labeling (July 7-9, 2016), Electronic Notes in Discrete Mathematics, Vol. 60, 47-54, Krakow, Poland, July 2016. ... Toru Hasunuma : Two generalized variants of dominating sets in subdivided-line graphs, Abstracts of International Symposium on Combinatorial Optimisation 2016 (Sep. 1-3, 2016), 27, Canterbury, UK, Sep. 2016. ... Toru Hasunuma : Completely independent spanning trees in the powers of sparse graphs, Abstracts of the 40th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (Dec. 12-16, 2016), 23, Newcastle, Australia, Dec. 2016. ... Toru Hasunuma : Augmenting a tree to a k-arbor-connected graph with pagenumber k, Extended abstracts of 34th European Workshop on Computational Geometry (March 21-23, 2018), (巻), (号), 27:1-6, Berlin, Germany, March 2018. ... Toru Hasunuma and Kosuke Ono : Connectivity keeping trees in 2-connected graphs, Journal of Graph Theory, Vol.94, No.1, 20-29, 2020. ... Toru Hasunuma : Connectivity keeping trees in 2-connected graphs with girth conditions, Proceedings of 31st International Workshop on Combinatorial Algorithms (8-10 June 2020, online), Lecture Notes in Computer Science, Vol.12126, 316-329, Bordeaux, France, June 2020. ... Toru Hasunuma : Augmenting a tree to a k-arbor-connected graph with pagenumber k, Proceedings of 32nd International Workshop on Combinatorial Algorithms (5-7 July 2021, online), Lecture Notes in Computer Science, Vol.12757, 356-369, Ottawa, Canada, July 2021. ... Toru Hasunuma : Connectivity keeping trees in 2-connected graphs with girth conditions, Algorithmica, Vol.83, No.9, 2697-2718, 2021. ... Toru Hasunuma : Connectivity preserving trees in k-connected or k-edge-connected graphs, Journal of Graph Theory, Vol.102, No.3, 423-435, 2023. ... Toru Hasunuma : Arbor-connectivity of the powers of trees, Abstracts of Optimization 2023 (July 24-26, 2023), 168, Aveiro, Portugal, July 2023. ... Toru Hasunuma : Completely independent spanning trees in line graphs, Graphs and Combinatorics, Vol.39, No.5, 90, 2023. ... Toru Hasunuma : Connectivity preserving Hamiltonian cycles in k-connected Dirac graphs, Abstracts of the 45th Australasian Combinatorics Conference 2023 (December 11-15, 2023), 35, Perth, Australia, Dec. 2023. ... Toru Hasunuma : Exponentiation of Graphs, Abstracts of Combinatorial Designs and Codes 2024 (July 8-12, 2024), 31, Sevilla, Spain, July 2024. ...
過去3日以内に登録・変更された情報
無効な情報 (1件)
-
Toru Hasunuma : Improved book-embeddings of incomplete hypercubes, Discrete Applied Mathematics, Vol.157, No.7, 1423-1431, 2009.
本データベースでは情報の登録，保守作業の分散を主たる目的の一つとしております．したがって，上記にリストアップされている情報の保守は個々の情報の当事者に委ねられます．
ある情報を保守する義務があるかないかは，その情報に対して権限を持っているかどうかで判断してください．もちろん情報の所有者が主に管理しなくてはならないことになりますが，権限を持っている利用者が連帯してその情報の保守を行なう義務を負っていると考えてください．
貴方がどの情報について権限を持っているかは，貴方自身の情報を閲覧してください．
Number of session users = 0, LA = 1.16, Max(EID) = 414431, Max(EOID) = 1118202.