:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Klingelhoefer, Felix, Newman, Alantha
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2305.02922
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hardness and Approximation for Coloring Digraphs
par: Chalermsook, Parinya, et autres
Publié: (2026)

Improved linearly ordered colorings of hypergraphs via SDP rounding
par: Louis, Anand, et autres
Publié: (2024)

Understanding the Cluster LP for Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2024)

Deterministic Edge Coloring with few Colors in CONGEST
par: Blikstad, Joakim, et autres
Publié: (2026)

Solving the Correlation Cluster LP in Sublinear Time
par: Cao, Nairen, et autres
Publié: (2025)

Static to Dynamic Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2025)

Revisiting Directed Disjoint Paths on tournaments (and relatives)
par: Gomes, Guilherme C. M., et autres
Publié: (2025)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
par: Lachish, Oded, et autres
Publié: (2026)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
par: Bansal, Nikhil, et autres
Publié: (2026)

Arboricity-Dependent Algorithms for Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Bounding the chromatic number of dense digraphs by arc neighborhoods
par: Klingelhoefer, Felix, et autres
Publié: (2023)

Density-Sensitive Algorithms for $(Δ+ 1)$-Edge Coloring
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
par: Assadi, Sepehr, et autres
Publié: (2026)

Faster Vizing and Near-Vizing Edge Coloring Algorithms
par: Assadi, Sepehr
Publié: (2024)

On the FirstFit Algorithm for Online Unit-Interval Coloring
par: Krekelberg, Bob, et autres
Publié: (2025)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
par: Ferber, Asaf, et autres
Publié: (2025)

Engineering Hypergraph $b$-Matching Algorithms
par: Großmann, Ernestine, et autres
Publié: (2024)

Approximation Algorithms for Matroid-Intersection Coloring with Applications to Rota's Basis Conjecture
par: Arndt, Stephen, et autres
Publié: (2026)

Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
par: Kowalik, Lukasz
Publié: (2024)

Pointwise Lipschitz Continuous Graph Algorithms
par: Liu, Quanquan C., et autres
Publié: (2024)

A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
par: Zhu, Chenghao, et autres
Publié: (2025)

Engineering Weighted Connectivity Augmentation Algorithms
par: Faraj, Marcelo Fonseca, et autres
Publié: (2024)

Simple Sublinear Algorithms for $(Δ+1)$ Vertex Coloring via Asymmetric Palette Sparsification
par: Assadi, Sepehr, et autres
Publié: (2025)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
par: Bai, Yuhang, 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)

Differentially private graph coloring
par: Xie, Michael, et autres
Publié: (2026)

A Tight ($3/2 + \varepsilon$)-Approximation Algorithm for Demand Strip Packing
par: Eberle, Franziska, et autres
Publié: (2024)

Finding $b$-colorings Using Feedback Edges
par: Balabán, Jakub
Publié: (2025)

Coloring Reconfiguration under Color Swapping
par: Fuchs, Janosch, et autres
Publié: (2025)

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)

A Simple Algorithm for Near-Vizing Edge-Coloring in Near-Linear Time
par: Dhawan, Abhishek
Publié: (2024)

Comparative genomics with succinct colored de Bruijn graphs
par: Ramos, Lucas P., et autres
Publié: (2024)

Inference of rankings planted in random tournaments
par: Kunisky, Dmitriy, et autres
Publié: (2024)

Coloring 3-Colorable Graphs with Low Threshold Rank
par: Hsieh, Jun-Ting
Publié: (2025)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
par: Liu, Shuilian, et autres
Publié: (2025)

Dynamic O(arboricity) coloring in polylogarithmic worst-case time
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Matroid-Based TSP Rounding for Half-Integral Solutions
par: Gupta, Anupam, et autres
Publié: (2021)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
par: Antony, Dhanyamol, et autres
Publié: (2023)

Parallel Derandomization for Coloring
par: Coy, Sam, et autres
Publié: (2023)

Kernelization for $H$-Coloring
par: Berkman, Yael, et autres
Publié: (2025)