yusuke1997/dblp-id-title huggingface dataset:
The Power of Convex Relaxation: The Surprising Stories of Matrix Completion and Compressed Sensing
Fast matrix multiplication using coherent configurations
Improved Bound for the Union of Fat Triangles
Approximate local search in combinatorial optimization
Counting Solutions to Polynomial Systems via Reductions
Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs
Guessing secrets with inner product questions
Split Decomposition of Undirected Graphs
Competitive analysis of the top- K ranking problem
Squeezing succinct data structures into entropy bounds
Approximation algorithms for layered manufacturing
Reconstruction using witness complexes
Online algorithms for market clearing
Deterministic Online Bipartite Edge Coloring
The Influence of Caches on the Performance of Sorting
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few Faces
Private data release via learning thresholds
Sharp threshold sequence and universality for Ising perceptron models
Faster dynamic matchings and vertex connectivity
Online paging with arbitrary associativity
Decidability of the Membership Problem for 2 × 2 integer matrices
Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region
The communication complexity of addition
Off-line admission control for general scheduling problems
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
A Near-Linear Time Sampler for the Ising Model with External Field
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS
Eliminating Depth Cycles among Triangles in Three Dimensions
An Almost Optimal Algorithm for Computing Nonnegative Rank
Fast Incremental Text Editing
Improved Inapproximability of Rainbow Coloring
Fast implementation of depth contours using topological sweep
Set membership with a few bit probes
The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications
Comparison-Sorting and Selecting in Totally Monotone Matrices
Beyond myopic best response (in Cournot competition)
Spectral Sparsification of Metrics and Kernels
A New Way to Weigh Malnourished Euclidean Graphs
Counting Homomorphisms to K 4 -minor-free Graphs, modulo 2
Routing through a Dense Channel with Minimum Total Wire Length
The complete classification for quantified equality constraints
Approximation algorithms for prize collecting forest problems with submodular penalty functions
Termination criteria for solving concurrent safety and reachability games
Random Contractions and Sampling for Hypergraph and Hedge Connectivity
The Bisection Width of Grid Graphs
On distance scales, embeddings, and efficient relaxations of the cut cone
Analysis of incomplete data and an intrinsic-dimension Helly theorem
Min-Wise versus linear independence (extended abstract)
New Bounds for Approximating Extremal Distances in Undirected Graphs
Excluding Single-Crossing Matching Minors in Bipartite Graphs
Reductions among high dimensional proximity problems
Line-of-sight networks
Compressed counting
Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition
Maintaining stream statistics over sliding windows (extended abstract)
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design
Constructing finite field extensions with large order elements
Approximate Counting via Correlation Decay on Planar Graphs
The Price of Stability for First Price Auction
Random cluster dynamics for the Ising model is rapidly mixing
Tight Network Topology Dependent Bounds on Rounds of Communication
Quasirandom rumor spreading
An Efficient Regularity Lemma for Semi-Algebraic Hypergraphs
Yet another algorithm for dense max cut: go greedy
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015
Computing the depth of a flat
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems
A half-integral Erdős-Pósa theorem for directed odd cycles
The popular assignment problem: when cardinality is more important than popularity
Optimal Girth Approximation for Dense Directed Graphs
Weak coloring numbers of minor-closed graph classes
Local Lipschitz Filters for Bounded-Range Functions with Applications to Arbitrary Real-Valued Functions
Efficient Automatic Part Nesting on Irregular and Inhomogeneous Surfaces
Lempel-Ziv: a "one-bit catastrophe" but not a tragedy
How to Round Subspaces: A New Spectral Clustering Algorithm
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n ) over all Finite Fields
Multivariate Fine-Grained Complexity of Longest Common Subsequence
On the Cover of the Rolling Stone
Random Restrictions of High Dimensional Distributions and Uniformity Testing with Subcube Conditioning
Quick and good facility location
Mean estimation when you have the source code; or, quantum Monte Carlo methods
A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions
Oblivious Sketching of High-Degree Polynomial Kernels
Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract)
On the Hardness of Scheduling With Non-Uniform Communication Delays
Efficient contention resolution protocols for selfish agents
Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized Complexity
Product growth and mixing in finite groups
Approximation Schemes for Capacitated Clustering in Doubling Metrics
Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Designing Proxies for Stock Market Indices is Computationally Hard
Maintaining hierarchical graph views
Lower bounds on average-case delay for video-on-demand broadcast protocols
Jungles, bundles, and fixed parameter tractability
On the midpath tree conjuncture: a counter-example
Highway Dimension: a Metric View
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
The First Classical Ramsey Number for Hypergraphs is Computed
A Dichotomy Hierarchy for Linear Time Subgraph Counting in Bounded Degeneracy Graphs
Scalable leader election
A o ( d ) · polylog n Monotonicity Tester for Boolean Functions over the Hypergrid [ n ] d
On the All-Pairs Euclidean Short Path Problem
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
Improved Approximation Results for Stochastic Knapsack Problems
Sampling from a moving window over streaming data
Inplace run-length 2d compressed search
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Polynomial integrality gaps for strong SDP relaxations of Densest k -subgraph
The streaming k-mismatch problem
A Competitive Strategy for Learning a Polygon
Practical Toroidality Testing
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
Deterministic Replacement Path Covering
On Minimizing Tardy Processing Time, Max-Min Skewed Convolution, and Triangular Structured ILPs
Edge-weighted Online Stochastic Matching: Beating
Algorithms for Compile-Time Memory Optimization
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA
Simple Mechanisms for Non-linear Agents
Critical chromatic number and the complexity of perfect packings in graphs
Component structure of the vacant set induced by a random walk on a random graph
Random Access to grammar-Compressed Strings
Weak ε-nets and interval chains
Metric embeddings with outliers
Generating Low-Degree 2-Spanners
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Pattern matching with address errors: rearrangement distances
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls
Optimal Scheduling of Multiclass Parallel Machines
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization
Strengthening integrality gaps for capacitated network design and covering problems
LRU is Better than FIFO
Packing cycles in planar and bounded-genus graphs
Spanning Trees Short or Small
On the (in)security of hash-based oblivious RAM and a new balancing scheme
Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game
Coloring powers of planar graphs
The Time Complexity of Fully Sparse Matrix Multiplication
Competitive on-line stream merging algorithms for media-on-demand
The threshold for SDP-refutation of random regular NAE-3SAT
Dynamic Generation of Discrete Random Variates
Algorithms for the coalitional manipulation problem
Approximation algorithms for data placement on parallel disks
Entropy-preserving cuttings and space-efficient planar point location
Algorithms and Complexity Analysis for Some Flow Problems
Tight Bounds on Vertex Connectivity Under Vertex Sampling
Exponential Separations in Local Differential Privacy
Complete partitions of graphs
Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
Optimal random number generation from a biased coin
Approximating the Minimum Equivalent Diagraph
Faster Approximate All Pairs Shortest Paths
A Local Search Framework for Experimental Design
Beyond the Richter-Thomassen Conjecture
Clinching Auction with Online Supply
Improved bounds for the symmetric rendezvous value on the line
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
A Nearly Instance Optimal Algorithm for Top- k Ranking under the Multinomial Logit Model
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic
Code Equivalence and Group Isomorphism
Root comparison techniques applied to computing the additively weighted Voronoi diagram
Efficient d -ary Cuckoo Hashing at High Load Factors by Bubbling Up
Scheduling with Conflicts, and Applications to Traffic Signal Control
Matroids, secretary problems, and online mechanisms
One (more) line on the most Ancient Algorithm in History
A Sublinear-Time Algorithm for Nearly-Perfect Matchings in Regular Non-Bipartite Graphs
The Aquarium Keeper's Problem
Jointly Private Convex Programming
A simple GAP-canceling algorithm for the generalized maximum flow problem
A PTAS for subset TSP in minor-free graphs
Tight Bounds for On-Line Tree Embeddings
Dihedral Bounds for Mesh Generation in High Dimensions
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
The shifting sands algorithm
The switch Markov chain for sampling irregular graphs (Extended Abstract)
Edge-Connectivity Augmentation with Partition Constraints
Fast approximate pattern matching with few indels via embeddings
Balancing Steiner trees and shortest path trees online
Finding Steiner Forests in Planar Graphs
Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma
Query-efficient algorithms for polynomial interpolation over composites
Computing Univariate GCDs over Number Fields
Sublinear time approximation of the cost of a metric k -nearest neighbor graph
Multi-budgeted Matchings and Matroid Intersection via Dependent Rounding
Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research
Cactus Representation of Minimum Cuts: Derandomize and Speed up
Online Stochastic Matching: Online Actions Based on Offline Statistics
Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)
Adaptive Discrete Phase Retrieval
Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract)
Towards PTAS for Precedence Constrained Scheduling via Combinatorial Algorithms
Single-Source Unsplittable Flows in Planar Graphs
The influence of search engines on preferential attachment
Word encoding tree connectivity works
Deterministic counting Lovász local lemma beyond linear programming
A Parameterized Family of Meta-Submodular Functions
Breaking the k / log k Barrier in Collective Tree Exploration via Tree-Mining
Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
Two tricks to triangulate chordal probe graphs in polynomial time
Towards a 4/3 approximation for the asymmetric traveling salesman problem
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
Strong bias of group generators: an obstacle to the "product replacement algorithm"
Regular Expression Matching with Multi-Strings and Intervals
Simple Delegated Choice
Learning Privately with Labeled and Unlabeled Examples
Experimental Performance of Shared RSA Modulus Generation
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
Hypergraph regularity and quasi-randomness
Extended Formulation Lower Bounds for Refuting Random CSPs
Output-sensitive Skyline Algorithms in External Memory
Using hashing to solve the dictionary problem
Optimal column-based low-rank matrix reconstruction
Spatial mixing and the connective constant: Optimal bounds
Optimal and Efficient Parametric Auctions
Moments of Inertia and Graph Separators
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles
Planar Multiway Cut with Terminals on Few Faces
Bounded Space On-Line Bin Packing: Best is Better than First
Overlap matching
Tree packing and approximating k-cuts
Parks and Recreation: Color Fault-Tolerant Spanners Made Local
An Oracle-Polynomial Time Augmentation Algorithm for Integer Programming
A Constant Factor Approximation Algorithm for Fault-Tolerant k -Median
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum
Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment
Directed scale-free graphs
Hamiltonicity and colorings of arrangement graphs
2nd Symposium on Simplicity in Algorithms, SOSA 2019, San Diego, CA, USA, January 8-9, 2019
The Entropy of Backwards Analysis
Efficient Randomized Algorithms for the Repeated Median Line Estimator
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs
Minimum Convex Hull and Maximum Overlap of Two Convex Polytopes
Average Case Analysis of Dynamic Graph Algorithms
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws
Tighter Low-rank Approximation via Sampling the Leveraged Element
Computing the Covers of a String in Linear Time
Flow-Cut Gaps and Face Covers in Planar Graphs
An Improved Distributed Algorithm for Maximal Independent Set
Fast Space Optimal Leader Election in Population Protocols
On k -Median clustering in high dimensions
Even strongly universal hashing is pretty fast
Ray shooting amid balls, farthest point from a line, and range emptiness searching
The bin-covering technique for thresholding random geometric graph properties
Randomized k -server algorithms for growth-rate bounded graphs
Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges
Better Sum Estimation via Weighted Sampling
Linear kernels for (connected) dominating set on H -minor-free graphs
Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions
Testing bipartiteness of geometric intersection graphs
Approximation Algorithms for Steiner Tree Augmentation Problems
A Unifying Framework for Differentially Private Sums under Continual Observation
On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
Multiplicative Equations over Commuting Matrices
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
Efficient Algorithms for Petersen's Matching Theorem
On the Exact Space Complexity of Sketching and Streaming Small Norms
Locally Private k -Means Clustering
Maximum independent sets in graphs of low degree
A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma
Online Resource Minimization
Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract)
On the complexity of optimal homotopies
Delaunay Bifiltrations of Functions on Point Clouds
Towards a complete characterization of tries
The k -mismatch problem revisited
Density and regularity theorems for semi-algebraic hypergraphs
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints
Induced subgraphs of bounded treewidth and the container method
Path-independent load balancing with unreliable machines
Cell-probe bounds for online edit distance and other pattern matching problems
Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology
Efficient algorithms for some special cases of the polynomial equivalence problem
Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
Recognizing dart-free perfect graphs
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
Implicit dictionaries with O (1) modifications per update and fast search
Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
Tight bounds for the partial-sums problem
Optimal constrained graph exploration
On the Number of Eularian Orientations of a Graph
Construction of probe interval models
Online Discrepancy with Recourse for Vectors and Graphs
Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs
A network formation game for bipartite exchange economies
Approximating the k -multicut problem
Computing Simplicial Representatives of Homotopy Group Elements
Edge disjoint paths revisited
When and Why the Topological Coverage Criterion Works
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time
Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions
A near-tight approximation lower bound and algorithm for the kidnapped robot problem
Evaluating the cylindricity of a nominally cylindrical point set
Efficient hashing with lookups in two memory accesses
Randomized Online Matching in Regular Graphs
On-line scheduling of a single machine to minimize total weighted completion time
On colorings of squares of outerplanar graphs
How to guess an n-digit number
Using Separation Algorithms in Fixed Dimension
A little advice can be very helpful
Treetopes and their Graphs
Approximation for minimum triangulation of convex polyhedra
Combinatorial algorithms for web search engines: three success stories
Combinatorial Approximation Algorithms for Generalized Flow Problems
On the Equilibria of Alternating Move Games
Generalized Unrelated Machine Scheduling Problem
Algorithms for the Densest Sub-Lattice Problem
Improved algorithms for orienteering and related problems
Almost-Delaunay simplices: nearest neighbor relations for imprecise points
Tight running times for minimum <italic>ℓ q </italic>-norm load balancing: beyond exponential dependencies on 1/<italic>∊</italic>
Rolling backwards can move you forward: on embedding problems in sparse expanders
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
Dynamic Low-Stretch Spanning Trees in Subpolynomial Time
Approximating the two-level facility location problem via a quasi-greedy approach
List-color-critical graphs on a fixed surface
Local versus global properties of metric spaces
Algorithms for Graphic Polymatroids and Parametric s-Sets
Tight Analysis of Parallel Randomized Greedy MIS
Linear reductions of maximum matching
On Near-Linear-Time Algorithms for Dense Subset Sum
Dichotomy for Holant* Problems of Boolean Domain
A new look at survey propagation and its generalizations
Frozen variables in random boolean constraint satisfaction problems
Equitable colorings with constant number of colors
Multidimensional balanced allocations
Computing Shortest Paths amid Pseudodisks
Balanced Aspect Ratio Trees: Combining the Advantages of k -d Trees and Octrees
Decomposing the Complement of the Union of Cubes in Three Dimensions
Relative Neighborhood Graphs in Three Dimensions
Dichotomy for Real Holant c Problems
Optimal Construction of Edge-Disjoint Paths in Random Graphs
Shuffling cards, adding numbers, and symmetric functions
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
Improved Bi-point Rounding Algorithms and a Golden Barrier for k -Median
Count on CFI graphs for #P-hardness
Approximate Maximum Flow on Separable Undirected Graphs
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations
Approximating capacitated k -median with (1 + ∊) k open facilities
Coloring k-colorable graphs using smaller palettes
Circular Separability of Polygon
Layered multicast scheduling for the L infinity objective
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent
Correlation Robust Stochastic Optimization
A Practical Clustering Algorithm for Static and Dynamic Information Organization
A Tight (3/2 + ∈ )-Approximation Algorithm for Demand Strip Packing
An Efficient Algorithm for Generating Necklaces with Fixed Density
Approximate distance oracles for unweighted graphs in Õ(n 2 ) time
A Better Algorithm for an Ancient Scheduling Problem
Sequential auctions and externalities
Tight Bounds for Online Graph Partitioning
Almost all hypergraphs without Fano planes are bipartite
Differentially Private Combinatorial Optimization
Computing a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property
Infinite-Duration All-Pay Bidding Games
Half-integrality, LP-branching and FPT Algorithms
Approximation algorithms for embedding general metrics into trees
Four point conditions and exponential neighborhoods for symmetric TSP
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity
High-order entropy-compressed text indexes
Towards a Characterization of Constant-Factor Approximable Min CSPs
Non-Clairvoyant Scheduling
Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation
The Primal Pathwidth SETH
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games
Approximating Traveling Salesman Problems Using a Bridge Lemma
Constrained Signaling in Auction Design
Algorithmic regularity for polynomials and applications
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree
Colored range closest-pair problem under general distance functions
A simpler implementation and analysis of Chazelle's soft heaps
Computing Morse Functions on Triangulated Manifolds
A tight threshold for metric Ramsey phenomena
Tightening Curves on Surfaces Monotonically with Applications
The k -Client Problem
Stochastic Load Balancing on Unrelated Machines
A General Approximation Technique for Constrained Forest Problems
The Bane of Low-Dimensionality Clustering
The complexity of simulating Brownian Motion
Mimicking Networks and Succinct Representations of Terminal Cuts
Positivity Problems for Low-Order Linear Recurrence Sequences
Sparse induced subgraphs in P 6 -free graphs
A 1.5-Approximation for Path TSP
Scheduling to minimize average stretch without migration
Computing the nucleolus of weighted voting games
Metric cotype
Combinatorial Stationary Prophet Inequalities
An exact characterization of tractable demand patterns for maximum disjoint path problems
Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming
Optimal parallel selection
Relating Interleaving and Fréchet Distances via Ordered Merge Trees
(1+ Є)-approximation for facility location in data streams
The Two-Sided Game of Googol and Sample-Based Prophet Inequalities
Solving d- SAT via Backdoors to Small Treewidth
An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph
Sketching valuation functions
Sampling on the Sphere by Mutually Orthogonal Subspaces