Image de couverture de livre

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Maalouly, Nicolas El, Lakis, Kostas
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Structural Parameterizations for Induced and Acyclic Matching
par: Lampis, Michael, et autres
Publié: (2025)

On Finding $\ell$-th Smallest Perfect Matchings
par: Maalouly, Nicolas El, et autres
Publié: (2025)

Bandwidth Parameterized by Cluster Vertex Deletion Number
par: Gima, Tatsuya, et autres
Publié: (2023)

The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth
par: Bodlaender, Hans L., et autres
Publié: (2026)

Bipartite Exact Matching in P
par: Du, Yuefeng
Publié: (2026)

On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
par: S., Karthik C., et autres
Publié: (2024)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

Bipartite Matching is in Catalytic Logspace
par: Agarwala, Aryan, et autres
Publié: (2025)

Matching and Edge Cover in Temporal Graphs
par: Cioni, Lapo, et autres
Publié: (2025)

The Fine-Grained Complexity of Episode Matching
par: Bille, Philip, et autres
Publié: (2021)

Near-Optimal Bounds for Parameterized Euclidean k-means
par: Cohen-Addad, Vincent, et autres
Publié: (2026)

Low-Sensitivity Matching via Sampling from Gibbs Distributions
par: Yoshida, Yuichi, et autres
Publié: (2025)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
par: Assadi, Sepehr, et autres
Publié: (2024)

Parameterized Shortest Path Reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

Knapsack on Graphs with Relaxed Neighborhood Constraints
par: Dey, Palash, et autres
Publié: (2025)

Neighborhood-Aware Graph Labeling Problem
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

Parameterized Restless Temporal Path
par: Cauvi, Justine, et autres
Publié: (2025)

Parameterized Vertex Integrity Revisited
par: Hanaka, Tesshu, et autres
Publié: (2024)

Parameterized complexity of reconfiguration of atoms
par: Cooper, Alexandre, et autres
Publié: (2021)

The Parameterized Landscape of Labeled Graph Contractions
par: Lafond, Manuel, et autres
Publié: (2025)

Parameterized Critical Node Cut Revisited
par: Knop, Dušan, et autres
Publié: (2025)

Parameterized Capacitated Vertex Cover Revisited
par: Lampis, Michael, et autres
Publié: (2026)

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

Parameterized Maximum Node-Disjoint Paths
par: Lampis, Michael, et autres
Publié: (2024)

Generalized Graph Packing Problems Parameterized by Treewidth
par: Esmer, Barış Can, et autres
Publié: (2025)

Parameterized Max Min Feedback Vertex Set
par: Lampis, Michael, et autres
Publié: (2023)

Parameterized Algorithms for Editing to Uniform Cluster Graph
par: Gaikwad, Ajinkya, et autres
Publié: (2024)

Structural Parameterizations for Two Bounded Degree Problems Revisited
par: Lampis, Michael, et autres
Publié: (2023)

Scalable Neighborhood Local Search for Single-Machine Scheduling with Family Setup Times
par: Balzereit, Kaja, et autres
Publié: (2024)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
par: Frei, Fabian, et autres
Publié: (2025)

Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
par: Pintér, József, et autres
Publié: (2026)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
par: Dey, Palash, et autres
Publié: (2026)

Exact Algorithms for Distance to Unique Vertex Cover
par: Fioravantes, Foivos, et autres
Publié: (2025)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
par: Grüttemeier, Niels, et autres
Publié: (2025)

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