The following pages link to Joseph Cheriyan (Q294661):
Displaying 50 items.
- (Q208487) (redirect page) (← links)
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← links)
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Packing of rigid spanning subgraphs and spanning trees (Q401490) (← links)
- On the maximum size of a minimal \(k\)-edge connected augmentation (Q765200) (← links)
- Network design via iterative rounding of setpair relaxations (Q858116) (← links)
- On the integrality ratio for tree augmentation (Q1003482) (← links)
- The parallel complexity of finding a blocking flow in a 3-layer network (Q1119019) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. II (Q1709583) (← links)
- On orienting graphs for connectivity: Projective planes and Halin graphs (Q1758272) (← links)
- Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
- A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs (Q1941534) (← links)
- Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs (Q2138961) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- On Eulerian orientations of even-degree hypercubes (Q2294235) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximating directed multicuts (Q2387182) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- A simple proof of the Moore-Hodgson algorithm for minimizing the number of late jobs (Q2670439) (← links)
- Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph (Q2706198) (← links)
- Approximation Algorithms for Minimum-Cost $k\hbox{-}(S,T)$ Connected Digraphs (Q2870515) (← links)
- (Q2921696) (← links)
- Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs (Q2929700) (← links)
- An <i>O</i> ( <i>VE</i> ) algorithm for ear decompositions of matching-covered graphs (Q2944500) (← links)
- Analysis of Preflow Push Algorithms for Maximum Network Flow (Q3034814) (← links)
- (Q3128905) (← links)
- (Q3140398) (← links)
- Approximating Minimum-Cost Connected T-Joins (Q3167389) (← links)
- Approximation Algorithms for Network Design with Metric Costs (Q3519197) (← links)
- Approximation algorithms for minimum-cost k-vertex connected subgraphs (Q3579233) (← links)
- Approximation algorithms for network design with metric costs (Q3581389) (← links)
- Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs (Q3638865) (← links)
- (Q3809566) (← links)
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs (Q3825103) (← links)
- (Q3840352) (← links)
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity (Q4037691) (← links)
- (Q4038695) (← links)
- (Q4228452) (← links)
- (Q4283439) (← links)
- Hypercubes and Multicommodity Flows (Q4337722) (← links)
- (Q4361183) (← links)
- Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory (Q4376193) (← links)
- (Q4400846) (← links)
- An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph (Q4429672) (← links)
- Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching (Q4507363) (← links)
- (Q4537732) (← links)
- (Q4763419) (← links)
