yusuke1997/dblp-id-title huggingface dataset:
Graph balancing: a special case of scheduling unrelated parallel machines
A Nearly-Linear Bound for Chasing Nested Convex Bodies
A New Property and a Faster Algorithm for Baseball Elimination
Online Edge Coloring Algorithms via the Nibble Method
Breaking the 𝒪( n )-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees
Graph Classes with Few Minimal Separators. II. A Dichotomy
An Improved Approximation for Maximum Weighted k -Set Packing
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier
Simultaneous approximations for adversarial and stochastic online budgeted allocation
On the shared substring alignment problem
Metric clustering via consistent labeling
Girth restrictions for the 5-flow conjecture
Analyzing BitTorrent and related peer-to-peer networks
Fast and Effective Stripification of Polygonal Surface Models
Finding the Repeated Median Regression Line
The Complexity of Heaps
Discrepancy Minimization via Regularization
Bounded-leg distance and reachability oracles
Meldable RAM priority queues and minimum directed spanning trees
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
From Sir Isaac to the Sloan Survey: Calculating the Structure and Chaos Owing to Gravity in the Universe
On Sketching Matrix Norms and the Top Singular Vector
Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint
Sublinear time, measurement-optimal, sparse recovery for all
Improved bounds on the average length of longest common subsequences
Zone diagrams: existence, uniqueness and algorithmic challenge
Linear-time algorithms for geometric graphs with sublinearly many crossings
Local Search for Weighted Tree Augmentation and Steiner Tree
Compact representations of ordered sets
Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary
Lower bound for sparse Euclidean spanners
A Near-Linear Area Bound for Drawing Binary Trees
CLAP: A New Algorithm for Promise CSPs
Dissections and trees, with applications to optimal mesh encoding and to random sampling
Spectral clustering with limited independence
Finding the Jaccard Median
Improved Approximations for the Steiner Tree Problem
Approximation Schemes for 0-1 Knapsack
Quasi-Monte Carlo Beyond Hardy-Krause
Clustering for Faster Network Simplex Pivots
Buffer minimization using max-coloring
Clustering Affine Subspaces: Hardness and Algorithms
Simple and Nearly Optimal Multi-Item Auctions
On Approximability of Clustering Problems Without Candidate Centers
Iterative Refinement for ℓp-norm Regression
Finding orthogonal vectors in discrete structures
Active Self-Assembly of Simple Units Using an Insertion Primitive
Local Statistics, Semidefinite Programming, and Community Detection
Pseudorandomness for read-k DNF formulas
Deterministic parallel algorithms for fooling polylogarithmic juntas and the Lovász Local Lemma
Vertical ray shooting and computing depth orders for fat objects
Expected-case complexity of approximate nearest neighbor searching
Sublinear time approximate clustering
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios
More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems
A general approach for incremental approximation and hierarchical clustering
Beating Exhaustive Search for Quantified Boolean Formulas and Connections to Circuit Complexity
Declaring independence via the sketching of sketches
On largest volume simplices and sub-determinants
Fast Parallel Algorithms for the Clique Separator Decomposition
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs
Improved Approximation Algorithm for Two-Dimensional Bin Packing
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids
Two-stage Stochastic Matching with Application to Ride Hailing
On clustering to minimize the sum of radii
Welfare Guarantees for Combinatorial Auctions with Item Bidding
Counting and detecting small subgraphs via equations and matrix multiplication
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model
New Combinatorial Insights for Monotone Apportionment
Constructing Laplace operator from point clouds in R d
Losing Treewidth In The Presence Of Weights
Computing Nearest Neighbors for Moving Points and Applications to Clustering
Data reduction for weighted and outlier-resistant clustering
Chasing Nested Convex Bodies Nearly Optimally
Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
Algorithms for #BIS-hard problems on expander graphs
Perfect Bayesian Equilibria in Repeated Sales
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach
SINR diagram with interference cancellation
Adaptive Shivers Sort: An Alternative Sorting Algorithm
On the relative strength of split, triangle and quadrilateral cuts
Torpid mixing of local Markov chains on 3-colorings of the discrete torus
A Hamilton Path for the Sigma-Tau Problem
Tight lower bound for the channel assignment problem
Provably good moving least squares
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
Maximizing Social Influence in Nearly Optimal Time
Shortest cycle through specified elements
Computing large matchings fast
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
The Hierarchy of Hereditary Sorting Operators
Distributed Zero-Knowledge Proofs Over Networks
Improved Approximations for Unrelated Machine Scheduling
Approximation Algorithms for Protein Folding Prediction
Parallel monotonicity reconstruction
Comparing top k lists
Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
On Parity Check (0, 1)-Matrix over Z p
Syndrome decoding of Reed-Muller codes and tensor decomposition over finite fields
A Probabilistic Algorithm for Updating Files over a Communication Link
Hyperbolic intersection graphs and (quasi)-polynomial time
Data Structures for Traveling Salesmen
Upper and Lower Bounds on Constructing Alphabetic Binary Trees
A Small Universal Graph for Bounded-degree Planar Graphs
Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
0/1 optimization and 0/1 primal separation are equivalent
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
The Power of Linear Reconstruction Attacks
The Change-of-Measure Method, Block Lewis Weights, and Approximating Matrix Block Norms
Steiner Point Removal - Distant Terminals Don't (Really) Bother
Improved Algorithms for Protein Motif Recognition
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS
The Stanford GraphBase: A Platform for Combinatorial Algorithms
Approximation algorithms via contraction decomposition
Non interactive simulation of correlated distributions is decidable
Approximating Sumset Size
Dimension reduction for finite trees in l 1
A complete resolution of the Keller maximum clique problem
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization
Embedding Probability Distributions into Low Dimensional ℓ 1 : Tree Ising Models via Truncated Metrics
Perfect matchings in random graphs with prescribed minimal degree
Combinatorial stochastic processes and nonparametric Bayesian modeling
The Algorithmic Aspects of Uncrowded Hypergraphs (Extended Abstract)
K -medians, facility location, and the Chernoff-Wald bound
Є-Samples for Kernels
Physarum can compute shortest paths
Dynamic Bridge-Finding in Õ (log 2 n ) Amortized Time
Prophet Secretary Through Blind Strategies
The Dynamic Servers Problem
Approximating Matrix p-norms
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
Strict Self-Assembly of Discrete Self-Similar Fractals in the abstract Tile Assembly Model
Constant Approximation Algorithm for Non-Uniform Capacitated Multi-Item Lot-Sizing via Strong Covering Inequalities
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Improved Bounds for Randomly Sampling Colorings via Linear Programming
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Bin Packing via Discrepancy of Permutations
Tight Streaming Lower Bounds for Deterministic Approximate Counting
Shortest Non-Crossing Walks in the Plane
On the Greedy Heuristic for Matchings
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract)
Random planar graphs with n nodes and a fixed number of edges
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
High-Dimensional Robust Mean Estimation in Nearly-Linear Time
Dynamic graph connectivity in polylogarithmic worst case time
On r-Simple k-Path and Related Problems Parameterized by k/r
Performance guarentee for online deadline scheduling in the presence of overload
Improved Approximations for Ultrametric Violation Distance
Competitive Data-Structure Dynamization
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs
Randomized Rounding Without Solving the Linear Program
Deterministic broadcasting in unknown radio networks
Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations
Set Covering with Our Eyes Wide Shut
A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing
Data streams: algorithms and applications
On the Optimality of Parsing in Dynamic Dictionary Based Data Compression
Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear Time
Approximate Core for Committee Selection via Multilinear Extension and Market Clearing
Tight Cell-Probe Bounds for Online Hamming Distance Computation
Polynomial Algorithms for Multiprocessor Scheduling with a Small Number of Job Lengths
Embeddability in ℝ 3 is NP-hard
Fully Dynamic Algorithms for Chordal Graphs
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs
Analysis of First-Come-First-Serve Parallel Job Scheduling
Improved Bounds for Testing Forbidden Order Patterns
The k-traveling repairman problem
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
On the Learnability of Random Deep Networks
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
On the hardness of finding balanced independent sets in random bipartite graphs
Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem
Matroid intersection, pointer chasing, and Young's seminormal representation of S n
Computing shortest paths with comparisons and additions
List Decoding with Double Samplers
Collapsing the Tower - On the Complexity of Multistage Stochastic IPs
The hyperring: a low-congestion deterministic data structure for distributed environments
Approximating Hereditary Discrepancy via Small Width Ellipsoids
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
Using Homogenous Weights for Approximating the Partial Cover Problem
Sublinear-time approximation of Euclidean minimum spanning tree
Algorithms for minimum volume enclosing simplex in R 3
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns
Algorithms Using Local Graph Features to Predict Epidemics
Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in O (log 3 n ) Worst Case Update Time
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
Differentiable Approximations for Distance Queries
Time-Space Lower Bounds for Bounded-Error Computation in the Random-Query Model
Faster exact and approximation algorithms for packing and covering matroids via push-relabel
On geometric permutations induced by lines transversal through a fixed point
On the Power of Relaxed Local Decoding Algorithms
Quantitative stochastic parity games
Online Facility Location against a t -Bounded Adversary
On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem
Dynamic algorithms for k -center on graphs
Quasirandom Load Balancing
Sandwiching random regular graphs between binomial random graphs
Near-optimal hierarchical matrix approximation from matrix-vector products
Tight Bounds on the Complexity of the Boyer-Moore String Matching Algorithm
Output-Sensitive Generation of Random Events
The Gotsman-Linial Conjecture is False
Testing convexity of functions over finite domains
A fractional model of the border gateway protocol (BGP)
RNC Algorithms for the Uniform Generation of Combinatorial Structures
Solving Fréchet Distance Problems by Algebraic Geometric Methods
Race Detection and Reachability in Nearly Series-Parallel DAGs
Connectivity in Random Forests and Credit Networks
Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics
Approximation Schemes for Scheduling
Four terminal planar Delta-Wye reducibility via rooted K 2, 4 minors
Construction of visual secret sharing schemes with almost optimal contrast
A randomly weighted minimum spanning tree with a random cost constraint
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
Combinatorial Prophet Inequalities
Structural and logical approaches to the graph isomorphism problem
Clustering for metric and non-metric distance measures
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
The MAX-CUT of sparse random graphs
Near-Optimal (Euclidean) Metric Compression
Partial covering of hypergraphs
Probabilistic analysis of linear programming decoding
Certified Computation of the Sign of a Matrix Determinant
Charity auctions on social networks
Parallel Virtual Memory
Near-optimal online auctions
A PTAS for ℓ 0 -Low Rank Approximation: Solving Dense CSPs over Reals
Online Coloring Known Graphs
Packing Steiner trees
Faster Rectangular Matrix Multiplication by Combination Loss Analysis
Routing and Admission Control in General Topology Networks with Poisson Arrivals
Broadcast Throughput in Radio Networks: Routing vs. Network Coding
Strong Connectivity Augmentation is FPT
Constraint Satisfaction Problems with Advice
Analysis of Random Processes via And-Or Tree Evaluation
On the Lattice Isomorphism Problem
Analysis of a Bounding Box Heuristic for Object Intersection
Time-Work Tradeoffs for Parallel Graph Algorithms
Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence
Stepwise randomized combinatorial auctions achieve revenue monotonicity
A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
Maximally Recoverable Codes for Grid-like Topologies
Lower bounds for embedding edit distance into normed spaces
Approximate Polynomials Gcds, Padé Approximation, Polynomial Zeros and Bipartite Graphs
Approximating Minimum Cost Connectivity Orientation and Augmentation
Fast Algorithms for Constructing Optimal Trees from Quartets
Nonplanar Topological Inference and Political-Map Graphs
Min-CSPs on Complete Instances
Maintaining significant stream statistics over sliding windows
Phase Transition for Glauber Dynamics for Independent Sets on Regular Trees
A Fine-Grained Perspective on Approximating Subset Sum and Partition
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
Poly-logarithmic Competitiveness for the k -Taxi Problem
Routing and scheduling in multihop wireless networks with time-varying channels
A New Algorithm for the Robust Semi-random Independent Set Problem
3-bit dictator testing: 1 vs. 5/8
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
Cut Tree Algorithms
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
Efficient coordination mechanisms for unrelated machine scheduling
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
Sparse source-wise and pair-wise distance preservers
Embedding Planar Graphs on the Grid
Randomized Cup Game Algorithms Against Strong Adversaries
A multiple-choice secretary algorithm with applications to online auctions
Efficient construction of unit circular-arc models
Equilibria in online games
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ 1 -Oblivious Routing
Linked decompositions of networks and the power of choice in Polya urns
Approximating Competitive Equilibrium by Nash Welfare
A Faster Algorithm for Finding the Minimum Cut in a Graph
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)
Minimizing average latency in oblivious routing
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees
Space-efficient Ray-shooting and Intersection Searching: Algorithms, Dynamization, and Applications
Approximability of Scheduling with Fixed Jobs
Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions
The Complexity of Simulation and Matrix Multiplication
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024
Deterministic network coding by matrix completion
Runtime Prediction of Real Programs on Real Machines
Quasi-popular Matchings, Optimality, and Extended Formulations
Fast practical solution of sorting by reversals
Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local Lemma
A polynomial time recognition algorithm for probe interval graphs
Convex Minimization with Integer Minima in Õ ( n 4 ) Time
Finding Perfect Matchings in Bipartite Hypergraphs
On permutations with limited independence
Worst-Case Efficient Priority Queues
How unfair is optimal routing?
Multicommodity facility location
On bounded leg shortest paths problems
Hardness Results for Homology Localization
Union-find with deletions
Gains-from-Trade in Bilateral Trade with a Broker
The Complexity of Contracts
Exact Distance Oracles for Planar Graphs with Failing Vertices
A Locality-Sensitive Hash for Real Vectors
A coarse Erdős-Pósa theorem
Average-Case Analysis of Off-Line and On-Line Knapsack Problems
Quasilinear-time eccentricities computation, and more, on median graphs
Faster Fully Dynamic Matchings with Small Approximation Ratios
Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement
The Variance of Two Game Tree Algorithms
Hiding Cliques for Cryptographic Security
Chernoff-Hoeffding Bounds for Applications with Limited Independence
Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems
Models of greedy algorithms for graph problems
On the approximability of Dodgson and Young elections
A Framework for Analyzing Resparsification Algorithms
Subexponential mixing for partition chains on grid-like graphs
Approximation Algorithms for Directed Steiner Problems
A near-linear algorithm for projective clustering integer points
Three-coloring triangle-free planar graphs in linear time
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
Minimum cost flows over time without intermediate storage
Prior-Independent Auctions for Heterogeneous Bidders
1st Symposium on Simplicity in Algorithms, SOSA 2018, New Orleans, LA, USA, January 7-10, 2018
The Full Degree Spanning Tree Problem
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022
The set-associative cache performance of search trees
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
A new bound for the Carathéodory rank of the bases of a matroid
Streaming Balanced Graph Partitioning Algorithms for Random Graphs
Efficient Document Exchange and Error Correcting Codes with Asymmetric Information
Throughput maximization of real-time scheduling with batching
About the Structure of the Integer Cone and its Application to Bin Packing
Private Mean Estimation with Person-Level Differential Privacy
Deterministic boundary recognition and topology extraction for large sensor networks
The Rigidity Transition in Random Graphs
More Applications of the Polynomial Method to Algorithm Design
A Near-Optimal Planarization Algorithm
An Efficient Uniqueness Theorem for Overcomplete Tensor Decomposition
On the Quickest Flow Problem in Dynamic Networks - A Parametric Min-Cost Flow Approach
How Compression and Approximation Affect Efficiency in String Distance Measures
An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract)
Derandomizing Algorithms for Routing and Sorting on Meshes
An (almost) Linear Time Algorithm for Odd Cyles Transversal
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021
The amortized cost of finding the minimum
On local search and placement of meters in networks
Efficient algorithms for computing all low s-t edge connectivities and related problems
The Min-Cost Matching with Concave Delays Problem
Sampling regular graphs and a peer-to-peer network
Sample-Optimal Density Estimation in Nearly-Linear Time
Paired Approximation Problems and Incompatible Inapproximabilities
Derandomized Balanced Allocation
Stabilizing Consensus with Many Opinions
Partitioning graphs into balanced components
Best-Fit Bin-Packing with Random Order
Wireless connectivity and capacity
Fast Information Spreading in Graphs with Large Weak Conductance
Locked and Unlocked Polygonal Chains in 3D
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
The effectiveness of Stackelberg strategies and tolls for network congestion games
Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion
Race to idle: new algorithms for speed scaling with a sleep state
Approximating Pathwidth for Graphs of Small Treewidth
Faster approximation schemes for fractional multicommodity flow problems
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
Lossless Prioritized Embeddings
The Scaling Window for a Random Graph with a Given Degree Sequence
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
Better approximation algorithms for bin covering
On Dynamic Graph Algorithms with Predictions
On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas
Lower bounds on the size of selection and rank indexes
Popularity, Mixed Matchings, and Self-duality
Approximation algorithms for stochastic and risk-averse optimization
An O(VE) algorithm for ear decompositions of matching-covered graphs
XOR Codes and Sparse Learning Parity with Noise
Breaking the Two Approximation Barrier for Various Consensus Clustering Problems
Matrix scaling by network flow
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses
On-line Randomized Call Control Revisited
Lower-bounded facility location
Additive approximation algorithms for list-coloring minor-closed class of graphs
List-coloring graphs without subdivisions and without immersions
On Linear and Semidefinite Programming Relaxations for Hypergraph Matching
On-Line Weighted Matching
Greedy Spanners in Euclidean Spaces Admit Sublinear Separators
Approximate Undirected Maximum Flows in O ( m polylog( n )) Time
Towards a theory of cache-efficient algorithms
A matroid approach to stable matchings with lower quotas
Analytic quantum weak coin flipping protocols with arbitrarily small bias
Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph
The Complexity of Gene Placement