Search Results - "parameterized algorithms"

Parameterized algorithms for locating-dominating sets by Cappelle, Márcia R., Gomes, Guilherme C.M, Santos, Vinicius F. dos

“…A 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…”
Get full text

Parameterized Algorithms for Queue Layouts by Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“…An $h$-queue layout of a graph $G$ consists of a linear order of its vertices and a partition of its edges into $h$ sets, called queues, such that no two…”
Get full text

Parameterized algorithms for minimum sum vertex cover by Aute, Shubhada, Panolan, Fahad

“… than 1.014 for MSVC is NP-hard, assuming the Unique Games Conjecture. We study the MSVC problem from the perspective of parameterized algorithms…”
Get full text

Parameterized Algorithms for Book Embedding Problems by Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“…A $k$-page book embedding of a graph $G$ draws the vertices of $G$ on a line and the edges on $k$ half-planes (called pages) bounded by this line, such that no…”
Get full text

Parameterized algorithms for the Steiner arborescence problem on a hypercube: Parameterized algorithms for the Steiner arborescence by Mahapatra, Sugyani, Narayanan, Manikandan, Narayanaswamy, N. S.

“…Motivated by a phylogeny reconstruction problem in evolutionary biology, we study the minimum Steiner arborescence problem on directed hypercubes ( MSA - DH )…”
Get full text

Parameterized algorithms for finding highly connected solution by Abhinav, Ankit, Bandopadhyay, Susobhan, Banik, Aritra, Saurabh, Saket

“…To introduce our question and the parameterization, consider the classical Vertex Cover problem. In this problem, the input is a graph G on n vertices and a…”
Get full text

Improved Parameterized Algorithms for Cluster Vertex Deletion by Tian, Kangyi, Xiao, Mingyu, Yang, Boting

“…In the Cluster Vertex Deletion problem, we are given a graph G and an integer k , and the goal is to determine whether we can delete at most k vertices from G…”
Get full text

Parameterized algorithms of fundamental NP-hard problems: a survey by Li, Wenjun, Ding, Yang, Yang, Yongjie, Sherratt, R. Simon, Park, Jong Hyuk, Wang, Jin

“… We give an overview on parameterized algorithms for some fundamental NP-hard problems, including MaxSAT, Maximum Internal Spanning Trees, Maximum Internal Out-Branching, Planar (Connected…”
Get full text

Parameterized algorithms for multi-label periodic temporal graph realization by Erlebach, Thomas, Morawietz, Nils, Wolf, Petra

“…In the periodic temporal graph realization problem introduced by Klobas et al. [SAND '24] one is given a period Δ and an n×n matrix D of desired fastest travel…”
Get full text

Further parameterized algorithms for the F -free edge deletion problem by Gaikwad, Ajinkya, Maity, Soumen

Get full text

Exact and parameterized algorithms for the independent cutset problem by Rauch, Johannes, Rautenbach, Dieter, Souza, Uéverton S.

“…The Independent Cutset problem asks whether there is a set of vertices in a given graph that is both independent and a cutset. This problem is ▪-complete even…”
Get full text

Exact and parameterized algorithms for choosability by Bliznets, Ivan, Nederlof, Jesper

“…In the C hoosability problem (or list chromatic number problem), for a given graph G , we need to find the smallest k such that G admits a list coloring for…”
Get full text

Parameterized algorithms on geometric intersection graphs by Xue, Jie, Zehavi, Meirav

“…We survey results on the parameterized complexity of various problems on geometric intersection graphs, particularly (unit) disk graphs. Specifically, we…”
Get full text

Parameterized algorithms for locating-dominating sets by Cappelle, Márcia R., Gomes, Guilherme C.M., dos Santos, Vinicius F.

Get full text

Parameterized algorithms for the Happy Set problem by Asahiro, Yuichi, Eto, Hiroshi, Hanaka, Tesshu, Lin, Guohui, Miyano, Eiji, Terabaru, Ippei

“…In this paper we study the parameterized complexity for the Maximum Happy Set problem (MaxHS): For an undirected graph G=(V,E) and a subset S⊆V of vertices, a…”
Get full text

A survey of parameterized algorithms and the complexity of edge modification by Crespelle, Christophe, Drange, Pål Grønås, Fomin, Fedor V., Golovach, Petr

“…The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems…”
Get full text

Parameterized algorithms and data reduction for the short secluded s‐t‐path problem by Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

“…Given a graph G = (V, E), two vertices s, t ∈ V, and two integers k, ℓ, the Short Secluded Path problem is to find a simple s‐t‐path with at most k vertices…”
Get full text

Parameterized Algorithms in Bioinformatics: An Overview by Bulteau, Laurent, Weller, Mathias

“… This work surveys recent developments of parameterized algorithms and complexity for important NP-hard problems in bioinformatic…”
Get full text

Efficient parameterized algorithms for computing all-pairs shortest paths by Kratsch, Stefan, Nelles, Florian

Get full text

Fixed parameterized algorithms for generalized feedback vertex set problems by Sheng, Bin, Gutin, Gregory

“…A graph is an r-pseudoforest if every connected component of it has a feedback edge set of size at most r. A graph is a d-quasi-forest if every connected…”
Get full text