Search Results - "Parameterized computational complexity"

  • Showing 1 - 7 results of 7
Refine Results
  1. 1
    Cover Image

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

    ISSN: 1387-2532, 1573-7454
    Published: New York Springer US 01.10.2021
    Published in Autonomous agents and multi-agent systems (01.10.2021)
    “…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…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

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

    ISSN: 1099-1425, 1094-6136, 1099-1425
    Published: New York, NY Springer US 01.08.2023
    Published in Journal of scheduling (01.08.2023)
    “…The NP-hard problem Material Consumption Scheduling and related problems have been thoroughly studied since the 1980's. Roughly speaking, the problem deals…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

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

    ISSN: 0022-0000, 1090-2724
    Published: Elsevier Inc 01.11.2011
    Published in Journal of computer and system sciences (01.11.2011)
    “…The Nemhauser–Trotter local optimization theorem applies to the NP-hard Vertex Cover problem and has applications in approximation as well as parameterized…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    Cover Image

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

    ISSN: 2050-1242, 2050-1250
    Published: New York, USA Cambridge University Press 01.06.2019
    “…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…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  5. 5
    Cover Image

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

    ISSN: 2034-8800
    Published: Ghent European Alliance for Innovation (EAI) 01.12.2016
    Published in EAI endorsed transactions on serious games (01.12.2016)
    “…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…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  6. 6
    Cover Image

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

    ISSN: 1869-5450, 1869-5469
    Published: Vienna Springer Vienna 01.06.2013
    Published in Social network analysis and mining (01.06.2013)
    “…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…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  7. 7
    Cover Image

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

    ISSN: 0020-0190, 1872-6119
    Published: Amsterdam Elsevier B.V 14.02.2002
    Published in Information processing letters (14.02.2002)
    “…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…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: