Surender Baswana

Available identifiers

zbMath Open baswana.surenderMaRDI QIDQ666656

List of research outcomes

Publication	Date of Publication	Type
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle	2023-10-23	Paper
Approximate Single-Source Fault Tolerant Shortest Path	2023-04-26	Paper
Mincut Sensitivity Data Structures for the Insertion of an Edge	2023-02-07	Paper
Mincut sensitivity data structures for the insertion of an edge	2022-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q5092428	2022-07-21	Paper
Fault tolerant depth first search in undirected graphs: simple yet efficient	2022-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q5111403	2020-05-27	Paper
Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier	2019-09-02	Paper
https://portal.mardi4nfdi.de/entity/Q5743393	2019-05-10	Paper
An efficient strongly connected components algorithm in the fault tolerant model	2019-03-11	Paper
Fault tolerant reachability for directed graphs	2018-08-24	Paper
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4643865	2018-05-29	Paper
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version)	2018-05-18	Paper
https://portal.mardi4nfdi.de/entity/Q4635993	2018-04-23	Paper
https://portal.mardi4nfdi.de/entity/Q4607876	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q4608014	2018-03-15	Paper
Fault-Tolerant Subgraph for Single-Source Reachability: General and Optimal	2018-01-31	Paper
Incremental algorithm for maintaining a DFS tree for undirected graphs	2017-10-10	Paper
Fault tolerant subgraph for single source reachability: generic and optimal	2017-09-29	Paper
Computing single source shortest paths using single-objective fitness	2017-07-14	Paper
https://portal.mardi4nfdi.de/entity/Q2957502	2017-01-26	Paper
Randomization for Efficient Dynamic Graph Algorithms	2016-03-23	Paper
On Dynamic DFS Tree in Directed Graphs	2015-09-16	Paper
Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time	2015-09-02	Paper
https://portal.mardi4nfdi.de/entity/Q5501268	2015-08-03	Paper
Fully Dynamic Maximal Matching in $O(\log n)$ Update Time	2015-06-02	Paper
https://portal.mardi4nfdi.de/entity/Q2921727	2014-10-13	Paper
Additive spanners and (α, β)-spanners	2014-09-09	Paper
Fully dynamic randomized algorithms for graph spanners	2014-09-09	Paper
Fully Dynamic Maximal Matching in O (log n) Update Time	2014-07-30	Paper
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs	2014-07-01	Paper
Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs	2013-05-16	Paper
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs	2012-01-23	Paper
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs	2011-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q3579505	2010-08-06	Paper
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths	2010-08-05	Paper
Streaming algorithm for graph spanners-single pass and constant processing time per edge	2010-04-19	Paper
All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time	2009-02-19	Paper
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error	2008-08-28	Paper
Implied Set Closure and Its Application to Memory Consistency Verification	2008-07-15	Paper
Dynamic Algorithms for Graph Spanners	2008-03-11	Paper
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs	2007-07-18	Paper
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths	2007-06-08	Paper
STACS 2005	2005-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4472449	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4471322	2004-07-28	Paper
https://portal.mardi4nfdi.de/entity/Q4449190	2004-02-08	Paper
Planar graph blocking for external searching	2002-12-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Surender Baswana