default search action
Siddharth Gupta 0002
Person information
- affiliation: University of Warwick, UK
- affiliation (former): Ben-Gurion University, Department of Computer Science, Israel
- affiliation (former): University of California, Irvine, CA, USA
Other persons with the same name
- Siddharth Gupta — disambiguation page
- Siddharth Gupta 0001 — Rice University, Houston, TX, USA
- Siddharth Gupta 0003
— EPFL, Lausanne, Switzerland
- Siddharth Gupta 0004
- Siddharth Gupta 0005 — University of Illinois at Urbana-Champagne, Champaign, IL, USA
- Siddharth Gupta 0006 — Granular AI, MA, USA
- Siddharth Gupta 0007 — Bharati Vidyapeeth's College of Engineering, New Delhi, India
- Siddharth Gupta 0008 — Samsung Electronics, Hwaseong, Korea
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Martin Balko
Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. 38(2): 1537-1565 (2024) - [c22]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. GD 2024: 19:1-19:19 - [c21]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. ISAAC 2024: 24:1-24:16 - [c20]Nada Almalki, Siddharth Gupta, Othon Michail:
Brief Announcement: On the Exponential Growth of Geometric Shapes. SAND 2024: 23:1-23:6 - [c19]Siddharth Gupta, Marc J. van Kreveld
Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. SAND 2024: 26:1-26:5 - [i22]Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis:
Weakly Leveled Planarity with Bounded Span. CoRR abs/2409.01889 (2024) - [i21]Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi:
Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR abs/2409.19410 (2024) - 2023
- [j4]Pratibha Choudhary
Improved kernels for tracking paths. Inf. Process. Lett. 181: 106360 (2023) - [j3]Siddharth Gupta
Grid recognition: Classical and parameterized computational perspectives. J. Comput. Syst. Sci. 136: 17-62 (2023) - [c18]Sabine Cornelsen
The Parametrized Complexity of the Segment Number. GD (2) 2023: 97-113 - [c17]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Collective Graph Exploration Parameterized by Vertex Cover. IPEC 2023: 22:1-22:18 - [c16]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. IPEC 2023: 23:1-23:22 - [c15]Walter Didimo, Siddharth Gupta
Parameterized Approaches to Orthogonal Compaction. SOFSEM 2023: 111-125 - [i20]Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin:
Collision Detection for Modular Robots - it is easy to cause collisions and hard to avoid them. CoRR abs/2305.01015 (2023) - [i19]Nada Almalki, Siddharth Gupta, Othon Michail:
Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. CoRR abs/2307.04385 (2023) - [i18]Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff:
The Parametrized Complexity of the Segment Number. CoRR abs/2308.15416 (2023) - [i17]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Drawn Tree Decomposition: New Approach for Graph Drawing Problems. CoRR abs/2310.05471 (2023) - [i16]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Collective Graph Exploration Parameterized by Vertex Cover. CoRR abs/2310.05480 (2023) - 2022
- [c14]Martin Balko
Bounding and Computing Obstacle Numbers of Graphs. ESA 2022: 11:1-11:13 - [c13]Johannes Blum, Yann Disser, Andreas Emil Feldmann
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC 2022: 5:1-5:23 - [c12]Siddharth Gupta, Manish Kumar
Brief Announcement: Distributed Reconfiguration of Spanning Trees. SSS 2022: 346-351 - [i15]Martin Balko
Bounding and computing obstacle numbers of graphs. CoRR abs/2206.15414 (2022) - [i14]Johannes Blum, Yann Disser, Andreas Emil Feldmann
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR abs/2208.14132 (2022) - [i13]Walter Didimo, Siddharth Gupta, Philipp Kindermann
Parameterized Approaches to Orthogonal Compaction. CoRR abs/2210.05019 (2022) - [i12]Siddharth Gupta, Manish Kumar, Shreyas Pai
Distributed Reconfiguration of Spanning Trees. CoRR abs/2211.01725 (2022) - 2021
- [j2]Giordano Da Lozzo
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica 83(8): 2471-2502 (2021) - [c11]Siddharth Gupta, Meirav Zehavi:
Multivariate Analysis of Scheduling Fair Competitions. AAMAS 2021: 555-564 - [c10]David Eppstein, Siddharth Gupta, Elham Havvaei:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. FCT 2021: 217-229 - [c9]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid Recognition: Classical and Parameterized Computational Perspectives. ISAAC 2021: 37:1-37:15 - [c8]Michael T. Goodrich
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. WADS 2021: 442-456 - [i11]David Eppstein, Siddharth Gupta, Elham Havvaei:
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. CoRR abs/2101.09918 (2021) - [i10]Siddharth Gupta, Meirav Zehavi:
Multivariate Analysis of Scheduling Fair Competitions. CoRR abs/2102.03857 (2021) - [i9]Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias:
How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. CoRR abs/2104.12337 (2021) - [i8]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
Grid Recognition: Classical and Parameterized Computational Perspectives. CoRR abs/2106.16180 (2021) - 2020
- [j1]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
The Parameterized Complexity of Motion Planning for Snake-Like Robots. J. Artif. Intell. Res. 69: 191-229 (2020)
2010 – 2019
- 2019
- [c7]Siddharth Gupta, Adrian Kosowski, Laurent Viennot:
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. ICALP 2019: 143:1-143:15 - [c6]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
The Parameterized Complexity of Motion Planning for Snake-Like Robots. IJCAI 2019: 5670-5676 - [c5]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC 2019: 9:1-9:17 - [i7]Siddharth Gupta, Guy Sa'ar, Meirav Zehavi:
The Parameterized Complexity of Motion Planning for Snake-Like Robots. CoRR abs/1903.02445 (2019) - [i6]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. CoRR abs/1910.02057 (2019) - 2018
- [b1]Siddharth Gupta:
Topological Algorithms for Geographic and Geometric Graphs. University of California, Irvine, USA, 2018 - [c4]Giordano Da Lozzo
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG 2018: 111-124 - [i5]Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta:
Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. CoRR abs/1803.05465 (2018) - [i4]Siddharth Gupta, Adrian Kosowski, Laurent Viennot:
Exact Distance Oracles Using Hopsets. CoRR abs/1803.06977 (2018) - 2017
- [c3]David Eppstein, Siddharth Gupta:
Crossing Patterns in Nonplanar Road Networks. SIGSPATIAL/GIS 2017: 40:1-40:9 - [i3]David Eppstein, Siddharth Gupta:
Crossing Patterns in Nonplanar Road Networks. CoRR abs/1709.06113 (2017) - 2016
- [c2]Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres:
A topological algorithm for determining how road networks evolve over time. SIGSPATIAL/GIS 2016: 31:1-31:10 - [i2]Siddharth Gupta, Diana Palsetia, Md. Mostofa Ali Patwary, Ankit Agrawal, Alok N. Choudhary:
A New Parallel Algorithm for Two-Pass Connected Component Labeling. CoRR abs/1606.05973 (2016) - [i1]Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres:
A Topological Algorithm for Determining How Road Networks Evolve Over Time. CoRR abs/1609.07239 (2016) - 2014
- [c1]Siddharth Gupta, Diana Palsetia, Md. Mostofa Ali Patwary, Ankit Agrawal
A New Parallel Algorithm for Two-Pass Connected Component Labeling. IPDPS Workshops 2014: 1355-1362
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-12-05 21:41 CET 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: