:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Aspnes, James
Format:	Preprint
Published:	2020
Subjects:	Data Structures and Algorithms 68-01
Online Access:	https://arxiv.org/abs/2003.01902
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Euclidean Affine Functions and Applications to Calendar Algorithms
by: Neri, Cassio, et al.
Published: (2021)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Independent Set Reconfiguration Under Bounded-Hop Token
by: Hatano, Hiroki, et al.
Published: (2024)

Towards a Unified Theory of Time-Varying Data
by: Bumpus, Benjamin Merlin, et al.
Published: (2024)

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

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

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

Compact enumeration for scheduling one machine
by: Vakhania, Nodari
Published: (2021)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

On Distributed Colouring of Hyperbolic Random Graphs
by: Maus, Yannic, et al.
Published: (2025)

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

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

Orientability of Undirected Phylogenetic Networks to a Desired Class: Practical Algorithms and Application to Tree-Child Orientation
by: Urata, Tsuyoshi, et al.
Published: (2024)

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

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

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

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

A Polynomial-Time Deterministic Algorithm for an NP-Complete Problem
by: Jiang, Xinwen, et al.
Published: (2021)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
by: Cui, Jinchuan, et al.
Published: (2022)

Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity
by: Li, Zhangsong
Published: (2025)

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

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)

Parameterized Complexity of Directed Traveling Salesman Problem
by: Blažej, Václav, et al.
Published: (2025)

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

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

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

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

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs
by: Chauhan, Archit, et al.
Published: (2024)

A Faster Algorithm for Independent Cut
by: Chernyshev, Vsevolod, et al.
Published: (2025)

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

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

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
by: Coşa, Matei Gabriel, et al.
Published: (2025)

Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
by: Hougardy, Stefan, et al.
Published: (2024)

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

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