11 citations · 35 across the 50 of their papers we have counts for
6 papers · 1 filter
Collision-free Movement on Grids and Beyond
Hendrik Molter, Meirav Zehavi
We study collision-free movement problems on graphs, where the task is to coordinate a set of robots so that they reach a target formation satisfying a desired property while minim…
Counting Paths and Trees via Exterior Algebra
Fahad Panolan, Saket Saurabh, Meirav Zehavi +1
We give randomized approximation algorithms for counting k-paths and k-forests in a host graph. Here k denotes the number of pattern vertices, n and m denote the numbers of host ve…
Fine-Grained Bounds for Courcelle's Theorem
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh +2
Courcelle's theorem states that there exists an algorithm that takes as input a graph of treewidth at most and a MSO formula , and determines whether satisfies i…
Minimum Temporal Spanners in Happy Graphs
Arnaud Casteigts, Hendrik Molter, Michelle Döring +1
Temporal graphs are graphs whose edge set changes over discrete time steps. These graphs can model scenarios related to transportation, scheduling, social networks, and networking…
When agents choose bundles autonomously: guarantees beyond discrepancy
Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman +1
We consider the fair division of indivisible items among agents with additive non-negative normalized valuations, with the goal of obtaining high value guarantees, that is, clo…
FPT Approximations for Connected Maximum Coverage
Tanmay Inamdar, Satyabrata Jana, Madhumita Kundu +3
We revisit connectivity-constrained coverage through a unifying model, Partial Connected Red-Blue Dominating Set. Given a red-blue bipartite graph and an auxiliary connectivity…