Copertina

Tree Containment Parameterized by Scanwidth

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	van Iersel, Leo, Jones, Mark, Weller, Mathias
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Computational Complexity Populations and Evolution 68W05 F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fast FPT Algorithms for Grundy Number on Dense Graphs
di: Nezhad, Sina Ghasemi, et al.
Pubblicazione: (2024)

Minimum-cost paths for electric cars
di: Dorfman, Dani, et al.
Pubblicazione: (2024)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
di: Bruchhold, Sebastian, et al.
Pubblicazione: (2025)

The Li-Chao Tree: Algorithm Specification and Analysis
di: Li, Chao
Pubblicazione: (2026)

Maximizing Diversity in (near-)Median String Selection
di: Chakraborty, Diptarka, et al.
Pubblicazione: (2026)

String 2-Covers with No Length Restrictions
di: Boneh, Itai, et al.
Pubblicazione: (2024)

Hairpin Completion Distance Lower Bound
di: Boneh, Itai, et al.
Pubblicazione: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
di: An, Hyung-Chan, et al.
Pubblicazione: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
di: Filmus, Yuval, et al.
Pubblicazione: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
di: Crochemore, Maxime, et al.
Pubblicazione: (2025)

PPSZ is better than you think
di: Scheder, Dominik
Pubblicazione: (2022)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
di: van Iersel, Leo, et al.
Pubblicazione: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
di: Sopp, Braeden, et al.
Pubblicazione: (2026)

Ordered Leaf Attachment (OLA) Vectors can Identify Reticulation Events even in Multifurcated Trees
di: Markin, Alexey, et al.
Pubblicazione: (2025)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
di: Krithika, R., et al.
Pubblicazione: (2023)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
di: Dvořák, Pavel, et al.
Pubblicazione: (2017)

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection
di: Liyanage, Adiesha, et al.
Pubblicazione: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
di: Bougeret, Marin, et al.
Pubblicazione: (2024)

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

Reconstructing semi-directed level-1 networks using few quarnets
di: Frohn, Martin, et al.
Pubblicazione: (2024)

Exact Algorithms for MaxCut on Split Graphs
di: Lalovic, Marko
Pubblicazione: (2024)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
di: Jansen, Klaus, et al.
Pubblicazione: (2024)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
di: Krishnaswamy, Ravishankar, et al.
Pubblicazione: (2014)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
di: Huber, Katharina T., et al.
Pubblicazione: (2024)

On the existence of funneled orientations for classes of rooted phylogenetic networks
di: Döcker, Janosch, et al.
Pubblicazione: (2024)

Optimal non-adaptive algorithm for edge estimation
di: Bishnu, Arijit, et al.
Pubblicazione: (2025)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
di: Shigemizu, Mika, et al.
Pubblicazione: (2018)

Large cliques and large independent sets: can they coexist?
di: Feige, Uriel, et al.
Pubblicazione: (2025)

Fairness in the k-Server Problem
di: Daneshvaramoli, Mohammadreza, et al.
Pubblicazione: (2025)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
di: Sun, Hao
Pubblicazione: (2023)

Set Parameterized Matching via Multi-Layer Hashing
di: Lewenstein, Moshe, et al.
Pubblicazione: (2026)

The Distributional Tail of Worst-Case Quickselect
di: Płecha, Witold
Pubblicazione: (2026)

Online coloring of short interval graphs and two-count interval graphs
di: Curbelo, Israel R.
Pubblicazione: (2024)

Spanning Trees Minimizing Branching Costs
di: Gargano, Luisa, et al.
Pubblicazione: (2024)

Shortest two disjoint paths in conservative graphs
di: Schlotter, Ildikó
Pubblicazione: (2023)

An Efficient Algorithm for Unbalanced 1D Transportation
di: Gouvine, Gabriel
Pubblicazione: (2023)

Dynamic Traffic Assignment for Public Transport with Vehicle Capacities
di: Patzner, Julian, et al.
Pubblicazione: (2024)

Efficient Binary Decision Diagram Manipulation in External Memory
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2021)