Image de couverture de livre

Layer-Based Width for PAFP

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	German, Samuel
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
par: Arhire, Andrei, et autres
Publié: (2025)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
par: German, Samuel
Publié: (2026)

Isomorphism for Tournaments of Small Twin Width
par: Grohe, Martin, et autres
Publié: (2023)

Variants of Merge-Width and Applications
par: Drabik, Karolina, et autres
Publié: (2026)

Cuts and Gauges for Submodular Width
par: Lanzinger, Matthias
Publié: (2026)

Bounding Width on Graph Classes of Constant Diameter
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Simultaneous Drawing of Layered Trees
par: Katheder, Julia, et autres
Publié: (2023)

Fault-Tolerant Matroid Bases
par: Bentert, Matthias, et autres
Publié: (2025)

Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
par: Gutekunst, Samuel C.
Publié: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
par: Bonomo-Braberman, Flavia, et autres
Publié: (2020)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
par: Beisegel, Jesse, et autres
Publié: (2025)

Solving Partial Dominating Set and Related Problems Using Twin-Width
par: Balabán, Jakub, et autres
Publié: (2025)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
par: Beisegel, Jesse, et autres
Publié: (2024)

Fast Makespan Minimization via Short ILPs
par: Hermelin, Danny, et autres
Publié: (2026)

A Unified Approach to Minimizing Symmetric Submodular Functions
par: Iwata, Satoru, et autres
Publié: (2026)

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

Optimal Enumeration of Eulerian Trails in Directed Graphs
par: Bals, Ben, et autres
Publié: (2026)

Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
par: Komusiewicz, Christian, et autres
Publié: (2026)

Minimum Sum Set Cover: Structures and Algorithm
par: Zhang, Zhongyi, et autres
Publié: (2026)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
par: Abbasi, Ali, et autres
Publié: (2026)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
par: Foucaud, Florent, et autres
Publié: (2026)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
par: Rosenke, Christian, et autres
Publié: (2026)

Node-Weighted Triangles: Faster and Simpler
par: Akmal, Shyan, et autres
Publié: (2026)

Terminal Steiner tree problem : Complexity and Algorithms
par: S, Jyothish, et autres
Publié: (2026)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
par: Dutta, Kunal, et autres
Publié: (2026)

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
par: Dahan, Anatole, et autres
Publié: (2026)

All ascents exponential from valued constraint graphs of pathwidth three
par: Kaznatcheev, Artem, et autres
Publié: (2026)

An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
par: Arndt, Stephen, et autres
Publié: (2026)

Polynomial Kernels for Spanning Tree with Diversity Requirements
par: Golovach, Petr A., et autres
Publié: (2026)

Placing Green Bridges Optimally for Robust Habitat Reconnection
par: Ellmies, Gero, et autres
Publié: (2026)

FO and MSO Model Checking on Temporal Graphs
par: Döring, Michelle, et autres
Publié: (2026)

DRESS and the WL Hierarchy: Climbing One Deletion at a Time
par: Velilla, Eduar Castrillo
Publié: (2026)

Markovian protocols and an upper bound on the extension complexity of the matching polytope
par: Szusterman, M.
Publié: (2026)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

Adversarial Configurations for the ReCom Transition Function
par: Gold, Micah
Publié: (2026)

Constant delay Gray code enumeration of ideals and antichains in posets
par: Brenner, Sofia, et autres
Publié: (2026)

A column generation algorithm for finding co-3-plexes in chordal graphs
par: Dupont-Bouillard, Alexandre
Publié: (2026)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
par: Bentert, Matthias, et autres
Publié: (2026)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

Tight Localizations of Feedback Sets
par: Hecht, Michael, et autres
Publié: (2020)