| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrei V. Kotlov, Joseph Cheriyan |
On the maximum size of a minimal k-edge connected augmentation.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Olivier Durand de Gevigney, Zoltán Szigeti |
Packing of Rigid Spanning Subgraphs and Spanning Trees |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta |
Approximating rooted Steiner networks. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani |
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann |
On the integrality ratio for tree augmentation. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Packing element-disjoint steiner trees. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
element-disjoint, approximation algorithms, Steiner trees, hardness of approximation, Packing |
| 1 | Joseph Cheriyan, Adrian Vetta |
Approximation Algorithms for Network Design with Metric Costs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems |
| 1 | Joseph Cheriyan, Santosh Vempala, Adrian Vetta |
Network Design Via Iterative Rounding Of Setpair Relaxations. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68W25, 90C27, 68R10, 90C35, 05C40, 90B10 |
| 1 | Marcelo H. de Carvalho, Joseph Cheriyan |
An O(VE) algorithm for ear decompositions of matching-covered graphs. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
Matching theory, ear decompositions |
| 1 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts. |
Combinatorica |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25 |
| 1 | Marcelo H. de Carvalho, Joseph Cheriyan |
An O(VE) algorithm for ear decompositions of matching-covered graphs. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Packing Element-Disjoint Steiner Trees. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Adrian Vetta |
Approximation algorithms for network design with metric costs. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
metric costs, approximation algorithms, graph connectivity |
| 1 | Joseph Cheriyan, Mohammad R. Salavatipour |
Hardness and Approximation Results for Packing Steiner Trees. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Santosh Vempala, Adrian Vetta |
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Santosh Vempala, Adrian Vetta |
Approximation algorithms for minimum-cost k-vertex connected subgraphs. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian |
Approximating the Single-Sink Link-Installation Problem in Network Design. |
SIAM Journal on Optimization |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Tibor Jordán, Zeev Nutov |
On Rooted Node-Connectivity Problems. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Santosh Vempala |
Edge Covers of Setpairs and the Iterative Rounding Method. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Ramakrishna Thurimella |
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Kurt Mehlhorn |
An Analysis of the Highest-Level Selection Rule in the Preflow-Push Max-Flow. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Ramakrishna Thurimella |
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation. |
J. Algorithms |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Tibor Jordán, R. Ravi |
On 2-Coverings and 2-Packings of Laminar Families. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Ramakrishna Thurimella |
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Joseph Cheriyan, András Sebö, Zoltán Szigeti |
An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. |
IPCO |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Tibor Jordán, Zeev Nutov |
Approximating k-outconnected Subgraph Problems. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Yu, Joseph Cheriyan |
The node multiterminal cut polyhedron. |
Networks |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Yu, Joseph Cheriyan, Penny E. Haxell |
Hypercubes and Multicommodity Flows. |
SIAM J. Discrete Math. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan |
Randomized Õ(M(|V|)) Algorithms for Problems in Matching Theory. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian |
Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem. |
SODA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Kurt Mehlhorn |
Algorithms for Dense Graphs and Networks on the Random Access Computer. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn |
An o(n³)-Time Algorithm Maximum-Flow Algorithm. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Ramakrishna Thurimella |
Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
minimum-size, k-connected spanning subgraphs, k-NCSS, k-ECSS, graph theory, heuristic, matching, undirected graphs |
| 1 | Joseph Cheriyan, Ramakrishna Thurimella |
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract). |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Torben Hagerup |
A Randomized Maximum-Flow Algorithm. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Yu, Joseph Cheriyan |
Approximation Algorithms for Feasible Cut and Multicut Problems. |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, John H. Reif |
Directed s-t Numberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan |
A Las Vegas O(n2.38) Algorithm for the Cardinality of a Maximum Matching. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Ming-Yang Kao, Ramakrishna Thurimella |
Scan-First Search and Sparse Certificates: An Improved Parallel Algorithms for k-Vertex Connectivity. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan |
Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, John H. Reif |
Parallel and Output Sensitive Algorithms for Combinatorial and Linear Algebra Problems. |
SPAA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, John H. Reif |
Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. |
SODA |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Ramakrishna Thurimella |
Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract) |
STOC |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Torben Hagerup, Kurt Mehlhorn |
Can A Maximum Flow be Computed on o(nm) Time? |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, S. N. Maheshwari |
The Parallel Complexity of Finding a Blocking Flow in a 3-Layer Network. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, S. N. Maheshwari |
Analysis of Preflow Push Algorithms for Maximum Network Flow. |
SIAM J. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Torben Hagerup |
A Randomized Maximum-Flow Algorithm |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
dynamic trees data structure, randomized maximum-flow algorithm, prudent linking excess diminishing, negligible probability, maximum flow excess, PLED algorithm, parameter, worst case, vertex |
| 1 | Joseph Cheriyan, S. N. Maheshwari |
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs. |
J. Algorithms |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, S. N. Maheshwari |
Analysis of Preflow Push Algorithms for Maximum Network Flow. |
FSTTCS |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")