- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j29 |      | Ashkan Aazami, Joseph Cheriyan, Bundit Laekhanukit: A bad example for the iterative rounding method for mincost k-connected spanning subgraphs. Discrete Optimization 10(1): 25-41 (2013) |
| 2012 | ||
| j28 | | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. Algorithmica 63(1-2): 425-456 (2012) |
| j27 | | Andrei V. Kotlov, Joseph Cheriyan: On the maximum size of a minimal k-edge connected augmentation. J. Comb. Theory, Ser. B 102(1): 206-211 (2012) |
| j26 | | Joseph Cheriyan, Chenglong Zou: On orienting graphs for connectivity: Projective planes and Halin graphs. Oper. Res. Lett. 40(5): 337-341 (2012) |
| c25 | | Joseph Cheriyan, Zachary Friggstad, Zhihan Gao: Approximating Minimum-Cost Connected T-Joins. APPROX-RANDOM 2012: 110-121 |
| c24 | | Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta: Approximating rooted Steiner networks. SODA 2012: 1499-1511 |
| i4 | | Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti: Packing of Rigid Spanning Subgraphs and Spanning Trees. CoRR abs/1201.3727 (2012) |
| i3 | | Joseph Cheriyan, Zachary Friggstad, Zhihan Gao: Approximating Minimum-Cost Connected T-Joins. CoRR abs/1207.5722 (2012) |
| i2 | | Joseph Cheriyan, László A. Végh: Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. CoRR abs/1212.3981 (2012) |
| 2009 | ||
| c23 | | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani: Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. APPROX-RANDOM 2009: 1-14 |
| 2008 | ||
| j25 | | 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 | ||
| j24 | | Joseph Cheriyan, Adrian Vetta: Approximation Algorithms for Network Design with Metric Costs. SIAM J. Discrete Math. 21(3): 612-636 (2007) |
| j23 | | Joseph Cheriyan, Mohammad R. Salavatipour: Packing element-disjoint steiner trees. ACM Transactions on Algorithms 3(4) (2007) |
| 2006 | ||
| j22 | | Joseph Cheriyan, Mohammad R. Salavatipour: Hardness and Approximation Results for Packing Steiner Trees. Algorithmica 45(1): 21-43 (2006) |
| j21 | | Joseph Cheriyan, Santosh Vempala, Adrian Vetta: Network Design Via Iterative Rounding Of Setpair Relaxations. Combinatorica 26(3): 255-275 (2006) |
| 2005 | ||
| j20 | | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. Combinatorica 25(3): 251-269 (2005) |
| j19 | | 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) |
| c22 | | Joseph Cheriyan, Mohammad R. Salavatipour: Packing Element-Disjoint Steiner Trees. APPROX-RANDOM 2005: 52-61 |
| c21 | | Marcelo H. de Carvalho, Joseph Cheriyan: An O(VE) algorithm for ear decompositions of matching-covered graphs. SODA 2005: 415-423 |
| c20 | | Joseph Cheriyan, Adrian Vetta: Approximation algorithms for network design with metric costs. STOC 2005: 167-175 |
| 2004 | ||
| c19 | | Joseph Cheriyan, Mohammad R. Salavatipour: Hardness and Approximation Results for Packing Steiner Trees. ESA 2004: 180-191 |
| 2003 | ||
| j18 | | 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 | ||
| c18 | | Joseph Cheriyan, Santosh Vempala, Adrian Vetta: Approximation algorithms for minimum-cost k-vertex connected subgraphs. STOC 2002: 306-312 |
| 2001 | ||
| j17 | | Joseph Cheriyan, Tibor Jordán, Zeev Nutov: On Rooted Node-Connectivity Problems. Algorithmica 30(3): 353-375 (2001) |
| j16 | | 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) |
| j15 | | F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian: Approximating the Single-Sink Link-Installation Problem in Network Design. SIAM Journal on Optimization 11(3): 595-610 (2001) |
| c17 | | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani: Approximating Directed Multicuts. FOCS 2001: 320-328 |
| c16 | | Joseph Cheriyan, Santosh Vempala: Edge Covers of Setpairs and the Iterative Rounding Method. IPCO 2001: 30-44 |
| 2000 | ||
| j14 | | Joseph Cheriyan, Ramakrishna Thurimella: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching. SIAM J. Comput. 30(2): 528-560 (2000) |
| 1999 | ||
| j13 | | 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) |
| j12 | | Joseph Cheriyan, Ramakrishna Thurimella: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation. J. Algorithms 33(1): 15-50 (1999) |
| c15 | | Joseph Cheriyan, Tibor Jordán, R. Ravi: On 2-Coverings and 2-Packings of Laminar Families. ESA 1999: 510-520 |
| 1998 | ||
| c14 | | Joseph Cheriyan, Tibor Jordán, Zeev Nutov: Approximating k-outconnected Subgraph Problems. APPROX 1998: 77-88 |
| c13 | | Joseph Cheriyan, András Sebö, Zoltán Szigeti: An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. IPCO 1998: 126-136 |
| i1 |  | Joseph Cheriyan, Ramakrishna Thurimella: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching. Electronic Colloquium on Computational Complexity (ECCC) 5(25) (1998) |
| 1997 | ||
| j11 | | |
| j10 | | Joseph Cheriyan: Randomized Õ(M(|V|)) Algorithms for Problems in Matching Theory. SIAM J. Comput. 26(6): 1635-1669 (1997) |
| j9 | | Bo Yu, Joseph Cheriyan, Penny E. Haxell: Hypercubes and Multicommodity Flows. SIAM J. Discrete Math. 10(2): 190-200 (1997) |
| c12 | | 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 |
| 1996 | ||
| j8 | | Joseph Cheriyan, Kurt Mehlhorn: Algorithms for Dense Graphs and Networks on the Random Access Computer. Algorithmica 15(6): 521-549 (1996) |
| j7 | | Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: An o(n³)-Time Algorithm Maximum-Flow Algorithm. SIAM J. Comput. 25(6): 1144-1170 (1996) |
| c11 | | Joseph Cheriyan, Ramakrishna Thurimella: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). FOCS 1996: 292-301 |
| c10 | | Joseph Cheriyan, Ramakrishna Thurimella: Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract). STOC 1996: 37-46 |
| 1995 | ||
| j6 | | Joseph Cheriyan, Torben Hagerup: A Randomized Maximum-Flow Algorithm. SIAM J. Comput. 24(2): 203-226 (1995) |
| c9 | | |
| 1994 | ||
| j5 | | Joseph Cheriyan, John H. Reif: Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. Combinatorica 14(4): 435-451 (1994) |
| c8 | | Joseph Cheriyan: A Las Vegas O(n2.38) Algorithm for the Cardinality of a Maximum Matching. SODA 1994: 442-451 |
| 1993 | ||
| j4 | | 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) |
| c7 | | Joseph Cheriyan: Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators. SODA 1993: 31-40 |
| c6 | | Joseph Cheriyan, John H. Reif: Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. SPAA 1993: 50-56 |
| 1992 | ||
| c5 | | Joseph Cheriyan, John H. Reif: Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. SODA 1992: 335-344 |
| 1991 | ||
| c4 | | Joseph Cheriyan, Ramakrishna Thurimella: Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract). STOC 1991: 391-401 |
| 1990 | ||
| c3 | | Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn: Can A Maximum Flow be Computed on o(nm) Time? ICALP 1990: 235-248 |
| 1989 | ||
| j3 | | 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) |
| j2 | | Joseph Cheriyan, S. N. Maheshwari: Analysis of Preflow Push Algorithms for Maximum Network Flow. SIAM J. Comput. 18(6): 1057-1086 (1989) |
| c2 | | |
| 1988 | ||
| j1 | | Joseph Cheriyan, S. N. Maheshwari: Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. J. Algorithms 9(4): 507-537 (1988) |
| c1 | | Joseph Cheriyan, S. N. Maheshwari: Analysis of Preflow Push Algorithms for Maximum Network Flow. FSTTCS 1988: 30-48 |
Colors in the list of coauthors
Last update Fri May 24 06:20:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page