Siddharth Gupta

According to our database, Siddharth Gupta authored at least 28 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Bounding and Computing Obstacle Numbers of Graphs.

Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff

SIAM J. Discret. Math., 2024

Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them.

Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Brief Announcement: On the Exponential Growth of Geometric Shapes.

Nada Almalki, Siddharth Gupta, Othon Michail

Proceedings of the 3rd Symposium on Algorithmic Foundations of Dynamic Networks, 2024

Exact Algorithms for Clustered Planarity with Linear Saturators.

Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi

Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Weakly Leveled Planarity with Bounded Span.

Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Improved kernels for tracking paths.

Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman

Inf. Process. Lett., March, 2023

Grid recognition: Classical and parameterized computational perspectives.

Siddharth Gupta, Guy Sa'ar, Meirav Zehavi

J. Comput. Syst. Sci., 2023

Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes.

Nada Almalki, Siddharth Gupta, Othon Michail

CoRR, 2023

Collision Detection for Modular Robots - it is easy to cause collisions and hard to avoid them.

Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin

CoRR, 2023

Parameterized Approaches to Orthogonal Compaction.

Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Drawn Tree Decomposition: New Approach for Graph Drawing Problems.

Siddharth Gupta, Guy Sa'ar, Meirav Zehavi

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Collective Graph Exploration Parameterized by Vertex Cover.

Siddharth Gupta, Guy Sa'ar, Meirav Zehavi

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The Parametrized Complexity of the Segment Number.

Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022

Distributed Reconfiguration of Spanning Trees.

Siddharth Gupta, Manish Kumar, Shreyas Pai

CoRR, 2022

Brief Announcement: Distributed Reconfiguration of Spanning Trees.

Siddharth Gupta, Manish Kumar, Shreyas Pai

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension.

Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

2021

C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width.

Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta

Algorithmica, 2021

How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths.

Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes.

David Eppstein, Siddharth Gupta, Elham Havvaei

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Multivariate Analysis of Scheduling Fair Competitions.

Siddharth Gupta, Meirav Zehavi

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

The Parameterized Complexity of Motion Planning for Snake-Like Robots.

Siddharth Gupta, Guy Sa'ar, Meirav Zehavi

J. Artif. Intell. Res., 2020

2019

Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond.

Siddharth Gupta, Adrian Kosowski, Laurent Viennot

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Topological Algorithms for Geographic and Geometric Graphs.

Siddharth Gupta

PhD thesis, 2018

Exact Distance Oracles Using Hopsets.

Siddharth Gupta, Adrian Kosowski, Laurent Viennot

CoRR, 2018

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity.

Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017

Crossing Patterns in Nonplanar Road Networks.

David Eppstein, Siddharth Gupta

Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2017

2016

A topological algorithm for determining how road networks evolve over time.

Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2016, Burlingame, California, USA, October 31, 2016

2014

A New Parallel Algorithm for Two-Pass Connected Component Labeling.

Siddharth Gupta, Diana Palsetia, Md. Mostofa Ali Patwary, Ankit Agrawal, Alok N. Choudhary

Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014