Imagen de Portada

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Holtgrefe, Niels, Schestag, Jannik, Zeh, Norbert
Formato:	Preprint
Publicado:	2026
Materias:	Computational Complexity Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
por: Holtgrefe, Niels, et al.
Publicado: (2026)

Parameterized Algorithms for Diversity of Networks with Ecological Dependencies
por: Jones, Mark, et al.
Publicado: (2025)

Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
por: van Iersel, Leo, et al.
Publicado: (2026)

Hardness Results on Characteristics for Elastic-Degenerated Strings
por: Köppl, Dominik, et al.
Publicado: (2024)

Finding Maximum Common Contractions Between Phylogenetic Networks
por: Marchand, Bertrand, et al.
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Kernelization Bounds for Constrained Coloring
por: Haviv, Ishay
Publicado: (2026)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
por: Grüttemeier, Niels, et al.
Publicado: (2025)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
por: Komusiewicz, Christian, et al.
Publicado: (2023)

The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth
por: Schestag, Jannik, et al.
Publicado: (2026)

A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth
por: Greilhuber, Jakob, et al.
Publicado: (2026)

Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
por: Focke, Jacob, et al.
Publicado: (2023)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
por: Balzereit, Kaja, et al.
Publicado: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
por: Austrin, Per, et al.
Publicado: (2024)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
por: de Berg, Mark, et al.
Publicado: (2025)

Kernelization Complexity of Solution Discovery Problems
por: Grobler, Mario, et al.
Publicado: (2024)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
por: Maalouly, Nicolas El, et al.
Publicado: (2025)

Some Applications and Limitations of Convex Optimization Hierarchies for Discrete and Continuous Optimization Problems
por: Ghosh, Mrinalkanti
Publicado: (2025)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
por: Buhrman, Harry, et al.
Publicado: (2025)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
por: Hamm, Thekla, et al.
Publicado: (2026)

Positive bias makes tensor-network contraction tractable
por: Jiang, Jiaqing, et al.
Publicado: (2024)

Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
por: Braida, Arthur, et al.
Publicado: (2024)

Neighborhood-Aware Graph Labeling Problem
por: Shahverdikondori, Mohammad, et al.
Publicado: (2026)

Lazy Kronecker Product
por: Song, Zhao
Publicado: (2026)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
por: Nederlof, Jesper
Publicado: (2026)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
por: Jiang, Cheng, et al.
Publicado: (2026)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
por: Ducoffe, Guillaume
Publicado: (2026)

Automated Lower Bounds for Small Matrix Multiplication Complexity over Finite Fields
por: Wang, Chengu
Publicado: (2026)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
por: Asadi, Vahid R., et al.
Publicado: (2026)

NP-Hardness and a PTAS for the Pinwheel Problem
por: Kleinberg, Robert, et al.
Publicado: (2026)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
por: Bodlaender, Hans L., et al.
Publicado: (2026)

Online Orthogonal Vectors Revisited
por: Gajulapalli, Karthik, et al.
Publicado: (2026)

Characterizing Streaming Decidability of CSPs via Non-Redundancy
por: Sharma, Amatya, et al.
Publicado: (2026)

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points
por: Chen, Xi, et al.
Publicado: (2026)

Sublinear-query relative-error testing of halfspaces
por: Chen, Xi, et al.
Publicado: (2026)

Quadratic Speedup for Computing Contraction Fixed Points
por: Chen, Xi, et al.
Publicado: (2026)

A Space-space Trade-off for Directed st-Connectivity
por: Edenhofer, Roman
Publicado: (2026)

Asymptotic Rank Speedup Theorems, Revisited
por: Alman, Josh, et al.
Publicado: (2026)

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
por: Ganian, Robert, et al.
Publicado: (2026)