Surender Baswana

1.4k total citations
37 papers, 504 citations indexed

About

Surender Baswana is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Surender Baswana has authored 37 papers receiving a total of 504 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 18 papers in Computer Networks and Communications and 11 papers in Artificial Intelligence. Recurrent topics in Surender Baswana's work include Complexity and Algorithms in Graphs (28 papers), Advanced Graph Theory Research (15 papers) and Optimization and Search Problems (13 papers). Surender Baswana is often cited by papers focused on Complexity and Algorithms in Graphs (28 papers), Advanced Graph Theory Research (15 papers) and Optimization and Search Problems (13 papers). Surender Baswana collaborates with scholars based in India, Germany and United States. Surender Baswana's co-authors include Sandeep Sen, Telikepalli Kavitha, Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie, Manoj Gupta, P. P. Chakrabarti, Benjamin Doerr and Frank Neumann and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Algorithms.

In The Last Decade

Surender Baswana

35 papers receiving 467 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Surender Baswana India 14 388 252 155 80 52 37 504
Pascal Schweitzer Germany 11 207 0.5× 140 0.6× 86 0.6× 40 0.5× 43 0.8× 38 415
Marcus Schaefer United States 13 309 0.8× 84 0.3× 132 0.9× 206 2.6× 99 1.9× 57 488
Elad Verbin Israel 12 165 0.4× 127 0.5× 130 0.8× 42 0.5× 28 0.5× 25 309
Edward F. Grove United States 8 77 0.2× 258 1.0× 132 0.9× 68 0.8× 65 1.3× 13 387
Justin Ward United Kingdom 12 194 0.5× 151 0.6× 142 0.9× 46 0.6× 20 0.4× 26 366
Shlomi Rubinstein Israel 10 166 0.4× 108 0.4× 53 0.3× 37 0.5× 22 0.4× 14 314
Morteza Monemizadeh United States 9 138 0.4× 112 0.4× 161 1.0× 27 0.3× 56 1.1× 24 303
Shiri Chechik Israel 11 285 0.7× 215 0.9× 98 0.6× 50 0.6× 31 0.6× 46 367
Chu Min Li France 10 246 0.6× 250 1.0× 270 1.7× 41 0.5× 14 0.3× 21 479
Ewald Speckenmeyer Germany 8 341 0.9× 199 0.8× 129 0.8× 57 0.7× 6 0.1× 26 446

Countries citing papers authored by Surender Baswana

Since Specialization
Citations

This map shows the geographic impact of Surender Baswana'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 Surender Baswana with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Surender Baswana more than expected).

Fields of papers citing papers by Surender Baswana

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Surender Baswana. 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 Surender Baswana. The network helps show where Surender Baswana may publish in the future.

Co-authorship network of co-authors of Surender Baswana

This figure shows the co-authorship network connecting the top 25 collaborators of Surender Baswana. A scholar is included among the top collaborators of Surender Baswana 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 Surender Baswana. Surender Baswana is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Baswana, Surender, et al.. (2023). Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle. ACM Transactions on Algorithms. 19(4). 1–41.
2.
Baswana, Surender, et al.. (2019). Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
3.
Baswana, Surender, et al.. (2019). Centralized Admissions for Engineering Colleges in India. DSpace (IIT Bombay). 323–324. 12 indexed citations
4.
Baswana, Surender, et al.. (2018). Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. SIAM Journal on Computing. 47(1). 80–95. 4 indexed citations
5.
Roy, Subhajit, et al.. (2013). Pertinent path profiling: Tracking interactions among relevant statements. 1–12. 5 indexed citations
6.
Baswana, Surender, et al.. (2012). Fully dynamic randomized algorithms for graph spanners. ACM Transactions on Algorithms. 8(4). 1–51. 32 indexed citations
7.
Baswana, Surender, et al.. (2012). Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. Algorithmica. 66(1). 18–50. 13 indexed citations
8.
Baswana, Surender & Telikepalli Kavitha. (2010). Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM Journal on Computing. 39(7). 2865–2896. 16 indexed citations
9.
Baswana, Surender, et al.. (2010). Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5. 513–524. 8 indexed citations
10.
Baswana, Surender, Telikepalli Kavitha, Kurt Mehlhorn, & Seth Pettie. (2010). Additive spanners and (α, β)-spanners. ACM Transactions on Algorithms. 7(1). 1–26. 43 indexed citations
11.
Baswana, Surender, et al.. (2009). Computing single source shortest paths using single-objective fitness. Adelaide Research & Scholarship (AR&S) (University of Adelaide). 59–66. 30 indexed citations
12.
Baswana, Surender, et al.. (2008). Fully dynamic algorithm for graph spanners with poly-logarithmic update time. Symposium on Discrete Algorithms. 1125–1134. 7 indexed citations
13.
Baswana, Surender. (2007). Streaming algorithm for graph spanners—single pass and constant processing time per edge. Information Processing Letters. 106(3). 110–114. 31 indexed citations
14.
Baswana, Surender & Sandeep Sen. (2006). A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures and Algorithms. 30(4). 532–563. 40 indexed citations
15.
Baswana, Surender, Telikepalli Kavitha, Kurt Mehlhorn, & Seth Pettie. (2005). New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners. Max Planck Institute for Plasma Physics. 672–681. 3 indexed citations
16.
Baswana, Surender & Sandeep Sen. (2004). Approximate distance oracles for unweighted graphs in Õ (n2) time. Symposium on Discrete Algorithms. 271–280. 12 indexed citations
17.
Baswana, Surender, Ramesh Hariharan, & Sandeep Sen. (2004). Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. Journal of Algorithms. 62(2). 74–92. 23 indexed citations
18.
Baswana, Surender, Ramesh Hariharan, & Sandeep Sen. (2003). Maintaining all-pairs approximate shortest paths under deletion of edges. Symposium on Discrete Algorithms. 394–403. 17 indexed citations
19.
Baswana, Surender & Subhankar Sen. (2003). A Simple Linear Time Algorithm for Computing Sparse Spanners in Weighted Graphs. 1 indexed citations
20.
Baswana, Surender, Ramesh Hariharan, & Sandeep Sen. (2002). Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. 117–123. 12 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

Breakdown of academic impact, for papers by Pascal Schweitzer Breakdown of academic impact, for papers by Marcus Schaefer Breakdown of academic impact, for papers by Elad Verbin Breakdown of academic impact, for papers by Edward F. Grove Breakdown of academic impact, for papers by Justin Ward Breakdown of academic impact, for papers by Shlomi Rubinstein Breakdown of academic impact, for papers by Morteza Monemizadeh Breakdown of academic impact, for papers by Shiri Chechik Breakdown of academic impact, for papers by Chu Min Li Breakdown of academic impact, for papers by Ewald Speckenmeyer
Rankless by CCL
2026