Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shankar M. Venkatesan
2000 – 2009
- 2001
[j7]Jong S. Lee, Bernard P. Zeigler, Shankar M. Venkatesan: Design and Development of Data Distribution Management Environment. Simulation 77(1-2): 39-52 (2001)
1990 – 1999
- 1997
- [j6]Hristo Djidjev, Shankar M. Venkatesan: Reduced Constants for Simple Cycle Graph Separation. Acta Inf. 34(3): 231-243 (1997)
- 1995
- [c4]
- 1991
- [j5]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
- [j4]
1980 – 1989
- 1987
- [j3]Vijay V. Raghavan, Shankar M. Venkatesan: On Bounds for a Board Covering Problem. Inf. Process. Lett. 25(5): 281-284 (1987)
- [j2]Shankar M. Venkatesan: Improved Constants for Some Separator Theorems. J. Algorithms 8(4): 572-578 (1987)
- [j1]Shankar M. Venkatesan: Approximation Algorithms for Weighted Matching. Theor. Comput. Sci. 54: 129-137 (1987)
- 1985
- [c3]
- 1983
- [c2]Donald B. Johnson, Shankar M. Venkatesan: Partition of Planar Flow Networks (Preliminary Version). FOCS 1983: 259-263
- 1982
- [c1]Donald B. Johnson, Shankar M. Venkatesan: Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version). FOCS 1982: 244-254
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:47 CET by the dblp team