| Domine: A Comprehensive Collection Of Known And Predicted Domain-Domain Interactions | 46 | 1.43 | 2011 |
| A Threat-Aware Routing Algorithm for Maximum Physical-Layer Path Survivability | 0 | 0.34 | 2010 |
| Finding Maximum Reliable Path in Mesh Networks under Multiple Failures. | 0 | 0.34 | 2010 |
| Improved approximation algorithms for the single-sink buy-at-bulk network design problems | 18 | 0.74 | 2009 |
| Domine: A Database Of Protein Domain Interactions | 41 | 1.43 | 2008 |
| A 4/3-approximation algorithm for minimum 3-edge-connectivity | 1 | 0.39 | 2007 |
| Approximating the k-traveling repairman problem with repairtimes | 13 | 0.62 | 2007 |
| Load-balanced agent activation for value-added network services | 1 | 0.37 | 2006 |
| Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem | 2 | 0.41 | 2005 |
| Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case | 5 | 0.40 | 2004 |
| Degree-bounded minimum spanning trees | 13 | 0.89 | 2004 |
| Load balancing for reliable multicast | 0 | 0.34 | 2004 |
| Survivable network design: the capacitated minimum spanning network problem | 2 | 0.41 | 2004 |
| Approximation algorithms for finding low-degree subgraphs | 14 | 0.77 | 2004 |
| Finding k-Connected Subgraphs with Minimum Average Weight | 2 | 0.38 | 2004 |
| Minimum Latency Tours and the k-Traveling Repairmen Problem | 2 | 0.41 | 2004 |
| A 5/4-approximation algorithm for minimum 2-edge-connectivity | 24 | 1.18 | 2003 |
| Approximating the Minimum Equivalent Digraph | 29 | 1.80 | 2002 |
| Designing multi-commodity flow trees | 11 | 0.78 | 2002 |
| Low degree spanning trees of small weight | 22 | 4.10 | 2002 |
| Balancing minimum spanning and shortest path trees | 132 | 10.17 | 2002 |
| A network flow technique for finding low-weight bounded-degree spanning trees | 8 | 0.86 | 2002 |
| Algorithms for Capacitated Vehicle Routing | 20 | 1.94 | 2001 |
| The Directed Minimum-Degree Spanning Tree Problem | 10 | 1.05 | 2001 |
| Approximation algorithms for the asymmetric postman problem | 1 | 0.43 | 1999 |
| A 3/2-Approximation Algorithm for the Mixed Postman Problem | 10 | 0.60 | 1999 |
| A uniform framework for approximating weighted connectivity problems | 13 | 0.84 | 1999 |
| The Finite Capacity Dial-A-Ride Problem | 26 | 2.05 | 1998 |
| Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem | 21 | 1.43 | 1998 |
| On strongly connected digraphs with bounded cycle length | 26 | 1.72 | 1996 |
| Low-Degree Spanning Trees of Small Weight | 29 | 2.80 | 1996 |
| Improved approximation algorithms for uniform connectivity problems | 79 | 5.69 | 1996 |
| Parallel Edge Coloring Approximation | 5 | 0.44 | 1996 |
| Landmarks in graphs | 80 | 6.71 | 1996 |
| A network-flow technique for finding low-weight bounded-degree spanning trees | 16 | 1.33 | 1996 |
| An efficient parallel algorithm for finding Hamiltonian cycles in dense directed graphs | 0 | 0.34 | 1995 |
| Balancing Minimum Spanning Trees and Shortest-Path Trees | 67 | 3.94 | 1995 |
| Chaining multiple-alignment blocks. | 16 | 1.55 | 1994 |
| Optimal Parallel Algorithms For Straight-Line Grid Embeddings Of Planar Graphs | 2 | 0.70 | 1994 |
| Optimal Parallel Algorithms For Straight-Line Grid Embeddings Of Planar Graphs | 2 | 0.70 | 1994 |
| Constructing aligned sequence blocks. | 9 | 0.84 | 1994 |
| Approximating the minimum-degree Steiner tree to within one of optimal | 98 | 5.01 | 1994 |
| Approximation Through Local Optimality: Designing Networks with Small Degree | 12 | 1.48 | 1992 |
| O (N log log N)-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs | 5 | 1.08 | 1992 |
| Approximating the minimum degree spanning tree to within one from the optimal degree | 68 | 6.55 | 1992 |
