Results 101 to 110 of about 23,779 (205)
Complexity and Approximability of Parameterized CSP
, 2016 The complexity of various Constraint Satisfaction Problems (CSP) when parameterized by structural measures (such as treewidth or clique-width) is a well-investigated area.
Mitsou, Valia
core
On the Parameterized Complexity of Contraction to Generalization of Trees [PDF]
, 2018 For a family of graphs F, the F-Contraction problem takes as an input a graph G and an integer k, and the goal is to decide if there exists S \subseteq E(G) of size at most k such that G/S belongs to F.
Agrawal, Akanksha +2 more
core +1 more source
Searching and Indexing Genomic Databases via Kernelization
Frontiers in Bioengineering and Biotechnology, 2015 The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes.
Travis eGagie, Simon ePuglisi
doaj +1 more source
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters [PDF]
, 2023 We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters.
Pilipczuk, Michał +2 more
core
Parameterized Complexity of Directed Spanner Problems. [PDF]
Algorithmica, 2022 Fomin FV +5 more
europepmc +1 more source
Crossing Numbers and Parameterized Complexity [PDF]
, 2008 The odd crossing number of G is the smallest number of pairs of edges that cross an odd number of times in any drawing of G. We show that there always is a drawing realizing the odd crossing number of G that uses at most 9k crossings, where k is the odd crossing number of G.
Michael J. Pelsmajer +2 more
openaire +1 more source
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan. [PDF]
Algorithmica, 2022 Nederlof J, Swennenhuis CMF.
europepmc +1 more source
The Parameterized Complexity of Degree Constrained Editing Problems [PDF]
, 2009 This thesis examines degree constrained editing problems within the framework of parameterized complexity. A degree constrained editing problem takes as input a graph and a set of constraints and asks whether the graph can be altered in at most k editing
MATHIESON, LUKE
core
Algorithms for Molecular BiologyInverse folding is a classic instance of negative RNA design which consists in finding a sequence that uniquely folds into a target secondary structure with respect to energy minimization. A breakthrough result of Bonnet et al. shows that, even in simple
Théo Boury +3 more
doaj +1 more source
Streaming Deletion Problems Parameterized by Vertex Cover [PDF]
, 2021 Streaming is a model where an input graph is provided one edge at a time, instead of being able to inspect it at will. In this work, we take a parameterized approach by assuming a vertex cover of the graph is given, building on work of Bishnu et al ...
Oostveen, Jelle, van Leeuwen, Erik Jan
core