Results 51 to 60 of about 23,779 (205)
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
, 2021 This report documents the program and the outcomes of Dagstuhl Seminar 21293 "Parameterized Complexity in Graph Drawing". The seminar was held mostly in-person from July 18 to July 23, 2021.
Ganian, Robert +3 more
core +1 more source
Parameterized Complexity of Superstring Problems [PDF]
Algorithmica, 2015 In the Shortest Superstring problem we are given a set of strings $S=\{s_1, \ldots, s_n\}$ and integer $\ell$ and the question is to decide whether there is a superstring $s$ of length at most $\ell$ containing all strings of $S$ as substrings. We obtain several parameterized algorithms and complexity results for this problem. In particular, we give an
Ivan Bliznets +5 more
openaire +2 more sources
The Burning Number of Directed Graphs: Bounds and Computational Complexity
Theory and Applications of Graphs, 2020 The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalizes naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs,
Remie Janssen
doaj +1 more source
On the Parameterized Complexity of Polytree Learning [PDF]
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021 A Bayesian network is a directed acyclic graph that represents statistical dependencies between variables of a joint probability distribution. A fundamental task in data science is to learn a Bayesian network from observed data. Polytree Learning is the problem of learning an optimal Bayesian network that fulfills the additional property that its ...
Niels Grüttemeier +2 more
openaire +2 more sources
On the parameterized complexity of computing tree-partitions
, 2022 We study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Bodlaender, Hans L. +2 more
core +1 more source
Treewidth-based algorithms for the small parsimony problem on networks
Algorithms for Molecular Biology, 2022 Background Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the Small Parsimony problem: given a tree T and an assignment of character-states
Celine Scornavacca, Mathias Weller
doaj +1 more source
Relativization and interactive proof systems in Parameterized Complexity theory [PDF]
, 2017 We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized complexity classes ...
Bottesch, Ralph, Bottesch, R.C. (Ralph)
core +1 more source
Parameterized Complexity of a Parallel Machine Scheduling Problem [PDF]
, 2022 In this paper we consider the parameterized complexity of two versions of a parallel machine scheduling problem with precedence delays, unit processing times and time windows.
Munier-Kordon, Alix +2 more
core +1 more source
Parameterized Complexity of Graph Burning
Algorithmica, 2022 AbstractGraph Burning asks, given a graph $$G = (V,E)$$ G = ( V , E ) and an integer k, whether there exists $$(b_{0},\dots ,b_{k-1}) \in V^{k}$$
Yasuaki Kobayashi, Yota Otachi
openaire +5 more sources
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Algorithms, 2019 Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj +1 more source