Conferences in DBLP
Avrim Blum , Shuchi Chawla , Adam Kalai Static optimality and dynamic search-optimality in lists and trees. [Citation Graph (0, 0)][DBLP ] Conf ] Rasmus Pagh , Jakob Pagter Optimal time-space trade-offs for non-comparison-based sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Nira Shafrir , Robert Endre Tarjan Union-find with deletions. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu A locality-preserving cache-oblivious dynamic dictionary. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Rolf Fagerberg , Riko Jacob Cache oblivious search trees via binary trees of small height. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Even , Guy Kortsarz An approximation algorithm for the group Steiner problem. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Zosin , Samir Khuller On directed Steiner trees. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Bläser An 8/13-approximation algorithm for the asymmetric maximum TSP. [Citation Graph (0, 0)][DBLP ] Conf ] Béla Csaba , Marek Karpinski , Piotr Krysta Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Jared Saia Censorship resistant peer-to-peer content addressable networks. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Rajeev Motwani , Rina Panigrahy , An Zhu Web caching with request reordering. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Kamesh Munagala Improved algorithms for the data placement problem. [Citation Graph (0, 0)][DBLP ] Conf ] Rahul Shah , Martin Farach-Colton Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees. [Citation Graph (0, 0)][DBLP ] Conf ] Amitai Armon , Yossi Azar , Leah Epstein , Oded Regev Temporary tasks assignment resolved. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson Dense point sets have sparse Delaunay triangulations: or "... but not too nasty". [Citation Graph (0, 0)][DBLP ] Conf ] Sunghee Choi , Nina Amenta Delaunay triangulation programs on surface data. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Tamal K. Dey Quality meshing with weighted Delaunay refinement. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Theocharis Malamatos Linear-size approximate voronoi diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Antoine Vigneron Motorcycle graphs and straight skeletons. [Citation Graph (0, 0)][DBLP ] Conf ] George Karakostas Faster approximation schemes for fractional multicommodity flow problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ekkehard Köhler , Martin Skutella Flows over time with load-dependent transit times. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Kolman , Christian Scheideler Improved bounds for the unsplittable flow problem. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Alexander Hall NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. [Citation Graph (0, 0)][DBLP ] Conf ] Tim Roughgarden How unfair is optimal routing? [Citation Graph (0, 0)][DBLP ] Conf ] Eric Lehman , Abhi Shelat Approximation algorithms for grammar-based compression. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Glenn S. Fowler , Raffaele Giancarlo Improving table compression with combinatorial optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Hsueh-I Lu Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. [Citation Graph (0, 0)][DBLP ] Conf ] Kunihiko Sadakane Succinct representations of lcp information and improvements in the compressed suffix arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Raman , Venkatesh Raman , S. Srinivasa Rao Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. [Citation Graph (0, 0)][DBLP ] Conf ] Uri Zwick Jenga. [Citation Graph (0, 0)][DBLP ] Conf ] Fan R. K. Chung , Ronald L. Graham , Linyuan Lu Guessing secrets with inner product questions. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Venkatesan Guruswami , Tali Kaufman , Madhu Sudan Guessing secrets efficiently via list decoding. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Oliver Krumke , Maarten Lipmann , Willem de Paepe , Diana Poensgen , Jörg Rambau , Leen Stougie , Gerhard J. Woeginger How to cut a cake almost fairly. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Rinaldi , Ulrich Voigt , Gerhard J. Woeginger The mathematics of playing golf. [Citation Graph (0, 0)][DBLP ] Conf ] Seth Pettie , Vijaya Ramachandran Computing shortest paths with comparisons and additions. [Citation Graph (0, 0)][DBLP ] Conf ] Yoshiharu Kohayakawa , Vojtech Rödl , Lubos Thoma An optimal algorithm for checking regularity (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ojas Parekh Edge dominating and hypomatchable sets. [Citation Graph (0, 0)][DBLP ] Conf ] Vilhelm Dahllöf , Peter Jonsson An algorithm for counting maximum weighted independent sets and its applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ryan Williams Algorithms for quantified Boolean formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Eleni Drinea , Alan M. Frieze , Michael Mitzenmacher Balls and bins models with feedback. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Cooper , Alan M. Frieze , Gregory B. Sorkin A note on random 2-SAT with prescribed literal degrees. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Pak Mixing time and long paths in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , David Gamarnik , Maxim Sviridenko The diameter of a long range percolation graph. [Citation Graph (0, 0)][DBLP ] Conf ] Cedric Adjih , Leonidas Georgiadis , Philippe Jacquet , Wojciech Szpankowski Is the internet fractal? [Citation Graph (0, 0)][DBLP ] Conf ] Victor Chepoi , Feodor F. Dragan , Yann Vaxès Center and diameter problems in plane triangulations and quadrangulations. [Citation Graph (0, 0)][DBLP ] Conf ] Seok-Hee Hong , Brendan D. McKay , Peter Eades Symmetric drawings of triconnected planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Shimon Even , Roni Kupershtok Layout area of the hypercube (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Anil Maheshwari , Norbert Zeh I/O-optimal algorithms for planar graphs using separators. [Citation Graph (0, 0)][DBLP ] Conf ] Ryan B. Hayward , Stefan Hougardy , Bruce A. Reed Polynomial time recognition of P4-structure. [Citation Graph (0, 0)][DBLP ] Conf ] Jérémy Barbay , Claire Kenyon Adaptive intersection and t-threshold problems. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Kenneth Ward Church , Emanuel Dar Separable attributes: a technique for solving the sub matrices character count problem. [Citation Graph (0, 0)][DBLP ] Conf ] Cristopher Moore , Ivan Rapaport , Eric Rémila Tiling groups for Wang tiles. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Kalai Generating random factored numbers, easily. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Berthold Vöcking Tight bounds for worst-case equilibria. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Edmonds , Kirk Pruhs Broadcast scheduling: when fairness is fine. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Engebretsen , Madhu Sudan Harmonic broadcasting is optimal. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Richard E. Ladner Windows scheduling problems for broadcast systems. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Lisa Zhang Scheduling protocols for switches with large envelopes. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Frank Hoffmann , Christian Knauer , Klaus Kriegel , Günter Rote , Carola Wenk Covering shapes by ellipses. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan Slice and dice: a simple, improved approximate tiling recipe. [Citation Graph (0, 0)][DBLP ] Conf ] Csaba D. Tóth Binary space partitions for line segments with a limited number of directions. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Closest-point problems simplified on the RAM. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Semi-online maintenance of geometric optima and measures. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Kamesh Munagala Generalized clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Steven S. Seiden , Rob van Stee New bounds for multi-dimensional packing. [Citation Graph (0, 0)][DBLP ] Conf ] Uri Zwick Computer assisted proof of optimal approximability results. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Halperin , Dror Livnat , Uri Zwick MAX CUT in cubic graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Marek Karpinski Approximating minimum unsatisfiability of linear equations. [Citation Graph (0, 0)][DBLP ] Conf ] Sandy Irani , Xiangwen Lu , Amelia Regan On-line algorithms for the dynamic traveling repair problem. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Ari Freund , Shimon Landa , Joseph Naor Competitive on-line switching policies. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , Bo Brinkman A randomized online algorithm for bandwidth utilization. [Citation Graph (0, 0)][DBLP ] Conf ] Parikshit Gopalan , Howard J. Karloff , Aranyak Mehta , Milena Mihail , Nisheeth K. Vishnoi Caching with expiration times. [Citation Graph (0, 0)][DBLP ] Conf ] Edward J. Anderson , Chris N. Potts On-line scheduling of a single machine to minimize total weighted completion time. [Citation Graph (0, 0)][DBLP ] Conf ] Shankar Krishnan , Nabil H. Mustafa , Suresh Venkatasubramanian Hardware-assisted computation of depth contours. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Michael A. Bender , Sándor P. Fekete , Joseph S. B. Mitchell , Martin Skutella The freeze-tag problem: how to wake up a swarm of robots. [Citation Graph (0, 0)][DBLP ] Conf ] Darin Goldstein , Nick Meyer The wake up and report problem is time-equivalent to the firing squad synchronization problem. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Diks , Pierre Fraigniaud , Evangelos Kranakis , Andrzej Pelc Tree exploration with little memory. [Citation Graph (0, 0)][DBLP ] Conf ] József Beck , Sachin Lodha Efficient proper 2-coloring of almost disjoint hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Irene Finocchi , Alessandro Panconesi , Riccardo Silvestri Experimental analysis of simple, distributed vertex coloring algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar On semidefinite programming relaxations for graph coloring and vertex cover. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi , Amitabh Sinha II Approximating k-cuts via network strength. [Citation Graph (0, 0)][DBLP ] Conf ] Ziv Bar-Yossef , Ravi Kumar , D. Sivakumar Reductions in streaming algorithms, with an application to counting triangles in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Brian Babcock , Mayur Datar , Rajeev Motwani Sampling from a moving window over streaming data. [Citation Graph (0, 0)][DBLP ] Conf ] Mayur Datar , Aristides Gionis , Piotr Indyk , Rajeev Motwani Maintaining stream statistics over sliding windows (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Asaf Shapira Testing satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Kalai Efficient pattern-matching with don't cares. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan Efficient algorithms for document retrieval problems. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Cormode , S. Muthukrishnan The string edit distance matching problem with moves. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan Simple approximation algorithm for nonoverlapping local alignments. [Citation Graph (0, 0)][DBLP ] Conf ] Maxime Crochemore , Gad M. Landau , Michal Ziv-Ukelson A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Andrzej Lingas On adaptive deterministic gossiping in ad hoc radio networks. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Gamburd , Igor Pak Expansion of product replacement graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Explicit constructions of selectors and related combinatorial structures, with applications. [Citation Graph (0, 0)][DBLP ] Conf ] Lars Engebretsen , Piotr Indyk , Ryan O'Donnell Derandomized dimensionality reduction with applications. [Citation Graph (0, 0)][DBLP ] Conf ] Seth Pettie , Vijaya Ramachandran Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] April Rasala , Clifford Stein , Eric Torng , Patchrawat Uthaisombut Existence theorems, lower bounds and algorithms for scheduling to meet two objectives. [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Bar-Yehuda , Magnús M. Halldórsson , Joseph Naor , Hadas Shachnai , Irina Shapira Scheduling split intervals. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Sudipto Guha , Yoav Katz , Joseph Naor , Baruch Schieber , Hadas Shachnai Throughput maximization of real-time scheduling with batching. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Morten N. Nielsen , Charles Rackoff (Incremental) priority algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , S. Muthukrishnan , Rajmohan Rajaraman Improved algorithms for stretch scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Joachim Giesen , Samrat Goswami , Wulue Zhao Shape dimension and approximation from samples. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Funke , Edgar A. Ramos Smooth-surface reconstruction in near-linear time. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Herbert Edelsbrunner , Yusu Wang Computing the writhing number of a polygonal knot. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Micha Sharir Pseudo-line arrangements: duality, algorithms, and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Vladlen Koltun , Micha Sharir On the overlay of envelopes in four dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein Preprocessing an undirected planar network to enable fast approximate distance queries. [Citation Graph (0, 0)][DBLP ] Conf ] Joachim Gudmundsson , Christos Levcopoulos , Giri Narasimhan , Michiel H. M. Smid Approximate distance oracles for geometric graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Camil Demetrescu , Mikkel Thorup Oracles for distances avoiding a link-failure. [Citation Graph (0, 0)][DBLP ] Conf ] Liam Roditty , Mikkel Thorup , Uri Zwick Roundtrip spanners and roundtrip routing in directed graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Michelangelo Grigni , Papa Sissokho Light spanners and approximate TSP in weighted graphs with forbidden minors. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Refael Hassin , Samir Khuller , Einat Or Capacitated vertex covering with applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ross M. McConnell , Jeremy Spinrad Construction of probe interval models. [Citation Graph (0, 0)][DBLP ] Conf ] Alantha Newman A new algorithm for protein folding in the HP model. [Citation Graph (0, 0)][DBLP ] Conf ] David Hart An optimal (expected time) algorithm for minimizing lab costs in DNA sequencing. [Citation Graph (0, 0)][DBLP ] Conf ] Gianluca Della Vedova , Tao Jiang , Jing Li 0002 , Jianjun Wen Approximating minimum quartet inconsistency (abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Naoki Katoh , Koji Obokata , Takeshi Tokuyama Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , John Dunagan Smoothed analysis of the perceptron algorithm for linear programming. [Citation Graph (0, 0)][DBLP ] Conf ] Satoru Iwata A fully combinatorial algorithm for submodular function minimization. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Eisenbrand , Giovanni Rinaldi , Paolo Ventura 0/1 optimization and 0/1 primal separation are equivalent. [Citation Graph (0, 0)][DBLP ] Conf ] Michal Katz , Nir A. Katz , Amos Korman , David Peleg Labeling schemes for flow and connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Cohen , Eran Halperin , Haim Kaplan , Uri Zwick Reachability and distance queries via 2-hop labels. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Theis Rauhe Improved labeling scheme for ancestor queries. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Tova Milo , Ronen Shabo A comparison of labeling schemes for ancestor queries. [Citation Graph (0, 0)][DBLP ] Conf ] Ziv Bar-Yossef , Kirsten Hildrum , Felix Wu Incentive-compatible online auctions for digital goods. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Tuomas Sandholm , Martin Zinkevich Online algorithms for market clearing. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler , Dan Rubenstein Pricing multicasting in more practical network models. [Citation Graph (0, 0)][DBLP ] Conf ] Aaron Archer , Éva Tardos Frugal path mechanisms. [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi , David P. Williamson Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. [Citation Graph (0, 0)][DBLP ] Conf ] 