Layer-Based Width for PAFP
Fuente:
arXiv
Saved in:
| Main Author: | German, Samuel |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
by: Arhire, Andrei, et al.
Published: (2025)
by: Arhire, Andrei, et al.
Published: (2025)
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
by: German, Samuel
Published: (2026)
by: German, Samuel
Published: (2026)
Isomorphism for Tournaments of Small Twin Width
by: Grohe, Martin, et al.
Published: (2023)
by: Grohe, Martin, et al.
Published: (2023)
Variants of Merge-Width and Applications
by: Drabik, Karolina, et al.
Published: (2026)
by: Drabik, Karolina, et al.
Published: (2026)
Cuts and Gauges for Submodular Width
by: Lanzinger, Matthias
Published: (2026)
by: Lanzinger, Matthias
Published: (2026)
Bounding Width on Graph Classes of Constant Diameter
by: Dabrowski, Konrad K., et al.
Published: (2025)
by: Dabrowski, Konrad K., et al.
Published: (2025)
Simultaneous Drawing of Layered Trees
by: Katheder, Julia, et al.
Published: (2023)
by: Katheder, Julia, et al.
Published: (2023)
Fault-Tolerant Matroid Bases
by: Bentert, Matthias, et al.
Published: (2025)
by: Bentert, Matthias, et al.
Published: (2025)
Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
by: Gutekunst, Samuel C.
Published: (2025)
by: Gutekunst, Samuel C.
Published: (2025)
Solving Problems on Generalized Convex Graphs via Mim-Width
by: Bonomo-Braberman, Flavia, et al.
Published: (2020)
by: Bonomo-Braberman, Flavia, et al.
Published: (2020)
A Graph Width Perspective on Partially Ordered Hamiltonian Paths
by: Beisegel, Jesse, et al.
Published: (2025)
by: Beisegel, Jesse, et al.
Published: (2025)
Solving Partial Dominating Set and Related Problems Using Twin-Width
by: Balabán, Jakub, et al.
Published: (2025)
by: Balabán, Jakub, et al.
Published: (2025)
The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
by: Beisegel, Jesse, et al.
Published: (2024)
by: Beisegel, Jesse, et al.
Published: (2024)
Fast Makespan Minimization via Short ILPs
by: Hermelin, Danny, et al.
Published: (2026)
by: Hermelin, Danny, et al.
Published: (2026)
A Unified Approach to Minimizing Symmetric Submodular Functions
by: Iwata, Satoru, et al.
Published: (2026)
by: Iwata, Satoru, et al.
Published: (2026)
Online Graph Balancing and the Power of Two Choices
by: Bansal, Nikhil, et al.
Published: (2026)
by: Bansal, Nikhil, et al.
Published: (2026)
Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)
by: Bals, Ben, et al.
Published: (2026)
Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
by: Komusiewicz, Christian, et al.
Published: (2026)
by: Komusiewicz, Christian, et al.
Published: (2026)
Minimum Sum Set Cover: Structures and Algorithm
by: Zhang, Zhongyi, et al.
Published: (2026)
by: Zhang, Zhongyi, et al.
Published: (2026)
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
by: Abbasi, Ali, et al.
Published: (2026)
by: Abbasi, Ali, et al.
Published: (2026)
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
by: Foucaud, Florent, et al.
Published: (2026)
by: Foucaud, Florent, et al.
Published: (2026)
Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
by: Rosenke, Christian, et al.
Published: (2026)
by: Rosenke, Christian, et al.
Published: (2026)
Node-Weighted Triangles: Faster and Simpler
by: Akmal, Shyan, et al.
Published: (2026)
by: Akmal, Shyan, et al.
Published: (2026)
Terminal Steiner tree problem : Complexity and Algorithms
by: S, Jyothish, et al.
Published: (2026)
by: S, Jyothish, et al.
Published: (2026)
Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
by: Dutta, Kunal, et al.
Published: (2026)
by: Dutta, Kunal, et al.
Published: (2026)
Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
by: Dahan, Anatole, et al.
Published: (2026)
by: Dahan, Anatole, et al.
Published: (2026)
All ascents exponential from valued constraint graphs of pathwidth three
by: Kaznatcheev, Artem, et al.
Published: (2026)
by: Kaznatcheev, Artem, et al.
Published: (2026)
An $Ω(n \log n)$ Randomized Lower Bound for Cutting a Cake into Proportionally Fair Pieces
by: Arndt, Stephen, et al.
Published: (2026)
by: Arndt, Stephen, et al.
Published: (2026)
Polynomial Kernels for Spanning Tree with Diversity Requirements
by: Golovach, Petr A., et al.
Published: (2026)
by: Golovach, Petr A., et al.
Published: (2026)
Placing Green Bridges Optimally for Robust Habitat Reconnection
by: Ellmies, Gero, et al.
Published: (2026)
by: Ellmies, Gero, et al.
Published: (2026)
FO and MSO Model Checking on Temporal Graphs
by: Döring, Michelle, et al.
Published: (2026)
by: Döring, Michelle, et al.
Published: (2026)
DRESS and the WL Hierarchy: Climbing One Deletion at a Time
by: Velilla, Eduar Castrillo
Published: (2026)
by: Velilla, Eduar Castrillo
Published: (2026)
Markovian protocols and an upper bound on the extension complexity of the matching polytope
by: Szusterman, M.
Published: (2026)
by: Szusterman, M.
Published: (2026)
Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
by: Marx, Dániel, et al.
Published: (2026)
by: Marx, Dániel, et al.
Published: (2026)
Adversarial Configurations for the ReCom Transition Function
by: Gold, Micah
Published: (2026)
by: Gold, Micah
Published: (2026)
Constant delay Gray code enumeration of ideals and antichains in posets
by: Brenner, Sofia, et al.
Published: (2026)
by: Brenner, Sofia, et al.
Published: (2026)
A column generation algorithm for finding co-3-plexes in chordal graphs
by: Dupont-Bouillard, Alexandre
Published: (2026)
by: Dupont-Bouillard, Alexandre
Published: (2026)
Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
by: Bentert, Matthias, et al.
Published: (2026)
by: Bentert, Matthias, et al.
Published: (2026)
String Matching with a Dynamic Pattern
by: Monteiro, Bruno, et al.
Published: (2025)
by: Monteiro, Bruno, et al.
Published: (2025)
Tight Localizations of Feedback Sets
by: Hecht, Michael, et al.
Published: (2020)
by: Hecht, Michael, et al.
Published: (2020)
Similar Items
-
UAIC_Twin_Width: An Exact yet Efficient Twin-Width Algorithm
by: Arhire, Andrei, et al.
Published: (2025) -
Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
by: German, Samuel
Published: (2026) -
Isomorphism for Tournaments of Small Twin Width
by: Grohe, Martin, et al.
Published: (2023) -
Variants of Merge-Width and Applications
by: Drabik, Karolina, et al.
Published: (2026) -
Cuts and Gauges for Submodular Width
by: Lanzinger, Matthias
Published: (2026)