yusuke1997/dblp-id-title huggingface dataset:
On the rank of a random binary matrix
A Generalized q th Root Algorithm
First Come First Served for Online Slot Allocation and Huffman Coding
Average-Case Subset Balancing Problems
An O(log m )-Competitive Algorithm for Online Machine Minimization
On the discrete Bak-Sneppen model of self-organized criticality
Combinatorics Helps for Hexahedral Mesh Generation in CAD
Finding duplicates in a data stream
New bounds for multi-dimensional packing
The random graph threshold for k -orientiability and a fast algorithm for optimal multiple-choice allocation
Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups
Optimal ℓ 1 Column Subset Selection and a Fast PTAS for Low Rank Approximation
Set connectivity problems in undirected graphs and the directed Steiner network problem
Concatenated codes can achieve list-decoding capacity
Doubly Balanced Connected Graph Partitioning
The Robust Sensitivity of Boolean Functions
Approximating (k, ℓ)-center clustering for curves
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA
Finding a Stable Allocation in Polymatroid Intersection
Approximate Nearest Neighbor Queries in Fixed Dimensions
A submodular measure and approximate Gomory-Hu theorem for packing odd trails
The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract)
Tree Containment Above Minimum Degree is FPT
Finger Search Trees with Constant Insertion Time
Chasing Convex Bodies Optimally
Fast and reliable reconstruction of phylogenetic trees with very short edges
Which formulae shrink under random restrictions?
A Stable Marriage Requires Communication
Online Dependent Rounding Schemes for Bipartite Matchings, with
Mapping Clones with a Given Ordering or Interleaving (Extended Abstract)
The complexity of counting graph homomorphisms (extended abstract)
Property Testing and Parameter Testing for Permutations
Quantum algorithm for a generalized hidden shift problem
On the Randomness Requirements of Rumor Spreading
Tight Distributed Sketching Lower Bound for Connectivity
Algorithms for quantified Boolean formulas
Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues
Fast algorithms for solving the Hamilton Cycle problem with high probability
New Results on the Old k-Opt Algorithm for the TSP
List-Decodable Subspace Recovery: Dimension Independent Error in Polynomial Time
Broadcast scheduling: algorithms and complexity
Approximability of the Six-vertex Model
Superlinear Bounds on Matrix Searching
Knapsack auctions
Reducing 3SUM to Convolution-3SUM
A Generalization of Janson Inequalities and its Application to Finding Shortest Paths
Undirected Graph Exploration with ⊝(log log n ) Pebbles
Approximate Data Structures with Applications
Short Synchronizing Words for Random Automata
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA
Exact Shortest Paths with Rational Weights on the Word RAM
Ascending auctions for integral (poly)matroids with concave nondecreasing separable values
Expanders are universal for the class of all spanning trees
Parameterized algorithms for block-structured integer programs with large entries
Multiple Translational Containment: Approximate and Exact Algorithms
Sublinear Time Low-Rank Approximation of Toeplitz Matrices
Weighted SGD for ℓ p Regression with Randomized Preconditioning
Parameterized Streaming: Maximal Matching and Vertex Cover
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA
Composition of nested embeddings with an application to outlier removal
Approximate Minimum Weight Steiner Triangulation in Three Dimensions
Parametric Polymatroid Optimization and Its Geometric Applications
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k -median sketching
On-line restricted caching
Improved bandwidth approximation for trees
Regular Languages meet Prefix Sorting
Detecting Feedback Vertex Sets of Size k in O *(2.7 k ) Time
Selection and Sorting in Totally Monotone Arrays
Dynamic Edge Coloring with Improved Approximation
The ℓ p -Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
Competitive Allocation of a Mixed Manna
Dynamic routing on networks with fixed-size buffers
Optimizing quantum optimization algorithms via faster quantum gradient computation
Optimal Vertex Fault-Tolerant Spanners in Polynomial Time
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
Dynamic dictionary matching and compressed suffix trees
Testing graphs for colorable properties
Computing strongly connected components in a linear number of symbolic steps
Hypergraph k -Cut in Randomized Polynomial Time
Comparing mixing times on sparse random graphs
Optimal Dynamic Strings
Competitive strategies to use "warm start" algorithms with predictions
Pairing heaps with O (log log n ) decrease cost
The complexity of matrix completion
Considering suppressed packets improves buffer management in QoS switches
Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
Improved Deterministic Algorithms for Linear Programming in Low Dimensions
Upper degree-constrained partial orientations
Improved Approximation for Vector Bin Packing
Treewidth-Pliability and PTAS for Max-CSPs
Planar Reachability Under Single Vertex or Edge Failures
Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion
A tight -approximation for Linear 3-Cut
The Value of Information Concealment
Loopless generation of multiset permutations using a constant number of variables by prefix shifts
Restructuring ordered binary trees
Sampling stable marriages: why spouse-swapping won't work
Optimal induced universal graphs for bounded-degree graphs
Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract)
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing
A time- and space-optimal algorithm for the many-visits TSP
Algorithms for the Optimal Loading of Recursive Neural Nets
Synopsis Data Structures for Massive Data Sets
Fully dynamic algorithm for graph spanners with poly-logarithmic update time
Bin Packing under Random-Order: Breaking the Barrier of 3/2
Engineering the compression of massive tables: an experimental approach
Fast and Space Efficient Spectral Sparsification in Dynamic Streams
Bipartite roots of graphs
Tight Bounds for Dynamic Storage Allocation
Optimization of Bootstrapping in Circuits
Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision
Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms
Small hop-diameter sparse spanners for doubling metrics
Reasoning about online algorithms with weighted automata
On the Decidability of the Fréchet Distance between Surfaces
Approximate Range Emptiness in Constant Time and Optimal Space
On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer
LR-Drawings of Ordered Rooted Binary Trees and Near-Linear Area Drawings of Outerplanar Graphs
Preemptive Scheduling of Parallel Jobs on Multiprocessors
Oracles for distances avoiding a link-failure
A constructive algorithm for the Lovász Local Lemma on permutations
Improved Parallel Integer Sorting Without Concurrent Writing
Space-efficient local computation algorithms
Nearly Tight Bounds for Sandpile Transience on the Grid
Slow mixing of Glauber dynamics for the hard-core model on the hypercube
Polynomial-Time Solutions to Image Segmentation
Invadable self-assembly: combining robustness with efficiency
A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs
Directed nowhere dense classes of graphs
Finding Near-Optimal Cuts: An Empirical Evaluation
Learning and Efficiency in Games with Dynamic Population
Analyzing graph structure via linear measurements
Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions (Preliminary Version)
Exponential Segregation in a Two-Dimensional Schelling Model with Tolerant Individuals
Reflections for quantum query algorithms
Static and Streaming Data Structures for Fréchet Distance Queries
Baker game and polynomial-time approximation schemes
Equilibria for economies with production: constant-returns technologies and production planning constraints
The Complexity of Resolvent Resolved
Improved smoothed analysis of the k -means method
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set
Depth Optimal Sorting Networks Resistant to k Passive Faults
The Online Submodular Cover Problem
Ordered and Unordered Top-K Range Reporting in Large Data Sets
Hole and antihole detection in graphs
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA
An Efficient Algorithm for Terraine Simplification
Finding Connected Components in O(log n log log n) Time on the EREW PRAM
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
Optimal One-Way Sorting on a One-Dimensional Sub-Bus Array
Who says you have to look at the input? The brave new world of sublinear computing
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search
Contagious Sets in Expanders
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
On the number of plane graphs
Improved bounds for testing Dyck languages
Stochastic Matching with Few Queries: New Algorithms and Tools
Testing matrix product states
Design of data structures for mergeable trees
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets
Tree exploration with logarithmic memory
Lower Bounds for On-Line Graph Coloring
Approximate Nearest Line Search in High Dimensions
Testing Monotone Continuous Distributions on High-dimensional Real Cubes
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
On the convergence time of a path-vector protocol
Outlier-robust Mean Estimation near the Breakdown Point via Sum-of-Squares
Efficient aggregation algorithms for probabilistic data
Max s , t -Flow Oracles and Negative Cycle Detection in Planar Digraphs
Efficient subspace approximation algorithms
Explicit constructions of selectors and related combinatorial structures, with applications
Embeddings and non-approximability of geometric problems
On the overlay of envelopes in four dimensions
External-Memory Graph Algorithms
An O(N) Oblivious Routing Algorithm for 2-D Meshes of Constant Queue-Size
Improved labeling scheme for ancestor queries
Random-Cluster Dynamics in ℤ 2
Popular Matching in Roommates Setting is NP-hard
Approximate Nearest Neighbor under edit distance via product metrics
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition
Lower bounds for text indexing with mismatches and differences
Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms
Predicting the "unpredictable"
Optimal Contextual Pricing and Extensions
Density Graphs and Separators
Tree Independence Number IV. Even-hole-free graphs
Inserting a vertex into a planar graph
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
Combinatorial Contracts Beyond Gross Substitutes
Universal epsilon-approximators for Integrals
On (1, ∊ )-Restricted Assignment Makespan Minimization
Implicit Manifold Reconstruction
A Lower Bound for Light Spanners in General Graphs
Algorithms for Subset Testing and Finding Maximal Sets
Binary space partitions for 3D subdivisions
From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems
Two-Dimensional Periodicity and Its Applications
Adaptive Sparse Recovery with Limited Adaptivity
The freeze-tag problem: how to wake up a swarm of robots
How to cut a cake almost fairly
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
Individual Sensitivity Preprocessing for Data Privacy
On the spread of viruses on the internet
Streaming Algorithms via Local Algorithms for Maximum Directed Cut
A Formal Treatment of Remotely Keyed Encryption
Fast Deterministic Processor Allocation
Maximum Flows and Parametric Shortest Paths in Planar Graphs
How to aggregate Top-lists: Approximation algorithms via scores and average ranks
An improved data stream algorithm for frequency moments
Fast Lattice Point Enumeration with Minimal Overhead
An elementary construction of constant-degree expanders
Adaptive and Approximate Orthogonal Range Counting
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in- f Time Barrier
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed
Distance Sensitive Bloom Filters Without False Negatives
Setting lower bounds on truthfulness: extended abstract
Clustering in Large Graphs and Matrices
Atomic Embeddability, Clustered Planarity, and Thickenability
Nearly Tight Bounds on Testing of Metric Properties
Reconstructing Randomly Sampled Multivariate Polynomials from Highly Noisy Data
Popular matchings
Online Submodular Maximization with Preemption
Adaptive Matrix Vector Product
The Complexity of Average-Case Dynamic Subgraph Counting
On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
The Fourth Moment Method
On Sampling Edges Almost Uniformly
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
From Algorithms to Connectivity and Back: Finding a Giant Component in Random k -SAT
Lower Bounds for Adaptive Sparse Recovery
Private Interdependent Valuations
A rigorous analysis of population stratification with limited data
Games, Computers, and O.R
Approximate Single Source Fault Tolerant Shortest Path
Fast Algorithms for Separable Linear Programs
Parameterized diff
Adaptive Out-Orientations with Applications
Approximate shared-memory counting despite a strong adversary
VC Set Systems in Minor-free (Di)Graphs and Applications
Improved equilibria via public service advertising
Dynamic weighted ancestors
On the complexity of bicoloring clique hypergraphs of graphs (extended abstract)
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems
Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
Quantum algorithms for graph problems with cut queries
On broadcasting in heterogenous networks
FPTAS for Holant Problems with Log-Concave Signatures
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
Approximate distance oracles with improved preprocessing time
Competitive Randomized Algorithms for Non-Uniform Problems
Selectable Heaps and Optimal Lazy Search Trees
Approximating k-median with non-uniform capacities
Graph Isomorphism Testing without Numberics for Graphs of Bounded Eigenvalue Multiplicity
A new algorithm for protein folding in the HP model
An algorithm for counting maximum weighted independent sets and its applications
A PTAS for ℓp-Low Rank Approximation
On the polynomial time computation of equilibria for certain exchange economies
On Termination of Integer Linear Loops
Improved bounds for centered colorings
A constant-factor approximation algorithm for optimal terrain guarding
Dynamic generators of topologically embedded graphs
Nearly 2-Approximate Distance Oracles in Subquadratic Time
Scapegoat Trees
Point containment in the integer hull of a polyhedron
Computing the Discrete Fréchet Distance in Subquadratic Time
Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
Approximately counting independent sets in bipartite graphs via graph containers
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs
Better bounds for matchings in the streaming model
Substring compression problems
Degree-3 Treewidth Sparsifiers
Non-Stochastic CDF Estimation Using Threshold Queries
Dense point sets have sparse Delaunay triangulations: or "... but not too nasty"
Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
Testing triangle-freeness in general graphs
(Almost) optimal coordination mechanisms for unrelated machine scheduling
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
The maximum latency of selfish routing
Quantum Approximate Counting, Simplified
An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism
The Complexity of Estimating Rényi Entropy
Exact and Approximation Algorithms for Weighted Matroid Intersection
Fuel Efficient Computation in Passive Self-Assembly
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices
The Subtree Max Gap Problem with Application to Parallel String Covering
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Improved distance sensitivity oracles via random sampling
Finding a Line Transversal of Axial Objects in Three Dimensions
Asymmetric Traveling Salesman Path and Directed Latency Problems
Matching Points into Noise Regions: Combinatorial Bounds and Algorithms
Approximation algorithms for restless bandit problems
A Linear Time 2+epsilon Approximation Algorithm for Edge Connectivity
Directed Shortest Paths via Approximate Cost Balancing
A Sublinear-Time Randomized Parallel Algorithm for the Maximum Clique Problem in Perfect Graphs
Path Problems in Skew-Symmetric Graphs
Extension Complexity Lower Bounds for Mixed-Integer Extended Formulations
Approximation Techniques for Average Completion Time Scheduling
Faster Sublinear-Time Edit Distance
Online Bin Packing with Lookahead
Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time
Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
Loss-bounded analysis for differentiated services
Mixing Times of Markov Chains for Self-Organizing Lists and Biased Permutations
Approximating Fair Clustering with Cascaded Norm Objectives
Optimal streaming and tracking distinct elements with high probability
Nash Flows Over Time with Spillback
Directed multicut is W [1]-hard, even for four terminal pairs
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k -Median
Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with Holes
Controlled perturbation for Delaunay triangulations
Massively Parallel Computation on Embedded Planar Graphs
Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
The maximum degree of random planar graphs
Near Optimal Algorithms For The Single Source Replacement Paths Problem
Improved Algorithms for Solving Polynomial Systems over GF(2) by Multiple Parity-Counting
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
Disjoint Set Union with Randomized Linking
Isomorphism and embedding problems for infinite limits of scale-free graphs
Efficient protocols of generating bipartite classical distributions and quantum states
Analytic combinatorics: a calculus of discrete structures
Maintaining Assignments Online: Matching, Scheduling, and Flows
An Improved Classical Singular Value Transformation for Quantum Machine Learning
Morphing Planar Graph Drawings with a Polynomial Number of Steps
Fast 2-Approximate All-Pairs Shortest Paths
The mathematics of playing golf
On the bandwidth conjecture for 3-colourable graphs
Make Up Your Mind: The Price of Online Queries in Differential Privacy
Efficient Quantum State Synthesis with One Query
Online Bipartite Matching with Amortized Replacements
Testing satisfiability
Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds
Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
Near-Optimal Randomized Algorithms for Selection in Totally Monotone Matrices
Pursuit-evasion with imprecise target location
Semi-online maintenance of geometric optima and measures
Stochastic k -Center and j -Flat-Center Problems
Improved Interior Point Algorithms for Exact and Approximate Solution of Multicommodity Flow Problems
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs
Almost Tight Error Bounds on Differentially Private Continual Counting
Non-uniform Geometric Set Cover and Scheduling on Multiple Machines
Faster single-source shortest paths with negative real weights via proper hop distance
A Reduction from Multi-Parameter to Single-Parameter Bayesian Contract Design
Fast Hashing on a PRAM - Designing by Expectation
Entropy Regularization and Faster Decremental Matching in General Graphs
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines
Faster Approximation Algorithms for Generalized Flow
Online make-to-order joint replenishment model: primal dual competitive algorithms
A tight lower bound for parity in noisy communication networks
Asymmetric balanced allocation with simple hash functions
Inapproximability of the multi-level uncapacitated facility location problem
A PTAS for the multiple knapsack problem
Decomposing Graphs into Regions of Small Diameter
New Approximation Bounds for Small-Set Vertex Expansion
Matroid Decomposition Methods for the Set Maxima Problem
Parameterized Algorithms for Survivable Network Design with Uniform Demands
Dynamic Algorithms for Maximum Matching Size
Testable Algorithms for Self-Avoiding Walks
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model
Capacitated vertex covering with applications
Escaping a grid by edge-disjoint paths
Improved Randomized On-Line Algorithms for the List Update Problem
Dynamically Maintaining the Persistent Homology of Time Series
An O ( n 5/4 ) Time ∊ -Approximation Algorithm for RMS Matching in a Plane
Reducing tile complexity for self-assembly through temperature programming
Fine-grained Complexity Meets IP = PSPACE
Unscrambling Address Lines
Finding irrelevant vertices in linear time on bounded-genus graphs
A unified approach to distance-two colouring of planar graphs
Learning pseudo-Boolean k -DNF and submodular functions
A topological proof of the Hell-Nešetřil dichotomy
Four-coloring P6-free graphs
Linear-Time FPT Algorithms via Network Flow
Approximate Nearest Neighbors Beyond Space Partitions
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Universality of random graphs
Competitive Analysis via Regularization
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
Complexity of polytope diameters via perfect matchings
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
Towards Instance-Optimal Private Query Release
Online Graph Algorithms with Predictions