Suchergebnisse - Fixed-parameter algorithms AND complexity~

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases von Weller, Mathias, Chateau, Annie, Dallard, Clément, Giroudeau, Rodolphe

“… This paper is devoted to new results about the scaffolding problem, an integral problem of genome inference in bioinformatics. The problem consists in finding …”
Volltext

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials von Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.

“… These polynomials have received a lot of attention recently for their crucial role in several new algorithms for counting and detecting graph patterns, and also for obtaining natural polynomial …”
Volltext

Fixed-Parameter Complexity of Minimum Profile Problems: Parameterized and Exact Algorithms von GUTIN, Gregory, SZEIDER, Stefan, YEO, Anders

Volltext

Reconciling multiple genes trees via segmental duplications and losses von Dondi, Riccardo, Lafond, Manuel, Scornavacca, Celine

“… , even when λ = 0 and a single gene tree is given, solving a long standing open problem on the complexity of multi-gene reconciliation …”
Volltext

Scheduling and fixed-parameter tractability von Mnich, Matthias, Wiese, Andreas

“… However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems …”
Volltext

Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane von Cambazard, Hadrien, Catusse, Nicolas

“… •A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem …”
Volltext

Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees von Stolzer, Maureen, Lai, Han, Xu, Minli, Sathaye, Deepa, Vernot, Benjamin, Durand, Dannie

“… , a process called reconciliation, yet current reconciliation algorithms model only a subset of these evolutionary processes. Results …”
Volltext

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable von Szeider, Stefan

“… (Parameterized Complexity, 1999). Our algorithm gives rise to a fixed-parameter tractable parameterization of the satisfiability problem …”
Volltext

Parameterized complexity of machine scheduling: 15 open problems von Mnich, Matthias, van Bevern, René

“… A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions …”
Volltext

On the Complexity of Some Geometric Problems With Fixed Parameters von Schaefer, Marcus

“… The following graph-drawing problems are known to be complete for the existential theory of the reals (${\exists \mathbb{R}}$-complete) as long as the …”
Volltext

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy von Mnich, Matthias, Schlotter, Ildikó

“… ; most such problems are NP -hard and also hard to approximate (Hamada et al. in Algorithmica 74(1):440–465, 2016). We therefore consider stable matching problems with lower quotas under a relaxed notion of tractability, namely fixed-parameter tractability …”
Volltext

Randomized Fixed-Parameter Algorithms for the Closest String Problem von Chen, Zhi-Zhong, Ma, Bin, Wang, Lusheng

“… s i . The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms …”
Volltext

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion von Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter

“… The complexity of the problem, when parameterized by solution size (i.e., size of the deletion set …”
Volltext

The constrained shortest common supersequence problem von Dondi, Riccardo

“… Finally, we investigate the parameterized complexity of the problem, and we present a fixed-parameter algorithm …”
Volltext

Fixed-parameter algorithms for protein similarity search under mRNA structure constraints von Blin, Guillaume, Fertin, Guillaume, Hermelin, Danny, Vialette, Stéphane

“… In this paper we propose three fixed-parameter algorithms that apply for several interesting parameters of MRSO …”
Volltext

Parameterized complexity of coverage in multi-interface IoT networks: Pathwidth von Aloisio, Alessandro, Navarra, Alfredo

“… The Internet of Things (IoT) has emerged as one of the growing fields in digital technology over the past decade. A primary goal of IoT is to connect physical …”
Volltext

Recognizing Map Graphs of Bounded Treewidth von Angelini, Patrizio, Bekos, Michael A., Da Lozzo, Giordano, Gronemann, Martin, Montecchiani, Fabrizio, Tappini, Alessandra

“… We present a fixed-parameter tractable algorithm for recognizing map graphs parameterized by treewidth …”
Volltext

The Authorization Policy Existence Problem von Berge, Pierre, Crampton, Jason, Gutin, Gregory, Watrigant, Remi

“… Constraints such as separation-of-duty are widely used to specify requirements that supplement basic authorization policies. However, the existence of …”
Volltext

Parameterized complexity analysis for the Closest String with Wildcards problem von Hermelin, Danny, Rozenberg, Liat

“… Our study determines for each natural parameterization whether this parameterization yields a fixed-parameter algorithm, or whether such an algorithm is highly unlikely to exist …”
Volltext

New results on maximum induced matchings in bipartite graphs and beyond von Dabrowski, Konrad K., Demange, Marc, Lozin, Vadim V.

“… In this paper, we reveal several classes of bipartite (and more general) graphs for which the problem admits fixed-parameter tractable algorithms …”
Volltext