|
Search the dblp DataBase
Shankar M. Venkatesan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Donald B. Johnson, Shankar M. Venkatesan
Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP] FOCS, 1982, pp:244-254 [Conf]
- Donald B. Johnson, Shankar M. Venkatesan
Partition of Planar Flow Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP] FOCS, 1983, pp:259-263 [Conf]
- Shankar M. Venkatesan
Approximation Algorithms for Planar Matching. [Citation Graph (0, 0)][DBLP] FSTTCS, 1985, pp:162-175 [Conf]
- Hristo Djidjev, Shankar M. Venkatesan
Planarization of Graphs Embedded on Surfaces. [Citation Graph (0, 0)][DBLP] WG, 1995, pp:62-72 [Conf]
- Hristo Djidjev, Shankar M. Venkatesan
Reduced Constants for Simple Cycle Graph Separation. [Citation Graph (0, 0)][DBLP] Acta Inf., 1997, v:34, n:3, pp:231-243 [Journal]
- Vijay V. Raghavan, Shankar M. Venkatesan
On Bounds for a Board Covering Problem. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:25, n:5, pp:281-284 [Journal]
- Shankar M. Venkatesan
Improved Constants for Some Separator Theorems. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1987, v:8, n:4, pp:572-578 [Journal]
- David J. Haglin, Shankar M. Venkatesan
Approximation and Intractability Results for the Maximum Cut Problem and its Variants. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1991, v:40, n:1, pp:110-113 [Journal]
- Shankar M. Venkatesan
Approximation Algorithms for Weighted Matching. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1987, v:54, n:, pp:129-137 [Journal]
- Shankar M. Venkatesan
On cleaving a planar graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:81, n:1, pp:97-102 [Journal]
Search in 0.001secs, Finished in 0.002secs
|