
Grid Recognition: Classical and Parameterized Computational Perspectives
Grid graphs, and, more generally, k× r grid graphs, form one of the most...
read it

How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths
Given an undirected graph, G, and vertices, s and t in G, the tracking p...
read it

Multivariate Analysis of Scheduling Fair Competitions
A fair competition, based on the concept of envyfreeness, is a nonelim...
read it

Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
We investigate the parameterized complexity of finding subgraphs with he...
read it

Detecting Urban Changes with Recurrent Neural Networks from Multitemporal Sentinel2 Data
The advent of multitemporal high resolution data, like the Copernicus S...
read it

CPlanarity Testing of Embedded Clustered Graphs with Bounded Dual CarvingWidth
For a clustered graph, i.e, a graph whose vertex set is recursively part...
read it

The Parameterized Complexity of Motion Planning for SnakeLike Robots
We study the parameterized complexity of a variant of the classic video ...
read it

Exact Distance Oracles Using Hopsets
For fixed h ≥ 2, we consider the task of adding to a graph G a set of we...
read it

SubexponentialTime and FPT Algorithms for Embedded Flat Clustered Planarity
The CPlanarity problem asks for a drawing of a clustered graph, i.e., a...
read it

Crossing Patterns in Nonplanar Road Networks
We define the crossing graph of a given embedded graph (such as a road n...
read it

A New Parallel Algorithm for TwoPass Connected Component Labeling
Connected Component Labeling (CCL) is an important step in pattern recog...
read it
Siddharth Gupta
is this you? claim profile