( en | de | ru )

 

Disambiguation of "Cheriyan, Joseph"

Author of the publication

copydeleteadd this publication to your clipboard
Can A Maximum Flow be Computed on o(nm) Time?

, , and . ICALP, volume 443 of Lecture Notes in Computer Science, page 235-248. Springer, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Cheriyan Menacherry

Joseph Ringwald

Joseph Stegemann

Joseph Schön

Joseph Schäfer

 

Other publications of authors with the same name

Hardness and Approximation Results for Packing Steiner Trees., and . ESA, volume 3221 of Lecture Notes in Computer Science, page 180-191. Springer, (2004)Approximating (p, 2) flexible graph connectivity via the primal-dual method., , , and . CoRR, (2022)Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract)., and . FOCS, page 292-301. IEEE Computer Society, (1996)Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions., , , and . Algorithmica, 86 (8): 2575-2604 (August 2024)Approximation algorithms for minimum-cost k-vertex connected subgraphs., , and . STOC, page 306-312. ACM, (2002)An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph., , and . SIAM J. Comput., 32 (4): 1050-1055 (2003)Edge Covers of Setpairs and the Iterative Rounding Method., and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 30-44. Springer, (2001)Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs, and . CoRR, (2012)Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators.. SODA, page 31-40. ACM/SIAM, (1993)Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs., and . FOCS, page 30-39. IEEE Computer Society, (2013)