Image de couverture de livre

Online Coloring of Short Intervals

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chybowska-Sokół, Joanna, Gutowski, Grzegorz, Junosza-Szaniawski, Konstanty, Mikos, Patryk, Polak, Adam
Format:	Preprint
Publié:	2018
Sujets:	Combinatorics Discrete Mathematics 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

Coloring and Recognizing Directed Interval Graphs
par: Gutowski, Grzegorz, et autres
Publié: (2023)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
par: Dudeja, Aditi, et autres
Publié: (2024)

Interval H-graphs : Recognition and forbidden obstructions
par: Müller, Haiko, et autres
Publié: (2025)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
par: Bourneuf, Romain, et autres
Publié: (2025)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
par: Beisegel, Jesse, et autres
Publié: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
par: Kunisky, Dmitriy, et autres
Publié: (2023)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

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

Reconfiguration of List Colourings
par: Cambie, Stijn, et autres
Publié: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
par: Torres, Ethan, et autres
Publié: (2025)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
par: Ingels, Florian, et autres
Publié: (2026)

Induced Cycles of Many Lengths
par: Chudnovsky, Maria, et autres
Publié: (2026)

Approximating maximum-size properly colored forests
par: Bai, Yuhang, et autres
Publié: (2024)

Problems on Group-labeled Matroid Bases
par: Hörsch, Florian, et autres
Publié: (2024)

$α_i$-Metric Graphs: Hyperbolicity
par: Dragan, Feodor F., et autres
Publié: (2024)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
par: Holtgrefe, Niels, et autres
Publié: (2024)

Unsplittable Transshipments
par: Debgupta, Srinwanti, et autres
Publié: (2026)

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

Optimal and Efficient Partite Decompositions of Hypergraphs
par: Krapivin, Andrew, et autres
Publié: (2025)

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

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Deterministic approximation for the volume of the truncated fractional matching polytope
par: Guo, Heng, et autres
Publié: (2024)

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

Clique-free t-matchings in degree-bounded graphs
par: Paluch, Katarzyna, et autres
Publié: (2024)

Hypergraph dualization with FPT-delay parameterized by the degeneracy and dimension
par: Bartier, Valentin, et autres
Publié: (2023)

A logarithmic approximation of linearly ordered colourings
par: Håstad, Johan, et autres
Publié: (2024)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
par: Neuen, Daniel
Publié: (2020)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

Parameterised algorithms for temporally satisfying reconfiguration problems
par: Davot, Tom, et autres
Publié: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
par: Bonamy, Marthe, et autres
Publié: (2020)

Computing Treedepth Obstructions
par: Kühn, Kolja
Publié: (2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
par: Bencs, Ferenc, et autres
Publié: (2025)

On the sizes of BDDs and ZDDs representing matroids
par: Emoto, Hiromi, et autres
Publié: (2024)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
par: Korhonen, Tuukka, et autres
Publié: (2024)

On the number of $k$-mers admitting a given lexicographical minimizer
par: Ingels, Florian, et autres
Publié: (2024)