default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShahbaz Khan 0004
Person information
- affiliation: Indian Institute of Technology Roorkee, India
- affiliation (former): University of Helsinki, Department of Computer Science, Finland
- affiliation (2017 - 2018): University of Vienna, Research Group Theory and Applications of Algorithms, Austria
- affiliation (PhD 2017): Indian Institute of Technology Kanpur, India
Other persons with the same name
- Shahbaz Khan 0001 — Brunel University
- Shahbaz Khan 0002 — Wuhan University, State Key Laboratory of Water Resources and Hydropower Engineering Science, China (and 3 more)
- Shahbaz Khan 0003 — Institute of Management Sciences, Pakistan
- Shahbaz Khan 0005
![[0000-0001-7715-0603]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-7715-0603")
— University of Engineering & Technology, Peshawar, Pakistan - Shahbaz Khan 0006 — GLA University, Institute of Business Management, Mathura, India
- Shahbaz Khan 0007 — Jamia Millia Islamia, Department of Mechanical Engineering, New Delhi, India
- Shahbaz Khan 0008 — Northwestern Polytechnical University, School of Automation, Xi'an, China
- Shahbaz Khan 0009 — Fraunhofer AISEC, Germany (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ACM Trans. Algorithms 20(2): 13 (2024)- [i18]Saumya Talera, Parth Bansal, Shabnam Khan, Shahbaz Khan:
Practical algorithms for Hierarchical overlap graphs. CoRR abs/2402.13920 (2024) - [i17]Kancharla Nikhilesh Bhagavan, Macharla Sri Vardhan, Madamanchi Ashok Chowdary, Shahbaz Khan:
Engineering Semi-streaming DFS algorithms. CoRR abs/2406.03922 (2024) - [i16]Bashar Ahmed, Siddharth Singh Rana, Ujjwal, Shahbaz Khan:
Evaluating Optimal Safe Flows Decomposition for RNA Assembly. CoRR abs/2409.13279 (2024) - 2023
- [c13]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut Paths and Their Remainder Structure, with Applications. STACS 2023: 17:1-17:17 - 2022
- [j6]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. Algorithmica 84(3): 719-741 (2022) - [j5]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Improving RNA Assembly via Safety and Completeness in Flow Decompositions. J. Comput. Biol. 29(12): 1270-1287 (2022) - [c12]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. ESA 2022: 31:1-31:14 - [c11]Shahbaz Khan, Alexandru I. Tomescu:
Optimizing Safe Flow Decompositions in DAGs. ESA 2022: 72:1-72:17 - [c10]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Safety and Completeness in Flow Decompositions for RNA Assembly. RECOMB 2022: 177-192 - [i15]Shahbaz Khan, Milla Kortelainen, Manuel Cáceres, Lucia Williams, Alexandru I. Tomescu:
Safety and Completeness in Flow Decompositions for RNA Assembly. CoRR abs/2201.10372 (2022) - [i14]Manuel Cáceres, Massimo Cairo, Andreas Grigorjew, Shahbaz Khan, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu, Lucia Williams:
Width Helps and Hinders Splitting Flows. CoRR abs/2207.02136 (2022) - [i13]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Cut paths and their remainder structure, with applications. CoRR abs/2210.07530 (2022) - 2021
- [j4]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
A simplified algorithm computing all s-t bridges and articulation points. Discret. Appl. Math. 305: 103-108 (2021) - [c9]Shahbaz Khan:
Optimal Construction of Hierarchical Overlap Graphs. CPM 2021: 17:1-17:11 - [c8]Manoj Gupta, Shahbaz Khan:
Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. SOSA 2021: 86-91 - [i12]Shahbaz Khan:
Optimal Construction of Hierarchical Overlap Graphs. CoRR abs/2102.02873 (2021) - [i11]Shahbaz Khan, Alexandru I. Tomescu:
Safety of Flow Decompositions in DAGs. CoRR abs/2102.06480 (2021) - 2020
- [c7]Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz:
Dynamic Matching Algorithms in Practice. ESA 2020: 58:1-58:20 - [i10]Monika Henzinger, Shahbaz Khan, Richard Paul, Christian Schulz:
Dynamic Matching Algorithms in Practice. CoRR abs/2004.09099 (2020) - [i9]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Computing all s-t bridges and articulation points simplified. CoRR abs/2006.15024 (2020) - [i8]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu:
Safety in s-t Paths, Trails and Walks. CoRR abs/2007.04726 (2020) - [i7]Massimo Cairo, Shahbaz Khan, Romeo Rizzi, Sebastian S. Schmidt, Alexandru I. Tomescu, Elia C. Zirondelli:
Genome assembly, a universal theoretical framework: unifying and generalizing the safe and complete algorithms. CoRR abs/2011.12635 (2020)
2010 – 2019
- 2019
- [j3]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) - [j2]Shahbaz Khan:
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. ACM Trans. Parallel Comput. 6(3): 18:1-18:33 (2019) - [c6]Shahbaz Khan, Shashank K. Mehta:
Depth First Search in the Semi-streaming Model. STACS 2019: 42:1-42:16 - [i6]Shahbaz Khan, Shashank K. Mehta:
Depth First Search in the Semi-streaming Model. CoRR abs/1901.03689 (2019) - 2018
- [c5]Surender Baswana, Ayush Goel, Shahbaz Khan:
Incremental DFS algorithms: a theoretical and experimental study. SODA 2018: 53-72 - [i5]Manoj Gupta, Shahbaz Khan:
Simple dynamic algorithms for Maximal Independent Set and other problems. CoRR abs/1804.01823 (2018) - 2017
- [j1]Surender Baswana, Shahbaz Khan:
Incremental Algorithm for Maintaining a DFS Tree for Undirected Graphs. Algorithmica 79(2): 466-483 (2017) - [c4]Manoj Gupta, Shahbaz Khan:
Multiple Source Dual Fault Tolerant BFS Trees. ICALP 2017: 127:1-127:15 - [c3]Shahbaz Khan:
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. SPAA 2017: 283-292 - [i4]Manoj Gupta, Shahbaz Khan:
Multiple Source Dual Fault Tolerant BFS Trees. CoRR abs/1704.06907 (2017) - [i3]Surender Baswana, Ayush Goel, Shahbaz Khan:
Incremental DFS algorithms: a theoretical and experimental study. CoRR abs/1705.02613 (2017) - [i2]Shahbaz Khan:
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs. CoRR abs/1705.03637 (2017) - 2016
- [c2]Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan:
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier. SODA 2016: 730-739 - 2015
- [i1]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
- [c1]Surender Baswana, Shahbaz Khan:
Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs. ICALP (1) 2014: 138-149
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-10-23 21:21 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:
