default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSurender Baswana
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Surender Baswana, Koustav Bhanja:
Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles. ICALP 2024: 17:1-17:20- 2023
- [j21]Surender Baswana
, Koustav Bhanja, Abhyuday Pandey:
Minimum+1 (s, t)-cuts and Dual-edge Sensitivity Oracle. ACM Trans. Algorithms 19(4): 38:1-38:41 (2023) - [i11]Surender Baswana, Koustav Bhanja:
Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle. CoRR abs/2310.12096 (2023) - 2022
- [j20]Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan:
Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet Efficient. Algorithmica 84(7): 2028-2049 (2022) - [j19]Surender Baswana, Shiv Kumar Gupta, Till Knollmann:
Mincut Sensitivity Data Structures for the Insertion of an Edge. Algorithmica 84(9): 2702-2734 (2022) - [c32]Surender Baswana, Koustav Bhanja, Abhyuday Pandey:
Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle. ICALP 2022: 15:1-15:20 - [c31]Surender Baswana, Abhyuday Pandey:
Sensitivity Oracles for All-Pairs Mincuts. SODA 2022: 581-609 - 2020
- [j18]Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty:
Approximate Single-Source Fault Tolerant Shortest Path. ACM Trans. Algorithms 16(4): 44:1-44:22 (2020) - [c30]Surender Baswana, Shiv Kumar Gupta, Till Knollmann:
Mincut Sensitivity Data Structures for the Insertion of an Edge. ESA 2020: 12:1-12:14 - [i10]Surender Baswana, Abhyuday Pandey:
Fault-Tolerant All-Pairs Mincuts. CoRR abs/2011.03291 (2020)
2010 – 2019
- 2019
- [j17]Surender Baswana, Keerti Choudhary, Liam Roditty:
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. Algorithmica 81(3): 967-985 (2019) - [j16]Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange:
Centralized Admissions for Engineering Colleges in India. INFORMS J. Appl. Anal. 49(5): 338-354 (2019) - [j15]Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS in Undirected Graphs: Breaking the O(m) Barrier. SIAM J. Comput. 48(4): 1335-1363 (2019) - [c29]Surender Baswana, Partha Pratim Chakrabarti, Sharat Chandran, Yashodhan Kanoria, Utkarsh Patange:
Centralized Admissions for Engineering Colleges in India. EC 2019: 323-324 - [c28]Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan:
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. MFCS 2019: 65:1-65:16 - [i9]Surender Baswana, P. P. Chakrabarti, Yashodhan Kanoria, Utkarsh Patange, Sharat Chandran:
Joint Seat Allocation 2018: An algorithmic perspective. CoRR abs/1904.06698 (2019) - 2018
- [j14]Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal. SIAM J. Comput. 47(1): 80-95 (2018) - [j13]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected Version). SIAM J. Comput. 47(3): 617-650 (2018) - [c27]Surender Baswana, Ayush Goel, Shahbaz Khan:
Incremental DFS algorithms: a theoretical and experimental study. SODA 2018: 53-72 - [c26]Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty:
Approximate Single Source Fault Tolerant Shortest Path. SODA 2018: 1901-1915 - [i8]Surender Baswana, Shiv Kumar Gupta, Ayush Tulsyan:
Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient. CoRR abs/1810.01726 (2018) - 2017
- [j12]Surender Baswana, Shahbaz Khan:
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. Algorithmica 79(2): 466-483 (2017) - [c25]Surender Baswana, Keerti Choudhary, Liam Roditty:
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. ICALP 2017: 72:1-72:15 - [i7]Surender Baswana, Ayush Goel, Shahbaz Khan:
Incremental DFS algorithms: a theoretical and experimental study. CoRR abs/1705.02613 (2017) - 2016
- [c24]Surender Baswana:
Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk). CALDAM 2016: 1-13 - [c23]Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. SODA 2016: 730-739 - [c22]Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault tolerant subgraph for single source reachability: generic and optimal. STOC 2016: 509-518 - [r4]Surender Baswana, Manoj Gupta, Sandeep Sen:
Matching in Dynamic Graphs. Encyclopedia of Algorithms 2016: 1195-1199 - [r3]Surender Baswana, Sandeep Sen:
Simple Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms 2016: 1981-1986 - [i6]Surender Baswana, Keerti Choudhary, Liam Roditty:
An efficient strongly connected components algorithm in the fault tolerant model. CoRR abs/1610.04010 (2016) - 2015
- [j11]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O(log n) Update Time. SIAM J. Comput. 44(1): 88-113 (2015) - [c21]Surender Baswana, Keerti Choudhary:
On Dynamic DFS Tree in Directed Graphs. MFCS (2) 2015: 102-114 - [c20]Surender Baswana, Keerti Choudhary, Liam Roditty:
Fault Tolerant Reachability for Directed Graphs. DISC 2015: 528-543 - [i5]Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS Tree in Undirected Graphs: breaking the O(m) barrier. CoRR abs/1502.02481 (2015) - 2014
- [c19]Surender Baswana, Shahbaz Khan:
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs. ICALP (1) 2014: 138-149 - 2013
- [j10]Surender Baswana, Neelesh Khanna:
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. Algorithmica 66(1): 18-50 (2013) - [c18]Ramshankar Chouhan, Subhajit Roy, Surender Baswana:
Pertinent path profiling: Tracking interactions among relevant statements. CGO 2013: 16:1-16:12 - 2012
- [j9]Surender Baswana, Sumeet Khurana, Soumojit Sarkar:
Fully dynamic randomized algorithms for graph spanners. ACM Trans. Algorithms 8(4): 35:1-35:51 (2012) - [c17]Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. FSTTCS 2012: 257-266 - [c16]Surender Baswana, Utkarsh Lath, Anuradha S. Mehta:
Single source distance oracle for planar digraphs avoiding a failed node or link. SODA 2012: 223-232 - [i4]Abhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen:
Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs. CoRR abs/1207.3976 (2012) - 2011
- [c15]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully Dynamic Maximal Matching in O (log n) Update Time. FOCS 2011: 383-392 - [i3]Surender Baswana, Manoj Gupta, Sandeep Sen:
Fully dynamic maximal matching in O(log n) update time. CoRR abs/1103.1109 (2011) - 2010
- [j8]Surender Baswana, Telikepalli Kavitha:
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs. SIAM J. Comput. 39(7): 2865-2896 (2010) - [j7]Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie:
Additive spanners and (alpha, beta)-spanners. ACM Trans. Algorithms 7(1): 5:1-5:26 (2010) - [c14]Neelesh Khanna, Surender Baswana:
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs. STACS 2010: 513-524 - [i2]Neelesh Khanna, Surender Baswana:
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph. CoRR abs/1001.0824 (2010)
2000 – 2009
- 2009
- [j6]Surender Baswana, Vishrut Goyal, Sandeep Sen:
All-pairs nearly 2-approximate shortest paths in I time. Theor. Comput. Sci. 410(1): 84-93 (2009) - [c13]Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann:
Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66 - 2008
- [j5]Surender Baswana:
Streaming algorithm for graph spanners - single pass and constant processing time per edge. Inf. Process. Lett. 106(3): 110-114 (2008) - [c12]Surender Baswana, Shashank K. Mehta, Vishal Powar:
Implied Set Closure and Its Application to Memory Consistency Verification. CAV 2008: 94-106 - [c11]Surender Baswana, Akshay Gaur, Sandeep Sen, Jayant Upadhyay:
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error. ICALP (1) 2008: 609-621 - [c10]Surender Baswana, Soumojit Sarkar:
Fully dynamic algorithm for graph spanners with poly-logarithmic update time. SODA 2008: 1125-1134 - [r2]Surender Baswana, Sandeep Sen:
Algorithms for Spanners in Weighted Graphs. Encyclopedia of Algorithms 2008 - 2007
- [j4]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. J. Algorithms 62(2): 74-92 (2007) - [j3]Surender Baswana, Sandeep Sen:
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4): 532-563 (2007) - 2006
- [j2]Surender Baswana, Sandeep Sen:
Approximate distance oracles for unweighted graphs in expected O(n2) time. ACM Trans. Algorithms 2(4): 557-577 (2006) - [c9]Surender Baswana:
Dynamic Algorithms for Graph Spanners. ESA 2006: 76-87 - [c8]Surender Baswana, Telikepalli Kavitha:
Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths. FOCS 2006: 591-602 - [i1]Surender Baswana:
Faster Streaming algorithms for graph spanners. CoRR abs/cs/0611023 (2006) - 2005
- [c7]Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie:
New constructions of (alpha, beta)-spanners and purely additive spanners. SODA 2005: 672-681 - [c6]Surender Baswana, Vishrut Goyal, Sandeep Sen:
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time. STACS 2005: 666-679 - 2004
- [c5]Surender Baswana, Sandeep Sen:
Approximate distance oracles for unweighted graphs in Õ(n2) time. SODA 2004: 271-280 - [r1]Surender Baswana, Sandeep Sen:
Randomized Graph Data-Structures for Approximate Shortest Paths. Handbook of Data Structures and Applications 2004 - 2003
- [c4]Surender Baswana, Sandeep Sen:
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs. ICALP 2003: 384-296 - [c3]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Maintaining all-pairs approximate shortest paths under deletion of edges. SODA 2003: 394-403 - 2002
- [j1]Surender Baswana, Sandeep Sen:
Planar Graph Blocking for External Searching. Algorithmica 34(3): 298-308 (2002) - [c2]Surender Baswana, Ramesh Hariharan, Sandeep Sen:
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. STOC 2002: 117-123 - 2000
- [c1]Surender Baswana, Sandeep Sen:
Planar Graph Blocking for External Searching. FSTTCS 2000: 252-263
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
