Zobrazeno 1 - 10
of 216
pro vyhledávání: '"Panolan, Fahad"'
For a finite set $\mathcal{F}$ of graphs, the $\mathcal{F}$-Hitting problem aims to compute, for a given graph $G$ (taken from some graph class $\mathcal{G}$) of $n$ vertices (and $m$ edges) and a parameter $k\in\mathbb{N}$, a set $S$ of vertices in
Externí odkaz:
http://arxiv.org/abs/2409.04786
In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which generalizes bo
Externí odkaz:
http://arxiv.org/abs/2407.09356
Autor:
Gupta, Sushmita, Inamdar, Tanmay, Jain, Pallavi, Lokshtanov, Daniel, Panolan, Fahad, Saurabh, Saket
Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance as ``far is better''. Formally stated, we initiate the study of ``obnox
Externí odkaz:
http://arxiv.org/abs/2405.15372
Autor:
Eriksson, Leif, Lagerkvist, Victor, Osipov, George, Ordyniak, Sebastian, Panolan, Fahad, Rychlicki, Mateusz
The quantified Boolean formula (QBF) problem is an important decision problem generally viewed as the archetype for PSPACE-completeness. Many problems of central interest in AI are in general not included in NP, e.g., planning, model checking, and no
Externí odkaz:
http://arxiv.org/abs/2405.06485
Autor:
Aute, Shubhada, Panolan, Fahad
Minimum sum vertex cover of an $n$-vertex graph $G$ is a bijection $\phi : V(G) \to [n]$ that minimizes the cost $\sum_{\{u,v\} \in E(G)} \min \{\phi(u), \phi(v) \}$. Finding a minimum sum vertex cover of a graph (the MSVC problem) is NP-hard. MSVC i
Externí odkaz:
http://arxiv.org/abs/2401.05085
We study the SHORTEST PATH problem with positive disjunctive constraints from the perspective of parameterized complexity. For positive disjunctive constraints, there are certain pair of edges such that any feasible solution must contain at least one
Externí odkaz:
http://arxiv.org/abs/2309.04346
Autor:
Lokshtanov, Daniel, Misra, Pranabendu, Panolan, Fahad, Ramanujan, M. S., Saurabh, Saket, Zehavi, Meirav
The streaming model was introduced to parameterized complexity independently by Fafianie and Kratsch [MFCS14] and by Chitnis, Cormode, Hajiaghayi and Monemizadeh [SODA15]. Subsequently, it was broadened by Chitnis, Cormode, Esfandiari, Hajiaghayi and
Externí odkaz:
http://arxiv.org/abs/2308.01598
We investigate a fundamental vertex-deletion problem called (Induced) Subgraph Hitting: given a graph $G$ and a set $\mathcal{F}$ of forbidden graphs, the goal is to compute a minimum-sized set $S$ of vertices of $G$ such that $G-S$ does not contain
Externí odkaz:
http://arxiv.org/abs/2304.13695
We initiate a systematic study of approximation schemes for fundamental optimization problems on disk graphs, a common generalization of both planar graphs and unit-disk graphs. Our main contribution is a general framework for designing efficient pol
Externí odkaz:
http://arxiv.org/abs/2211.02717
Boolean Matrix Factorization (BMF) aims to find an approximation of a given binary matrix as the Boolean product of two low-rank binary matrices. Binary data is ubiquitous in many fields, and representing data by binary matrices is common in medicine
Externí odkaz:
http://arxiv.org/abs/2207.11917