yusuke1997/dblp-id-title huggingface dataset:
Fast Approximation Algorithms for Piercing Boxes by Points
Balanced Allocation: Patience is not a Virtue
Obstructions for three-coloring graphs with one forbidden induced subgraph
Graph distances in the streaming model: the value of space
Shortest Paths Algorithms: Theory and Experimental Evaluation
The expected value of random minimal length spanning tree of a complete graph
On-line Algorithms for Compressing Planar Curves
List Decodable Learning via Sum of Squares
Primal-dual approach for directed vertex connectivity augmentation and generalizations
Playing Mastermind with Many Colors
Conformance testing in the presence of multiple faults
Bounding the Diffuse Adversary
The P-range Tree: A New Data Structure for Range Searching in Secondary Memory
On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings
Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract)
Greedy optimal homotopy and homology generators
Coupling with the stationary distribution and improved sampling for colorings and independent sets
Near-optimal approximation algorithm for simultaneous Max-Cut
New Approximation Schemes for Unsplittable Flow on a Path
Separation in Correlation-Robust Monopolist Problem with Budget
Finding a heaviest triangle is not harder than matrix multiplication
Optimal time-space trade-offs for non-comparison-based sorting
Randomized greedy: new variants of some classic approximation algorithms
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation
A Space-Time Tradeoff for Permutation Problems
Finding Perfect Matchings in Dense Hypergraphs
New approaches to covering and packing problems
Exact distance oracles for planar graphs
Sandpile transience on the grid is polynomially bounded
Competitive Strategies for Symmetric Rendezvous on the Line
Fault Tolerant Approximate BFS Structures
Approximating Matrix Multiplication for Pattern Recognition Tasks
Column subset selection, matrix factorization, and eigenvalue optimization
Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification
A Truthful Cardinal Mechanism for One-Sided Matching
Self-Stabilizing Algorithms for Synchronous Unidirectional Rings
Testing Poisson Binomial Distributions
Towards robust and efficient computation in dynamic peer-to-peer networks
Collecting correlated information from a sensor network
Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons
On Algorithm Design for Metrical Task Systems
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
The Canadian Traveller Problem
On distributions computable by random walks on graphs
A tight quasi-polynomial bound for Global Label Min-Cut
Fine-grained hardness of CVP(P) - Everything that we can prove (and nothing else)
Just the Fax - Differentiating Voice and Fax Phone Lines Using Call Billing Data
Dynamic Dictionary with Subconstant Wasted Bits per Key
Higher degree sum-of-squares relaxations robust against oblivious outliers
The uniform hardcore lemma via approximate Bregman projections
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
Better Data Structures for Colored Orthogonal Range Reporting
On levels in arrangements of surfaces in three dimensions
Approximating fixation probabilities in the generalized Moran process
Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time
Dynamic Double Auctions: Towards First Best
Accurate approximations for Asian options
Distribution-free Testing for Halfspaces (Almost) Requires PAC Learning
Approximation algorithms for extensible bin packing
Quasi-regular sequences and optimal schedules for security games
Efficient Õ ( n / ∊ ) Spectral Sketches for the Laplacian and its Pseudoinverse
Popularity vs maximum cardinality in the stable marriage setting
Spanners and emulators with sublinear distance errors
The Power of Clairvoyance for Multi-Level Aggregation and Set Cover with Delay
Secretary Problems: The Power of a Single Sample
Low-distortion Inference of Latent Similarities from a Multiplex Social Network
Experimental Studies of Access Graph Based Heuristics: Beating the LRU Standard?
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings
New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
The (1 + beta)-Choice Process and Weighted Balls-into-Bins
Targeting and Signaling in Ad Auctions
On risks of using cuckoo hashing with simple universal hash classes
Exact and approximation algorithms for minimum-width cylindrical shells
The communication and streaming complexity of computing the longest common and increasing subsequences
Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry
A Competitive 3-Server Algorithm
Dynamic Point Location in General Subdivisions
From coding theory to efficient pattern matching
Packing A -paths in Group-Labelled Graphs via Linear Matroid Parity
Greedy spanners are optimal in doubling metrics
Linear phase transition in random linear constraint satisfaction problems
Distance Oracles for Stretch Less Than 2
Online Prediction in Sub-linear Space
The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction
Efficient Maintenance of the Union Intervals on a Line, with Applications
Distributed Degree Splitting, Edge Coloring, and Orientations
Steiner points in tree metrics don't (really) help
On-Line Difference Maximization
On Traversing Layered Graphs On-line
Efficient Exact Sampling from the Ising Model Using Swendsen-Wang
Local Rules for Protein Folding on a Triangular Lattice and Generalized Hydrophobicity in the HP Model
Basis Reduction and the Complexity of Brand-and-Bound
Exploiting Metric Structure for Efficient Private Query Release
Catalan structures and dynamic programming in H -minor-free graphs
Forcing relations for AND/OR precedence constraints
On Approximability of the Minimum-Cost k -Connected Spanning Subgraph Problem
An Optimal Algorithm for Approximate Nearest Neighbor Searching
An O(n 2 ) Algorithm for Circular-Arc Graph Recognition
Fully dynamic approximation schemes on planar and apex-minor-free graphs
Improved Spectral Density Estimation via Explicit and Implicit Deflation
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
A Nonlinear Approach to Dimension Reduction
Scheduling Calls for Multicasting in Tree-Networks
Distributed Algorithms Made Secure: A Graph Theoretic Approach
ETH Hardness for Densest- k -Subgraph with Perfect Completeness
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract)
Kinetic Collision Detection Between Two Simple Polygons
On hierarchical routing in doubling metrics
Bidimensionality and Kernels
Faster Deterministic Sorting and Priority Queues in Linear Space
Decrementai Transitive Closure and Shortest Paths for Planar Digraphs and Beyond
Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
Strong Connectivity in Directed Graphs under Failures, with Applications
Almost Euclidean subspaces of l N 1 via expander codes
Integer Programming with GCD Constraints
A Simple FPTAS for Counting Edge Covers
The complexity of detecting taut angle structures on triangulations
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits
Combinatorial approximation algorithms for the maximum directed cut problem
Congestion Minimization for Multipath Routing via Multiroute Flows
Preprocessing an undirected planar network to enable fast approximate distance queries
TSP-based curve reconstruction in polynomial time
Quartic quantum speedups for planted inference
An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem
Size complexity of volume meshes vs. surface meshes
Finding a Bounded-Degree Expander Inside a Dense One
Numerical Taxonomy on Data: Experimental Results
On the Mysteries of MAX NAE-SAT
Trade-offs on the location of the core node in a network
A satisfiability algorithm for AC 0
On the Cell Probe Complexity of Dynamic Membership
Probabilistic Analysis for Scheduling with Conflicts
Approximating the k -Level in Three-Dimensional Plane Arrangements
Approximating the Number of Zeroes of a GF[2] Polynomial
Collusion-resistant mechanisms for single-parameter agents
Jenga
Approximating connected facility location problems via random facility sampling and core detouring
Compact Routing with Minimum Stretch
Multilevel Adaptive Hashing
Beating Bellman's Algorithm for Subset Sum
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
Better Approximation Guarantees for Job-shop Scheduling
Domatic partitions and the Lovász local lemma
On the Optimality of Spiral Search
Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane
Approximation Algorithms for the Achromatic Number
A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number
The directed circular arrangement problem
Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling
Constrained-Order Prophet Inequalities
Optimal Link Path Queries in a Simple Polygon
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production
Designing networks with good equilibria
Approximate line nearest neighbor in high dimensions
Fast Generation of Random Spanning Trees and the Effective Resistance Metric
Single source distance oracle for planar digraphs avoiding a failed node or link
Improved Concentration Bounds for Count-Sketch
The Submodular Santa Claus Problem
Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
Optimization problems in multiple-interval graphs
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning
A Mazing 2+ ∊ Approximation for Unsplittable Flow on a Path
On the insertion time of random walk cuckoo hashing
Permutation Property Testing under Different Metrics with Low Query Complexity
On complete classes of valuated matroids
Efficient Approximation Algorithms for the Hamming Center Problem
Bottleneck links, variable demand, and the tragedy of the commons
When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?
Metastability of logit dynamics for coordination games
Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three
The unreasonable effectiveness of martingales
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ ( n 5/3 ) Time
Communication Complexity of Combinatorial Auctions with Submodular Valuations
A Multi-Dimensional Online Contention Resolution Scheme for Revenue Maximization
Analyzing and characterizing small-world graphs
Obnoxious centers in graphs
Robust PCA and clustering in noisy mixtures
Estimating the sortedness of a data stream
Counting Networks with Arbitrary Fan-Out
Testing graph isomorphism
Approximating unique games
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs
Multi-transversals for Triangles and the Tuza's Conjecture
On the power of two, three and four probes
Firefighting on Trees Beyond Integrality Gaps
Fast Algorithms for Sorting and Searching Strings
Blocking Optimal k -Arborescences
Dynamic Generalized Closest Pair: Revisiting Eppstein's Technique
Stable Husbands
Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth
On Simultaneous Two-player Combinatorial Auctions
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020
Quantum Locally Recoverable Codes
Towards Optimal Algorithms for Prediction with Expert Advice
A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
Improved girth approximation in weighted undirected graphs
Rangesum histograms
Computing Walrasian Equilibria: Fast Algorithms and Structural Properties
Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph
On profit-maximizing envy-free pricing
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
Structural and algorithmic aspects of massive social networks
Constructing pseudo-random permutations with a prescribed structure
A Faster Deterministic Maximum Flow Algorithm
On the Complexity of Dynamic Mechanism Design
Streaming complexity of CSPs with randomly ordered constraints
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover
On Likely Solutions of a Stable Matching Problem
Domain Reduction for Monotonicity Testing: A o ( d ) Tester for Boolean Functions in d -Dimensions
An efficient algorithm for the configuration problem of dominance graphs
Tightening non-simple paths and cycles on surfaces
Testing Ising Models
Polynomial time approximation schemes for the traveling repairman and other minimum latency problems
Persistence, Amortization and Randomization
The I/O complexity of Toom-Cook integer multiplication
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
Matroid Secretary for Regular and Decomposable Matroids
Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract)
Algorithms for infinite huffman-codes
Approximately optimal control of fluid networks
Nearly Optimal Approximate Dual-Failure Replacement Paths
Ultra-low-dimensional embeddings for doubling metrics
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy
LP decoding achieves capacity
First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space
Directed Tangle Tree-Decompositions and Applications
Sorting by placement and shift
Almost Envy-Freeness with General Valuations
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
Bandit Algorithms for Prophet Inequality and Pandora's Box
Improved quantum query algorithms for triangle finding and associativity testing
Randomized Fully-Scalable BSP Techniques for Multi-Searching and Convex Hull Construction (Preliminary Version)
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016
Adaptive Hierarchical Clustering Using Ordinal Queries
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters
Dimensionality reduction: Beyond the Johnson-Lindenstrauss bound
A linear lower bound on index size for text retrieval
Balancing Minimum Spanning and Shortest Path Trees
Faster Construction of Planar Two-Centers
Secretary Problems: Laminar Matroid and Interval Scheduling
Fully Dynamic Connectivity in O (log n (log log n ) 2 ) Amortized Expected Time
Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces
(Un)expected Behavior of Typical Suffix Trees
The Dichotomy of List Homomorphisms for Digraphs
The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain
Maxima in Convex Regions
Clustering Mixtures of Bounded Covariance Distributions Under Optimal Separation
Bridging the Capacity Gap Between Interactive and One-Way Communication
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version)
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Quantum Algorithms for Highly Non-Linear Boolean Functions
Dynamic Dynamic Time Warping
On-Line Navigation in a Room
Average Sensitivity of Dynamic Programming
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
MST in O (1) Rounds of Congested Clique
Approximate Graph Colouring and Crystals
Improving Biconnectivity Approximation via Local Optimization
New Separations and Reductions for Directed Hopsets and Preservers
Fault-tolerant gathering algorithms for autonomous mobile robots
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D
How random is the human genome?
Almost Tight Bounds for Differentially Private Densest Subgraph
Online Sorting and Translational Packing of Convex Polygons
Approximate clustering without the approximation
Navigating nets: simple algorithms for proximity search
Semi-oblivious routing: lower bounds
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
The Complexity of Approximately Counting Retractions
Expander Decomposition and Pruning: Faster, Stronger, and Simpler
Fast greedy for linear matroids
Polynomial time recognition of P4-structure
A spectral technique for random satisfiable 3CNF formulas
Approximately Stable, School Optimal, and Student-Truthful Many-to-One Matchings (via Differential Privacy)
A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer
Competitive routing in the half-θ 6 -graph
Simple Contention Resolution via Multiplicative Weight Updates
Finding a long directed cycle
Shortest Paths in an Arrangement with k Line Orientations
Why simple hash functions work: exploiting the entropy in a data stream
New lower bounds for oblivious routing in undirected graphs
Breaking the n log n Barrier for Solvable-Group Isomorphism
Directed network design with orientation constraints
Synchrony and Asynchrony in Neural Networks
Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract
Browsing around a digital library
Parameter-free Locality Sensitive Hashing for Spherical Range Reporting
Embeddability of Simplicial Complexes is Undecidable
Better Algorithms and Hardness for Broadcast Scheduling via a Discrepancy Approach
Deterministic Algorithms for the Lovász Local Lemma
Approximation Algorithms for the Maximum Acyclic Subgraph Problem
Distributionally Robust Max Flows
A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model
Non-independent randomized rounding
Data Structures for Mobile Data
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
Average-radius list-recoverability of random linear codes
On Computability of Equilibria in Markets with Production
Robust Satisfiability of Systems of Equations
Spatial mixing and the random-cluster dynamics on lattices
Between O(nm) and O(n alpha)
Cubic upper and lower bounds for subtrajectory clustering under the continuous Fréchet distance
Torpid mixing of simulated tempering on the Potts model
Embedding metric spaces in their intrinsic dimension
Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams
Optimal pattern matching in LZW compressed strings
Maximum s-t -flow with k crossings in O ( k 3 n log n ) time
On allocations that maximize fairness
Approximation Algorithms for Finding Maximum Induced Expanders
On the hardness of pricing loss-leaders
Approximating Multicut and the Demand Graph
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018
An Elementary Predictor Obtaining Distance to Calibration
The menu complexity of "one-and-a-half-dimensional" mechanism design
Constructing Many Faces in Arrangements of Lines and Segments
Compressing rectilinear pictures and minimizing access control lists
A Data Structure for Arc Insertion and Regular Path Finding
Computing the shortest path: A search meets graph theory
File Maintenance: When in Doubt, Change the Layout!
The approximation complexity of win-lose games
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology
Faster Computation of 3-Edge-Connected Components in Digraphs
Compact representations of separable graphs
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
A proof of the Boyd-Carr conjecture
A faster method for sampling independent sets
A semidefinite programming approach to tensegrity theory and realizability of graphs
A Simple O (log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
Distributed Paging for General Networks
Space-Optimal Majority in Population Protocols
Methods for Achieving Fast Query Times in Point Location Data Structures
Labelings vs. Embeddings: On Distributed Representations of Distances
Closest-point problems simplified on the RAM
Generating well-shaped Delaunay meshed in 3D
A Polynomial Algorithm for Abstract Maximum Flow
Computational Hardness of the Hylland-Zeckhauser Scheme
Computing the Fréchet Distance between Real-Valued Surfaces
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
Static and kinetic geometric spanners with applications
Tight Sampling Bounds for Eigenvalue Approximation
Kirchhoff Index as a Measure of Edge Centrality in Weighted Networks: Nearly Linear Time Algorithms
Appointment scheduling with discrete random durations
Spectral Independence Beyond Total Influence on Trees and Related Graphs
Median Bounds and Their Application
Flushing Without Cascades
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Hierarchies of Minion Tests for PCSPs through Tensors
Online scheduling to minimize the maximum delay factor
Computational Concentration of Measure: Optimal Bounds, Reductions, and More
Estimators and tail bounds for dimension reduction in l α (0 < α ≤ 2) using stable random projections
On Playing "Twenty Questions" with a Liar
Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability
Factor Refinement
Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths
Maximal k -Edge-Connected Subgraphs in Weighted Graphs via Local Random Contraction
Nested Convex Bodies are Chaseable
Optimal Listing of Cycles and st-Paths in Undirected Graphs
Comparing Point Sets Under Projection
Distribution-sensitive point location in convex subdivisions
Correlation Clustering: maximizing agreements via semidefinite programming
Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study
Fast Constructions of Light-Weight Spanners for General Graphs
Parallelism and time in hierarchical self-assembly
Uniform random sampling of simple branched coverings of the sphere by itself
Buckets, Heaps, Lists, and Monotone Priority Queues
Continuous Local Search
Lower Bounds for Testing Triangle-freeness in Boolean Functions
Representing Sets with Constant Time Equality Testing
A 5/4-approximation algorithm for minimum 2-edge-connectivity
A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs
Core congestion is inherent in hyperbolic networks
Random walks, electric networks and the transience class problem of sandpiles
Cell-Probe Lower Bounds for Succinct Partial Sums
Frugality in path auctions
Electrostatic Fields without Singularities: Theory and Algorithms
On Optimal Strategies for Searching in Presence of Errors
An algorithmic decomposition of claw-free graphs leading to an O(n 3 )-algorithm for the weighted stable set problem
Improved Approximation Algorithms for Scheduling with Release Dates
New Approximability Results for Two-Dimensional Bin Packing
On the performance of user equilibria in traffic networks
Algorithmic Extensions of Dirac's Theorem
New Techniques for Approximating Complex Polynomial Zeros
On-Line Caching as Cache Size Varies
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees