Toshimasa Ishii

Kenjiro Takazawa

Algorithmica, 2022

Reallocation Problems with Minimum Completion Time.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2019

Settlement fund circulation problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2016

Subexponential fixed-parameter algorithms for partial vector domination.

[BibT_eX]

[DOI]

Hirotaka Ono

Yushi Uno

Discret. Optim., 2016

(Total) Vector domination for graphs with bounded branchwidth.

[BibT_eX]

[DOI]

Hirotaka Ono

Yushi Uno

Discret. Appl. Math., 2016

2014

Algorithmic aspects of distance constrained labeling: a survey.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2014

Posimodular Function Optimization.

[BibT_eX]

[DOI]

CoRR, 2014

Augmenting Edge-Connectivity between Vertex Subsets.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Augmenting Outerplanar Graphs to Meet Diameter Requirements.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

A Linear Time Algorithm for L(2, 1)-Labeling of Trees.

[BibT_eX]

[DOI]

Algorithmica, 2013

2012

A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

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

[BibT_eX]

[DOI]

Discret. Math., 2012

Graph Augmentation Problem with Diameter Requirements.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Networking and Computing, 2012

2010

Posi-Modular Systems with Modulotone Requirements under Permutation Constraints.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

The (p, q)-total Labeling Problem for Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

An O(n1.75) algorithm for L(2, 1)-labeling of trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs.

[BibT_eX]

[DOI]

Discret. Optim., 2009

A tight upper bound on the (2,1)-total labeling number of outerplanar graphs

[BibT_eX]

[DOI]

CoRR, 2009

A Linear Time Algorithm for L(2, 1)-Labeling of Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2009

2008

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

[BibT_eX]

[DOI]

CoRR, 2008

An Algorithm for L(2, 1)-Labeling of Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2008

2007

Minimum cost source location problem with local 3-vertex-connectivity requirements.

[BibT_eX]

[DOI]

Hitoshi Fujita

Theor. Comput. Sci., 2007

Bisecting a 4-connected graph with three resource sets.

[BibT_eX]

[DOI]

Kengo Iwata

Discret. Appl. Math., 2007

The source location problem with local 3-vertex-connectivity requirements.

[BibT_eX]

[DOI]

Hitoshi Fujita

Discret. Appl. Math., 2007

2006

Augmenting forests to meet odd diameter requirements.

[BibT_eX]

[DOI]

Shigeyuki Yamamoto

Discret. Optim., 2006

Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs.

[BibT_eX]

[DOI]

Masayuki Hagiwara

Discret. Appl. Math., 2006

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

A robust algorithm for bisecting a triconnected graph with two resource sets.

[BibT_eX]

[DOI]

Kengo Iwata

Theor. Comput. Sci., 2005

Bisecting a Four-Connected Graph with Three Resource Sets.

[BibT_eX]

[DOI]

Kengo Iwata

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

A simple recognition of maximal planar graphs.

[BibT_eX]

[DOI]

Takahisa Suzuki

Inf. Process. Lett., 2004

2003

Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs.

[BibT_eX]

[DOI]

Yoko Akiyama

Proceedings of the Computing: the Australasian Theory Symposiumm, 2003

On the minimum local-vertex-connectivity augmentation in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs.

[BibT_eX]

[DOI]

Masayuki Hagiwara

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2001

Multigraph augmentation under biconnectivity and general edge-connectivity requirements.

[BibT_eX]

[DOI]

Networks, 2001

Minimum cost source location problem with vertex-connectivity requirements in digraphs.

[BibT_eX]

[DOI]

Hiro Ito

Inf. Process. Lett., 2001

2000

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2000

On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2000

Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1999

1998

Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

Augmenting Edge and Vertex Connectivities Simultaneously.

[BibT_eX]

[DOI]