Image de couverture de livre

Grouped Color Deletion, Lasserre Exactness and Clique-Sum Locality for Rainbow Matching

Fuente: arXiv

Enregistré dans:

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

Documents similaires

Quadratic Kernel for Cliques or Trees Vertex Deletion
par: Kumabe, Soh
Publié: (2025)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
par: Xu, Xiaojia, et autres
Publié: (2024)

Exact Clique Number Manipulation via Edge Interdiction
par: Zhou, Yi, et autres
Publié: (2026)

KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
par: Jin, Mingming, et autres
Publié: (2023)

Optimal (degree+1)-Coloring in Congested Clique
par: Coy, Sam, et autres
Publié: (2023)

Locally Rainbow Paths
par: Fluschnik, Till, et autres
Publié: (2024)

Streaming Maximal Matching with Bounded Deletions
par: Khanna, Sanjeev, et autres
Publié: (2025)

Algorithms and Complexity of Hedge Cluster Deletion Problems
par: Konstantinidis, Athanasios L., et autres
Publié: (2025)

Product-State Approximation Algorithms for the Transverse Field Ising Model
par: Lipardi, Vincenzo, et autres
Publié: (2026)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
par: Dalirrooyfard, Mina, et autres
Publié: (2023)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
par: Pilipczuk, Michał, et autres
Publié: (2025)

Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs
par: Ito, Takehiro, et autres
Publié: (2025)

Faster Combinatorial k-Clique Algorithms
par: Abboud, Amir, et autres
Publié: (2024)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
par: Jacob, Ashwin, et autres
Publié: (2024)

Semirandom Planted Clique and the Restricted Isometry Property
par: Błasiok, Jarosław, et autres
Publié: (2024)

Learning Minimum Linear Arrangement of Cliques and Lines
par: Dallot, Julien, et autres
Publié: (2024)

Dynamic Maximal Matching in Clique Networks
par: Li, Minming, et autres
Publié: (2024)

Advances in Exact and Approximate Group Closeness Centrality Maximization
par: Schulz, Christian, et autres
Publié: (2026)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
par: Göbel, Andreas, et autres
Publié: (2025)

Minor Containment and Disjoint Paths in almost-linear time
par: Korhonen, Tuukka, et autres
Publié: (2024)

How to Find Long Maximal Exact Matches and Ignore Short Ones
par: Gagie, Travis
Publié: (2024)

Pathfinding in Self-Deleting Graphs
par: Dvořák, Michal, et autres
Publié: (2025)

A Reduction-based Algorithm for the Clique Interdiction Problem
par: Zhu, Chenghao, et autres
Publié: (2025)

Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions
par: Horowicz, Noam, et autres
Publié: (2025)

Adversarial Robustness on Insertion-Deletion Streams
par: Gribelyuk, Elena, et autres
Publié: (2026)

Cluster Vertex Deletion on Chordal Graphs
par: Cao, Yixin, et autres
Publié: (2026)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
par: Baguley, Samuel, et autres
Publié: (2024)

Snakes and Ladders: a Treewidth Story
par: Chaplick, Steven, et autres
Publié: (2023)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
par: El-Hayek, Antoine, et autres
Publié: (2023)

When MIS and Maximal Matching are Easy in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Exact Algorithms for Edge Deletion to Cactus
par: Akhtar, Sheikh Shakil, et autres
Publié: (2026)

Faster diameter computation in graphs of bounded Euler genus
par: Kluk, Kacper, et autres
Publié: (2025)

On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

A Randomized Rounding Approach for DAG Edge Deletion
par: Kalantarzadeh, Sina, et autres
Publié: (2025)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
par: Goldmann, Lito, et autres
Publié: (2023)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
par: Blažej, Václav, et autres
Publié: (2024)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
par: Murakami, Hitoshi, et autres
Publié: (2024)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
par: Wlodarczyk, Michal
Publié: (2023)

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2023)

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
par: Houari-Durand, Séhane Bel, et autres
Publié: (2025)