:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Babatunde, Abiola, England, Matthew, Sadeghimanesh, AmirHosein
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Combinatorics
Accès en ligne:	https://arxiv.org/abs/2601.14424
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Lower Bounds on Tree Covers
par: Chen, Yu, et autres
Publié: (2025)

Cover time of random subgraphs of the hypercube
par: Cooper, Colin, et autres
Publié: (2025)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
par: Madani, Amirali, et autres
Publié: (2025)

Forest Covers and Bounded Forest Covers
par: Gaur, Daya Ram, et autres
Publié: (2024)

A faster algorithm for Vertex Cover parameterized by solution size
par: Harris, David G., et autres
Publié: (2022)

An Algebraic Approach to the Longest Path Problem
par: Khazali, Omar Al -
Publié: (2023)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
par: Gribanov, Dmitry, et autres
Publié: (2022)

Notes on the Linear Algebraic View of Regularity Lemmas
par: Bodwin, Greg, et autres
Publié: (2025)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
par: Shook, James M., et autres
Publié: (2025)

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
par: Bell, Tolson, et autres
Publié: (2023)

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

Connected Partitions via Connected Dominating Sets
par: Niklanovits, Aikaterini, et autres
Publié: (2025)

On Sparse Covers of Minor Free Graphs, Low Dimensional Metric Embeddings, and other applications
par: Filtser, Arnold
Publié: (2024)

Understanding Multistationarity of Fully Open Reaction Networks
par: Yao, Shenghao, et autres
Publié: (2024)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
par: Gao, Xuan-Zhao, et autres
Publié: (2024)

Complexity and Algorithm for the Matching vertex-cutset Problem
par: Li, Hengzhe, et autres
Publié: (2025)

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
par: Haviv, Ishay
Publié: (2022)

Odd and Even Harder Problems on Cycle-Factors
par: Hörsch, Florian, et autres
Publié: (2025)

On the Two Paths Theorem and the Two Disjoint Paths Problem
par: Humeau, Samuel, et autres
Publié: (2025)

A Maximum Linear Arrangement Problem on Directed Graphs
par: DeVos, Matt, et autres
Publié: (2018)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
par: Kobayashi, Yasuaki, et autres
Publié: (2023)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
par: Hellmuth, Marc, et autres
Publié: (2023)

Analysis of a Random Local Search Algorithm for Dominating Set
par: Higl, Hendrik
Publié: (2026)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
par: Aubian, Guillaume, et autres
Publié: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
par: Jenssen, Matthew, et autres
Publié: (2024)

Solving Problems on Generalized Convex Graphs via Mim-Width
par: Bonomo-Braberman, Flavia, et autres
Publié: (2020)

Sampling and counting triangle-free graphs near the critical density
par: Jenssen, Matthew, et autres
Publié: (2024)

Computing Subset Vertex Covers in $H$-Free Graphs
par: Brettell, Nick, et autres
Publié: (2023)

Stable Approximation Algorithms for Dominating Set and Independent Set
par: de Berg, Mark, et autres
Publié: (2024)

Fair Set Cover
par: Dehghankar, Mohsen, et autres
Publié: (2024)

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings
par: Hou, Jiaxin, et autres
Publié: (2023)

Making an oriented graph acyclic using inversions of bounded or prescribed size
par: Bang-Jensen, Jørgen, et autres
Publié: (2025)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
par: Avila, Tatiana Rocha, et autres
Publié: (2026)

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential
par: Koehler, Frederic, et autres
Publié: (2025)

Lower Bounds for Greedy Teaching Set Constructions
par: Compton, Spencer, et autres
Publié: (2025)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
par: Abboud, Amir, et autres
Publié: (2026)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
par: Dey, Palash, et autres
Publié: (2024)

The Strong Birthday Problem Revisited
par: Tripathy, Chijul B.
Publié: (2025)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
par: Tayal, Mumuksh
Publié: (2025)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2026)