:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Palais, Léo Colisson, Dumas, Jean-Guillaume, Galan, Alexis, Grenet, Bruno, Maignan, Aude
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2601.21423
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications
by: Dumas, Jean-Guillaume, et al.
Published: (2026)

Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
by: Liu, Bowie, et al.
Published: (2024)

Optimal Communication Unbalanced Private Set Union
by: Dumas, Jean-Guillaume, et al.
Published: (2024)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
by: Dumas, Maël, et al.
Published: (2022)

A Simple Algorithm for Trimmed Multipoint Evaluation
by: Fischer, Nick, et al.
Published: (2025)

An Objective Improvement Approach to Solving Discounted Payoff Games
by: Dell'Erba, Daniele, et al.
Published: (2024)

A Critical Pair Enumeration Algorithm for String Diagram Rewriting
by: Matsui, Anna, et al.
Published: (2026)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
by: Dempsey, Jordan, et al.
Published: (2024)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
by: Ducoffe, Guillaume
Published: (2026)

Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
by: Montanaro, Ashley, et al.
Published: (2024)

Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
by: Bampis, Evripidis, et al.
Published: (2025)

Wagner's Algorithm Provably Runs in Subexponential Time for SIS$^\infty$
by: Ducas, Léo, et al.
Published: (2025)

Algorithmic study on liar's vertex-edge domination problem
by: Bhattacharya, Debojyoti, et al.
Published: (2023)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

GridOT -- a discrete optimal transport solver on grids
by: Rauch, Johannes, et al.
Published: (2025)

Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time
by: Fischer, Nick, et al.
Published: (2024)

Terminal Steiner tree problem : Complexity and Algorithms
by: S, Jyothish, et al.
Published: (2026)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
by: Meel, Kuldeep S., et al.
Published: (2025)

#CFG and #DNNF admit FPRAS
by: Meel, Kuldeep S., et al.
Published: (2024)

An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
by: Meel, Kuldeep S., et al.
Published: (2024)

A $(1+ε)$-Approximation for Ultrametric Embedding in Subquadratic Time
by: Bathie, Gabriel, et al.
Published: (2025)

Cost Preserving Dependent Rounding for Allocation Problems
by: Rohwedder, Lars, et al.
Published: (2025)

On the complexity of global Roman domination problem in graphs
by: Reddy, Sangam Balchandar, et al.
Published: (2026)

Dynamic parameterized problems on unit disk graphs
by: An, Shinwoo, et al.
Published: (2024)

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

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
by: Austrin, Per, et al.
Published: (2024)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
by: Crane, Alex, et al.
Published: (2026)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
by: Saxena, Raghuvansh R., et al.
Published: (2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
by: Bruno, Roberto, et al.
Published: (2024)

Online matching games in bipartite expanders and applications
by: Bauwens, Bruno, et al.
Published: (2022)

Methodology of Algorithm Engineering
by: Mendling, Jan, et al.
Published: (2023)

On the closest pair of points problem
by: Hitz, Martin, et al.
Published: (2026)

Practical Computation of Graph VC-Dimension
by: Coudert, David, et al.
Published: (2024)

Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems
by: Bendotti, Pascale, et al.
Published: (2024)

Distributed Algorithms for Euclidean Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2026)

The Impact of Approximation on Algorithmic Progress
by: Li, Jeffery, et al.
Published: (2026)

A Coalgebraic Dijkstra Algorithm
by: Sanada, Takahiro, et al.
Published: (2026)

The Kernighan-Lin Search Algorithm
by: Dasdan, Ali
Published: (2025)

Simple and Faster Algorithms for Knapsack
by: He, Qizheng, et al.
Published: (2023)

Algorithmic Extensions of Dirac's Theorem
by: Fomin, Fedor V., et al.
Published: (2020)