Siddharth Gupta

Orcid: 0000-0003-4671-9822

Affiliations:
  • University of Warwick, UK
  • Ben-Gurion University, Department of Computer Science, Israel (former)
  • University of California, Irvine, CA, USA (former)


According to our database1, Siddharth Gupta authored at least 22 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Improved kernels for tracking paths.
Inf. Process. Lett., March, 2023

Grid recognition: Classical and parameterized computational perspectives.
J. Comput. Syst. Sci., 2023

Parameterized Approaches to Orthogonal Compaction.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Drawn Tree Decomposition: New Approach for Graph Drawing Problems.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Collective Graph Exploration Parameterized by Vertex Cover.
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The Parametrized Complexity of the Segment Number.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2022
Distributed Reconfiguration of Spanning Trees.
CoRR, 2022

Brief Announcement: Distributed Reconfiguration of Spanning Trees.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Bounding and Computing Obstacle Numbers of Graphs.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

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

How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Multivariate Analysis of Scheduling Fair Competitions.
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.
J. Artif. Intell. Res., 2020

2019
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Topological Algorithms for Geographic and Geometric Graphs.
PhD thesis, 2018

Exact Distance Oracles Using Hopsets.
CoRR, 2018

Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

2017
Crossing Patterns in Nonplanar Road Networks.
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.
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.
Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014


  Loading...