Image de couverture de livre

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jones, Mark, Schestag, Jannik
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
par: van Iersel, Leo, et autres
Publié: (2026)

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
par: Holtgrefe, Niels, et autres
Publié: (2026)

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
par: Holtgrefe, Niels, et autres
Publié: (2026)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
par: Komusiewicz, Christian, et autres
Publié: (2023)

Parameterized Shortest Path Reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2024)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
par: van Iersel, Leo, et autres
Publié: (2026)

Isomorphism Testing Parameterized by Genus and Beyond
par: Neuen, Daniel
Publié: (2021)

Fourier Analysis of Iterative Algorithms
par: Jones, Chris, et autres
Publié: (2024)

A Note on Generic Tangle Algorithms
par: Elbracht, Christian, et autres
Publié: (2020)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
par: Madani, Amirali, et autres
Publié: (2025)

Complexity and Algorithm for the Matching vertex-cutset Problem
par: Li, Hengzhe, et autres
Publié: (2025)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
par: Haviv, Ishay
Publié: (2022)

Algorithmic study on liar's vertex-edge domination problem
par: Bhattacharya, Debojyoti, et autres
Publié: (2023)

A Lower Bound for the Max Entropy Algorithm for TSP
par: Jin, Billy, et autres
Publié: (2023)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
par: Bai, Yuhang, et autres
Publié: (2026)

A Faster Deterministic Approximation Algorithm for TTP-2
par: Kanaya, Yuga, et autres
Publié: (2023)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Approximation and FPT Algorithms for Finding DM-Irreducible Spanning Subgraphs
par: Norose, Ryoma, et autres
Publié: (2024)

A Strongly Subcubic Combinatorial Algorithm for Triangle Detection with Applications
par: Dumitrescu, Adrian
Publié: (2024)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
par: Murakami, Hitoshi, et autres
Publié: (2024)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
par: Dhawan, Abhishek
Publié: (2024)

A Linear-Time Algorithm for Finding an Odd Cycle Through Two Specified Vertices
par: Kano, Takumi, et autres
Publié: (2026)

Linear-Time Algorithms for k-Edge-Connected Components, k-Lean Tree Decompositions, and More
par: Korhonen, Tuukka
Publié: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
par: Cabello, Sergio, et autres
Publié: (2025)

Stable Approximation Algorithms for Dominating Set and Independent Set
par: de Berg, Mark, et autres
Publié: (2024)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
par: Holtgrefe, Niels, et autres
Publié: (2024)

Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
par: Cheng, Christine T., et autres
Publié: (2026)

Analysis of a Random Local Search Algorithm for Dominating Set
par: Higl, Hendrik
Publié: (2026)

Reconstructing semi-directed level-1 networks using few quarnets
par: Frohn, Martin, et autres
Publié: (2024)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
par: Huber, Katharina T., et autres
Publié: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
par: Ashok, Pradeesha, et autres
Publié: (2024)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
par: Scheffler, Robert
Publié: (2025)

A Uniformly Random Solution to Algorithmic Redistricting
par: Cai, Jin-Yi, et autres
Publié: (2024)

Testing H-freeness on sparse graphs, the case of bounded expansion
par: Humeau, Samuel, et autres
Publié: (2025)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
par: Karamchedu, Mithra, et autres
Publié: (2025)

Liar's vertex-edge domination in unit disk graph
par: Bhattacharya, Debojyoti, et autres
Publié: (2025)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)