:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bonnet, Édouard, Duron, Julien, Sylvester, John, Zamaraev, Viktor
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics Data Structures and Algorithms 68R01, 68R05, 68R10 G.2.1; G.2.2
Online Access:	https://arxiv.org/abs/2409.04821
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023)

Tight bounds on adjacency labels for monotone graph classes
by: Bonnet, Édouard, et al.
Published: (2023)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)

Constructions, bounds, and algorithms for peaceable queens
by: Clinch, Katie, et al.
Published: (2024)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

The Hierarchy of Saturating Matching Numbers
by: Simon, Hans U., et al.
Published: (2025)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Boolean combinations of graphs
by: Adenwalla, Sarosh, et al.
Published: (2024)

On the thinness of trees
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
by: Bar-Noy, Amotz, et al.
Published: (2025)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

Simple Approximations for General Spanner Problems
by: Bökler, Fritz, et al.
Published: (2025)

Exact Minimum Weight Spanners via Column Generation
by: Bökler, Fritz, et al.
Published: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

Homomorphism Counts to Trees
by: Dawar, Anuj
Published: (2024)

Packing, Hitting, and Colouring Squares
by: Caoduro, Marco, et al.
Published: (2022)

Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Skip Letters for Short Supersequence of All Permutations
by: Tan, Oliver
Published: (2022)

WELLDOC property for words generated by morphisms
by: Puzynina, Svetlana, et al.
Published: (2026)