Conferences in DBLP
Virginia Vassilevska , Ryan Williams , Shan Leung Maverick Woo Confronting hardness using a hybrid approach. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1-10 [Conf ] Arist Kojevnikov , Alexander S. Kulikov A new approach to proving upper bounds for MAX-2-SAT. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:11-17 [Conf ] Fedor V. Fomin , Fabrizio Grandoni , Dieter Kratsch Measure and conquer: a simple O(2^{0.288n} ) independent set algorithm. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:18-25 [Conf ] Vadim V. Lozin , Martin Milanic A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:26-30 [Conf ] Wolfgang W. Bein , Mordecai J. Golin , Lawrence L. Larmore , Yan Zhang The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:31-40 [Conf ] Sanjeev Arora , László Lovász , Ilan Newman , Yuval Rabani , Yuri Rabinovich , Santosh Vempala Local versus global properties of metric spaces. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:41-50 [Conf ] Moses Charikar , Konstantin Makarychev , Yury Makarychev Directed metrics and directed graph partitioning problems. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:51-60 [Conf ] Kedar Dhamdhere , Anupam Gupta , Harald Räcke Improved embeddings of graph metrics into random trees. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:61-69 [Conf ] Hubert T.-H. Chan , Anupam Gupta Small hop-diameter sparse spanners for doubling metrics. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:70-78 [Conf ] Manor Mendel , Assaf Naor Metric cotype. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:79-88 [Conf ] Susanne Albers , Stefan Eilts , Eyal Even-Dar , Yishay Mansour , Liam Roditty On nash equilibria for a network creation game. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:89-98 [Conf ] Anupam Gupta , Kunal Talwar Approximating unique games. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:99-106 [Conf ] Peter Bro Miltersen , Troels Bjerre Sørensen Computing sequential equilibria for two-player games. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:107-116 [Conf ] Marcin Jurdzinski , Mike Paterson , Uri Zwick A deterministic subexponential algorithm for solving parity games. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:117-123 [Conf ] Xiaotie Deng , Qizhi Fang , Xiaoxun Sun Finding nucleolus of flow game. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:124-131 [Conf ] Rakesh V. Vohra Predicting the "unpredictable". [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:132- [Conf ] Sven Koenig , Apurva Mudgal , Craig A. Tovey A near-tight approximation lower bound and algorithm for the kidnapped robot problem. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:133-142 [Conf ] Klaus Jansen , Roberto Solis-Oba An asymptotic approximation algorithm for 3D-strip packing. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:143-152 [Conf ] Zoya Svitkina , Éva Tardos Facility location with hierarchical facility costs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:153-161 [Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi , Uriel Feige , Mohammad R. Salavatipour Combination can be hard: approximability of the unique coverage problem. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:162-171 [Conf ] Ernst Althaus , Rouven Naujoks Computing steiner minimum trees in Hamming metric. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:172-181 [Conf ] Pankaj K. Agarwal , Sariel Har-Peled , Hai Yu Robust shape fitting via peeling and grating coresets. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:182-191 [Conf ] Éric Colin de Verdière , Jeff Erickson Tightening non-simple paths and cycles on surfaces. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:192-201 [Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos , Rephael Wenger Anisotropic surface meshing. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:202-211 [Conf ] Prosenjit Bose , Jurek Czyzowicz , Zhicheng Gao , Pat Morin , David R. Wood Simultaneous diagonal flips in plane triangulations. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:212-221 [Conf ] Anna Lubiw , Mark Petrick , Michael J. Spriggs Morphing orthogonal planar graph drawings. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:222-230 [Conf ] Mike Paterson , Uri Zwick Overhang. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:231-240 [Conf ] Micah Adler , Nicholas J. A. Harvey , Kamal Jain , Robert D. Kleinberg , April Rasala Lehman On the capacity of information networks. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:241-250 [Conf ] Micah Adler , Erik D. Demaine , Nicholas J. A. Harvey , Mihai Patrascu Lower bounds for asymmetric communication channels and distributed source coding. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:251-260 [Conf ] Nir Ailon , Bernard Chazelle , Seshadhri Comandur , Ding Liu Self-improving algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:261-270 [Conf ] Jeff Edmonds , Kirk Pruhs Cake cutting really is not a piece of cake. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:271-278 [Conf ] Noga Alon , Tali Kaufman , Michael Krivelevich , Dana Ron Testing triangle-freeness in general graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:279-288 [Conf ] Martin Grohe , Dániel Marx Constraint solving via fractional edge covers. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:289-298 [Conf ] Eldar Fischer , Arie Matsliah Testing graph isomorphism. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:299-308 [Conf ] Min Chih Lin , Jayme Luiz Szwarcfiter Efficient construction of unit circular-arc models. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:309-315 [Conf ] Shakhar Smorodinsky On the chromatic number of some geometric hypergraphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:316-323 [Conf ] Moses Charikar , Samir Khuller A robust maximum completion time measure for scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:324-333 [Conf ] Ho-Leung Chan , Tak Wah Lam , Kin-Shing Liu Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:334-343 [Conf ] Nikhil Bansal , Don Coppersmith , Maxim Sviridenko Improved approximation algorithms for broadcast scheduling. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:344-353 [Conf ] Petra Berenbrink , Tom Friedetzky , Leslie Ann Goldberg , Paul W. Goldberg , Zengjian Hu , Russell A. Martin Distributed selfish load balancing. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:354-363 [Conf ] Philippe Baptiste Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for offline dynamic power management. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:364-367 [Conf ] Alexander Golynski , J. Ian Munro , S. Srinivasa Rao Rank/select operations on large alphabets: a tool for text indexing. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:368-373 [Conf ] Chengwen Chris Wang , Jonathan Derryberry , Daniel Dominic Sleator O (log log n )-competitive dynamic binary search trees. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:374-383 [Conf ] Michael T. Goodrich , Michael J. Nelson , Jonathan Z. Sun The rainbow skip graph: a fault-tolerant constant-degree distributed data structure. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:384-393 [Conf ] Loukas Georgiadis , Robert Endre Tarjan , Renato Fonseca F. Werneck Design of data structures for mergeable trees. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:394-403 [Conf ] Gianni Franceschini , J. Ian Munro Implicit dictionaries with O (1) modifications per update and fast search. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:404-413 [Conf ] Ivona Bezáková , Nayantara Bhatnagar , Eric Vigoda Sampling binary contingency tables with a greedy start. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:414-423 [Conf ] Philipp Woelfel Asymmetric balanced allocation with simple hash functions. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:424-433 [Conf ] Krishnaram Kenthapadi , Rina Panigrahy Balanced allocation on graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:434-443 [Conf ] Ming Li , Bin Ma , Louxin Zhang Superiority and complexity of the spaced seeds. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:444-453 [Conf ] Michael Krivelevich , Dan Vilenchik Solving random satisfiable 3CNF formulas in expected polynomial time. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:454-463 [Conf ] Jie Gao , Michael Langberg , Leonard J. Schulman Analysis of incomplete data and an intrinsic-dimension Helly theorem. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:464-473 [Conf ] Olaf Hall-Holt , Matthew J. Katz , Piyush Kumar , Joseph S. B. Mitchell , Arik Sityon Finding large sticks and potatoes in polygons. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:474-483 [Conf ] Haim Kaplan , Micha Sharir Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:484-493 [Conf ] Mark de Berg , Chris Gray Vertical ray shooting and computing depth orders for fat objects. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:494-503 [Conf ] Oswin Aichholzer , Thomas Hackl , Birgit Vogtenhuber , Clemens Huemer , Ferran Hurtado , Hannes Krasser On the number of plane graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:504-513 [Conf ] Timothy M. Chan All-pairs shortest paths for unweighted undirected graphs in o(mn) time. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:514-523 [Conf ] Glencora Borradaile , Philip N. Klein An O (n log n) algorithm for maximum st -flow in a directed planar graph. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:524-533 [Conf ] Mateo Restrepo , David P. Williamson A simple GAP-canceling algorithm for the generalized maximum flow problem. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:534-543 [Conf ] Vladimir G. Deineko , Bettina Klinz , Gerhard J. Woeginger Four point conditions and exponential neighborhoods for symmetric TSP. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:544-553 [Conf ] Harold N. Gabow Upper degree-constrained partial orientations. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:554-563 [Conf ] Kamalika Chaudhuri , Kevin Chen , Radu Mihaescu , Satish Rao On the tandem duplication-random loss model of genome rearrangement. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:564-570 [Conf ] Ming-Yang Kao , Robert T. Schweller Reducing tile complexity for self-assembly through temperature programming. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:571-580 [Conf ] Gerth Stølting Brodal , Rolf Fagerberg Cache-oblivious string dictionaries. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:581-590 [Conf ] Rezaul Alam Chowdhury , Vijaya Ramachandran Cache-oblivious dynamic programming. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:591-600 [Conf ] Deepak Ajwani , Roman Dementiev , Ulrich Meyer A computational study of external-memory BFS algorithms. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:601-610 [Conf ] Lisa Fleischer , Michel X. Goemans , Vahab S. Mirrokni , Maxim Sviridenko Tight approximation algorithms for maximum general assignment problems. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:611-620 [Conf ] Daniel Golovin , Viswanath Nagarajan , Mohit Singh Approximating the k -multicut problem. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:621-630 [Conf ] Mohammad Taghi Hajiaghayi , Kamal Jain The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:631-640 [Conf ] Piotr Berman , Marek Karpinski 8/7-approximation algorithm for (1, 2)-TSP. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:641-648 [Conf ] Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , Frank Thomson Leighton Improved lower and upper bounds for universal TSP in planar metrics. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:649-658 [Conf ] Bruno Codenotti , Amin Saberi , Kasturi R. Varadarajan , Yinyu Ye Leontief economies encode nonzero sum two-player games. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:659-667 [Conf ] Richard Cole , Yevgeniy Dodis , Tim Roughgarden Bottleneck links, variable demand, and the tragedy of the commons. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:668-677 [Conf ] Krishnendu Chatterjee , Luca de Alfaro , Thomas A. Henzinger The complexity of quantitative concurrent parity games. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:678-687 [Conf ] Kamal Jain , Kasturi R. Varadarajan Equilibria for economies with production: constant-returns technologies and production planning constraints. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:688-697 [Conf ] Sudipto Guha , Boulos Harb Approximation algorithms for wavelet transform coding of data streams. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:698-707 [Conf ] Lakshminath Bhuvanagiri , Sumit Ganguly , Deepanjan Kesh , Chandan Saha Simpler algorithm for estimating frequency moments of data streams. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:708-713 [Conf ] Camil Demetrescu , Irene Finocchi , Andrea Ribichini Trading off space for passes in graph streaming problems. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:714-723 [Conf ] L. K. Lee , H. F. Ting Maintaining significant stream statistics over sliding windows. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:724-732 [Conf ] Sudipto Guha , Andrew McGregor , Suresh Venkatasubramanian Streaming and sublinear approximation of entropy and information distances. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:733-742 [Conf ] Jesús A. De Loera , Raymond Hemmecke , Matthias Köppe , Robert Weismantel FPTAS for mixed-integer polynomial optimization with a fixed number of variables. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:743-748 [Conf ] Bernd Gärtner , Ingo Schurr Linear programming and unique sink orientations. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:749-757 [Conf ] Leonid Khachiyan , Endre Boros , Konrad Borys , Khaled M. Elbassioni , Vladimir Gurvich Generating all vertices of a polyhedron is hard. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:758-765 [Conf ] Anthony Man-Cho So , Yinyu Ye A semidefinite programming approach to tensegrity theory and realizability of graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:766-775 [Conf ] Don Coppersmith , Lisa Fleischer , Atri Rudra Ordering by weighted number of wins gives a good ranking for weighted tournaments. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:776-782 [Conf ] Stanislav Angelov , Boulos Harb , Sampath Kannan , Li-San Wang Weighted isotonic regression under the L _{1} norm. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:783-791 [Conf ] Tugkan Batu , Funda Ergün , Süleyman Cenk Sahinalp Oblivious string embeddings and edit distance approximations. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:792-801 [Conf ] Mikkel Thorup , Uri Zwick Spanners and emulators with sublinear distance errors. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:802-809 [Conf ] Sang-il Oum , Paul D. Seymour Certifying large branch-width. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:810-813 [Conf ] Jan Obdrzálek DAG-width: connectivity measure for directed graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:814-821 [Conf ] László Babai On the diameter of Eulerian orientations of graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:822-831 [Conf ] Michael Kaufmann , Jan Kratochvíl , Katharina Anna Lehmann , Amarendran R. Subramanian Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:832-841 [Conf ] Ephraim Korach , Thành Nguyen , Britta Peis Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:842-850 [Conf ] Daniela Kühn , Deryk Osthus Critical chromatic number and the complexity of perfect packings in graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:851-859 [Conf ] Micha Sharir , Emo Welzl On the number of crossing-free matchings, (cycles, and partitions). [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:860-869 [Conf ] Dana Randall Slow mixing of glauber dynamics via topological obstructions. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:870-879 [Conf ] Harry Buhrman , Robert Spalek Quantum verification of matrix products. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:880-889 [Conf ] Antar Bandyopadhyay , David Gamarnik Counting without sampling: new algorithms for enumeration problems using statistical physics. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:890-899 [Conf ] Ivona Bezáková , Daniel Stefankovic , Vijay V. Vazirani , Eric Vigoda Accelerating simulated annealing for the permanent and combinatorial counting problems. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:900-907 [Conf ] Parikshit Gopalan Query-efficient algorithms for polynomial interpolation over composites. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:908-917 [Conf ] Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , Frank Thomson Leighton , Harald Räcke New lower bounds for oblivious routing in undirected graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:918-927 [Conf ] Robert D. Kleinberg Anytime algorithms for multi-armed bandit problems. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:928-936 [Conf ] Varsha Dani , Thomas P. Hayes Robbing the bandit: less regret in online geometric optimization against an adaptive adversary. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:937-943 [Conf ] Ferdinando Cicalese , Eduardo Sany Laber On the competitive ratio of evaluating priced functions. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:944-953 [Conf ] Adam Meyerson , Akash Nanavati , Laura Poplawski Randomized online algorithms for minimum metric bipartite matching. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:954-959 [Conf ] Alan M. Frieze Random graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:960- [Conf ] David Arthur , Rina Panigrahy Analyzing BitTorrent and related peer-to-peer networks. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:961-969 [Conf ] Anupam Gupta , Mohammad Taghi Hajiaghayi , Harald Räcke Oblivious network design. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:970-979 [Conf ] Fabian Kuhn , Thomas Moscibroda , Roger Wattenhofer The price of being near-sighted. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:980-989 [Conf ] Valerie King , Jared Saia , Vishal Sanwalani , Erik Vee Scalable leader election. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:990-999 [Conf ] Alexander Kröller , Sándor P. Fekete , Dennis Pfisterer , Stefan Fischer Deterministic boundary recognition and topology extraction for large sensor networks. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1000-1009 [Conf ] Robert Krauthgamer , Yuval Rabani Improved lower bounds for embeddings into L _{1} . [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1010-1017 [Conf ] Moses Charikar , Mohammad Taghi Hajiaghayi , Howard J. Karloff , Satish Rao l ^{2} _{2} spreading metrics for vertex ordering problems. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1018-1027 [Conf ] James R. Lee , Assaf Naor , Yuval Peres Trees and Markov convexity. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1028-1037 [Conf ] D. Dellamonica Jr. , Yoshiharu Kohayakawa An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1038-1044 [Conf ] Yuval Emek , David Peleg A tight upper bound on the probabilistic embedding of series-parallel graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1045-1053 [Conf ] Moshe Babaioff , Ron Lavi , Elan Pavlov Single-value combinatorial auctions and implementation in undominated strategies. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1054-1063 [Conf ] Shahar Dobzinski , Michael Schapira An improved approximation algorithm for combinatorial auctions with submodular bidders. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1064-1073 [Conf ] Zoë Abrams Revenue maximization when bidders have budgets. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1074-1082 [Conf ] Gagan Aggarwal , Jason D. Hartline Knapsack auctions. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1083-1092 [Conf ] Patrick Briest , Piotr Krysta Single-minded unlimited supply pricing on sparse instances. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1093-1102 [Conf ] Nicholas J. A. Harvey , David R. Karger , Sergey Yekhanin The complexity of matrix completion. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1103-1111 [Conf ] Steven Butler Relating singular values and discrepancy of weighted directed graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1112-1116 [Conf ] Amit Deshpande , Luis Rademacher , Santosh Vempala , Grant Wang Matrix approximation and projective clustering via volume sampling. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1117-1126 [Conf ] Petros Drineas , Michael W. Mahoney , S. Muthukrishnan Sampling algorithms for l _{2} regression and applications. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1127-1136 [Conf ] Deepak Agarwal , Jeff M. Phillips , Suresh Venkatasubramanian The hunting of the bump: on maximizing statistical discrepancy. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1137-1146 [Conf ] Guolong Lin , Chandrashekhar Nagarajan , Rajmohan Rajaraman , David P. Williamson A general approach for incremental approximation and hierarchical clustering. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1147-1156 [Conf ] Kevin L. Chang , Ravi Kannan The space complexity of pass-efficient algorithms for clustering. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1157-1166 [Conf ] Ioannis Giotis , Venkatesan Guruswami Correlation clustering with a fixed number of clusters. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1167-1176 [Conf ] Ke Chen On k -Median clustering in high dimensions. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1177-1185 [Conf ] Rina Panigrahy Entropy based nearest neighbor search in high dimensions. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1186-1195 [Conf ] Timothy M. Chan A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1196-1202 [Conf ] Alexandr Andoni , Piotr Indyk Efficient algorithms for substring near neighbor problem. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1203-1212 [Conf ] Sergio Cabello Many distances in planar graphs. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1213-1220 [Conf ] Amihood Amir , Yonatan Aumann , Gary Benson , Avivit Levy , Ohad Lipsky , Ely Porat , Steven Skiena , Uzi Vishne Pattern matching with address errors: rearrangement distances. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1221-1229 [Conf ] Kunihiko Sadakane , Roberto Grossi Squeezing succinct data structures into entropy bounds. [Citation Graph (0, 0)][DBLP ] SODA, 2006, pp:1230-1239 [Conf ]