Image de couverture de livre

On Integer Programs That Look Like Paths

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Briański, Marcin, Lassota, Alexandra, Pekárková, Kristýna, Pilipczuk, Michał, Reuter, Janina
Format:	Preprint
Publié:	2025
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

Parameterized algorithms for block-structured integer programs with large entries
par: Cslovjecsek, Jana, et autres
Publié: (2023)

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

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

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

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
par: Czyżewska, Jadwiga, et autres
Publié: (2025)

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

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Parameterized Complexity of MinCSP over the Point Algebra
par: Osipov, George, et autres
Publié: (2023)

FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares
par: Jansen, Klaus, et autres
Publié: (2024)

Bounding $\varepsilon$-scatter dimension via metric sparsity
par: Bourneuf, Romain, et autres
Publié: (2024)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
par: Lokshtanov, Daniel, et autres
Publié: (2026)

Parameterized dynamic data structure for Split Completion
par: Majewski, Konrad, et autres
Publié: (2024)

Parameterized and approximation algorithms for coverings points with segments in the plane
par: Kowalska, Katarzyna, et autres
Publié: (2024)

Dynamic Detours
par: Dadush, Daniel, et autres
Publié: (2026)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
par: Bonnet, Édouard, et autres
Publié: (2026)

Graph classes through the lens of logic
par: Pilipczuk, Michał
Publié: (2025)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
par: Chudnovsky, Maria, et autres
Publié: (2024)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
par: S., Karthik C., et autres
Publié: (2023)

Combinatorial Correlation Clustering
par: Cohen-Addad, Vincent, et autres
Publié: (2024)

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation
par: Hatzel, Meike, et autres
Publié: (2022)

Space-Efficient Algorithm for Integer Programming with Few Constraints
par: Rohwedder, Lars, et autres
Publié: (2024)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
par: Kim, Eun Jung, et autres
Publié: (2022)

Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard
par: Włodarczyk, Michał
Publié: (2024)

Max Weight Independent Set in sparse graphs with no long claws
par: Abrishami, Tara, et autres
Publié: (2023)

A tight quasi-polynomial bound for Global Label Min-Cut
par: Jaffke, Lars, et autres
Publié: (2022)

Dynamic data structures for twin-ordered matrices
par: Bosek, Bartłomiej, et autres
Publié: (2026)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime
par: Aggarwal, Divesh, et autres
Publié: (2024)

Accelerating Graph Similarity Search through Integer Linear Programming
par: D'Ascenzo, Andrea, et autres
Publié: (2025)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
par: Dory, Michal, et autres
Publié: (2022)

Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
par: Mao, Xiao
Publié: (2023)

Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number
par: Majewski, Konrad, et autres
Publié: (2021)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

On the Inversion Modulo a Power of an Integer
par: Xu, Guangwu, et autres
Publié: (2025)

Batched Ranged Random Integer Generation
par: Brackett-Rozinsky, Nevin, et autres
Publié: (2024)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
par: Hunkenschröder, Christoph, et autres
Publié: (2025)

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

Optimal Micro-Transit Zoning via Clique Generation and Integer Programming
par: Hu, Hins, et autres
Publié: (2025)

A Polynomial Coreset for Furthest Neighbor in Planar Metrics
par: Kluk, Kacper, et autres
Publié: (2026)

QuaRs: A Transform for Better Lossless Compression of Integers
par: Matt, Jonas G.
Publié: (2025)