Conferences in DBLP
Approximating Optimal Binary Decision Trees. [Citation Graph (, )][DBLP ] Santa Claus Meets Hypergraph Matchings. [Citation Graph (, )][DBLP ] Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. [Citation Graph (, )][DBLP ] Connected Vertex Covers in Dense Graphs. [Citation Graph (, )][DBLP ] Improved Approximation Guarantees through Higher Levels of SDP Hierarchies. [Citation Graph (, )][DBLP ] Sweeping Points. [Citation Graph (, )][DBLP ] Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. [Citation Graph (, )][DBLP ] Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. [Citation Graph (, )][DBLP ] Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP. [Citation Graph (, )][DBLP ] Approximating Maximum Subgraphs without Short Cycles. [Citation Graph (, )][DBLP ] Deterministic 7/8-Approximation for the Metric Maximum TSP. [Citation Graph (, )][DBLP ] Inapproximability of Survivable Networks. [Citation Graph (, )][DBLP ] Approximating Single Machine Scheduling with Scenarios. [Citation Graph (, )][DBLP ] Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity. [Citation Graph (, )][DBLP ] A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One. [Citation Graph (, )][DBLP ] The Directed Minimum Latency Problem. [Citation Graph (, )][DBLP ] A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP ] Approximating Directed Weighted-Degree Constrained Networks. [Citation Graph (, )][DBLP ] A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs. [Citation Graph (, )][DBLP ] Budgeted Allocations in the Full-Information Setting. [Citation Graph (, )][DBLP ] Optimal Random Matchings on Trees and Applications. [Citation Graph (, )][DBLP ] Small Sample Spaces Cannot Fool Low Degree Polynomials. [Citation Graph (, )][DBLP ] Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. [Citation Graph (, )][DBLP ] Tensor Products of Weakly Smooth Codes Are Robust. [Citation Graph (, )][DBLP ] On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. [Citation Graph (, )][DBLP ] Improved Bounds for Testing Juntas. [Citation Graph (, )][DBLP ] The Complexity of Distinguishing Markov Random Fields. [Citation Graph (, )][DBLP ] Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms. [Citation Graph (, )][DBLP ] Tight Bounds for Hashing Block Sources. [Citation Graph (, )][DBLP ] Improved Separations between Nondeterministic and Randomized Multiparty Communication. [Citation Graph (, )][DBLP ] Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. [Citation Graph (, )][DBLP ] On the Query Complexity of Testing Orientations for Being Eulerian. [Citation Graph (, )][DBLP ] Approximately Counting Embeddings into Random Graphs. [Citation Graph (, )][DBLP ] Increasing the Output Length of Zero-Error Dispersers. [Citation Graph (, )][DBLP ] Euclidean Sections of with Sublinear Randomness and Error-Correction over the Reals. [Citation Graph (, )][DBLP ] The Complexity of Local List Decoding. [Citation Graph (, )][DBLP ] Limitations of Hardness vs. Randomness under Uniform Reductions. [Citation Graph (, )][DBLP ] Learning Random Monotone DNF. [Citation Graph (, )][DBLP ] Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). [Citation Graph (, )][DBLP ] Dense Fast Random Projections and Lean Walsh Transforms. [Citation Graph (, )][DBLP ] Near Optimal Dimensionality Reductions That Preserve Volumes. [Citation Graph (, )][DBLP ] Sampling Hypersurfaces through Diffusion. [Citation Graph (, )][DBLP ] A 2-Source Almost-Extractor for Linear Entropy. [Citation Graph (, )][DBLP ] Extractors for Three Uneven-Length Sources. [Citation Graph (, )][DBLP ] The Power of Choice in a Generalized Pólya Urn Model. [Citation Graph (, )][DBLP ] Corruption and Recovery-Efficient Locally Decodable Codes. [Citation Graph (, )][DBLP ] Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets. [Citation Graph (, )][DBLP ] 