The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Joseph Cheriyan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  46. Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002