Preprint
Nov 2026
We study vertex-deletion problems on string graphs and, more generally, on graphs excluding a fixed graph as an induced minor. For every fixed graph $H$, fixed nonnegative integer $t$, and fixed monadic second-order formula $\phi$, we consider the problem of finding a minimum-cardinality set $S$ such that $G-S$ has tre...
D. Lokshtanov, Fahad Panolan, Saket Saurabh et al.
· 0 citations
Save
{ copied = true; setTimeout(() => copied = false, 1500) })"
class="icon-btn" aria-label="Copy link">
{ copied = 'apa'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy APA
Copied ✓
{ copied = 'mla'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy MLA
Copied ✓
{ copied = 'bibtex'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy BibTeX
Copied ✓
Sep 2026
This work shows that both pre-weighted problems have polynomial kernels when parameterized by $k, and shows that both problems are W[1]-hard parameterized by treedepth, answering another question from earlier work.
Shubhada Aute, Fahad Panolan, Geevarghese Philip
· arXiv.org · 0 citations
Save
{ copied = true; setTimeout(() => copied = false, 1500) })"
class="icon-btn" aria-label="Copy link">
{ copied = 'apa'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy APA
Copied ✓
{ copied = 'mla'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy MLA
Copied ✓
{ copied = 'bibtex'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy BibTeX
Copied ✓
Preprint
Sep 2026
These algorithms combine exterior algebra with random matrix estimators, using the tensor-train moment bound of Rakhshan and Rabusseau~[AISTATS 2020].
Fahad Panolan, Saket Saurabh, M. Zehavi et al.
· 0 citations
Save
{ copied = true; setTimeout(() => copied = false, 1500) })"
class="icon-btn" aria-label="Copy link">
{ copied = 'apa'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy APA
Copied ✓
{ copied = 'mla'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy MLA
Copied ✓
{ copied = 'bibtex'; setTimeout(() => { copied = null; open = false }, 1000) })"
class="flex w-full items-center justify-between rounded-lg px-3 py-2 text-left text-sm hover:bg-gray-100 dark:hover:bg-ink-800">
Copy BibTeX
Copied ✓