Conferences in DBLP
Eran Halperin , Uri Zwick Combinatorial approximation algorithms for the maximum directed cut problem. [Citation Graph (0, 0)][DBLP ] Conf ] Gruia Calinescu , Howard J. Karloff , Yuval Rabani Approximation algorithms for the 0-extension problem. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Cole , Ramesh Hariharan , Moshe Lewenstein , Ely Porat A faster implementation of the Goemans-Williamson clustering algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Naor , Yuval Rabani Tree packing and approximating k-cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Xiang-Yang Li , Shang-Hua Teng Generating well-shaped Delaunay meshed in 3D. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu , Joseph S. B. Mitchell Approximation algorithms for TSP with neighborhoods in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Lun Cheng , Tamal K. Dey , Herbert Edelsbrunner , John Sullivan Dynamic skin triangulation. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Micha Sharir Online point location in planar arrangements and its applications. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sanders Reconciling simplicity and realism in parallel disk models. [Citation Graph (0, 0)][DBLP ] Conf ] Jeffrey Scott Vitter , David A. Hutchinson Distribution sort with randomizing cycle. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Meyer External memory BFS on undirected graphs with bounded degree. [Citation Graph (0, 0)][DBLP ] Conf ] Anil Maheshwari , Norbert Zeh I/O-efficient algorithms for graphs of bounded treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Benny Sudakov , Uri Zwick Constructing worst case instances for semidefinite programming based approximation algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Pellegrini Randomizing combinatorial algorithms for linear programming when the dimension is moderately high. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna , Joseph Naor , Leonid Zosin Approximation algorithms for the metric labeling problem via a new linear programming formulation. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Lattice approximation and linear discrepency of totally unimodular matrices. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kumar , D. Sivakumar On polynomial approximation to the shortest lattice vector length. [Citation Graph (0, 0)][DBLP ] Conf ] Francis Y. L. Chin , Stanley P. Y. Fung , Cao An Wang Approximation for minimum triangulation of convex polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Michael A. Bender , Erik D. Demaine , Sándor P. Fekete , Joseph S. B. Mitchell , Saurabh Sethia Optimal covering tours with turn costs. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Sariel Har-Peled Maintaining approximate extent measures of moving points. [Citation Graph (0, 0)][DBLP ] Conf ] John Hershberger , Subhash Suri Simplified kinetic connectivity for rectangles and hypercubes. [Citation Graph (0, 0)][DBLP ] Conf ] Menelaos I. Karavelas , Leonidas J. Guibas Static and kinetic geometric spanners with applications. [Citation Graph (0, 0)][DBLP ] Conf ] David Liben-Nowell Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance. [Citation Graph (0, 0)][DBLP ] Conf ] Tandy Warnow , Bernard M. E. Moret , Katherine St. John Absolute convergence: true trees from short sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Katherine St. John , Tandy Warnow , Bernard M. E. Moret , Lisa Vawter Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel G. Brown A probabilistic analysis of a greedy algorithm arising from computational biology. [Citation Graph (0, 0)][DBLP ] Conf ] Rahul Shah , Martin Farach-Colton On the midpath tree conjuncture: a counter-example. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Gavoille , David Peleg , Stephane Perennes , Ran Raz Distance labeling in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta Steiner points in tree metrics don't (really) help. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , Joseph Wang Fast approximation of centrality. [Citation Graph (0, 0)][DBLP ] Conf ] Guangting Chen , Guoliang Xue K-pair delay constrained minimum cost routing in undirected networks. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna , Joseph Naor A deterministic algorithm for the cost-distance problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yunhong Zhou , Subhash Suri Shape sensitive geometric permutations. [Citation Graph (0, 0)][DBLP ] Conf ] Yingping Huang , Jinhui Xu , Danny Z. Chen Geometric permutations of high dimensional spheres. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Gutwenger , Petra Mutzel , René Weiskircher Inserting an edge into a planar graph. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Theocharis Malamatos , David M. Mount Entropy-preserving cuttings and space-efficient planar point location. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Theocharis Malamatos , David M. Mount A simple entropy-based algorithm for planar point location. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Giovanni Manzini An experimental study of an opportunistic index. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Richard Cole , Ramesh Hariharan , Moshe Lewenstein , Ely Porat Overlap matching. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Alejandro López-Ortiz A linear lower bound on index size for text retrieval. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Piotr Indyk , Suresh Venkatasubramanian Pattern matching for sets of segments. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Ely Porat , Moshe Lewenstein Approximate subset matching with Don't Cares. [Citation Graph (0, 0)][DBLP ] Conf ] Arne Andersson , Mikkel Thorup Dynamic string searching. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Kortsarz , Robert Krauthgamer On approximating the achromatic number. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Halperin , Ram Nathaniel , Uri Zwick Coloring k-colorable graphs using smaller palettes. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Krivelevich , Ram Nathaniel , Benny Sudakov Approximating coloring and maximum independent sets in 3-uniform hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Damian-Iordache , Sriram V. Pemmaraju Computing optimal alpha-fat and alpha-small decompositions. [Citation Graph (0, 0)][DBLP ] Conf ] John Iacono Optimal planar point location. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Ovidiu Daescu , John Hershberger , Peter M. Kogge , Jack Snoeyink Polygonal path approximation with angle constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Funke , Edgar A. Ramos Reconstructing a collection of curves with corners and endpoints. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Meyerson , Kamesh Munagala , Serge A. Plotkin Web caching using access statistics. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Richard E. Ladner Competitive on-line stream merging algorithms for media-on-demand. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Brehob , Richard J. Enbody , Eric Torng , Stephen Wagner On-line restricted caching. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel , Adam Meyerson , Serge A. Plotkin Approximate majorization and fair online load balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou Game theory, algorithms, and the Internet. [Citation Graph (0, 0)][DBLP ] Conf ] David R. Karger , Nathan Srebro Learning Markov networks: maximum bounded tree-width graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Rautenbach , Bruce A. Reed Approximately covering by cycles in planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Zelikovsky , Ion I. Mandoiu Practical approximation algorithms for zero- and bounded-skew trees. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Vetta Approximating the minimum strongly connected subgraph via a matching lower bound. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Berman , Bhaskar DasGupta , S. Muthukrishnan , Suneeta Ramaswami Improved approximation algorithms for rectangle tiling and packing. [Citation Graph (0, 0)][DBLP ] Conf ] Nina Mishra , Daniel Oblinger , Leonard Pitt Sublinear time approximate clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Benny Pinkas Efficient oblivious transfer protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Omer Reingold Constructing pseudo-random permutations with a prescribed structure. [Citation Graph (0, 0)][DBLP ] Conf ] Vijay Raghavan , Jeremy Spinrad Robust algorithms for restricted domains. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Kobler , Udi Rotics Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Julie L. Johnson , Jeremy Spinrad A polynomial time recognition algorithm for probe interval graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Johann A. Makowsky Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. [Citation Graph (0, 0)][DBLP ] Conf ] Chen Li 0003 , Chee-Keng Yap A new constructive root bound for algebraic expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Yi-Ting Chiang , Ching-Chi Lin , Hsueh-I Lu Orderly spanning trees with applications to graph encoding and graph drawing. [Citation Graph (0, 0)][DBLP ] Conf ] John Iacono Alternatives to splay trees with O(log n) worst-case access times. [Citation Graph (0, 0)][DBLP ] Conf ] Andrej Brodnik , Svante Carlsson , Johan Karlsson , J. Ian Munro Worst case constant time priority queue. [Citation Graph (0, 0)][DBLP ] Conf ] J. Ian Munro , Venkatesh Raman , Adam J. Storm Representing dynamic binary trees succinctly. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Haim Kaplan Making data structures confluently persistent. [Citation Graph (0, 0)][DBLP ] Conf ] Serge Abiteboul , Haim Kaplan , Tova Milo Compact labeling schemes for ancestor queries. [Citation Graph (0, 0)][DBLP ] Conf ] János Csirik , David S. Johnson , Claire Kenyon Better approximation algorithms for bin covering. [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan New approaches to covering and packing problems. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel W. Engels , Jon Feldman , David R. Karger , Matthias Ruhl Parallel processor scheduling with delay constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Edward G. Coffman Jr. , George S. Lueker Approximation algorithms for extensible bin packing. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Skutella , Marc Uetz Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Kesselman , Yishay Mansour Loss-bounded analysis for differentiated services. [Citation Graph (0, 0)][DBLP ] Conf ] Allan Borodin , Rafail Ostrovsky , Yuval Rabani Stability preserving transformations: packet routing networks with edge capacities and speeds. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel , Adam Meyerson , Serge A. Plotkin Distributed admission control, scheduling, and routing with stale information. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Hall , Jason D. Hartline , Anna R. Karlin , Jared Saia , John Wilkes On algorithms for efficient data migration. [Citation Graph (0, 0)][DBLP ] Conf ] Gianluca De Marco , Andrzej Pelc Fast distributed graph coloring with O(Delta) colors. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Adam Meyerson , Kamesh Munagala Improved algorithms for fault tolerant facility location. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Samir Khuller , David M. Mount , Giri Narasimhan Algorithms for facility location problems with outliers. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze , Gregory B. Sorkin The probabilistic relationship between the assignment and asymmetric traveling salesman problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ivan D. Baev , Rajmohan Rajaraman Approximation algorithms for data placement in arbitrary networks. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Erlebach , Klaus Jansen , Eike Seidel Polynomial-time approximation schemes for geometric graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Sariel Har-Peled , Leonidas J. Guibas , T. M. Murali Morphing between polylines. [Citation Graph (0, 0)][DBLP ] Conf ] Kim Miller , Suneeta Ramaswami , Peter Rousseeuw , Joan Antoni Sellarès , Diane L. Souvaine , Ileana Streinu , Anja Struyf Fast implementation of depth contours using topological sweep. [Citation Graph (0, 0)][DBLP ] Conf ] Marshall W. Bern Computing the depth of a flat. [Citation Graph (0, 0)][DBLP ] Conf ] Hana Chockler , Uri Zwick Which formulae shrink under random restrictions? [Citation Graph (0, 0)][DBLP ] Conf ] Andrea E. F. Clementi , Angelo Monti , Riccardo Silvestri Selective families, superimposed codes, and broadcasting on unknown radio networks. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Istrate , Madhav V. Marathe , S. S. Ravi Adversarial models in evolutionary game dynamics. [Citation Graph (0, 0)][DBLP ] Conf ] Dimitris Achlioptas , Arthur D. Chtcherba , Gabriel Istrate , Cristopher Moore The phase transition in 1-in-k SAT and NAE 3-SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Fan R. K. Chung , Ronald L. Graham , Frank Thomson Leighton Guessing secrets. [Citation Graph (0, 0)][DBLP ] Conf ] Gopal Pandurangan , Eli Upfal Can entropy characterize performance of online algorithms?. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Jason D. Hartline , Andrew Wright Competitive auctions and digital goods. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , David F. Fischer , Michael J. Fischer , Ming-Yang Kao , Alok Kumar Towards understanding the predictability of stock markets from the perspective of computational complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Tak Wah Lam , Kar-Keung To Performance guarentee for online deadline scheduling in the presence of overload. [Citation Graph (0, 0)][DBLP ] Conf ] Gerhard J. Woeginger Assigning chain-like tasks to a chain-like network. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Anderson , Brian Tjaden The inverse nearest neighbor problem with astrophysical applications. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel , Piotr Indyk , Kasturi R. Varadarajan Reductions among high dimensional proximity problems. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Thore Husfeldt , Theis Rauhe A cell probe lower bound for dynamic nearest-neighbor searching. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Thomas B. Sebastian , Benjamin B. Kimia Shape matching using edit-distance: an implementation. [Citation Graph (0, 0)][DBLP ] Conf ] Vida Dujmovic , Sue Whitesides On validating planar worlds. [Citation Graph (0, 0)][DBLP ] Conf ] Yijie Han Improved fast integer sorting in linear space. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrich Meyer Single-source shortest-paths on arbitrary directed graphs in linear average-case time. [Citation Graph (0, 0)][DBLP ] Conf ] Christian A. Duncan , Stephen G. Kobourov , V. S. Anil Kumar Optimal constrained graph exploration. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst Althaus , Denys Duchier , Alexander Koller , Kurt Mehlhorn , Joachim Niehren , Sven Thiel An efficient algorithm for the configuration problem of dominance graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Therese C. Biedl Linear reductions of maximum matching. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein , S. Muthukrishnan Internet packet filter management and rectangle geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Robert Endre Tarjan , Kostas Tsioutsiouliklis Faster kinetic heaps and their use in broadcast scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Giridhar Pemmasani , Steven Skiena , Pavel Sumazin Finding least common ancestors in directed acyclic graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Sany Laber , Ruy Luiz Milidiú , Artur Alves Pessoa On binary searching with non-uniform costs. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Christian Sohler Soft kinetic data structures. [Citation Graph (0, 0)][DBLP ] Conf ] Eldar Fischer Testing graphs for colorable properties. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Amit , Nathan Linial , Jirí Matousek , Eyal Rozenman Random lifts of graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Justin A. Boyan , Michael Mitzenmacher IMproved results for route planning in stochastic transportation. [Citation Graph (0, 0)][DBLP ] Conf ] Ted Carson , Russell Impagliazzo Hill-climbing finds random planted bisections. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Alejandro López-Ortiz , J. Ian Munro On universally easy classes for NP-complete problems. [Citation Graph (0, 0)][DBLP ] Conf ] Linyuan Lu The diameter of random massive graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan Domatic partitions and the Lovász local lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Sriram V. Pemmaraju Equitable colorings extend Chernoff-Hoeffding bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeniy Dodis , Peter Winkler Universal configurations in light-flipping games. [Citation Graph (0, 0)][DBLP ] Conf ] Jérémy Barbay , Claire Kenyon On the discrete Bak-Sneppen model of self-organized criticality. [Citation Graph (0, 0)][DBLP ] Conf ] 