| 2008 |
|---|
| 48 | EE | Joseph Cheriyan,
Howard J. Karloff,
Rohit Khandekar,
Jochen Könemann:
On the integrality ratio for tree augmentation.
Oper. Res. Lett. 36(4): 399-401 (2008) |
| 2007 |
|---|
| 47 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Packing element-disjoint steiner trees.
ACM Transactions on Algorithms 3(4): (2007) |
| 46 | EE | Joseph Cheriyan,
Adrian Vetta:
Approximation Algorithms for Network Design with Metric Costs.
SIAM J. Discrete Math. 21(3): 612-636 (2007) |
| 2006 |
|---|
| 45 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees.
Algorithmica 45(1): 21-43 (2006) |
| 44 | EE | Joseph Cheriyan,
Santosh Vempala,
Adrian Vetta:
Network Design Via Iterative Rounding Of Setpair Relaxations.
Combinatorica 26(3): 255-275 (2006) |
| 2005 |
|---|
| 43 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Packing Element-Disjoint Steiner Trees.
APPROX-RANDOM 2005: 52-61 |
| 42 | EE | Marcelo H. de Carvalho,
Joseph Cheriyan:
An O(VE) algorithm for ear decompositions of matching-covered graphs.
SODA 2005: 415-423 |
| 41 | EE | Joseph Cheriyan,
Adrian Vetta:
Approximation algorithms for network design with metric costs.
STOC 2005: 167-175 |
| 40 | EE | Marcelo H. de Carvalho,
Joseph Cheriyan:
An O(VE) algorithm for ear decompositions of matching-covered graphs.
ACM Transactions on Algorithms 1(2): 324-337 (2005) |
| 39 | EE | Joseph Cheriyan,
Howard J. Karloff,
Yuval Rabani:
Approximating Directed Multicuts.
Combinatorica 25(3): 251-269 (2005) |
| 2004 |
|---|
| 38 | EE | Joseph Cheriyan,
Mohammad R. Salavatipour:
Hardness and Approximation Results for Packing Steiner Trees.
ESA 2004: 180-191 |
| 2003 |
|---|
| 37 | EE | Joseph Cheriyan,
Santosh Vempala,
Adrian Vetta:
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph.
SIAM J. Comput. 32(4): 1050-1055 (2003) |
| 2002 |
|---|
| 36 | EE | Joseph Cheriyan,
Santosh Vempala,
Adrian Vetta:
Approximation algorithms for minimum-cost k-vertex connected subgraphs.
STOC 2002: 306-312 |
| 2001 |
|---|
| 35 | | Joseph Cheriyan,
Howard J. Karloff,
Yuval Rabani:
Approximating Directed Multicuts.
FOCS 2001: 320-328 |
| 34 | EE | Joseph Cheriyan,
Santosh Vempala:
Edge Covers of Setpairs and the Iterative Rounding Method.
IPCO 2001: 30-44 |
| 33 | EE | Joseph Cheriyan,
Tibor Jordán,
Zeev Nutov:
On Rooted Node-Connectivity Problems.
Algorithmica 30(3): 353-375 (2001) |
| 32 | EE | Joseph Cheriyan,
András Sebö,
Zoltán Szigeti:
Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph.
SIAM J. Discrete Math. 14(2): 170-180 (2001) |
| 2000 |
|---|
| 31 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching.
SIAM J. Comput. 30(2): 528-560 (2000) |
| 1999 |
|---|
| 30 | EE | Joseph Cheriyan,
Tibor Jordán,
R. Ravi:
On 2-Coverings and 2-Packings of Laminar Families.
ESA 1999: 510-520 |
| 29 | EE | Joseph Cheriyan,
Kurt Mehlhorn:
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow.
Inf. Process. Lett. 69(5): 239-242 (1999) |
| 28 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation.
J. Algorithms 33(1): 15-50 (1999) |
| 1998 |
|---|
| 27 | EE | Joseph Cheriyan,
Tibor Jordán,
Zeev Nutov:
Approximating k-outconnected Subgraph Problems.
APPROX 1998: 77-88 |
| 26 | EE | Joseph Cheriyan,
András Sebö,
Zoltán Szigeti:
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs.
IPCO 1998: 126-136 |
| 25 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
Electronic Colloquium on Computational Complexity (ECCC) 5(25): (1998) |
| 1997 |
|---|
| 24 | | F. Sibel Salman,
Joseph Cheriyan,
R. Ravi,
S. Subramanian:
Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem.
SODA 1997: 619-628 |
| 23 | EE | Bo Yu,
Joseph Cheriyan:
The node multiterminal cut polyhedron.
Networks 30(2): 133-148 (1997) |
| 22 | | Joseph Cheriyan:
Randomized Õ(M(|V|)) Algorithms for Problems in Matching Theory.
SIAM J. Comput. 26(6): 1635-1669 (1997) |
| 21 | EE | Bo Yu,
Joseph Cheriyan,
Penny E. Haxell:
Hypercubes and Multicommodity Flows.
SIAM J. Discrete Math. 10(2): 190-200 (1997) |
| 1996 |
|---|
| 20 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).
FOCS 1996: 292-301 |
| 19 | EE | Joseph Cheriyan,
Ramakrishna Thurimella:
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract).
STOC 1996: 37-46 |
| 18 | | Joseph Cheriyan,
Kurt Mehlhorn:
Algorithms for Dense Graphs and Networks on the Random Access Computer.
Algorithmica 15(6): 521-549 (1996) |
| 17 | | Joseph Cheriyan,
Torben Hagerup,
Kurt Mehlhorn:
An o(n³)-Time Algorithm Maximum-Flow Algorithm.
SIAM J. Comput. 25(6): 1144-1170 (1996) |
| 1995 |
|---|
| 16 | | Bo Yu,
Joseph Cheriyan:
Approximation Algorithms for Feasible Cut and Multicut Problems.
ESA 1995: 394-408 |
| 15 | | Joseph Cheriyan,
Torben Hagerup:
A Randomized Maximum-Flow Algorithm.
SIAM J. Comput. 24(2): 203-226 (1995) |
| 1994 |
|---|
| 14 | | Joseph Cheriyan:
A Las Vegas O(n2.38) Algorithm for the Cardinality of a Maximum Matching.
SODA 1994: 442-451 |
| 13 | | Joseph Cheriyan,
John H. Reif:
Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity.
Combinatorica 14(4): 435-451 (1994) |
| 1993 |
|---|
| 12 | | Joseph Cheriyan:
Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators.
SODA 1993: 31-40 |
| 11 | EE | Joseph Cheriyan,
John H. Reif:
Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems.
SPAA 1993: 50-56 |
| 10 | | Joseph Cheriyan,
Ming-Yang Kao,
Ramakrishna Thurimella:
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity.
SIAM J. Comput. 22(1): 157-174 (1993) |
| 1992 |
|---|
| 9 | EE | Joseph Cheriyan,
John H. Reif:
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity.
SODA 1992: 335-344 |
| 1991 |
|---|
| 8 | | Joseph Cheriyan,
Ramakrishna Thurimella:
Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract)
STOC 1991: 391-401 |
| 1990 |
|---|
| 7 | | Joseph Cheriyan,
Torben Hagerup,
Kurt Mehlhorn:
Can A Maximum Flow be Computed on o(nm) Time?
ICALP 1990: 235-248 |
| 1989 |
|---|
| 6 | | Joseph Cheriyan,
Torben Hagerup:
A Randomized Maximum-Flow Algorithm
FOCS 1989: 118-123 |
| 5 | | Joseph Cheriyan,
S. N. Maheshwari:
The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network.
Inf. Process. Lett. 31(3): 157-161 (1989) |
| 4 | EE | Joseph Cheriyan,
S. N. Maheshwari:
The parallel complexity of finding a blocking flow in a 3-layer network.
Inf. Process. Lett. 32(3): 157-161 (1989) |
| 3 | | Joseph Cheriyan,
S. N. Maheshwari:
Analysis of Preflow Push Algorithms for Maximum Network Flow.
SIAM J. Comput. 18(6): 1057-1086 (1989) |
| 1988 |
|---|
| 2 | | Joseph Cheriyan,
S. N. Maheshwari:
Analysis of Preflow Push Algorithms for Maximum Network Flow.
FSTTCS 1988: 30-48 |
| 1 | | Joseph Cheriyan,
S. N. Maheshwari:
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs.
J. Algorithms 9(4): 507-537 (1988) |
