Image de couverture de livre

Stability in Graphs with Matroid Constraints

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fomin, Fedor V., Golovach, Petr A., Korhonen, Tuukka, Saurabh, Saket
Format:	Preprint
Publié:	2024
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

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

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

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
par: Fomin, Fedor V., et autres
Publié: (2026)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
par: Bentert, Matthias, et autres
Publié: (2025)

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

When does FTP become FPT?
par: Bentert, Matthias, et autres
Publié: (2025)

Edge Clique Partition and Cover Beyond Independence
par: Fomin, Fedor V., et autres
Publié: (2025)

The Parameterized Complexity Landscape of Two-Sets Cut-Uncut
par: Bentert, Matthias, et autres
Publié: (2024)

H-Planarity and Parametric Extensions: when Modulators Act Globally
par: Fomin, Fedor V., et autres
Publié: (2025)

Path Contraction Faster than $2^n$
par: Agrawal, Akanksha, et autres
Publié: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

Fixed-Parameter Tractability of Hedge Cut
par: Fomin, Fedor V., et autres
Publié: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
par: Korhonen, Tuukka, et autres
Publié: (2024)

Parameterized Saga of First-Fit and Last-Fit Coloring
par: Agrawal, Akanksha, et autres
Publié: (2024)

Approximating Submodular Matroid-Constrained Partitioning
par: Bérczi, Kristóf, et autres
Publié: (2025)

A Tale of Santa Claus, Hypergraphs and Matroids
par: Davies, Sami, et autres
Publié: (2018)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
par: Jana, Satyabrata, et autres
Publié: (2025)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Computing Tree Decompositions with Small Independence Number
par: Dallard, Clément, et autres
Publié: (2022)

Packing Short Cycles
par: Bentert, Matthias, et autres
Publié: (2024)

Problems on Group-labeled Matroid Bases
par: Hörsch, Florian, et autres
Publié: (2024)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Approximation of Spanning Tree Congestion using Hereditary Bisection
par: Kolman, Petr
Publié: (2024)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2023)

Fractional Linear Matroid Matching is in quasi-NC
par: Gurjar, Rohit, et autres
Publié: (2024)

On the Structural Parameterizations of 2-Club with Triangle Constraints
par: Jacob, Ashwin, et autres
Publié: (2025)

A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
par: Bentert, Matthias, et autres
Publié: (2026)

Online Graph Coloring for $k$-Colorable Graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2025)

Hybrid k-Clustering: Blending k-Median and k-Center
par: Fomin, Fedor V., et autres
Publié: (2024)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
par: Fomin, Fedor V., et autres
Publié: (2025)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
par: Klimm, Max, et autres
Publié: (2022)

On the Congruency-Constrained Matroid Base
par: Liu, Siyue, et autres
Publié: (2023)

Graph Visualization for Blockchain Data
par: Dietl, Marcell, et autres
Publié: (2024)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

Temporal Graph Realization With Bounded Stretch
par: Mertzios, George B., et autres
Publié: (2025)

Triangle Detection in H-Free Graphs
par: Abboud, Amir, et autres
Publié: (2025)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

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)