:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ramos, Lucas P., Louza, Felipe A., Telles, Guilherme P.
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2411.09114
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

In-Place BWT and Lyndon Array Construction in Constant Space
by: Louza, Felipe A., et al.
Published: (2025)

Almost succinct representation of maximal palindromes
by: Mieno, Takuya, et al.
Published: (2025)

When is String Reconstruction using de Bruijn Graphs Hard?
by: Bals, Ben, et al.
Published: (2025)

Implementation Of Dynamic De Bruijn Graphs Via Learned Index
by: Nigrelli, Riccardo
Published: (2024)

Differentially private graph coloring
by: Xie, Michael, et al.
Published: (2026)

Edge-coloring sparse graphs with $Δ$ colors in quasilinear time
by: Kowalik, Lukasz
Published: (2024)

Kernelization for list $H$-coloring for graphs with small vertex cover
by: Piecyk, Marta, et al.
Published: (2025)

Better coloring of 3-colorable graphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)

A customizable inexact subgraph matching algorithm for attributed graphs
by: Benko, Tatyana, et al.
Published: (2025)

The Canadian Traveller Problem on outerplanar graphs
by: Beaudou, Laurent, et al.
Published: (2024)

Coloring tournaments with few colors: Algorithms and complexity
by: Klingelhoefer, Felix, et al.
Published: (2023)

Finding $b$-colorings Using Feedback Edges
by: Balabán, Jakub
Published: (2025)

Erdős-Gyárfás conjecture on graphs without long induced paths
by: Hegde, Anand Shripad, et al.
Published: (2024)

Dynamic O(arboricity) coloring in polylogarithmic worst-case time
by: Ghaffari, Mohsen, et al.
Published: (2024)

Improved linearly ordered colorings of hypergraphs via SDP rounding
by: Louis, Anand, et al.
Published: (2024)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
by: Castelo, Emanuel, et al.
Published: (2025)

Approximating maximum properly colored forests via degree bounded independent sets
by: Bai, Yuhang, et al.
Published: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)

A characterization of one-sided error testable graph properties in bounded degeneracy graphs
by: Lachish, Oded, et al.
Published: (2026)

Revisiting Directed Disjoint Paths on tournaments (and relatives)
by: Gomes, Guilherme C. M., et al.
Published: (2025)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
by: Bougeret, Marin, et al.
Published: (2026)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)

Comparative Performance of the AVL Tree and Three Variants of the Red-Black Tree
by: Brown, Russell A.
Published: (2024)

Private graph colouring with limited defectiveness
by: Christiansen, Aleksander B. G., et al.
Published: (2024)

Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)

The trace reconstruction problem for spider graphs
by: Sun, Alec, et al.
Published: (2022)

Edge coloring of products of signed graphs
by: Janczewski, Robert, et al.
Published: (2023)

Greedy Dynamic Matching
by: Arnosti, Nick, et al.
Published: (2025)

Spanning tree congestion of proper interval graphs
by: Otachi, Yota
Published: (2026)

Approximating optimization problems in graphs with locational uncertainty
by: Bougeret, Marin, et al.
Published: (2022)

Improved girth approximation in weighted undirected graphs
by: Kadria, Avi, et al.
Published: (2025)

Fair densest subgraph across multiple graphs
by: Arachchi, Chamalee Wickrama, et al.
Published: (2025)

On $k$-connectivity oracles in $k$-connected graphs
by: Nutov, Zeev
Published: (2026)

Upper bounds on the theta function of random graphs
by: Feige, Uriel, et al.
Published: (2025)

On recognizing graphs representing Persistent Perfect Phylogenies
by: Bonizzoni, Paola, et al.
Published: (2025)

Strassen's algorithm via orbit flip graphs
by: Ikenmeyer, Christian, et al.
Published: (2025)

Decay of correlation for edge colorings when $q>3Δ$
by: Chen, Zejia, et al.
Published: (2025)

Testing $C_k$-freeness in bounded-arboricity graphs
by: Eden, Talya, et al.
Published: (2024)

Faster algorithms for packing forests in graphs and related problems
by: Arkhipov, Pavel, et al.
Published: (2024)

Quasilinear-time eccentricities computation, and more, on median graphs
by: Bergé, Pierre, et al.
Published: (2024)