:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bodini, Olivier, Durand, Francis, Marchal, Philippe
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Discrete Mathematics
Online Access:	https://arxiv.org/abs/2406.16396
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
by: Efthymiou, Charilaos, et al.
Published: (2023)

Approximation Algorithms for Optimal Hopsets
by: Dinitz, Michael, et al.
Published: (2025)

Edge Clique Partition and Cover Beyond Independence
by: Fomin, Fedor V., et al.
Published: (2025)

Optimal Padded Decomposition For Bounded Treewidth Graphs
by: Filtser, Arnold, et al.
Published: (2024)

Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)

Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
by: Georgiou, Konstantinos, et al.
Published: (2025)

Placing Green Bridges Optimally for Robust Habitat Reconnection
by: Ellmies, Gero, et al.
Published: (2026)

Explicit Min-wise Hash Families with Optimal Size
by: Chen, Xue, et al.
Published: (2025)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
by: Harada, Tsubasa, et al.
Published: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
by: Gahlawat, Harmender, et al.
Published: (2025)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
by: Baswana, Surender, et al.
Published: (2023)

Greedy Gray Codes for some Restricted Classes of Binary Words
by: Hassler, Nathanaël, et al.
Published: (2024)

Near-Optimal Constructive Bounds for $\ell_2$ Prefix Discrepancy and Steinitz Problems via Affine Spectral Independence
by: Dutta, Kunal, et al.
Published: (2026)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)

Isomorphism Testing Parameterized by Genus and Beyond
by: Neuen, Daniel
Published: (2021)

An Approximate Generalization of the Okamura-Seymour Theorem
by: Kumar, Nikhil
Published: (2022)

Generalizing Roberts' characterization of unit interval graphs
by: Martínez, Virginia Ardévol, et al.
Published: (2024)

Optimal and Efficient Partite Decompositions of Hypergraphs
by: Krapivin, Andrew, et al.
Published: (2025)

Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)

Simultaneous Drawing of Layered Trees
by: Katheder, Julia, et al.
Published: (2023)

Towards an Optimal Contention Resolution Scheme for Matchings
by: Nuti, Pranav, et al.
Published: (2022)

An Alternate Proof of Near-Optimal Light Spanners
by: Bodwin, Greg
Published: (2023)

Polynomial Kernels for Spanning Tree with Diversity Requirements
by: Golovach, Petr A., et al.
Published: (2026)

Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings
by: Brlek, Srečko, et al.
Published: (2024)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
by: Liu, Bowie, et al.
Published: (2025)

Approximation of Spanning Tree Congestion using Hereditary Bisection
by: Kolman, Petr
Published: (2024)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
by: Ingels, Florian
Published: (2023)

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
by: Foucaud, Florent, et al.
Published: (2026)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem
by: Disser, Yann, et al.
Published: (2024)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
by: Abbasi, Ali, et al.
Published: (2026)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
by: Marx, Dániel, et al.
Published: (2026)

The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
by: Byrka, Jarosław, et al.
Published: (2024)

Partial Optimality in the Preordering Problem
by: Stein, David, et al.
Published: (2026)

Optimal hypersurface decision trees
by: He, Xi
Published: (2025)

Sampling Tree-Weighted Partitions Without Sampling Trees
by: Cannon, Sarah, et al.
Published: (2025)

Counting Locally Optimal Tours in the TSP
by: Manthey, Bodo, et al.
Published: (2024)

Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme
by: Li, Xiaxin, et al.
Published: (2024)

Streaming algorithm for balance gain and cost with cardinality constraint on the integer lattice
by: Tan, Jingjing
Published: (2024)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
by: Harada, Tsubasa
Published: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
by: Guruswami, Venkatesan, et al.
Published: (2024)