yusuke1997/dblp-id-title huggingface dataset:
On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence
A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
A Framework for Searching in Graphs in the Presence of Errors
Constraint solving via fractional edge covers
On adaptive deterministic gossiping in ad hoc radio networks
Split Packing: An Algorithm for Packing Circles with Optimal Worst-Case Density
Distortion-Oblivious Algorithms for Minimizing Flow Time
Minimum moment Steiner trees
Chain decompositions and independent trees in 4-connected graphs
Making Octants Colorful and Related Covering Decomposition Problems
Morphing Binary Trees
Lyndon Words and Short Superstrings
Optimal Lower Bounds for Sketching Graph Cuts
Improved approximation algorithms for scheduling with fixed jobs
Improved algorithms for path, matching, and packing problems
Deterministic enumeration of all minimum k-cut-sets in hypergraphs for fixed k
Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance
On Survivable Set Connectivity
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
A Deterministic Parallel APSP Algorithm and its Applications
Tiling groups for Wang tiles
Geodesic Spanners for Points on a Polyhedral Terrain
Dynamic Algorithms for Matroid Submodular Maximization
Subtree Isomorphism Revisited
Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management
Optimal covering tours with turn costs
Reductions in streaming algorithms, with an application to counting triangles in graphs
Improving the Discrepancy Bound for Sparse Matrices: Better Approximations for Sparse Lattice Approximation Problems
Greedy Dynamic Routing on Arrays
Variable length path coupling
Weighted Graph Laplace Operator under Topological Noise
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
The Statistical Adversary Allows Optimal Money-Making Trading Strategies
A lower bound for scheduling mechanisms
Finding minimal triangulations of convex 3-polytopes is NP-hard
Expanders via random spanning trees
The Diffusion of Networking Technologies
A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions
Mean-field Potts and random-cluster dynamics from high-entropy initializations
Incentive Compatible Budget Elicitation in Multi-unit Auctions
A constant-time algorithm for middle levels Gray codes
Tight Bounds for Parallel Paging and Green Paging
Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities and Multiple Sources and Sinks
Minimizing Wirelength in Zero and Bounded Skew Clock Trees
Improved bounds and algorithms for graph cuts and network reliability
Distributed Metropolis Sampler with Optimal Parallelism
Genus and the Geometry of the Cut Graph
Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and more
Matrix Perturbation: Davis-Kahan in the Infinity Norm
Constructive algorithm for path-width of matroids
Minimum Makespan Scheduling with Low Rank Processing Times
Bidimensionality: new connections between FPT algorithms and PTASs
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly
The prize collecting Steiner tree problem: theory and practice
Approximation algorithms and hardness of the k -route cut problem
Internet packet filter management and rectangle geometry
Towards Tight(er) Bounds for the Excluded Grid Theorem
Shortest Disjoint Paths on a Grid
Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
Transforming Curves on Surfaces Redux
Potential Hessian Ascent: The Sherrington-Kirkpatrick Model
An approximation algorithm for finding a long path in Hamiltonian graphs
Non-clairvoyant scheduling with precedence constraints
Polycubes with Small Perimeter Defect
Scaling Algorithms for the Shortest Paths Problem
Near-Optimal Spanners for General Graphs in (Nearly) Linear Time
On Separating Points by Lines
Pricing Query Complexity of Revenue Maximization
Path and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
Estimating Interpolation Error: A Combinatorial Approach
Testing Approximate Stationarity Concepts for Piecewise Affine Functions
Low Degree Testing over the Reals
Approximating Permanent of Random Matrices with Vanishing Mean: Made Better and Simpler
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space
2-Approximation for Prize-Collecting Steiner Forest
Applying extra-resource analysis to load balancing
Connecting Robust Shuffle Privacy and Pan-Privacy
Finding least common ancestors in directed acyclic graphs
Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's"
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
On the optimality of approximation schemes for the classical scheduling problem
Sequential and Parallel Algorithms to Find a K 5 Minor
Fast algorithms for maximizing submodular functions
Subsampling Mathematical Relaxations and Average-case Complexity
New constructions of RIP matrices with fast multiplication and fewer rows
All-Pairs Small-Stretch Paths
Queueing Analysis of Oblivious Packet-Routing Networks
The Identity Problem for Matrix Semigroups in SL 2 (ℤ) is NP-complete
Optimal Dynamic Sequence Representations
All-Hops Shortest Paths
Quantum algorithms for Simon's problem over general groups
Towards (1 + ∊ )-Approximate Flow Sparsifiers
Mixing time and long paths in graphs
Triangulating Vertex Colored Graphs
Maintaining Matroid Intersections Online
Approximating vertex cover on dense graphs
Universal Perfect Samplers for Incremental Streams
On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres
On the complexity of binary polynomial optimization over acyclic hypergraphs
Compass Permits Leader Election
A Constant Factor Approximation Algorithm for Reordering Buffer Management
Sublinear-Round Broadcast without Trusted Setup
The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
Competitive Analysis with a Sample and the Secretary Problem
Zigzagging through acyclic orientations of chordal graphs and hypergraphs
Range Selection and Median: Tight Cell Probe Lower Bounds and Adaptive Data Structures
Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings
Voting with limited information and many alternatives
Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard
Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes
Optimal crowdsourcing contests
Bi-Factor Approximation Algorithms for Hard Capacitated k -Median Problems
Finding shortest contractible and shortest separating cycles in embedded graphs
Efficient Approximation and Optimization Algorithms for Computational Metrology
Massively Parallel and Dynamic Algorithms for Minimum Size Clustering
Testing Additive Integrality Gaps
The Power of Proportional Fairness for Non-Clairvoyant Scheduling under Polyhedral Constraints
Expanders via Local Edge Flips
Approximating LCS in Linear Time: Beating the √n Barrier
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
Load Balancing Requires Omega(log * n ) Expected Time
Approximating general metric distances between a pattern and a text
Combinatorial and Geometric Properties of Planar Laman Graphs
Reconstructing a History of Recombinations from a Set of Sequences
The complexity of approximately counting in 2-spin systems on k -uniform bounded-degree hypergraphs
Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices
The hiring problem and Lake Wobegon strategies
Online Min-Max Paging
Smoothed Analysis of Local Search for the Maximum-Cut Problem
Directed metrics and directed graph partitioning problems
Shape Replication through Self-Assembly and RNase Enzymes
A divide and conquer algorithm for d -dimensional arrangement
The Fast Cauchy Transform and Faster Robust Linear Regression
Selection with monotone comparison cost
Measure and conquer: a simple O(2 0.288 n ) independent set algorithm
A Hybrid Sampling Scheme for Triangle Counting
Approximating the Largest Root and Applications to Interlacing Families
Quasiconvex analysis of backtracking algorithms
On the Distributed Complexity of Computing Maximal Matchings
Lower bounds for collusion-secure fingerprinting
Aggregation of partial rankings, p -ratings and top- m lists
Fast Distance Multiplication of Unit-Monge Matrices
A tight Erdős-Pósa function for planar minors
Range Predecessor and Lempel-Ziv Parsing
The Focus of Attention Problem
Sorting Permutations by Transpositions
Submodular Maximization by Simulated Annealing
Efficient and Practical Modular Decomposition
Minimum Cut and Minimum k-Cut in Hypergraphs via Branching Contractions
Navigating an Infinite Space with Unreliable Movements
The interlace polynomial: a new graph polynomial
Online vertex colorings of random graphs without monochromatic subgraphs
Computing equilibria in multi-player games
Rapid Mixing for Colorings via Spectral Independence
On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture
Hiring for An Uncertain Task: Joint Design of Information and Contracts
Improved string reconstruction over insertion-deletion channels
Quantifying the Burden of Exploration and the Unfairness of Free Riding
Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem
Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs
Decremental maintenance of strongly connected components
Online Principal Components Analysis
Odd Cycle Transversal on P 5 -free Graphs in Quasi-polynomial Time
Approximating Discrete Collections via Local Improvements
Randomized Online Scheduling on Two Uniform Machines
Computing Lewis Weights to High Precision
The Vertex-Disjoint Menger Problem in Planar Graphs
Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H<-Minor-Free Graphs
Approximating asymmetric maximum TSP
Complexity Results and Algorithms for { <, <=, = }-Constrained Scheduling
Weighted flow time does not admit O(1)-competitive algorithms
Breaking the O( n2.5 ) Time Barrier for Undirected Unit-Capacity Maximum Flow
A characterization of easily testable induced subgraphs
Monotone minimal perfect hashing: searching a sorted table with O (1) accesses
Optimal On-line Algorithms for an Electronic Commerce Money Distribution System
Approximately Counting Knapsack Solutions in Subquadratic Time
On-line Complexity of Monotone Set Systems
Computing sequential equilibria for two-player games
Locality-sensitive Hashing without False Negatives
Stochastic Vertex Cover with Few Queries
Adaptive sampling for quickselect
The mixing time of the Newman: Watts small world
A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage
Games of fixed rank: a hierarchy of bimatrix games
Improved Coresets for Kernel Density Estimates
Holographic algorithms with unsymmetric signatures
Incremental DFS algorithms: a theoretical and experimental study
A Fast Algorithm for Computing Zigzag Representatives
Trading off space for passes in graph streaming problems
An improved approximation algorithm for the 0-extension problem
Labeling schemes for small distances in trees
Random Weighted Laplacians, Lovász Minimum Digraphs and Finding Minimum Separators
Fully Dynamic Matching: Beating 2-Approximation in Δ ϵ Update Time
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
Experimental analysis of dynamic all pairs shortest path algorithms
Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
Efficient Linear and Affine Codes for Correcting Insertions/Deletions
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA
Simple Pricing Schemes For Consumers With Evolving Values
A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs
Censorship resistant peer-to-peer content addressable networks
Compression boosting in optimal linear time using the Burrows-Wheeler Transform
Go with the Winners for Graph Bisection
Gowers Norm, Function Limits, and Parameter Estimation
Algorithmic Complexity of Power Law Networks
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
LP-branching algorithms based on biased graphs
The Secretary Problem with Independent Sampling
Packing tight Hamilton cycles in 3-uniform hypergraphs
Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy
Optimum Parallel Computations with Banded Matrices
Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
On the rectilinear crossing number of complete graphs
Online Nash Social Welfare Maximization with Predictions
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter
The matching problem has no small symmetric SDP
A PTAS for TSP with neighborhoods among fat regions in the plane
Competitive auctions and digital goods
Constructing high order elements through subspace polynomials
Let Sleeping Files Lie: Pattern Matching in Z-compressed Files
On polynomial approximation to the shortest lattice vector length
Competitive Algorithms for Generalized k -Server in Uniform Metrics
The interface between computational and combinatorial geometry
On the approximability of some network design problems
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free
Suffix Arrays: A New Method for On-Line String Searches
Packing anchored rectangles
Algorithms for weighted independent transversals and strong colouring
Spanning closed walks and TSP in 3-connected planar graphs
Every Collinear Set in a Planar Graph Is Free
Overcoming the l 1 non-embeddability barrier: algorithms for product metrics
Faster p -norm minimizing flows, via smoothed q -norm problems
Improved approximation bound for quadratic optimization problems with orthogonality constraints
Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations
Parameter-free Topology Inference and Sparsification for Data on Manifolds
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem
Having Hope in Missing Spanners: New Distance Preservers and Light Hopsets
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
Online Lower Bounds via Duality
Linear-Time Transitive Orientation
Tight Bounds for Online TSP on the Line
Coloring and Maximum Weight Independent Set of Rectangles
Independence and Efficient Domination on P 6 -free Graphs
Faster Deterministic Distributed Coloring Through Recursive List Coloring
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
Polynomial bounds for centered colorings on proper minor-closed graph classes
Cliquewidth and Dimension
An optimal algorithm for hyperplane depth in the plane
Improved Sublinear Time Algorithm for Longest Increasing Subsequence
On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood
On Belief Propagation Guided Decimation for Random k-SAT
Optimal Bounds for Matching Routing on Trees
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs
Robust Load Balancing with Machine Learned Advice
Exact Flow Sparsification Requires Unbounded Size
Improved Local Computation Algorithm for Set Cover via Sparsification
Tolls for Dynamic Equilibrium Flows
Lattice Sparsification and the Approximate Closest Vector Problem
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
Incremental and Decremental Maintenance of Planar Width
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps
On properties of random dissections and triangulations
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles
The Complexity of Flat Origami
The complexity of quantitative concurrent parity games
Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change
Near-Optimal Sublinear Time Algorithms for Ulam Distance
Flow and Stretch Metrics for Scheduling Continuous Job Streams
Online Network Design Algorithms via Hierarchical Decompositions
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms
An Improved Approximation Ratio for the Minimum Latency Problem
David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems
Finding Optimal Edge-Rankings of Trees
Information dissemination via random walks in d -dimensional space
Can entropy characterize performance of online algorithms?
Improved algorithmic versions of the Lovász Local Lemma
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
Locally Consistent Parsing for Text Indexing in Small Space
Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication
Motion Planning of a Ball Amid Segments in Three Dimensions
Partitioning a Polygon Into Small Pieces
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
Smaller explicit superconcentrators
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013
Roundness Estimation via Random Sampling
Optimal Edge Ranking of Trees in Polynomial Time
Zonotopes as bounding volumes
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
The phase transition in 1-in-k SAT and NAE 3-SAT
Faster Replacement Paths
Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes
On the Approximation of Maximum Satisfiability
Randomized pursuit-evasion with limited visibility
Algorithms for distributed functional monitoring
Online and Random-order Load Balancing Simultaneously
On Supermodular Contracts and Dense Subgraphs
Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
Online Discrepancy Minimization for Stochastic Arrivals
On Parallel Complexity of Integer Linear Programming, GCD and the Iterated mod Function
Matrix approximation and projective clustering via volume sampling
Breaking the 3/4 Barrier for Approximate Maximin Share
Pattern matching for sets of segments
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
Eigenvalues of a matrix in the streaming model
An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra
Probabilistic Existence of Large Sets of Designs
Better Approximations for Tree Sparsity in Nearly-Linear Time
Lower Bounds for Approximating the Matching Polytope
Generating adversaries for request-answer games
Cubic Goldreich-Levin
On Approximability of Steiner Tree in ℓ p -metrics
A note on the set systems used for broadcast encryption
Computing minimal triangulations in time O(n alpha log n) = o(n 2.376 )
The Space Complexity of 2-Dimensional Approximate Range Counting
Approximating k-cuts via network strength
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Towards Polynomial Simplex-Like Algorithms for Market Equlibria
Price of Anarchy for Greedy Auctions
A linear work, O(n 1/6 ) time, parallel algorithm for solving planar Laplacians
On the Configuration-LP of the Restricted Assignment Problem
Approximate counting via correlation decay in spin systems
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets
Maintaining Expander Decompositions via Sparse Cuts
A logarithmic approximation for unsplittable flow on line graphs
Approximation-Tolerant Model-Based Compressive Sensing
Approximation of non-boolean 2CSP
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
An improved approximation algorithm for virtual private network design
Risk-Averse Stochastic Optimization: Probabilistically-Constrained Models and Algorithms for Black-Box Distributions
Near-Linear Time Approximations for Cut Problems via Fair Cuts
Edge-Coloring Algorithms for Bounded Degree Multigraphs
Approximately covering by cycles in planar graphs
Surprise probabilities in Markov chains
Approximating k -center in planar graphs
Dictionaries using variable-length keys and data, with applications
The Directed Flat Wall Theorem
Random walks on the vertices of transportation polytopes with constant number of sources
The Rainbow at the End of the Line - A PPAD Formulation of the Colorful Carathéodory Theorem with Applications
Maximizing submodular set functions subject to multiple linear constraints
A polynomial-time approximation scheme for planar multiway cut
Geometric k Shortest Paths
Fast computation of power series solutions of systems of differential equations
Watermarking maps: hiding information in structured data
Randomized greedy hot-potato routing
Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More
Generic quantum Fourier transforms
A Convex Relaxation for the Asymmetric TSP
An analogue of Reed's conjecture for digraphs
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Efficient Algorithms and Lower Bounds for Robust Linear Regression
Multi-token Markov Game with Switching Costs
Deep Weisfeiler Leman
The Polyhedron-Hitting Problem
Envy-free Chore Division for An Arbitrary Number of Agents
Concentration and moment inequalities for polynomials of independent random variables
Four Soviets Walk the Dog - with an Application to Alt's Conjecture
Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines
Explicit two-deletion codes with redundancy matching the existential bound
Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
Approximate Trace Reconstruction from a Single Trace
Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
On the maximum quadratic assignment problem
Binary space partitions for line segments with a limited number of directions
Distributed Computation of Large-scale Graph Problems
Whole genome duplications, multi-break rearrangements, and genome halving problem
A stronger bound on Braess's Paradox
The whole genome assembly of Drosophila
Efficient Algorithms for Finding Disjoint Paths in Grids (Extended Abstract)
A Small Approximately min-wise Independent Family of Hash Functions
Hitting time results for Maker-Breaker games
Algorithmic trade-offs for girth approximation in undirected graphs
Rankwidth meets stability
Computing excluded minors
A Distanced Matching Game, Decremental APSP in Expanders, and Faster Deterministic Algorithms for Graph Cut Problems
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem
Dichotomy for Holant* Problems with Domain Size 3
Locally Testable Tree Codes
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix
Parallel Complexity of Tridiagonal Symmetric Eigenvalue Problem
Efficient sequences of trials
Online Lewis Weight Sampling
Improved Explicit Near-Optimal Codes in the High-Noise Regimes
Efficiency of the floating body as a robust measure of dispersion
PTAS for Minimum Cost Multi-covering with Disks
Testing Identity of Structured Distributions
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices