Conferences in DBLP
Yijie Han Optimal parallel selection. [Citation Graph (0, 0)][DBLP ] Conf ] Sampath Kannan , Sanjeev Khanna Selection with monotone comparison cost. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Krauthgamer , Ori Sasson Property testing of data dimensionality. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald Fagin , Ravi Kumar , D. Sivakumar Comparing top k lists. [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani , Sandeep K. Shukla , Rajesh K. Gupta Algorithms for power savings. [Citation Graph (0, 0)][DBLP ] Conf ] Susanne Albers , Helge Bals Dynamic TCP acknowledgement: penalizing long delays. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Fleischer , Jay Sethuraman Approximately optimal control of fluid networks. [Citation Graph (0, 0)][DBLP ] Conf ] Lisa Fleischer , Martin Skutella Minimum cost flows over time without intermediate storage. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin , Guy Kortsarz Sublogarithmic approximation for telephone multicast: path out of jungle. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas S. Schulz , Nicolás E. Stier Moses On the performance of user equilibria in traffic networks. [Citation Graph (0, 0)][DBLP ] Conf ] Aaron Archer , David P. Williamson Faster approximation algorithms for the minimum latency problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yoo Ah Kim Data migration to minimize the average completion time. [Citation Graph (0, 0)][DBLP ] Conf ] Ian H. Witten Browsing around a digital library. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri Binary space partitions for 3D subdivisions. [Citation Graph (0, 0)][DBLP ] Conf ] Bettina Speckmann , Csaba D. Tóth Allocating vertex pi-guards in simple polygons via pseudo-triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Gill Barequet , Michael T. Goodrich , Aya Levi-Steiner , Dvir Steiner Straight-skeleton based contour interpolation. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern , David Eppstein Möbius-invariant natural neighbor interpolation. [Citation Graph (0, 0)][DBLP ] Conf ] George S. Lueker Improved bounds on the average length of longest common subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] Béla Bollobás , Christian Borgs , Jennifer T. Chayes , Oliver Riordan Directed scale-free graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Cooper , Alan M. Frieze The cover time of sparse random graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , Boris Pittel Perfect matchings in random graphs with prescribed minimal degree. [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Kratsch , Ross M. McConnell , Kurt Mehlhorn , Jeremy Spinrad Certifying algorithms for recognizing interval graphs and permutation graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Fedor V. Fomin , Dimitrios M. Thilikos Dominating sets in planar graphs: branch-width and exponential speed-up. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Quick and good facility location. [Citation Graph (0, 0)][DBLP ] Conf ] Sean Curran , Orlando Lee , Xingxing Yu Chain decompositions and independent trees in 4-connected graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Piotr Krysta Optimizing misdirection. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Vijay Kumar , Atri Rudra , Felix Wu Online learning in online auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Aaron Archer , Christos H. Papadimitriou , Kunal Talwar , Éva Tardos An approximate truthful mechanism for combinatorial auctions with single parameter agents. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Jason D. Hartline Competitiveness via consensus. [Citation Graph (0, 0)][DBLP ] Conf ] Petros Drineas , Ravi Kannan Pass efficient algorithms for approximating large matrices. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Martin Strauss Rangesum histograms. [Citation Graph (0, 0)][DBLP ] Conf ] Anna C. Gilbert , S. Muthukrishnan , Martin Strauss Approximation of functions over redundant dictionaries using coherence. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Francis Zane Counting inversions in lists. [Citation Graph (0, 0)][DBLP ] Conf ] Marcel Dhiflaoui , Stefan Funke , Carsten Kwappik , Kurt Mehlhorn , Michael Seel , Elmar Schömer , Ralph Schulte , Dennis Weber Certifying and repairing solutions to large LPs how good are LP-solvers? [Citation Graph (0, 0)][DBLP ] Conf ] Jittat Fakcharoenphol , Chris Harrelson , Satish Rao , Kunal Talwar An improved approximation algorithm for the 0-extension problem. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Mohammad Mahdian , Mohammad R. Salavatipour Packing Steiner trees. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Halperin , Guy Kortsarz , Robert Krauthgamer , Aravind Srinivasan , Nan Wang Integrality ratio for group Steiner trees and directed steiner trees. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Giesen , Matthias John The flow complex: a data structure for geometric modeling. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Sheung-Hung Poon Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Daniel Boissonnat , Menelaos I. Karavelas On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Monique Teillaud Perturbations and vertex removal in a 3D delaunay triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Menelaos I. Karavelas , Ioannis Z. Emiris Root comparison techniques applied to computing the additively weighted Voronoi diagram. [Citation Graph (0, 0)][DBLP ] Conf ] Mary Cryan , Martin E. Dyer , Haiko Müller , Leen Stougie Random walks on the vertices of transportation polytopes with constant number of sources. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Michael R. Capalbo Smaller explicit superconcentrators. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad R. Salavatipour A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Abraham Flaxman A spectral technique for random satisfiable 3CNF formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , David Gamarnik , Mohammad Taghi Hajiaghayi , Gregory B. Sorkin Random MAX SAT, random MAX CUT, and their phase transitions. [Citation Graph (0, 0)][DBLP ] Conf ] Guy E. Blelloch , Bruce M. Maggs , Shan Leung Maverick Woo Space-efficient finger search on degree-balanced search trees. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , Gauri Shah Skip graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Surender Baswana , Ramesh Hariharan , Sandeep Sen Maintaining all-pairs approximate shortest paths under deletion of edges. [Citation Graph (0, 0)][DBLP ] Conf ] Liam Roditty A faster and simpler fully dynamic transitive closure. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan Data streams: algorithms and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Béla Bollobás , Don Coppersmith , Michael Elkin Sparse distance preservers and additive spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , Manor Mendel Multi-embedding and path approximation of metric spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu Approximation algorithm for embedding metrics into a two-dimensional space. [Citation Graph (0, 0)][DBLP ] Conf ] Valerie King , Li Zhang , Yunhong Zhou On the complexity of distance-based evolutionary tree reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta Improved results for directed multicut. [Citation Graph (0, 0)][DBLP ] Conf ] Jesper Makholm Byskov Algorithms for k-colouring and finding maximal independent sets. [Citation Graph (0, 0)][DBLP ] Conf ] Sriram V. Pemmaraju , Kittikorn Nakprasit , Alexandr V. Kostochka Equitable colorings with constant number of colors. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kumar , Alexander Russell A note on the set systems used for broadcast encryption. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Peikert , Abhi Shelat , Adam Smith Lower bounds for collusion-secure fingerprinting. [Citation Graph (0, 0)][DBLP ] Conf ] Harry Buhrman , Lance Fortnow , Ilan Newman , Hein Röhrig Quantum property testing. [Citation Graph (0, 0)][DBLP ] Conf ] Wim van Dam , Sean Hallgren , Lawrence Ip Quantum algorithms for some hidden shift problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel , Deborah Estrin Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Non-independent randomized rounding. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Kedar Dhamdhere Minimizing weighted flow time. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Eisenbrand , Stefan Funke , Naveen Garg , Jochen Könemann A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandr Andoni , Michel Deza , Anupam Gupta , Piotr Indyk , Sofya Raskhodnikova Lower bounds for embedding edit distance into normed spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Anupam Gupta , Ilan Newman , Yuri Rabinovich , Alistair Sinclair Embedding k-outerplanar graphs into l1. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Piotr Indyk Embeddings and non-approximability of geometric problems. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Better algorithms for high-dimensional proximity problems via asymmetric embeddings. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg Lower bounds for external memory dictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] Enoch Peserico Online paging with arbitrary associativity. [Citation Graph (0, 0)][DBLP ] Conf ] James D. Fix The set-associative cache performance of search trees. [Citation Graph (0, 0)][DBLP ] Conf ] Raffaella Gentilini , Carla Piazza , Alberto Policriti Computing strongly connected components in a linear number of symbolic steps. [Citation Graph (0, 0)][DBLP ] Conf ] Uli Wagner On the rectilinear crossing number of complete graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Helmut Alt , Alon Efrat , Günter Rote , Carola Wenk Matching planar maps. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Dynamic generators of topologically embedded graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei Bespamyatnikh Computing homotopic shortest paths in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Worm Mortensen Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna Edge disjoint paths revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser A new approximation algorithm for the asymmetric TSP with triangle inequality. [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Lewenstein , Maxim Sviridenko Approximating asymmetric maximum TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Jittat Fakcharoenphol , Chris Harrelson , Satish Rao The k-traveling repairman problem. [Citation Graph (0, 0)][DBLP ] Conf ] William Hesse Directed graphs requiring large numbers of shortcuts. [Citation Graph (0, 0)][DBLP ] Conf ] Gianni Franceschini , Roberto Grossi Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel K. Blandford , Guy E. Blelloch , Ian A. Kash Compact representations of separable graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Philip Bille , Theis Rauhe Labeling schemes for small distances in trees. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup On AC0 implementations of fusion trees and atomic heaps. [Citation Graph (0, 0)][DBLP ] Conf ] Persi Diaconis Who cares about permanents? [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Kratsch , Jeremy Spinrad Between O(nm) and O(n alpha). [Citation Graph (0, 0)][DBLP ] Conf ] Devdatt P. Dubhashi , Alessandro Mei , Alessandro Panconesi , Jaikumar Radhakrishnan , Aravind Srinivasan Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. [Citation Graph (0, 0)][DBLP ] Conf ] Raja Jothi , Balaji Raghavachari , Subramanian Varadarajan A 5/4-approximation algorithm for minimum 2-edge-connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Chaitanya Swamy , David B. Shmoys Fault-tolerant facility location. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Amos Fiat , Haim Kaplan Efficient sequences of trials. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Rote Pursuit-evasion with imprecise target location. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Igor Shparlinski Unconditional proof of tightness of Johnson bound. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Lipton , Nisheeth K. Vishnoi Deterministic identity testing for multivariate polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Andelman , Yishay Mansour , An Zhu Competitive queueing policies for QoS switches. [Citation Graph (0, 0)][DBLP ] Conf ] William Aiello , Rafail Ostrovsky , Eyal Kushilevitz , Adi Rosén Dynamic routing on networks with fixed-size buffers. [Citation Graph (0, 0)][DBLP ] Conf ] Lali Barrière , Pierre Fraigniaud , Lata Narayanan , Jaroslav Opatrny Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Richard E. Ladner , Tami Tamir Scheduling techniques for media-on-demand. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu , Kenneth L. Clarkson Smaller core-sets for balls. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , An Nguyen , Li Zhang Zonotopes as bounding volumes. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Funda Ergün , Lance Fortnow , Avner Magen , Ilan Newman , Ronitt Rubinfeld , Christian Sohler Sublinear-time approximation of Euclidean minimum spanning tree. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu An approximation algorithm for cutting out convex polygons. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Torsten Suel , Radek Vingralek Inferring tree topologies using flow tests. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Winkler , Lisa Zhang Wavelength assignment and generalized interval graph coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Carla P. Gomes , Rommel G. Regis , David B. Shmoys An improved approximation algorithm for the partial latin square extension problem. [Citation Graph (0, 0)][DBLP ] Conf ] Hung Q. Ngo , Van H. Vu Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Grossi , Ankur Gupta , Jeffrey Scott Vitter High-order entropy-compressed text indexes. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Moshe Lewenstein Multidimensional matching and fast search in suffix trees. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Gad M. Landau , Dina Sokol Inplace 2D matching in compressed images. [Citation Graph (0, 0)][DBLP ] Conf ] Ming Li , Xin Chen , Xin Li , Bin Ma , Paul M. B. Vitányi The similarity metric. [Citation Graph (0, 0)][DBLP ] Conf ] 