|
|
Conferences in DBLP
Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs. [Citation Graph (, )][DBLP]
Adaptive Sampling for k-Means Clustering. [Citation Graph (, )][DBLP]
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs. [Citation Graph (, )][DBLP]
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. [Citation Graph (, )][DBLP]
Truthful Mechanisms via Greedy Iterative Packing. [Citation Graph (, )][DBLP]
Resource Minimization Job Scheduling. [Citation Graph (, )][DBLP]
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. [Citation Graph (, )][DBLP]
New Hardness Results for Diophantine Approximation. [Citation Graph (, )][DBLP]
PASS Approximation. [Citation Graph (, )][DBLP]
Optimal Sherali-Adams Gaps from Pairwise Independence. [Citation Graph (, )][DBLP]
An Approximation Scheme for Terrain Guarding. [Citation Graph (, )][DBLP]
Scheduling with Outliers. [Citation Graph (, )][DBLP]
Improved Inapproximability Results for Maximum k-Colorable Subgraph. [Citation Graph (, )][DBLP]
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems. [Citation Graph (, )][DBLP]
On the Optimality of Gluing over Scales. [Citation Graph (, )][DBLP]
On Hardness of Pricing Items for Single-Minded Bidders. [Citation Graph (, )][DBLP]
Real-Time Message Routing and Scheduling. [Citation Graph (, )][DBLP]
Approximating Some Network Design Problems with Node Costs. [Citation Graph (, )][DBLP]
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. [Citation Graph (, )][DBLP]
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy. [Citation Graph (, )][DBLP]
Minimizing Average Shortest Path Distances via Shortcut Edge Addition. [Citation Graph (, )][DBLP]
Approximating Node-Connectivity Augmentation Problems. [Citation Graph (, )][DBLP]
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. [Citation Graph (, )][DBLP]
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. [Citation Graph (, )][DBLP]
On the Complexity of the Asymmetric VPN Problem. [Citation Graph (, )][DBLP]
Deterministic Approximation Algorithms for the Nearest Codeword Problem. [Citation Graph (, )][DBLP]
Strong Parallel Repetition Theorem for Free Projection Games. [Citation Graph (, )][DBLP]
Random Low Degree Polynomials are Hard to Approximate. [Citation Graph (, )][DBLP]
Composition of Semi-LTCs by Two-Wise Tensor Products. [Citation Graph (, )][DBLP]
On the Security of Goldreich's One-Way Function. [Citation Graph (, )][DBLP]
Random Tensors and Planted Cliques. [Citation Graph (, )][DBLP]
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. [Citation Graph (, )][DBLP]
Average-Case Analyses of Vickrey Costs. [Citation Graph (, )][DBLP]
A Hypergraph Dictatorship Test with Perfect Completeness. [Citation Graph (, )][DBLP]
Extractors Using Hardness Amplification. [Citation Graph (, )][DBLP]
How Well Do Random Walks Parallelize?. [Citation Graph (, )][DBLP]
An Analysis of Random-Walk Cuckoo Hashing. [Citation Graph (, )][DBLP]
Hierarchy Theorems for Property Testing. [Citation Graph (, )][DBLP]
Algorithmic Aspects of Property Testing in the Dense Graphs Model. [Citation Graph (, )][DBLP]
Succinct Representation of Codes with Applications to Testing. [Citation Graph (, )][DBLP]
Efficient Quantum Tensor Product Expanders and k-Designs. [Citation Graph (, )][DBLP]
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND. [Citation Graph (, )][DBLP]
Pseudorandom Generators and Typically-Correct Derandomization. [Citation Graph (, )][DBLP]
Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions. [Citation Graph (, )][DBLP]
Tolerant Linearity Testing and Locally Testable Codes. [Citation Graph (, )][DBLP]
Pseudorandom Bit Generators That Fool Modular Sums. [Citation Graph (, )][DBLP]
The Glauber Dynamics for Colourings of Bounded Degree Trees. [Citation Graph (, )][DBLP]
Testing ±1-weight halfspace. [Citation Graph (, )][DBLP]
Small-Bias Spaces for Group Products. [Citation Graph (, )][DBLP]
Small Clique Detection and Approximate Nash Equilibria. [Citation Graph (, )][DBLP]
Testing Computability by Width Two OBDDs. [Citation Graph (, )][DBLP]
Improved Polynomial Identity Testing for Read-Once Formulas. [Citation Graph (, )][DBLP]
Smooth Analysis of the Condition Number and the Least Singular Value. [Citation Graph (, )][DBLP]
|
