Siddharth Gupta

61 papers A* 2A 3B 11C 2Journal 33Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs. SOFSEM Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen G. Kobourov, Johannes Zink
2026	J	`jnl`	Parameterized approaches to orthogonal compaction. J. Comput. Syst. Sci. Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
2026	J	`jnl`	The Complexity of Extending Storylines with Minimum Local Crossing Number. CoRR Alexander Dobler, Siddharth Gupta, Philipp Kindermann, Fabrizio Montecchiani, Martin Nöllenburg
2026	J	`jnl`	Weakly leveled planarity with bounded span. Theor. Comput. Sci. Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis
2025	—	`conf`	Brief Announcement: Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. SAND Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin
2025	C	`conf`	Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. SSS Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin
2025	J	`jnl`	Efficient Distributed Algorithms for Shape Reduction via Reconfigurable Circuits. CoRR Nada Almalki, Siddharth Gupta, Othon Michail, Andreas Padalkin
2025	J	`jnl`	Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs. CoRR Sabine Cornelsen, Henry Förster, Siddharth Gupta, Stephen G. Kobourov, Johannes Zink
2025	J	`jnl`	On the exponential growth of geometric shapes. Theor. Comput. Sci. Nada Almalki, Siddharth Gupta, Othon Michail
2024	J	`jnl`	Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2024	—	`conf`	Brief Announcement: Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. SAND Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
2024	—	`conf`	Brief Announcement: On the Exponential Growth of Geometric Shapes. SAND Nada Almalki, Siddharth Gupta, Othon Michail
2024	—	`conf`	Collision Detection for Modular Robots - It Is Easy to Cause Collisions and Hard to Avoid Them. ALGOWIN Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
2024	B	`conf`	Exact Algorithms for Clustered Planarity with Linear Saturators. ISAAC Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024	J	`jnl`	Exact Algorithms for Clustered Planarity with Linear Saturators. CoRR Giordano Da Lozzo, Robert Ganian, Siddharth Gupta, Bojan Mohar, Sebastian Ordyniak, Meirav Zehavi
2024	—	`conf`	On the Exponential Growth of Geometric Shapes. ALGOWIN Nada Almalki, Siddharth Gupta, Othon Michail
2024	A	`conf`	Weakly Leveled Planarity with Bounded Span. GD Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis
2024	J	`jnl`	Weakly Leveled Planarity with Bounded Span. CoRR Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Ignaz Rutter, Ioannis G. Tollis
2023	B	`conf`	Collective Graph Exploration Parameterized by Vertex Cover. IPEC Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Collective Graph Exploration Parameterized by Vertex Cover. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Collision Detection for Modular Robots - it is easy to cause collisions and hard to avoid them. CoRR Siddharth Gupta, Marc J. van Kreveld, Othon Michail, Andreas Padalkin
2023	B	`conf`	Drawn Tree Decomposition: New Approach for Graph Drawing Problems. IPEC Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Drawn Tree Decomposition: New Approach for Graph Drawing Problems. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Grid recognition: Classical and parameterized computational perspectives. J. Comput. Syst. Sci. Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2023	J	`jnl`	Growing Fast without Colliding: Polylogarithmic Time Step Construction of Geometric Shapes. CoRR Nada Almalki, Siddharth Gupta, Othon Michail
2023	J	`jnl`	Improved kernels for tracking paths. Inf. Process. Lett. Pratibha Choudhary, Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias, Venkatesh Raman
2023	B	`conf`	Parameterized Approaches to Orthogonal Compaction. SOFSEM Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
2023	—	`conf`	The Parametrized Complexity of the Segment Number. GD (2) Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff
2023	J	`jnl`	The Parametrized Complexity of the Segment Number. CoRR Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli, Siddharth Gupta, Jan Kratochvíl, Alexander Wolff
2022	A	`conf`	Bounding and Computing Obstacle Numbers of Graphs. ESA Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022	J	`jnl`	Bounding and computing obstacle numbers of graphs. CoRR Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022	C	`conf`	Brief Announcement: Distributed Reconfiguration of Spanning Trees. SSS Siddharth Gupta, Manish Kumar, Shreyas Pai
2022	J	`jnl`	Distributed Reconfiguration of Spanning Trees. CoRR Siddharth Gupta, Manish Kumar, Shreyas Pai
2022	B	`conf`	On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
2022	J	`jnl`	On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz
2022	J	`jnl`	Parameterized Approaches to Orthogonal Compaction. CoRR Walter Didimo, Siddharth Gupta, Philipp Kindermann, Giuseppe Liotta, Alexander Wolff, Meirav Zehavi
2021	J	`jnl`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. Algorithmica Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2021	B	`conf`	Grid Recognition: Classical and Parameterized Computational Perspectives. ISAAC Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2021	J	`jnl`	Grid Recognition: Classical and Parameterized Computational Perspectives. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2021	B	`conf`	How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. WADS Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias
2021	J	`jnl`	How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths. CoRR Michael T. Goodrich, Siddharth Gupta, Hadi Khodabandeh, Pedro Matias
2021	A	`conf`	Multivariate Analysis of Scheduling Fair Competitions. AAMAS Siddharth Gupta, Meirav Zehavi
2021	J	`jnl`	Multivariate Analysis of Scheduling Fair Competitions. CoRR Siddharth Gupta, Meirav Zehavi
2021	B	`conf`	Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. FCT David Eppstein, Siddharth Gupta, Elham Havvaei
2021	J	`jnl`	Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes. CoRR David Eppstein, Siddharth Gupta, Elham Havvaei
2020	J	`jnl`	The Parameterized Complexity of Motion Planning for Snake-Like Robots. J. Artif. Intell. Res. Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2019	B	`conf`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. IPEC Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2019	J	`jnl`	C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width. CoRR Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2019	A*	`conf`	Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond. ICALP Siddharth Gupta, Adrian Kosowski, Laurent Viennot
2019	A*	`conf`	The Parameterized Complexity of Motion Planning for Snake-Like Robots. IJCAI Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2019	J	`jnl`	The Parameterized Complexity of Motion Planning for Snake-Like Robots. CoRR Siddharth Gupta, Guy Sa'ar, Meirav Zehavi
2018	J	`jnl`	Exact Distance Oracles Using Hopsets. CoRR Siddharth Gupta, Adrian Kosowski, Laurent Viennot
2018	B	`conf`	Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. WG Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2018	J	`jnl`	Subexponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity. CoRR Giordano Da Lozzo, David Eppstein, Michael T. Goodrich, Siddharth Gupta
2018	—	`—`	Topological Algorithms for Geographic and Geometric Graphs. Siddharth Gupta
2017	—	`conf`	Crossing Patterns in Nonplanar Road Networks. SIGSPATIAL/GIS David Eppstein, Siddharth Gupta
2017	J	`jnl`	Crossing Patterns in Nonplanar Road Networks. CoRR David Eppstein, Siddharth Gupta
2016	J	`jnl`	A New Parallel Algorithm for Two-Pass Connected Component Labeling. CoRR Siddharth Gupta, Diana Palsetia, Md. Mostofa Ali Patwary, Ankit Agrawal, Alok N. Choudhary
2016	J	`jnl`	A Topological Algorithm for Determining How Road Networks Evolve Over Time. CoRR Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres
2016	—	`conf`	A topological algorithm for determining how road networks evolve over time. SIGSPATIAL/GIS Michael T. Goodrich, Siddharth Gupta, Manuel R. Torres
2014	—	`conf`	A New Parallel Algorithm for Two-Pass Connected Component Labeling. IPDPS Workshops Siddharth Gupta, Diana Palsetia, Md. Mostofa Ali Patwary, Ankit Agrawal, Alok N. Choudhary