Pravin M. Vaidya

2.7k total citations
36 papers, 1.6k citations indexed

About

Pravin M. Vaidya is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Numerical Analysis. According to data from OpenAlex, Pravin M. Vaidya has authored 36 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Computational Theory and Mathematics, 12 papers in Computer Graphics and Computer-Aided Design and 10 papers in Numerical Analysis. Recurrent topics in Pravin M. Vaidya's work include Computational Geometry and Mesh Generation (12 papers), Advanced Optimization Algorithms Research (10 papers) and Complexity and Algorithms in Graphs (10 papers). Pravin M. Vaidya is often cited by papers focused on Computational Geometry and Mesh Generation (12 papers), Advanced Optimization Algorithms Research (10 papers) and Complexity and Algorithms in Graphs (10 papers). Pravin M. Vaidya collaborates with scholars based in United States. Pravin M. Vaidya's co-authors include Sachin S. Sapatnekar, Sanjiv Kapoor, Sung‐Mo Kang, Vasant B. Rao, Kenneth L. Clarkson, Serge Plotkin, Andrew V. Goldberg, Tong Gao, C.L. Liu and K. Mahadevan and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

In The Last Decade

Pravin M. Vaidya

35 papers receiving 1.5k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Pravin M. Vaidya United States	20	600	454	354	325	275	36	1.6k
Komei Fukuda Switzerland	17	743 1.2×	168 0.4×	402 1.1×	197 0.6×	238 0.9×	63	1.7k
Serge Plotkin United States	29	1.5k 2.5×	574 1.3×	242 0.7×	2.3k 7.2×	87 0.3×	69	3.3k
Kenneth J. Supowit United States	17	520 0.9×	324 0.7×	503 1.4×	395 1.2×	13 0.0×	33	1.6k
John M. Danskin United States	12	223 0.4×	82 0.2×	153 0.4×	283 0.9×	163 0.6×	31	1.1k
Sanjiv Kapoor United States	17	327 0.5×	139 0.3×	288 0.8×	269 0.8×	41 0.1×	68	917
Clark D. Thompson United States	12	524 0.9×	640 1.4×	114 0.3×	770 2.4×	18 0.1×	28	1.5k
Robert W. Leland United States	9	228 0.4×	493 1.1×	88 0.2×	520 1.6×	29 0.1×	14	1.2k
András Frank Hungary	26	1.4k 2.3×	326 0.7×	281 0.8×	765 2.4×	36 0.1×	69	1.8k
Kurt M. Anstreicher United States	21	960 1.6×	185 0.4×	81 0.2×	234 0.7×	1.0k 3.7×	64	1.8k
Ketan Mulmuley United States	19	984 1.6×	104 0.2×	589 1.7×	294 0.9×	32 0.1×	48	1.7k

Countries citing papers authored by Pravin M. Vaidya

Since Specialization

Citations

This map shows the geographic impact of Pravin M. Vaidya's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pravin M. Vaidya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pravin M. Vaidya more than expected).

Fields of papers citing papers by Pravin M. Vaidya

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pravin M. Vaidya. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pravin M. Vaidya. The network helps show where Pravin M. Vaidya may publish in the future.

Co-authorship network of co-authors of Pravin M. Vaidya

This figure shows the co-authorship network connecting the top 25 collaborators of Pravin M. Vaidya. A scholar is included among the top collaborators of Pravin M. Vaidya based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pravin M. Vaidya. Pravin M. Vaidya is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Vaidya, Pravin M.. (2002). Reducing the parallel complexity of certain linear programming problems. 37. 583–589.

Gala, Kaushik, et al.. (2002). Inductance model and analysis methodology for high-speed on-chip interconnect. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 10(6). 730–745. 9 indexed citations

Gao, Tong, Pravin M. Vaidya, & C.L. Liu. (2002). A new performance driven placement algorithm. 44–47. 30 indexed citations

Kapoor, Sanjiv & Pravin M. Vaidya. (1996). Speeding up Karmarkar's algorithm for multicommodity flows. Mathematical Programming. 73(1). 111–127. 17 indexed citations

Vaidya, Pravin M.. (1996). A new algorithm for minimizing convex functions over convex sets. Mathematical Programming. 73(3). 291–341. 84 indexed citations

Vaidya, Pravin M., et al.. (1995). Using geometry to solve the transportation problem in the plane. Algorithmica. 13(5). 442–461. 7 indexed citations

Sapatnekar, Sachin S., Pravin M. Vaidya, & Sung‐Mo Kang. (1994). Convexity-based algorithms for design centering. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 13(12). 1536–1549. 24 indexed citations

Sapatnekar, Sachin S., Vasant B. Rao, Pravin M. Vaidya, & Sung‐Mo Kang. (1993). An exact solution to the transistor sizing problem for CMOS circuits using convex optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 12(11). 1621–1634. 230 indexed citations

Gao, Tong, et al.. (1992). A performance driven macro-cell placement algorithm. Design Automation Conference. 147–152. 29 indexed citations

10.

Vaidya, Pravin M.. (1991). A sparse graph almost as good as the complete graph on points inK dimensions. Discrete & Computational Geometry. 6(3). 369–381. 59 indexed citations

11.

Vaidya, Pravin M.. (1990). Reducing the parallel complexity of certain linear programming problems (extended abstract). 583–589. 1 indexed citations

12.

Vaidya, Pravin M.. (1989). AnO(n logn) algorithm for the all-nearest-neighbors Problem. Discrete & Computational Geometry. 4(2). 101–115. 144 indexed citations

13.

Vaidya, Pravin M.. (1989). A new algorithm for minimizing convex functions over convex sets. 338–343. 92 indexed citations

14.

Vaidya, Pravin M.. (1989). Geometry Helps in Matching. SIAM Journal on Computing. 18(6). 1201–1225. 88 indexed citations

15.

Vaidya, Pravin M.. (1989). Space-Time Trade-Offs for Orthogonal Range Queries. SIAM Journal on Computing. 18(4). 748–758. 3 indexed citations

16.

Vaidya, Pravin M.. (1988). Geometry Helps in Matching (Extended Abstract). 422–425. 2 indexed citations

17.

Vaidya, Pravin M.. (1988). Minimum Spanning Trees in k-Dimensional Space. SIAM Journal on Computing. 17(3). 572–582. 21 indexed citations

18.

Vaidya, Pravin M.. (1987). An algorithm for linear programming which requires O(((m+n)n^z+(m+n)¹n)) arithmetic operations. 29–38. 44 indexed citations

19.

Kapoor, Sanjiv & Pravin M. Vaidya. (1986). Fast algorithms for convex quadratic programming and multicommodity flows. 147–159. 66 indexed citations

20.

Vaidya, Pravin M.. (1984). A fast approximation for minimum spanning trees in k-dimensional space. 27(1). 403–407. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact