default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Surender Baswana
@inproceedings{DBLP:conf/icalp/BaswanaB24,
author = {Surender Baswana and
Koustav Bhanja},
editor = {Karl Bringmann and
Martin Grohe and
Gabriele Puppis and
Ola Svensson},
title = {Vital Edges for (s, t)-Mincut: Efficient Algorithms, Compact Structures,
{\&} Optimal Sensitivity Oracles},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},
series = {LIPIcs},
volume = {297},
pages = {17:1--17:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.17},
doi = {10.4230/LIPICS.ICALP.2024.17},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaBP23,
author = {Surender Baswana and
Koustav Bhanja and
Abhyuday Pandey},
title = {Minimum+1 (\emph{s, t})-cuts and Dual-edge Sensitivity Oracle},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {4},
pages = {38:1--38:41},
year = {2023},
url = {https://doi.org/10.1145/3623271},
doi = {10.1145/3623271},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BaswanaBP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-12096,
author = {Surender Baswana and
Koustav Bhanja},
title = {Vital Edges for (s, t)-mincut: Efficient Algorithms, Compact Structures,
and Optimal Sensitivity Oracle},
journal = {CoRR},
volume = {abs/2310.12096},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.12096},
doi = {10.48550/ARXIV.2310.12096},
eprinttype = {arXiv},
eprint = {2310.12096},
timestamp = {Fri, 27 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-12096.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaGT22,
author = {Surender Baswana and
Shiv Kumar Gupta and
Ayush Tulsyan},
title = {Fault Tolerant Depth First Search in Undirected Graphs: Simple Yet
Efficient},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {2028--2049},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00947-7},
doi = {10.1007/S00453-022-00947-7},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaGT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaGK22,
author = {Surender Baswana and
Shiv Kumar Gupta and
Till Knollmann},
title = {Mincut Sensitivity Data Structures for the Insertion of an Edge},
journal = {Algorithmica},
volume = {84},
number = {9},
pages = {2702--2734},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00978-0},
doi = {10.1007/S00453-022-00978-0},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaGK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaswanaBP22,
author = {Surender Baswana and
Koustav Bhanja and
Abhyuday Pandey},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Minimum+1 (s, t)-cuts and Dual Edge Sensitivity Oracle},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {15:1--15:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.15},
doi = {10.4230/LIPICS.ICALP.2022.15},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaBP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaP22,
author = {Surender Baswana and
Abhyuday Pandey},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Sensitivity Oracles for All-Pairs Mincuts},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {581--609},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.27},
doi = {10.1137/1.9781611977073.27},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BaswanaP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaCHR20,
author = {Surender Baswana and
Keerti Choudhary and
Moazzam Hussain and
Liam Roditty},
title = {Approximate Single-Source Fault Tolerant Shortest Path},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {4},
pages = {44:1--44:22},
year = {2020},
url = {https://doi.org/10.1145/3397532},
doi = {10.1145/3397532},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BaswanaCHR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BaswanaGK20,
author = {Surender Baswana and
Shiv Kumar Gupta and
Till Knollmann},
editor = {Fabrizio Grandoni and
Grzegorz Herman and
Peter Sanders},
title = {Mincut Sensitivity Data Structures for the Insertion of an Edge},
booktitle = {28th Annual European Symposium on Algorithms, {ESA} 2020, September
7-9, 2020, Pisa, Italy (Virtual Conference)},
series = {LIPIcs},
volume = {173},
pages = {12:1--12:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ESA.2020.12},
doi = {10.4230/LIPICS.ESA.2020.12},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BaswanaGK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-03291,
author = {Surender Baswana and
Abhyuday Pandey},
title = {Fault-Tolerant All-Pairs Mincuts},
journal = {CoRR},
volume = {abs/2011.03291},
year = {2020},
url = {https://arxiv.org/abs/2011.03291},
eprinttype = {arXiv},
eprint = {2011.03291},
timestamp = {Thu, 12 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-03291.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaCR19,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
title = {An Efficient Strongly Connected Components Algorithm in the Fault
Tolerant Model},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {967--985},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0452-3},
doi = {10.1007/S00453-018-0452-3},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaCR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/interfaces/BaswanaCCKP19,
author = {Surender Baswana and
Partha Pratim Chakrabarti and
Sharat Chandran and
Yashodhan Kanoria and
Utkarsh Patange},
title = {Centralized Admissions for Engineering Colleges in India},
journal = {{INFORMS} J. Appl. Anal.},
volume = {49},
number = {5},
pages = {338--354},
year = {2019},
url = {https://doi.org/10.1287/inte.2019.1007},
doi = {10.1287/INTE.2019.1007},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/interfaces/BaswanaCCKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaCC019,
author = {Surender Baswana and
Shreejit Ray Chaudhury and
Keerti Choudhary and
Shahbaz Khan},
title = {Dynamic {DFS} in Undirected Graphs: Breaking the O(m) Barrier},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {4},
pages = {1335--1363},
year = {2019},
url = {https://doi.org/10.1137/17M114306X},
doi = {10.1137/17M114306X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaCC019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ec/BaswanaCCKP19,
author = {Surender Baswana and
Partha Pratim Chakrabarti and
Sharat Chandran and
Yashodhan Kanoria and
Utkarsh Patange},
editor = {Anna R. Karlin and
Nicole Immorlica and
Ramesh Johari},
title = {Centralized Admissions for Engineering Colleges in India},
booktitle = {Proceedings of the 2019 {ACM} Conference on Economics and Computation,
{EC} 2019, Phoenix, AZ, USA, June 24-28, 2019},
pages = {323--324},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3328526.3329610},
doi = {10.1145/3328526.3329610},
timestamp = {Thu, 04 Apr 2024 16:56:10 +0200},
biburl = {https://dblp.org/rec/conf/ec/BaswanaCCKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BaswanaGT19,
author = {Surender Baswana and
Shiv Kumar Gupta and
Ayush Tulsyan},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Fault Tolerant and Fully Dynamic {DFS} in Undirected Graphs: Simple
Yet Efficient},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {65:1--65:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.65},
doi = {10.4230/LIPICS.MFCS.2019.65},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BaswanaGT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-06698,
author = {Surender Baswana and
P. P. Chakrabarti and
Yashodhan Kanoria and
Utkarsh Patange and
Sharat Chandran},
title = {Joint Seat Allocation 2018: An algorithmic perspective},
journal = {CoRR},
volume = {abs/1904.06698},
year = {2019},
url = {http://arxiv.org/abs/1904.06698},
eprinttype = {arXiv},
eprint = {1904.06698},
timestamp = {Mon, 07 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-06698.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaCR18,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
title = {Fault-Tolerant Subgraph for Single-Source Reachability: General and
Optimal},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {1},
pages = {80--95},
year = {2018},
url = {https://doi.org/10.1137/16M1087643},
doi = {10.1137/16M1087643},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaCR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaGS18,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Fully Dynamic Maximal Matching in O(log n) Update Time (Corrected
Version)},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {3},
pages = {617--650},
year = {2018},
url = {https://doi.org/10.1137/16M1106158},
doi = {10.1137/16M1106158},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaG018,
author = {Surender Baswana and
Ayush Goel and
Shahbaz Khan},
editor = {Artur Czumaj},
title = {Incremental {DFS} algorithms: a theoretical and experimental study},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {53--72},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.4},
doi = {10.1137/1.9781611975031.4},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaG018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaCHR18,
author = {Surender Baswana and
Keerti Choudhary and
Moazzam Hussain and
Liam Roditty},
editor = {Artur Czumaj},
title = {Approximate Single Source Fault Tolerant Shortest Path},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1901--1915},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.124},
doi = {10.1137/1.9781611975031.124},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BaswanaCHR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-01726,
author = {Surender Baswana and
Shiv Kumar Gupta and
Ayush Tulsyan},
title = {Fault Tolerant and Fully Dynamic {DFS} in Undirected Graphs: Simple
Yet Efficient},
journal = {CoRR},
volume = {abs/1810.01726},
year = {2018},
url = {http://arxiv.org/abs/1810.01726},
eprinttype = {arXiv},
eprint = {1810.01726},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-01726.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaK17,
author = {Surender Baswana and
Shahbaz Khan},
title = {Incremental Algorithm for Maintaining a {DFS} Tree for Undirected
Graphs},
journal = {Algorithmica},
volume = {79},
number = {2},
pages = {466--483},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0204-1},
doi = {10.1007/S00453-016-0204-1},
timestamp = {Thu, 21 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaswanaCR17,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {An Efficient Strongly Connected Components Algorithm in the Fault
Tolerant Model},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {72:1--72:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.72},
doi = {10.4230/LIPICS.ICALP.2017.72},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaCR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaswanaG017,
author = {Surender Baswana and
Ayush Goel and
Shahbaz Khan},
title = {Incremental {DFS} algorithms: a theoretical and experimental study},
journal = {CoRR},
volume = {abs/1705.02613},
year = {2017},
url = {http://arxiv.org/abs/1705.02613},
eprinttype = {arXiv},
eprint = {1705.02613},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaswanaG017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/Baswana16,
author = {Surender Baswana},
editor = {Sathish Govindarajan and
Anil Maheshwari},
title = {Randomization for Efficient Dynamic Graph Algorithms - (Invited Talk)},
booktitle = {Algorithms and Discrete Applied Mathematics - Second International
Conference, {CALDAM} 2016, Thiruvananthapuram, India, February 18-20,
2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9602},
pages = {1--13},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-29221-2\_1},
doi = {10.1007/978-3-319-29221-2\_1},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/caldam/Baswana16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaCC016,
author = {Surender Baswana and
Shreejit Ray Chaudhury and
Keerti Choudhary and
Shahbaz Khan},
editor = {Robert Krauthgamer},
title = {Dynamic {DFS} in Undirected Graphs: breaking the O(\emph{m}) barrier},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {730--739},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch52},
doi = {10.1137/1.9781611974331.CH52},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BaswanaCC016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaswanaCR16,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Fault tolerant subgraph for single source reachability: generic and
optimal},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {509--518},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897648},
doi = {10.1145/2897518.2897648},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BaswanaCR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BaswanaGS16,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Matching in Dynamic Graphs},
booktitle = {Encyclopedia of Algorithms},
pages = {1195--1199},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_567},
doi = {10.1007/978-1-4939-2864-4\_567},
timestamp = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/BaswanaGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BaswanaS16,
author = {Surender Baswana and
Sandeep Sen},
title = {Simple Algorithms for Spanners in Weighted Graphs},
booktitle = {Encyclopedia of Algorithms},
pages = {1981--1986},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_10},
doi = {10.1007/978-1-4939-2864-4\_10},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/BaswanaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaswanaCR16,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
title = {An efficient strongly connected components algorithm in the fault
tolerant model},
journal = {CoRR},
volume = {abs/1610.04010},
year = {2016},
url = {http://arxiv.org/abs/1610.04010},
eprinttype = {arXiv},
eprint = {1610.04010},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaswanaCR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaGS15,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Fully Dynamic Maximal Matching in O(log n) Update Time},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {1},
pages = {88--113},
year = {2015},
url = {https://doi.org/10.1137/130914140},
doi = {10.1137/130914140},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BaswanaC15,
author = {Surender Baswana and
Keerti Choudhary},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {On Dynamic {DFS} Tree in Directed Graphs},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {102--114},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_9},
doi = {10.1007/978-3-662-48054-0\_9},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BaswanaC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BaswanaCR15,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
editor = {Yoram Moses},
title = {Fault Tolerant Reachability for Directed Graphs},
booktitle = {Distributed Computing - 29th International Symposium, {DISC} 2015,
Tokyo, Japan, October 7-9, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9363},
pages = {528--543},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48653-5\_35},
doi = {10.1007/978-3-662-48653-5\_35},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BaswanaCR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaswanaCC015,
author = {Surender Baswana and
Shreejit Ray Chaudhury and
Keerti Choudhary and
Shahbaz Khan},
title = {Dynamic {DFS} Tree in Undirected Graphs: breaking the O(m) barrier},
journal = {CoRR},
volume = {abs/1502.02481},
year = {2015},
url = {http://arxiv.org/abs/1502.02481},
eprinttype = {arXiv},
eprint = {1502.02481},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaswanaCC015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaswanaK14,
author = {Surender Baswana and
Shahbaz Khan},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Incremental Algorithm for Maintaining {DFS} Tree for Undirected Graphs},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {138--149},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_12},
doi = {10.1007/978-3-662-43948-7\_12},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaK13,
author = {Surender Baswana and
Neelesh Khanna},
title = {Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal
Data Structures for Undirected Unweighted Graphs},
journal = {Algorithmica},
volume = {66},
number = {1},
pages = {18--50},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9621-y},
doi = {10.1007/S00453-012-9621-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cgo/ChouhanRB13,
author = {Ramshankar Chouhan and
Subhajit Roy and
Surender Baswana},
title = {Pertinent path profiling: Tracking interactions among relevant statements},
booktitle = {Proceedings of the 2013 {IEEE/ACM} International Symposium on Code
Generation and Optimization, {CGO} 2013, Shenzhen, China, February
23-27, 2013},
pages = {16:1--16:12},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CGO.2013.6494983},
doi = {10.1109/CGO.2013.6494983},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cgo/ChouhanRB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaKS12,
author = {Surender Baswana and
Sumeet Khurana and
Soumojit Sarkar},
title = {Fully dynamic randomized algorithms for graph spanners},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {4},
pages = {35:1--35:51},
year = {2012},
url = {https://doi.org/10.1145/2344422.2344425},
doi = {10.1145/2344422.2344425},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BaswanaKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AnandBGS12,
author = {Abhash Anand and
Surender Baswana and
Manoj Gupta and
Sandeep Sen},
editor = {Deepak D'Souza and
Telikepalli Kavitha and
Jaikumar Radhakrishnan},
title = {Maintaining Approximate Maximum Weighted Matching in Fully Dynamic
Graphs},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2012, December 15-17, 2012,
Hyderabad, India},
series = {LIPIcs},
volume = {18},
pages = {257--266},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2012.257},
doi = {10.4230/LIPICS.FSTTCS.2012.257},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AnandBGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaLM12,
author = {Surender Baswana and
Utkarsh Lath and
Anuradha S. Mehta},
editor = {Yuval Rabani},
title = {Single source distance oracle for planar digraphs avoiding a failed
node or link},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {223--232},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.20},
doi = {10.1137/1.9781611973099.20},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-3976,
author = {Abhash Anand and
Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Maintaining Approximate Maximum Weighted Matching in Fully Dynamic
Graphs},
journal = {CoRR},
volume = {abs/1207.3976},
year = {2012},
url = {http://arxiv.org/abs/1207.3976},
eprinttype = {arXiv},
eprint = {1207.3976},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-3976.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BaswanaGS11,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
editor = {Rafail Ostrovsky},
title = {Fully Dynamic Maximal Matching in {O} (log n) Update Time},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {383--392},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.89},
doi = {10.1109/FOCS.2011.89},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BaswanaGS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-1109,
author = {Surender Baswana and
Manoj Gupta and
Sandeep Sen},
title = {Fully dynamic maximal matching in O(log n) update time},
journal = {CoRR},
volume = {abs/1103.1109},
year = {2011},
url = {http://arxiv.org/abs/1103.1109},
eprinttype = {arXiv},
eprint = {1103.1109},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-1109.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BaswanaK10,
author = {Surender Baswana and
Telikepalli Kavitha},
title = {Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected
Graphs},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {7},
pages = {2865--2896},
year = {2010},
url = {https://doi.org/10.1137/080737174},
doi = {10.1137/080737174},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BaswanaK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaKMP10,
author = {Surender Baswana and
Telikepalli Kavitha and
Kurt Mehlhorn and
Seth Pettie},
title = {Additive spanners and (alpha, beta)-spanners},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {1},
pages = {5:1--5:26},
year = {2010},
url = {https://doi.org/10.1145/1868237.1868242},
doi = {10.1145/1868237.1868242},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BaswanaKMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KhannaB10,
author = {Neelesh Khanna and
Surender Baswana},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size
Data Structures for Unweighted Graphs},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {513--524},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2481},
doi = {10.4230/LIPICS.STACS.2010.2481},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KhannaB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0824,
author = {Neelesh Khanna and
Surender Baswana},
title = {Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size
Data Structures for Unweighted Graph},
journal = {CoRR},
volume = {abs/1001.0824},
year = {2010},
url = {http://arxiv.org/abs/1001.0824},
eprinttype = {arXiv},
eprint = {1001.0824},
timestamp = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0824.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaswanaGS09,
author = {Surender Baswana and
Vishrut Goyal and
Sandeep Sen},
title = {All-pairs nearly 2-approximate shortest paths in \emph{I} time},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {84--93},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.10.018},
doi = {10.1016/J.TCS.2008.10.018},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaswanaGS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/foga/BaswanaBDFKN09,
author = {Surender Baswana and
Somenath Biswas and
Benjamin Doerr and
Tobias Friedrich and
Piyush P. Kurur and
Frank Neumann},
editor = {Ivan I. Garibay and
Thomas Jansen and
R. Paul Wiegand and
Annie S. Wu},
title = {Computing single source shortest paths using single-objective fitness},
booktitle = {Foundations of Genetic Algorithms, 10th {ACM} {SIGEVO} International
Workshop, {FOGA} 2009, Orlando, Forida, USA, January 9-11, 2009, Proceedings},
pages = {59--66},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1527125.1527134},
doi = {10.1145/1527125.1527134},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/foga/BaswanaBDFKN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Baswana08,
author = {Surender Baswana},
title = {Streaming algorithm for graph spanners - single pass and constant
processing time per edge},
journal = {Inf. Process. Lett.},
volume = {106},
number = {3},
pages = {110--114},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2007.11.001},
doi = {10.1016/J.IPL.2007.11.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Baswana08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/BaswanaMP08,
author = {Surender Baswana and
Shashank K. Mehta and
Vishal Powar},
editor = {Aarti Gupta and
Sharad Malik},
title = {Implied Set Closure and Its Application to Memory Consistency Verification},
booktitle = {Computer Aided Verification, 20th International Conference, {CAV}
2008, Princeton, NJ, USA, July 7-14, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5123},
pages = {94--106},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70545-1\_11},
doi = {10.1007/978-3-540-70545-1\_11},
timestamp = {Sat, 30 Sep 2023 09:35:55 +0200},
biburl = {https://dblp.org/rec/conf/cav/BaswanaMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaswanaGSU08,
author = {Surender Baswana and
Akshay Gaur and
Sandeep Sen and
Jayant Upadhyay},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier
with Constant Additive Error},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {609--621},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_50},
doi = {10.1007/978-3-540-70575-8\_50},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaGSU08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaS08,
author = {Surender Baswana and
Soumojit Sarkar},
editor = {Shang{-}Hua Teng},
title = {Fully dynamic algorithm for graph spanners with poly-logarithmic update
time},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1125--1134},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347205},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/BaswanaS08,
author = {Surender Baswana and
Sandeep Sen},
editor = {Ming{-}Yang Kao},
title = {Algorithms for Spanners in Weighted Graphs},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_10},
doi = {10.1007/978-0-387-30162-4\_10},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/BaswanaS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BaswanaHS07,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
title = {Improved decremental algorithms for maintaining transitive closure
and all-pairs shortest paths},
journal = {J. Algorithms},
volume = {62},
number = {2},
pages = {74--92},
year = {2007},
url = {https://doi.org/10.1016/j.jalgor.2004.08.004},
doi = {10.1016/J.JALGOR.2004.08.004},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BaswanaHS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BaswanaS07,
author = {Surender Baswana and
Sandeep Sen},
title = {A simple and linear time randomized algorithm for computing sparse
spanners in weighted graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {4},
pages = {532--563},
year = {2007},
url = {https://doi.org/10.1002/rsa.20130},
doi = {10.1002/RSA.20130},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BaswanaS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BaswanaS06,
author = {Surender Baswana and
Sandeep Sen},
title = {Approximate distance oracles for unweighted graphs in expected \emph{O}(\emph{n}\({}^{\mbox{2}}\))
time},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {4},
pages = {557--577},
year = {2006},
url = {https://doi.org/10.1145/1198513.1198518},
doi = {10.1145/1198513.1198518},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BaswanaS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Baswana06,
author = {Surender Baswana},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Dynamic Algorithms for Graph Spanners},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {76--87},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_10},
doi = {10.1007/11841036\_10},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Baswana06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BaswanaK06,
author = {Surender Baswana and
Telikepalli Kavitha},
title = {Faster Algorithms for Approximate Distance Oracles and All-Pairs Small
Stretch Paths},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {591--602},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.29},
doi = {10.1109/FOCS.2006.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BaswanaK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0611023,
author = {Surender Baswana},
title = {Faster Streaming algorithms for graph spanners},
journal = {CoRR},
volume = {abs/cs/0611023},
year = {2006},
url = {http://arxiv.org/abs/cs/0611023},
eprinttype = {arXiv},
eprint = {cs/0611023},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0611023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaKMP05,
author = {Surender Baswana and
Telikepalli Kavitha and
Kurt Mehlhorn and
Seth Pettie},
title = {New constructions of (alpha, beta)-spanners and purely additive spanners},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {672--681},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070526},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaKMP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaswanaGS05,
author = {Surender Baswana and
Vishrut Goyal and
Sandeep Sen},
editor = {Volker Diekert and
Bruno Durand},
title = {All-Pairs Nearly 2-Approximate Shortest-Paths in O(n\({}^{\mbox{2}}\)
polylog n) Time},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {666--679},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_55},
doi = {10.1007/978-3-540-31856-9\_55},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaswanaGS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaS04,
author = {Surender Baswana and
Sandeep Sen},
editor = {J. Ian Munro},
title = {Approximate distance oracles for unweighted graphs in {\~{O}}(n\({}^{\mbox{2}}\))
time},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {271--280},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982830},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/BaswanaS04,
author = {Surender Baswana and
Sandeep Sen},
editor = {Dinesh P. Mehta and
Sartaj Sahni},
title = {Randomized Graph Data-Structures for Approximate Shortest Paths},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {https://doi.org/10.1201/9781420035179.ch38},
doi = {10.1201/9781420035179.CH38},
timestamp = {Thu, 19 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/reference/crc/BaswanaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaswanaS03,
author = {Surender Baswana and
Sandeep Sen},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n\({}^{\mbox{1+1/k}}\))
Size in Weighted Graphs},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {384--296},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_32},
doi = {10.1007/3-540-45061-0\_32},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaswanaS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BaswanaHS03,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
title = {Maintaining all-pairs approximate shortest paths under deletion of
edges},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {394--403},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644171},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BaswanaHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaS02,
author = {Surender Baswana and
Sandeep Sen},
title = {Planar Graph Blocking for External Searching},
journal = {Algorithmica},
volume = {34},
number = {3},
pages = {298--308},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0969-2},
doi = {10.1007/S00453-002-0969-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaswanaHS02,
author = {Surender Baswana and
Ramesh Hariharan and
Sandeep Sen},
editor = {John H. Reif},
title = {Improved decremental algorithms for maintaining transitive closure
and all-pairs shortest paths},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {117--123},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509928},
doi = {10.1145/509907.509928},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BaswanaHS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BaswanaS00,
author = {Surender Baswana and
Sandeep Sen},
editor = {Sanjiv Kapoor and
Sanjiva Prasad},
title = {Planar Graph Blocking for External Searching},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1974},
pages = {252--263},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44450-5\_20},
doi = {10.1007/3-540-44450-5\_20},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BaswanaS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
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:
