type: presentations

label: url

en: Exponentiation of Graphs

ja: Exponentiation of Graphs

en: Abstracts of Combinatorial Designs and Codes 2024 (July 8-12, 2024)

en: Sevilla, Spain

ja: Sevilla, Spain


en: Connectivity preserving Hamiltonian cycles in k-connected Dirac graphs

en: Abstracts of the 45th Australasian Combinatorics Conference 2023 (December 11-15, 2023)

en: Perth, Australia

ja: Perth, Australia


en: Arbor-connectivity of the powers of trees

en: Abstracts of Optimization 2023 (July 24-26, 2023)

en: Aveiro, Portugal

ja: Aveiro, Portugal


en: Augmenting a tree to a k-arbor-connected graph with pagenumber k

en: Proceedings of 32nd International Workshop on Combinatorial Algorithms (5-7 July 2021, online), Lecture Notes in Computer Science

en: Springer

ja: Springer

en: Ottawa, Canada

ja: Ottawa, Canada


en: Connectivity keeping trees in 2-connected graphs with girth conditions

en: Proceedings of 31st International Workshop on Combinatorial Algorithms (8-10 June 2020, online), Lecture Notes in Computer Science

en: Bordeaux, France

ja: Bordeaux, France


ja: Augmenting a tree to a k-arbor-connected graph with pagenumber k

en: Extended abstracts of 34th European Workshop on Computational Geometry (March 21-23, 2018)

en: Berlin, Germany

ja: Berlin, Germany


en: Completely independent spanning trees in the powers of sparse graphs

en: Abstracts of the 40th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (Dec. 12-16, 2016)

en: Newcastle, Australia

ja: Newcastle, Australia


en: Two generalized variants of dominating sets in subdivided-line graphs

en: Abstracts of International Symposium on Combinatorial Optimisation 2016 (Sep. 1-3, 2016)

en: Canterbury, UK

ja: Canterbury, UK


en: Constructions of universalized Sierpinski graphs based on labeling manipulations

en: Proceedings of the 9th International Workshop on Graph Labeling (July 7-9, 2016), Electronic Notes in Discrete Mathematics, Vol. 60, 47-54

en: Krakow, Poland

ja: Krakow, Poland


en: Minimum degree conditions and optimal graphs for completely independent spanning trees

en: Proceedings of 26th International Workshop on Combinatorial Algorithms (October 5-7, 2015), Lecture Notes in Computer Science

en: Verona, Italy

ja: Verona, Italy


en: A linear-time algorithm for the queue-numbers of proper triangulated cacti

en: Proceedings of 31st European Workshop on Computational Geometry (March 16-18, 2015)

en: Ljubljana, Slovenia

ja: Ljubljana, Slovenia


en: Colorings of iterated subdivided-line graphs

en: Abstracts of Bordeaux Graph Workshop 2014 (November 19-22, 2014)

en: Bordeaux, France


en: Global defensive t-alliances in iterated subdivided-line graphs

en: Abstracts of the Second Gdansk Workshop on Graph Theory (June 26-28, 2014)

en: Gdansk, Poland

ja: Gdansk, Poland


en: Structural properties of subdivided-line graphs

en: Proceedings of 24th International Workshop on Combinatorial Algorithms (July 10-12, 2013), Lecture Notes in Computer Science

en: Springer-Verlag

ja: Springer-Verlag

en: Rouen, France

ja: Rouen, France


en: Book-embeddings of iterated subdivided-line graphs

en: Proceedings of 29th European Workshop on Computational Geometry (March 17-20, 2013)

en: Braunschweig, Germany

ja: Braunschweig, Germany


en: A linear time algorithm for the queue-numbers of maximal outerplanar graphs

en: Proceedings of 28th European Workshop on Computational Geometry (March 19-21, 2012)

en: Assisi, Italy

ja: Assisi, Italy


en: Improved bounds for minimum fault-tolerant gossip graphs

en: Proceedings of 37th International Workshop on Graph-Theoretic Concepts in Computer Science (June 21-24, 2011), Lecture Notes in Computer Science

en: Tepla, Czech Republic

ja: Tepla, Czech Republic


en: The (p,q)-total labeling problem for trees

en: Proceedings of 21th International Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Computer Science

en: Jeju Island, Korea

ja: Jeju Island, Korea


en: The (2,1)-total labeling number of outerplanar graphs is at mot Δ+2

en: Proceedings of 21th International Workshop on Combinatorial Algorithms (IWOCA 2010), Lecture Notes in Computer Science

en: London

ja: London


en: A linear time algorithm for L(2,1)-labeling of trees

en: Proceedings of the 17th Annual European Symposium on Algorithms (ESA 2009), Lecture Notes in Computer Science vol. 5757, pp. 35-46.

en: Copenhagen, Denmark

ja: Copenhagen, Denmark


en: An O(n^{1.75}) algorithm for L(2,1)-labeling of trees

en: Proceedings of 11th Scandinavian Workshop on Algorithm Theory (SWAT2008), Lecture Notes in Computer Science

en: Springer-Verlag

en: Gothenburg, Sweden

ja: Gothenburg, Sweden


en: Multilayer grid embeddings of iterated line digraphs

en: Proceedings of 12th Australasian Theory Symposium (Jan. 16-19, 2006) Australian Computer Science Communications

en: Australian Computer Society

ja: Australian Computer Society

en: Hobart, Tasmania

ja: Hobart, Tasmania


en: Laying out iterated line digraphs using queues

en: Proceedings of 11th International Symposium on Graph Drawing (Sep. 21-24, 2003), Lecture Notes in Computer Science

en: Perugia, Italy

ja: Perugia, Italy


en: Completely independent spanning trees in maximal planar graphs

en: Proceedings of 28th International Workshop on Graph-Theoretic Concepts in Computer Science (June 13-15, 2002), Lecture Notes in Computer Science

en: Chesky Krumlov, Czech Republic

ja: Chesky Krumlov, Czech Republic


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

en: Proceedings of Brazilizan Symposium on Graphs, Algorithms and Combinatorics (March 17-19, 2001) Electronic Notes in Discrete Mathematics

en: Elsevier Science B.V.

ja: Elsevier Science B.V.

en: Fortaleza, Brazil

ja: Fortaleza, Brazil


en: The pagenumber of de Bruijn and Kautz digraphs

en: Proceedings of 5th Australasian Theory Symposium (Jan.18-21, 1999), Australian Computer Science Communications

en: Auckland

ja: Auckland


en: An efficient NC algorithm for a sparse k-edge-connectivity certificate

en: Proceedings of 9th International Symposium on Algorithms and Computation (Taejon, Korea, Dec.14-16, 1998) Lecture Notes in Computer Science

en: Springer-Verlag

en: Taejon

ja: Taejon


en: Independent spanning trees with small depths in iterated line digraphs

en: Proceedings of 4th Australasian Theory Symposium (Perth, Australia, Feb. 2-3, 1998), Australian Computer Science Communications

ja: Springer-Verlag

en: Perth

ja: Perth