Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2024
Optimal Polynomial-Time Compression for Boolean Max CSP
ACM Transactions on Computation Theory (TOCT), Volume 16, Issue 1Article No.: 4, Pages 1–20https://doi.org/10.1145/3624704In the Boolean maximum constraint satisfaction problem—Max CSPΓ—one is given a collection of weighted applications of constraints from a finite constraint language Γ, over a common set of variables, and the goal is to assign Boolean values to the ...
- research-articleNovember 2023
2k-Vertex Kernels for Cluster Deletion and Strong Triadic Closure
Journal of Computer Science and Technology (JCST), Volume 38, Issue 6Dec 2023, Pages 1431–1439https://doi.org/10.1007/s11390-023-1420-1AbstractCluster deletion and strong triadic closure are two important NP-complete problems that have received significant attention due to their applications in various areas, including social networks and data analysis. Although cluster deletion and ...
- research-articleJune 2023
Weighted Edit Distance Computation: Strings, Trees, and Dyck
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of ComputingJune 2023, Pages 377–390https://doi.org/10.1145/3564246.3585178Given two strings of length n over alphabet Σ, and an upper bound k on their edit distance, the algorithm of Myers (Algorithmica’86) and Landau and Vishkin (JCSS’88) from almost forty years back computes the unweighted string edit distance in O(n+k2) ...
- research-articleApril 2023
Polynomial Kernel for Interval Vertex Deletion
ACM Transactions on Algorithms (TALG), Volume 19, Issue 2Article No.: 11, Pages 1–68https://doi.org/10.1145/3571075Given a graph G and an integer k, the Interval Vertex Deletion (IVD) problem asks whether there exists a subset S⊆ V(G) of size at most k such that G-S is an interval graph. This problem is known to be NP-complete (according to Yannakakis at STOC 1978). ...
- research-articleJanuary 2023
-
- research-articleSeptember 2022
On the satisfaction probability of k-CNF formulas
CCC '22: Proceedings of the 37th Computational Complexity ConferenceJuly 2022, Article No.: 2, Pages 1–27https://doi.org/10.4230/LIPIcs.CCC.2022.2The satisfaction probability σ(ϕ) := Prβ:vars(ϕ)→{0,1}[β|= ϕ] of a propositional formula ϕ is the likelihood that a random assignment β makes the formula true. We study the complexity of the problem kSAT-PROB>δ = {ϕ is a kCNF formula | σ(ϕ) > δ} for ...
- ArticleJune 2022
Lossy Kernelization of Same-Size Clustering
Computer Science – Theory and ApplicationsJun 2022, Pages 96–114https://doi.org/10.1007/978-3-031-09574-0_7AbstractIn this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters, from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) polynomial kernel for this ...
- research-articleJune 2022
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
STOC 2022: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of ComputingJune 2022, Pages 900–913https://doi.org/10.1145/3519935.3520021In the F-minor-free deletion problem we are given an undirected graph G and the goal is to find a minimum vertex set that intersects all minor models of graphs from the family F. This captures numerous important problems including Vertex cover, Feedback ...
- extended-abstractMay 2022
Parameterized Algorithms for Kidney Exchange
AAMAS '22: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent SystemsMay 2022, Pages 1693–1695In kidney exchange programs, multiple patient-donor pairs each of whom are otherwise incompatible, exchange their donors to receive compatible kidneys. The Kidney Exchange problem is typically modelled as a directed graph where every vertex is either an ...
- research-articleJanuary 2022
Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems
SIAM Journal on Discrete Mathematics (SIDMA), Volume 36, Issue 4Dec 2022, Pages 2798–2821https://doi.org/10.1137/21M1449476A graph is $c$-closed if every pair of vertices with at least $c$ common neighbors is adjacent. The $c$-closure of a graph $G$ is the smallest number $c$ such that $G$ is $c$-closed. Fox et al. [SIAM J. Comput., 49 (2020), pp. 448--464] defined $c$-closure ...
- research-articleJanuary 2022
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
SIAM Journal on Discrete Mathematics (SIDMA), Volume 36, Issue 3Sep 2022, Pages 1955–1990https://doi.org/10.1137/20M1335285The Vertex Cover problem plays an essential role in the study of polynomial kernelization in parameterized complexity, i.e., the study of provable and efficient preprocessing for ${\mathsf{NP}}$-hard problems. Motivated by the great variety of positive ...
- research-articleApril 2021
Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
ACM Journal of Experimental Algorithmics (JEA), Volume 26Article No.: 1.3, Pages 1–30https://doi.org/10.1145/3439801Finding a maximum-cardinality or maximum-weight matching in (edge-weighted) undirected graphs is among the most prominent problems of algorithmic graph theory. For n-vertex and m-edge graphs, the best-known algorithms run in Õ(m√ n) time. We build on ...
- research-articleJanuary 2021
Kernelization of Whitney Switches
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35, Issue 22021, Pages 1298–1336https://doi.org/10.1137/20M1367519A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs $G$ and $H$ are 2-isomorphic, or equivalently, their cycle matroids are isomorphic if and only if $G$ can be transformed into $H$ by a series of operations called Whitney switches. ...
- research-articleJanuary 2021
Parameterized Pre-Coloring Extension and List Coloring Problems
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35, Issue 12021, Pages 575–596https://doi.org/10.1137/20M1323369Golovach, Paulusma, and Song [Inform. and Comput., 237 (2014), pp. 204--214] asked to determine the parameterized complexity of the following problems parameterized by $k$: 1. Given a graph $G$, a clique modulator $D$ (a clique modulator is a set of vertices,...
- research-articleJanuary 2021
Parameterized Complexity of Conflict-Free Graph Coloring
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35, Issue 32021, Pages 2003–2038https://doi.org/10.1137/19M1307160Given a graph $G$, a $q$-open neighborhood conflict-free coloring or $q$-ONCF-coloring is a vertex coloring $c\colon V(G) \rightarrow \{1,2,\ldots,q\}$ such that for each vertex $v \in V(G)$ there is a vertex in $N(v)$ that is uniquely colored from the ...
- research-articleJanuary 2021
Kernelization of Graph Hamiltonicity: Proper $H$-Graphs
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35, Issue 22021, Pages 840–892https://doi.org/10.1137/19M1299001We obtain new polynomial kernels and compression algorithms for Path Cover and Cycle Cover, the well-known generalizations of the classical Hamiltonian Path and Hamiltonian Cycle problems. Our choice of parameterization is strongly influenced by the work of ...
- research-articleJanuary 2021
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
SIAM Journal on Discrete Mathematics (SIDMA), Volume 35, Issue 12021, Pages 105–151https://doi.org/10.1137/18M1228839Suppose ${\mathcal{F}}$ is a finite family of graphs. We consider the following meta-problem, called $\mathcal{F}$-Immersion Deletion: given a graph $G$ and integer $k$, decide whether the deletion of at most $k$ edges of $G$ can result in a graph that ...
- research-articleJanuary 2021
On structural parameterizations of the selective coloring problem
Procedia Computer Science (PROCS), Volume 195, Issue C2021, Pages 77–85https://doi.org/10.1016/j.procs.2021.11.013AbstractIn the Selective Coloring problem, we are given an integer k, a graph G, and a partition of V(G) into p parts, and the goal is to decide whether or not we can pick exactly one vertex of each part and obtain a k-colorable induced subgraph of G. ...
- research-articleJanuary 2021
Parameterized algorithms for locating-dominating sets
Procedia Computer Science (PROCS), Volume 195, Issue C2021, Pages 68–76https://doi.org/10.1016/j.procs.2021.11.012AbstractA locating-dominating set D of a graph G is a dominating set of G where each vertex not in D has a unique neighborhood in D, and the Locating-Dominating Set problem asks if G contains such a dominating set of bounded size. This problem is known to ...
- research-articleJanuary 2021
Kernelization results for Equitable Coloring
Procedia Computer Science (PROCS), Volume 195, Issue C2021, Pages 59–67https://doi.org/10.1016/j.procs.2021.11.011AbstractAn n-vertex graph is equitably k-colorable if there is a proper coloring of its vertices such that each color is used either [n/k] or [n/k] times. While classic Vertex Coloring is fixed parameter tractable under well established parameters such as ...