| Settlement fund circulation problem | 0 | 0.34 | 2017 |
| Posimodular Function Optimization. | 0 | 0.34 | 2017 |
| Algorithmic aspects of distance constrained labeling: a survey. | 1 | 0.36 | 2014 |
| Augmenting edge-connectivity between vertex subsets | 2 | 0.45 | 2014 |
| Subexponential Fixed-Parameter Algorithms for Partial Vector Domination. | 0 | 0.34 | 2014 |
| (Total) Vector Domination for Graphs with Bounded Branchwidth. | 1 | 0.35 | 2014 |
| Posimodular Function Optimization. | 0 | 0.34 | 2014 |
| Augmenting outerplanar graphs to meet diameter requirements | 2 | 0.38 | 2013 |
| The (p,q)-total labeling problem for trees | 1 | 0.36 | 2012 |
| Graph Augmentation Problem with Diameter Requirements | 1 | 0.37 | 2012 |
| The (2,1)-total labeling number of outerplanar graphs is at most Δ + 2 | 2 | 0.36 | 2010 |
| Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs | 4 | 0.59 | 2010 |
| An O(n1.75) algorithm for L(2,1)-labeling of trees | 6 | 0.45 | 2009 |
| Posi-modular Systems with Modulotone Requirements under Permutation Constraints | 0 | 0.34 | 2009 |
| A tight upper bound on the (2,1)-total labeling number of outerplanar graphs | 4 | 0.44 | 2009 |
| A Linear Time Algorithm for (2,1)-Labeling of Trees | 0 | 0.34 | 2009 |
| Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs | 3 | 0.47 | 2009 |
| An Algorithm for L(2, 1)-Labeling of Trees | 0 | 0.34 | 2008 |
| Greedy approximation for source location problem with vertex-connectivity requirements in undirected graphs | 1 | 0.36 | 2007 |
| The source location problem with local 3-vertex-connectivity requirements | 5 | 0.50 | 2007 |
| Bisecting a 4-connected graph with three resource sets | 2 | 0.38 | 2007 |
| Augmenting forests to meet odd diameter requirements | 9 | 0.95 | 2006 |
| Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph | 0 | 0.34 | 2006 |
| Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs | 10 | 1.20 | 2006 |
| Bisecting a four-connected graph with three resource sets | 2 | 0.38 | 2005 |
| A robust algorithm for bisecting a triconnected graph with two resource sets | 1 | 0.36 | 2005 |
| A simple recognition of maximal planar graphs | 1 | 0.37 | 2004 |
| Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs | 2 | 0.40 | 2003 |
| Minimum cost source location problem with vertex-connectivity requirements in digraphs. | 21 | 1.25 | 2001 |
| Multigraph augmentation under biconnectivity and general edge-connectivity requirements | 1 | 0.36 | 2001 |
| Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph | 0 | 0.34 | 2000 |
| Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph | 3 | 0.40 | 2000 |
| On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph | 6 | 0.49 | 2000 |
| Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph | 3 | 0.42 | 1999 |
| K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph | 4 | 0.43 | 1998 |
| Optimal augmentation to make a graph k-edge-connected and triconnected | 6 | 0.63 | 1998 |
| Augmenting Edge and Vertex Connectivities Simultaneously | 6 | 0.52 | 1997 |
