:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Maus, Yannic, Ruff, Janosch
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms 68W15
Online Access:	https://arxiv.org/abs/2505.19109
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
by: Baguley, Samuel, et al.
Published: (2024)

Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model
by: Robinson, Peter, et al.
Published: (2025)

Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
by: Göbel, Andreas, et al.
Published: (2025)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

The Berlekamp-Massey Algorithm revisited
by: Atti, Nadia Ben, et al.
Published: (2022)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
by: Lynch, Nancy
Published: (2024)

On the Advice Complexity of Online Unit Clustering
by: Nagy-György, Judit
Published: (2023)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
by: Gribelyuk, Elena, et al.
Published: (2024)

The Telephone $k$-Multicast Problem
by: Hathcock, Daniel, et al.
Published: (2024)

satsuma: Structure-based Symmetry Breaking in SAT
by: Anders, Markus, et al.
Published: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
by: Hung, Chia-Yang, et al.
Published: (2024)

Algorithms Transcending the SAT-Symmetry Interface
by: Anders, Markus, et al.
Published: (2023)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
by: Bai, Miao, et al.
Published: (2023)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)

On the on-line coloring of unit interval graphs with proper interval representation
by: Curbelo, Israel R., et al.
Published: (2024)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
by: Chiclana, Rafael, et al.
Published: (2025)

Optimizing Exact String Matching via Statistical Anchoring
by: Garraoui, Omar
Published: (2025)

Improved Approximation Algorithms for the Expanding Search Problem
by: Griesbach, Svenja M., et al.
Published: (2023)

Fast FPT Algorithms for Grundy Number on Dense Graphs
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
by: Bansal, Ishan, et al.
Published: (2024)

Additive estimates of the permanent using Gaussian fields
by: Mukerji, Tantrik, et al.
Published: (2022)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)

Resident fitness computation in linear time and other algorithmic aspects of interacting trajectories
by: Friedl, Katalin, et al.
Published: (2025)

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

Strengths and Limitations of Greedy in Cup Games
by: Jasińska, Kalina, et al.
Published: (2026)

Quasi-optimal hierarchically semi-separable matrix approximation
by: Amsel, Noah, et al.
Published: (2025)

Computing the probability of intersection
by: Barvinok, Alexander
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
by: Gu, Qian-Ping, et al.
Published: (2025)

Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
by: An, Hyung-Chan, et al.
Published: (2025)