Search Results - Fixed-parameter algorithms and complexity

Refine Results
  1. 1

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

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.09.2023
    Published in Algorithmica (01.09.2023)
    “… 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…”
    Get full text
    Journal Article
  2. 2

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

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.06.2018
    Published in Algorithmica (01.06.2018)
    “…This paper is devoted to new results about the scaffolding problem, an integral problem of genome inference in bioinformatics. The problem consists in finding…”
    Get full text
    Journal Article
  3. 3

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

    ISSN: 0025-5610, 1436-4646
    Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2015
    Published in Mathematical programming (01.12.2015)
    “… However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems…”
    Get full text
    Journal Article
  4. 4
  5. 5

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

    ISSN: 0377-2217, 1872-6860
    Published: Elsevier B.V 16.10.2018
    Published in European journal of operational research (16.10.2018)
    “…•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem…”
    Get full text
    Journal Article
  6. 6

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

    ISSN: 1748-7188, 1748-7188
    Published: London BioMed Central 20.03.2019
    Published in Algorithms for molecular biology (20.03.2019)
    “…, even when λ = 0 and a single gene tree is given, solving a long standing open problem on the complexity of multi-gene reconciliation…”
    Get full text
    Journal Article
  7. 7

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

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.01.2016
    Published in Algorithmica (01.01.2016)
    “… s i . The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms…”
    Get full text
    Journal Article
  8. 8

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

    ISSN: 0022-0000, 1090-2724
    Published: Elsevier Inc 01.12.2004
    Published in Journal of computer and system sciences (01.12.2004)
    “… (Parameterized Complexity, 1999). Our algorithm gives rise to a fixed-parameter tractable parameterization of the satisfiability problem…”
    Get full text
    Journal Article
  9. 9

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

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.05.2020
    Published in Algorithmica (01.05.2020)
    “…; 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…”
    Get full text
    Journal Article
  10. 10

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

    ISSN: 1367-4803, 1367-4811, 1367-4811, 1460-2059
    Published: England Oxford University Press 15.09.2012
    Published in Bioinformatics (15.09.2012)
    “…, a process called reconciliation, yet current reconciliation algorithms model only a subset of these evolutionary processes. Results…”
    Get full text
    Journal Article
  11. 11

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

    ISSN: 2542-6605, 2542-6605
    Published: Elsevier B.V 01.12.2024
    Published in Internet of things (Amsterdam. Online) (01.12.2024)
    “…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…”
    Get full text
    Journal Article
  12. 12

    The "Art of Trellis Decoding" Is Fixed-Parameter Tractable by Jeong, Jisu, Kim, Eun Jung, Oum, Sang-il

    ISSN: 0018-9448, 1557-9654
    Published: New York IEEE 01.11.2017
    Published in IEEE transactions on information theory (01.11.2017)
    “… We present a fixed-parameter tractable algorithm to construct a linear layout of width at most k, if it exists, for input subspaces of a finite-dimensional vector space over F…”
    Get full text
    Journal Article
  13. 13

    The constrained shortest common supersequence problem by Dondi, Riccardo

    ISSN: 1570-8667, 1570-8675
    Published: Elsevier B.V 01.07.2013
    “… Finally, we investigate the parameterized complexity of the problem, and we present a fixed-parameter algorithm…”
    Get full text
    Journal Article
  14. 14

    Imbalance is fixed parameter tractable by Lokshtanov, Daniel, Misra, Neeldhara, Saurabh, Saket

    ISSN: 0020-0190, 1872-6119
    Published: Amsterdam Elsevier B.V 01.09.2013
    Published in Information processing letters (01.09.2013)
    “… We show that this problem is fixed parameter tractable and provide an algorithm that runs in time 2O(blogb)⋅nO(1…”
    Get full text
    Journal Article
  15. 15

    Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory by Baste, Julien, Fellows, Michael R., Jaffke, Lars, Masařík, Tomáš, de Oliveira Oliveira, Mateus, Philip, Geevarghese, Rosamond, Frances A.

    ISSN: 0004-3702, 1872-7921
    Published: Amsterdam Elsevier B.V 01.02.2022
    Published in Artificial intelligence (01.02.2022)
    “…•Parameterized analysis of a general notion of diversity of solutions that suits a large class of combinatorial problems.•Introduction of the notion of dynamic…”
    Get full text
    Journal Article
  16. 16

    Fixed-parameter algorithms for Fair Hitting Set problems by Inamdar, Tanmay, Kanesh, Lawqueen, Kundu, Madhumita, Purohit, Nidhi, Saurabh, Saket

    ISSN: 0890-5401
    Published: Elsevier Inc 01.01.2025
    Published in Information and computation (01.01.2025)
    “…Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic…”
    Get full text
    Journal Article
  17. 17

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

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Published: New York Elsevier Ltd 01.12.2018
    Published in Computers & operations research (01.12.2018)
    “… A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions…”
    Get full text
    Journal Article
  18. 18

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

    ISSN: 1570-8667, 1570-8675
    Published: Elsevier B.V 2008
    “… In this paper we propose three fixed-parameter algorithms that apply for several interesting parameters of MRSO…”
    Get full text
    Journal Article
  19. 19

    A faster fixed parameter algorithm for two-layer crossing minimization by Kobayashi, Yasuaki, Tamaki, Hisao

    ISSN: 0020-0190, 1872-6119
    Published: Amsterdam Elsevier B.V 01.09.2016
    Published in Information processing letters (01.09.2016)
    “…•We improve the running time of the previously known fixed parameter algorithm…”
    Get full text
    Journal Article
  20. 20

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

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.02.2024
    Published in Algorithmica (01.02.2024)
    “… We present a fixed-parameter tractable algorithm for recognizing map graphs parameterized by treewidth…”
    Get full text
    Journal Article