A New Parallel Algorithm for Two-Pass Connected Component Labeling. - Siddharth Gupta 002; Diana Palsetia; Md. Mostofa Ali Patwary; Ankit Agrawal 001; Alok N. Choudhary (IPDPS Workshops, 2014)

A topological algorithm for determining how road networks evolve over time. - Michael T. Goodrich; Siddharth Gupta 002; Manuel R. Torres (SIGSPATIAL/GIS, 2016)

Crossing Patterns in Nonplanar Road Networks. - David Eppstein; Siddharth Gupta 002 (SIGSPATIAL/GIS, 2017)

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. - Giordano Da Lozzo; David Eppstein; Michael T. Goodrich; Siddharth Gupta 002 (WG, 2018)

Exact Distance Oracles Using Hopsets. - Siddharth Gupta 002; Adrian Kosowski; Laurent Viennot (CoRR, 2018)

Topological Algorithms for Geographic and Geometric Graphs. - Siddharth Gupta 002 (2018)

Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. - Siddharth Gupta 002; Adrian Kosowski; Laurent Viennot (ICALP, 2019)

The Parameterized Complexity of Motion Planning for Snake-Like Robots. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (J. Artif. Intell. Res., 2020)

Multivariate Analysis of Scheduling Fair Competitions. - Siddharth Gupta 002; Meirav Zehavi (AAMAS, 2021)

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. - David Eppstein; Siddharth Gupta 002; Elham Havvaei (FCT, 2021)

How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. - Michael T. Goodrich; Siddharth Gupta 002; Hadi Khodabandeh; Pedro Matias 001 (WADS, 2021)

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. - Giordano Da Lozzo; David Eppstein; Michael T. Goodrich; Siddharth Gupta 002 (Algorithmica, 2021)

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. - Johannes Blum 001; Yann Disser; Andreas Emil Feldmann; Siddharth Gupta 002; Anna Zych-Pawlewicz (IPEC, 2022)

Brief Announcement: Distributed Reconfiguration of Spanning Trees. - Siddharth Gupta 002; Manish Kumar 011; Shreyas Pai (SSS, 2022)

Distributed Reconfiguration of Spanning Trees. - Siddharth Gupta 002; Manish Kumar 011; Shreyas Pai (CoRR, 2022)

The Parametrized Complexity of the Segment Number. - Sabine Cornelsen; Giordano Da Lozzo; Luca Grilli 001; Siddharth Gupta 002; Jan Kratochvíl; Alexander Wolff 001 (GD (2), 2023)

Collective Graph Exploration Parameterized by Vertex Cover. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (IPEC, 2023)

Drawn Tree Decomposition: New Approach for Graph Drawing Problems. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (IPEC, 2023)

Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (CoRR, 2023)

Grid recognition: Classical and parameterized computational perspectives. - Siddharth Gupta 002; Guy Sa'ar; Meirav Zehavi (J. Comput. Syst. Sci., 2023)

Improved kernels for tracking paths. - Pratibha Choudhary; Michael T. Goodrich; Siddharth Gupta 002; Hadi Khodabandeh; Pedro Matias 001; Venkatesh Raman 001 (Inf. Process. Lett., 2023)

Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. - Siddharth Gupta 002; Marc J. van Kreveld; Othon Michail; Andreas Padalkin (ALGOWIN, 2024)

Weakly Leveled Planarity with Bounded Span. - Michael A. Bekos; Giordano Da Lozzo; Fabrizio Frati; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Ignaz Rutter; Ioannis G. Tollis (GD, 2024)

Exact Algorithms for Clustered Planarity with Linear Saturators. - Giordano Da Lozzo; Robert Ganian; Siddharth Gupta 002; Bojan Mohar; Sebastian Ordyniak; Meirav Zehavi (ISAAC, 2024)

Brief Announcement: On the Exponential Growth of Geometric Shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (SAND, 2024)

Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. - Siddharth Gupta 002; Marc J. van Kreveld; Othon Michail; Andreas Padalkin (SAND, 2024)

Bounding and Computing Obstacle Numbers of Graphs. - Martin Balko; Steven Chaplick; Robert Ganian; Siddharth Gupta 002; Michael Hoffmann 001; Pavel Valtr 001; Alexander Wolff 001 (SIAM J. Discret. Math., 2024)

Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail; Andreas Padalkin (SAND, 2025)

On the exponential growth of geometric shapes. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail (Theor. Comput. Sci., 2025)

Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. - Nada Almalki 002; Siddharth Gupta 002; Othon Michail; Andreas Padalkin (CoRR, 2025)

Parameterized approaches to orthogonal compaction. - Walter Didimo; Siddharth Gupta 002; Philipp Kindermann; Giuseppe Liotta; Alexander Wolff 001; Meirav Zehavi (J. Comput. Syst. Sci., 2026)