Conferences in DBLP
Stanislav Angelov , Sanjeev Khanna , Keshav Kunal The Network as a Storage Device: Dynamic Routing with Bounded Buffers. [Citation Graph (0, 0)][DBLP ] Conf ] Adi Avidor , Uri Zwick Rounding Two and Three Dimensional Solutions of the SDP Relaxation of MAX CUT. [Citation Graph (0, 0)][DBLP ] Conf ] Kamalika Chaudhuri , Satish Rao , Samantha Riesenfeld , Kunal Talwar What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Chepoi , Karim Nouioua , Yann Vaxès A Rounding Algorithm for Approximating Minimum Manhattan Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Mohammad R. Salavatipour Packing Element-Disjoint Steiner Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Kunal Talwar Approximating the Bandwidth of Caterpillars. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Amit Kumar Where's the Winner? Max-Finding and Sorting with Metric Costs. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Martin Pál , R. Ravi , Amitabh Sinha What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Luca Trevisan The Complexity of Making Unique Choices: Approximating 1-in- k SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Hall , Christos H. Papadimitriou Approximating the Distortion. [Citation Graph (0, 0)][DBLP ] Conf ] Boulos Harb , Sampath Kannan , Andrew McGregor Approximating the Best-Fit Tree Under Lp Norms. [Citation Graph (0, 0)][DBLP ] Conf ] Gustav Hast Beating a Random Assignment. [Citation Graph (0, 0)][DBLP ] Conf ] V. S. Anil Kumar , Madhav V. Marathe , Srinivasan Parthasarathy 0002 , Aravind Srinivasan Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Maßberg , Jens Vygen Approximation Algorithms for Network Design and Facility Location with Service Capacities. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew McGregor Finding Graph Matchings in Data Streams. [Citation Graph (0, 0)][DBLP ] Conf ] Julián Mestre A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. [Citation Graph (0, 0)][DBLP ] Conf ] Shlomo Moran , Sagi Snir Efficient Approximation of Convex Recolorings. [Citation Graph (0, 0)][DBLP ] Conf ] Viswanath Nagarajan , R. Ravi Approximation Algorithms for Requirement Cut on Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Remy , Angelika Steger Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Iannis Tourlakis Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Sourav Chakraborty , Jaikumar Radhakrishnan , Nandakumar Raghunathan Bounds for Error Reduction with Few Quantum Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Chandra Chekuri , Martin Pál Sampling Bounds for Stochastic Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Zeev Dvir , Amir Shpilka An Improved Analysis of Mergers. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Eran Ofek Finding a Maximum Independent Set in a Sparse Random Graph. [Citation Graph (0, 0)][DBLP ] Conf ] Ronen Gradwohl , Guy Kindler , Omer Reingold , Amnon Ta-Shma On the Error Parameter of Dispersers. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Atri Rudra Tolerant Locally Testable Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Salil P. Vadhan A Lower Bound on List Size for List Decoding. [Citation Graph (0, 0)][DBLP ] Conf ] Shirley Halevy , Eyal Kushilevitz A Lower Bound for Distribution-Free Monotonicity Testing. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey C. Jackson , Rocco A. Servedio On Learning Random DNF Formulas Under the Uniform Distribution. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Kaplan , Moni Naor , Omer Reingold Derandomized Constructions of k-Wise (Almost) Independent Permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Lachish , Ilan Newman Testing Periodicity. [Citation Graph (0, 0)][DBLP ] Conf ] Vadim Lyubashevsky The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Marciniszyn , Reto Spöhel , Angelika Steger The Online Clique Avoidance Game on Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Rémi Monasson A Generating Function Method for the Average-Case Analysis of DPLL. [Citation Graph (0, 0)][DBLP ] Conf ] Cristopher Moore , Gabriel Istrate , Demetrios D. Demopoulos , Moshe Y. Vardi A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Randall , Peter Winkler Mixing Points on a Circle. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Rozenman , Salil P. Vadhan Derandomized Squaring of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Dekel Tsur Tight Bounds for String Reconstruction Using Substring Queries. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Umans Reconstructive Dispersers and Hitting Set Generators. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Valiant The Tensor Product of Two Codes Is Not Necessarily Robustly Testable. [Citation Graph (0, 0)][DBLP ] Conf ] Raphael Yuster Fractional Decompositions of Dense Hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] 