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