Image de couverture de livre

Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lassota, Alexandra, Ligthart, Koen
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Solving 4-Block Integer Linear Programs Faster Using Affine Decompositions of the Right-Hand Sides
par: Lassota, Alexandra, et autres
Publié: (2026)

Tight Lower Bounds for Block-Structured Integer Programs
par: Hunkenschröder, Christoph, et autres
Publié: (2024)

Parameterized Complexity of Fair Many-to-One Matchings
par: Javadi, Ramin, et autres
Publié: (2024)

Computational Complexity and Integer Programming Formulation of the Oredango Puzzle
par: Takahata, Takuma, et autres
Publié: (2025)

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

Hadamard Row-Wise Generation Algorithm
par: Monroy, Brayan, et autres
Publié: (2024)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
par: Maalouly, Nicolas El, et autres
Publié: (2025)

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

Automatizing Software Cognitive Complexity Reduction through Integer Linear Programming
par: Saborido, Rubén, et autres
Publié: (2024)

Parameterized Complexity of the Star Decomposition Problem
par: Hajebi, Sahab, et autres
Publié: (2024)

The Parameterized Complexity of Coloring Mixed Graphs
par: Lauerbach, Antonio, et autres
Publié: (2026)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming
par: Rohwedder, Lars, et autres
Publié: (2024)

The Parameterized Complexity of Computing the Linear Vertex Arboricity
par: Erhardt, Alexander, et autres
Publié: (2025)

On the Parameterized Complexity of Semitotal Domination on Graph Classes
par: Retschmeier, Lukas
Publié: (2025)

Baby PIH: Parameterized Inapproximability of Min CSP
par: Guruswami, Venkatesan, et autres
Publié: (2023)

Parameterized Local Search for Max $c$-Cut
par: Garvardt, Jaroslav, et autres
Publié: (2024)

A Parameterized Study of Secluded Structures in Directed Graphs
par: Schmidt, Jonas, et autres
Publié: (2025)

Second-Order Parameterizations for the Complexity Theory of Integrable Functions
par: Bacho, Aras, et autres
Publié: (2025)

The Parameter Report: An Orientation Guide for Data-Driven Parameterization
par: Komusiewicz, Christian, et autres
Publié: (2025)

Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond
par: van Iersel, Leo, et autres
Publié: (2024)

Almost Polynomial Factor Inapproximability for Parameterized k-Clique
par: S., Karthik C., et autres
Publié: (2021)

A Parameterized-Complexity Framework for Finding Local Optima
par: Ganian, Robert, et autres
Publié: (2026)

The Parameterized Complexity of Geometric 1-Planarity
par: Firbas, Alexander
Publié: (2026)

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

$\#$W[1] = $\text{FPT}$: Fixed-Parameter Tractable Exact Algorithms for the $\#k$-Matching Problem
par: Yi, Yongming
Publié: (2026)

Assembly Addition Chains
par: Cronin, Leroy, et autres
Publié: (2025)

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
par: Lichter, Moritz, et autres
Publié: (2024)

Towards Parameterized Hardness on Maintaining Conjunctive Queries
par: Wang, Qichen
Publié: (2026)

Parameterized Complexity of Segment Routing
par: Bazgan, Cristina, et autres
Publié: (2025)

Integer Programming Using A Single Atom
par: Goswami, Kapil, et autres
Publié: (2024)

Maximizing Phylogenetic Diversity under Ecological Constraints: A Parameterized Complexity Study
par: Komusiewicz, Christian, et autres
Publié: (2024)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
par: Banik, Aritra, et autres
Publié: (2025)

Uniformity within Parameterized Circuit Classes
par: Hegeman, Steef, et autres
Publié: (2025)

Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH
par: Li, Shuangle, et autres
Publié: (2024)

The Parameterized Complexity of Terminal Monitoring Set
par: Aravind, N. R., et autres
Publié: (2024)

Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Counterfactual Explanations for Integer Optimization Problems
par: Engelhardt, Felix, et autres
Publié: (2025)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
par: Conrado, Giovanna K., et autres
Publié: (2023)

Tighter Bounds for the Randomized Polynomial-Time Simplex Algorithm for Linear Programming
par: Gibor, Daniel
Publié: (2025)

Parameterized Complexity Of Representing Models Of MSO Formulas
par: Kučera, Petr, et autres
Publié: (2026)