Výsledky vyhledávání - "parameterized computational complexity"

Parameterized computational complexity of finding small-diameter subgraphs Autor Schäfer, Alexander, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf

“…Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first…”
Získat plný text

Parameterized computational complexity of control problems in voting systems Autor Liu, Hong, Feng, Haodi, Zhu, Daming, Luan, Junfeng

“…Voting systems are common tools in a variety of areas. This paper studies parameterized computational complexity of control of Plurality, Condorcet and Approval voting systems, respectively…”
Získat plný text

Parameterized computational complexity of Dodgson and Young elections Autor Betzler, Nadja, Guo, Jiong, Niedermeier, Rolf

“…We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a…”
Získat plný text

On coalitional manipulation for multiwinner elections: shortlisting Autor Bredereck, Robert, Kaczmarczyk, Andrzej, Niedermeier, Rolf

“…Shortlisting of candidates—selecting a group of “best” candidates—is a special case of multiwinner elections. We provide the first in-depth study of the…”
Získat plný text

A multivariate complexity analysis of the material consumption scheduling problem Autor Bentert, Matthias, Bredereck, Robert, Györgyi, Péter, Kaczmarczyk, Andrzej, Niedermeier, Rolf

“… We initiate a systematic exploration of the parameterized computational complexity landscape of Material Consumption Scheduling , providing parameterized tractability as well as intractability results…”
Získat plný text

A generalization of Nemhauser and Trotterʼs local optimization theorem Autor Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf

“…The Nemhauser–Trotter local optimization theorem applies to the NP-hard Vertex Cover problem and has applications in approximation as well as parameterized…”
Získat plný text

Assessing the computational complexity of multilayer subgraph detection Autor Bredereck, Robert, Komusiewicz, Christian, Kratsch, Stefan, Molter, Hendrik, Niedermeier, Rolf, Sorge, Manuel

“…Multilayer graphs consist of several graphs, called layers, where the vertex set of all layers is the same but each layer has an individual edge set. They are…”
Získat plný text

Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms Autor Wareham, Todd

“…A key challenge in robot swarm engineering is the design of individual robot controllers such that the robots as a group can perform a specified task. In this…”
Získat plný text

On tractable cases of Target Set Selection Autor Nichterlein, André, Niedermeier, Rolf, Uhlmann, Johannes, Weller, Mathias

“…We study the NP-hard Target Set Selection (TSS) problem occurring in social network analysis. Roughly speaking, given a graph where each vertex is associated…”
Získat plný text

Perfect Code is W[1]-complete Autor Cesati, Marco

“…We show that the parameterized problem Perfect Code belongs to W[1]. This result closes an old open question, because it was often conjectured that Perfect…”
Získat plný text

Parameterized Dynamic Cluster Editing Autor Luo, Junjie, Molter, Hendrik, Nichterlein, André, Niedermeier, Rolf

“…We introduce a dynamic version of the NP-hard graph modification problem Cluster Editing . The essential point here is to take into account dynamically…”
Získat plný text

Temporal graph realization from fastest paths Autor Klobas, Nina, Mertzios, George B., Molter, Hendrik, Spirakis, Paul G.

“…In this paper, we initiate the study of the temporal graph realization problem with respect to the fastest path durations among its vertices, while we focus on…”
Získat plný text

A refined complexity analysis of fair districting over graphs Autor Boehmer, Niclas, Koana, Tomohiro, Niedermeier, Rolf

“…We study the NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k  connected…”
Získat plný text

Prices matter for the parameterized complexity of shift bribery Autor Bredereck, Robert, Chen, Jiehua, Faliszewski, Piotr, Nichterlein, André, Niedermeier, Rolf

“… We study the parameterized computational complexity of Shift Bribery for a number of parameters and several classes of price functions…”
Získat plný text

Fine-grained view on bribery for group identification Autor Boehmer, Niclas, Bredereck, Robert, Knop, Dušan, Luo, Junjie

“…) setting, we provide a comprehensive picture of the parameterized computational complexity landscape…”
Získat plný text

The complexity of degree anonymization by vertex addition Autor Bredereck, Robert, Froese, Vincent, Hartung, Sepp, Nichterlein, André, Niedermeier, Rolf, Talmon, Nimrod

“… We explore three variants of vertex addition (justified by real-world considerations) and study their (parameterized) computational complexity…”
Získat plný text

Parameterized complexity of control problems in Maximin election Autor Liu, Hong, Zhu, Daming

“…Elections are a central model in a variety of areas. This paper studies parameterized computational complexity of five control problems in the Maximin election…”
Získat plný text

H-index manipulation by merging articles: Models, theory, and experiments Autor van Bevern, René, Komusiewicz, Christian, Niedermeier, Rolf, Sorge, Manuel, Walsh, Toby

“… The author is allowed to merge articles; this may affect the H-index. We analyze the (parameterized) computational complexity of maximizing the H-index using article merges…”
Získat plný text

Campaign Management Under Approval-Driven Voting Rules Autor Schlotter, Ildiko, Faliszewski, Piotr, Elkind, Edith

“… In this paper, we investigate both classic and parameterized computational complexity of electoral campaign management under such rules…”
Získat plný text

Multivariate algorithmics for eliminating envy by donating goods Autor Boehmer, Niclas, Bredereck, Robert, Heeger, Klaus, Knop, Dušan, Luo, Junjie

“…Fairly dividing a set of indivisible resources to a set of agents is of utmost importance in some applications. However, after an allocation has been…”
Získat plný text