Conferences in DBLP
Johan Håstad On Nontrivial Approximation of CSPs. [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas C. Wormald Analysis of Algorithms on the Cores of Random Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Ambühl , Thomas Erlebach , Matús Mihalák , Marc Nunkesser Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Ambühl , Monaldo Mastrolilli , Ola Svensson Approximating Precedence-Constrained Single Machine Scheduling by Coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Don Coppersmith , Baruch Schieber Minimizing Setup and Beam-On Times in Radiation Therapy. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Stefano Leonardi , Gil Shallom , René Sitters On the Value of Preemption in Scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin E. Birnbaum , Kenneth J. Goldman An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Cardinal , Samuel Fiorini , Gwenaël Joret Tight Results on Minimum Entropy Set Cover. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert T.-H. Chan , Donglin Xia , Goran Konjevod , Andréa W. Richa A Tight Lower Bound for the Steiner Point Removal Problem on Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Shuchi Chawla , Tim Roughgarden Single-Source Stochastic Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Martin Pál An O (logn ) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Sashka Davis , Jeff Edmonds , Russell Impagliazzo Online Algorithms to Minimize Resource Reallocations and Network Communication. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Magnús M. Halldórsson , Asaf Levin , Hadas Shachnai Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. [Citation Graph (0, 0)][DBLP ] Conf ] Rajiv Gandhi , Julián Mestre Combinatorial Algorithms for Data Migration to Minimize Average Completion Time. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Grigoriev , Maxim Sviridenko , Marc Uetz LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximating Buy-at-Bulk and Shallow-Light k -Steiner Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Yoo Ah Kim , Azarakhsh Malekian Improved Algorithms for Data Migration. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Langberg , Yuval Rabani , Chaitanya Swamy Approximation Algorithms for Graph Homomorphism Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Retsef Levi , Maxim Sviridenko Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Inge Li Gørtz Hardness of Preemptive Finite Capacity Dial-a-Ride. [Citation Graph (0, 0)][DBLP ] Conf ] Viswanath Nagarajan , R. Ravi Minimum Vehicle Routing with a Common Deadline. [Citation Graph (0, 0)][DBLP ] Conf ] Anthony Man-Cho So , Jiawei Zhang , Yinyu Ye Stochastic Combinatorial Optimization with Controllable Risk Aversion Level. [Citation Graph (0, 0)][DBLP ] Conf ] Zeev Nutov Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. [Citation Graph (0, 0)][DBLP ] Conf ] David P. Woodruff Better Approximations for the Minimum Common Integer Partition Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Benny Applebaum , Yuval Ishai , Eyal Kushilevitz On Pseudorandom Generators with Linear Stretch in NC0 . [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Elad Hazan , Satyen Kale A Fast Random Sampling Algorithm for Sparsifying Matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Nayantara Bhatnagar , Sam Greenberg , Dana Randall The Effect of Boundary Conditions on Mixing Rates of Markov Chains. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Deshpande , Santosh Vempala Adaptive Sampling and Fast Low-Rank Matrix Approximation. [Citation Graph (0, 0)][DBLP ] Conf ] Irit Dinur , Madhu Sudan , Avi Wigderson Robust Local Testability of Tensor Products of LDPC Codes. [Citation Graph (0, 0)][DBLP ] Conf ] Petros Drineas , Michael W. Mahoney , S. Muthukrishnan Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Leslie Ann Goldberg , Mark Jerrum Dobrushin Conditions and Systematic Scan. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Elchanan Mossel , Dan Vilenchik Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Murali K. Ganapathy Robust Mixing. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Goldreich , Dana Ron Approximating Average Parameters of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Elena Grigorescu , Swastik Kopparty , Madhu Sudan Local Decoding and Testing for Homomorphisms. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Gutfreund Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Healy Randomness-Efficient Sampling Within NC 1 . [Citation Graph (0, 0)][DBLP ] Conf ] Shlomo Hoory , Avner Magen , Toniann Pitassi Monotone Circuits for the Majority Function. [Citation Graph (0, 0)][DBLP ] Conf ] Oded Lachish , Ilan Newman , Asaf Shapira Space Complexity vs. Query Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Yi-Kai Liu Consistency of Local Density Matrices Is QMA-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Yi-Kai Liu , Vadim Lyubashevsky , Daniele Micciancio On Bounded Distance Decoding for General Lattices. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Marciniszyn , Jozef Skokan , Reto Spöhel , Angelika Steger Threshold Functions for Asymmetric Ramsey Properties Involving Cliques. [Citation Graph (0, 0)][DBLP ] Conf ] Sharon Marko , Dana Ron Distance Approximation in Bounded-Degree and General Sparse Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Motwani , Rina Panigrahy , Ying Xu 0002 Fractional Matching Via Balls-and-Bins. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Strohmer , Roman Vershynin A Randomized Solver for Linear Systems with Exponential Convergence. [Citation Graph (0, 0)][DBLP ] Conf ] Philipp Woelfel Maintaining External Memory Efficient Hash Tables. [Citation Graph (0, 0)][DBLP ] Conf ] 