Conferences in DBLP
Daniel K. Blandford , Guy E. Blelloch Dictionaries using variable-length keys and data, with applications. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Bro Miltersen Lower bounds on the size of selection and rank indexes. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Leung Chan , Wing-Kai Hon , Tak Wah Lam , Kunihiko Sadakane Dynamic dictionary matching and compressed suffix trees. [Citation Graph (0, 0)][DBLP ] Conf ] Meng He , J. Ian Munro , S. Srinivasa Rao A categorization theorem on suffix arrays with applications to space efficient text indexes. [Citation Graph (0, 0)][DBLP ] Conf ] GaHyun Park , Wojciech Szpankowski Towards a complete characterization of tries. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , Kevin L. Chang , Aleksandr Yampolskiy Inoculation strategies for victims of viruses and the sum-of-squares partition problem. [Citation Graph (0, 0)][DBLP ] Conf ] Nicole Immorlica , Mohammad Mahdian Marriage, honesty, and stability. [Citation Graph (0, 0)][DBLP ] Conf ] Kamal Jain , Vijay V. Vazirani , Yinyu Ye Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. [Citation Graph (0, 0)][DBLP ] Conf ] Bruno Codenotti , Sriram V. Pemmaraju , Kasturi R. Varadarajan On the polynomial time computation of equilibria for certain exchange economies. [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Tim Roughgarden Computing equilibria in multi-player games. [Citation Graph (0, 0)][DBLP ] Conf ] James R. Lee On distance scales, embeddings, and efficient relaxations of the cut cone. [Citation Graph (0, 0)][DBLP ] Conf ] Shuchi Chawla , Anupam Gupta , Harald Räcke Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. [Citation Graph (0, 0)][DBLP ] Conf ] Christos H. Papadimitriou , Shmuel Safra The complexity of low-distortion embeddings between point sets. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu , Kedar Dhamdhere , Anupam Gupta , Yuri Rabinovich , Harald Räcke , R. Ravi , Anastasios Sidiropoulos Approximation algorithms for low-distortion embeddings into low-dimensional spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Adriana Karagiozova A tight threshold for metric Ramsey phenomena. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir The interface between computational and combinatorial geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein Multiple-source shortest paths in planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Chris Harrelson Computing the shortest path: A search meets graph theory. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Rajeev Motwani Finding large cycles in Hamiltonian graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Zeev Nutov Approximating connectivity augmentation problems. [Citation Graph (0, 0)][DBLP ] Conf ] László A. Végh , András A. Benczúr Primal-dual approach for directed vertex connectivity augmentation and generalizations. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Michael Mitzenmacher Multidimensional balanced allocations. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , Tom Leighton Online client-server load balancing without global information. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Tracy Kimbrel , Maxim Sviridenko Job shop scheduling with unit processing times. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Moses Charikar , Sanjeev Khanna , Joseph Naor Approximating the average response time in broadcast scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Elkin , Guy Kortsarz Improved schedule for radio broadcast. [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan On levels in arrangements of surfaces in three dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Hanno Lefmann Distributions of points in the unit-square and large k -gons. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Shakhar Smorodinsky On geometric permutations induced by lines transversal through a fixed point. [Citation Graph (0, 0)][DBLP ] Conf ] Miroslav Chlebík , Janka Chlebíková Approximation hardness of optimization problems in intersection graphs of d -dimensional boxes. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Kleinberg , Jon M. Kleinberg Isomorphism and embedding problems for infinite limits of scale-free graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Abraham Flaxman , Alan M. Frieze , Juan Vera Adversarial deletion in a scale free random graph process. [Citation Graph (0, 0)][DBLP ] Conf ] Soumen Chakrabarti , Alan M. Frieze , Juan Vera The influence of search engines on preferential attachment. [Citation Graph (0, 0)][DBLP ] Conf ] Noam Berger , Christian Borgs , Jennifer T. Chayes , Amin Saberi On the spread of viruses on the internet. [Citation Graph (0, 0)][DBLP ] Conf ] Van Nguyen , Charles U. Martel Analyzing and characterizing small-world graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Cormode , S. Muthukrishnan Substring compression problems. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Gumhold Optimizing markov models with applications to triangular connectivity coding. [Citation Graph (0, 0)][DBLP ] Conf ] Yonatan Aumann , Moshe Lewenstein , Oren Melamud , Ron Y. Pinter , Zohar Yakhini Dotted interval graphs and high throughput genotyping. [Citation Graph (0, 0)][DBLP ] Conf ] Jesper Jansson , Nguyen Bao Nguyen , Wing-Kin Sung Algorithms for combining rooted triplets into a galled phylogenetic network. [Citation Graph (0, 0)][DBLP ] Conf ] Masao Hara , Seiichi Tani , Makoto Yamamoto Unknotting is in AM cup co-AM. [Citation Graph (0, 0)][DBLP ] Conf ] Retsef Levi , Robin Roundy , David B. Shmoys A constant approximation algorithm for the one-warehouse multi-retailer problem. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Becchetti , Jochen Könemann , Stefano Leonardi , Martin Pál Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. [Citation Graph (0, 0)][DBLP ] Conf ] Abraham Flaxman , Adam Tauman Kalai , H. Brendan McMahan Online convex optimization in the bandit setting: gradient descent without a gradient. [Citation Graph (0, 0)][DBLP ] Conf ] Brian C. Dean , Michel X. Goemans , Jan Vondrák Adaptivity and approximation for stochastic packing problems. [Citation Graph (0, 0)][DBLP ] Conf ] Anthony Man-Cho So , Yinyu Ye Theory of semidefinite programming for sensor network localization. [Citation Graph (0, 0)][DBLP ] Conf ] Marcelo H. de Carvalho , Joseph Cheriyan An O(VE) algorithm for ear decompositions of matching-covered graphs. [Citation Graph (0, 0)][DBLP ] Conf ] David J. Abraham , Robert W. Irving , Telikepalli Kavitha , Kurt Mehlhorn Popular matchings. [Citation Graph (0, 0)][DBLP ] Conf ] Loukas Georgiadis , Robert Endre Tarjan Dominator tree verification and vertex-disjoint paths. [Citation Graph (0, 0)][DBLP ] Conf ] Irit Katriel , Hans L. Bodlaender Online topological ordering. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein All maximal independent sets and dynamic dominance for sparse graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Jon Feldman , Clifford Stein LP decoding achieves capacity. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Alexander Vardy Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. [Citation Graph (0, 0)][DBLP ] Conf ] Micah Adler Collecting correlated information from a sensor network. [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas J. A. Harvey , David R. Karger , Kazuo Murota Deterministic network coding by matrix completion. [Citation Graph (0, 0)][DBLP ] Conf ] April Rasala Lehman , Eric Lehman Network coding: does the model need tuning? [Citation Graph (0, 0)][DBLP ] Conf ] Vladlen Koltun Pianos are not flat: rigid motion planning in three dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Boaz Ben-Moshe , Matthew J. Katz , Joseph S. B. Mitchell A constant-factor approximation algorithm for optimal terrain guarding. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir , Hayim Shaul Ray shooting amid balls, farthest point from a line, and range emptiness searching. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Theocharis Malamatos , David M. Mount Space-time tradeoffs for approximate spherical range counting. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Meital Levy , Jirí Matousek , Elchanan Mossel , János Pach , Micha Sharir , Shakhar Smorodinsky , Uli Wagner , Emo Welzl Online conflict-free coloring for intervals. [Citation Graph (0, 0)][DBLP ] Conf ] John C. Baez Loop quantum gravity. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Krivelevich , Zeev Nutov , Raphael Yuster Approximation algorithms for cycle packing problems. [Citation Graph (0, 0)][DBLP ] Conf ] Harold N. Gabow , Michel X. Goemans , Éva Tardos , David P. Williamson Approximating the smallest k -edge connected spanning subgraph by LP-rounding. [Citation Graph (0, 0)][DBLP ] Conf ] Özgür Sümer Partial covering of hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tomokazu Imamura , Kazuo Iwama Approximating vertex cover on dense graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi Bidimensionality: new connections between FPT algorithms and PTASs. [Citation Graph (0, 0)][DBLP ] Conf ] Nicole Immorlica , Mohammad Mahdian , Vahab S. Mirrokni Limitations of cross-monotonic cost sharing schemes. [Citation Graph (0, 0)][DBLP ] Conf ] Jochen Könemann , Stefano Leonardi , Guido Schäfer A group-strategyproof mechanism for Steiner forests. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew V. Goldberg , Jason D. Hartline Collusion-resistant mechanisms for single-parameter agents. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Kleinberg A multiple-choice secretary algorithm with applications to online auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Navin Goyal , Michael E. Saks Rounds vs queries trade-off in noisy computation. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksandrs Slivkins Distributed approaches to triangulation and embedding. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Mihai Badoiu , Erik D. Demaine , Martin Farach-Colton , Mohammad Taghi Hajiaghayi , Anastasios Sidiropoulos Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics. [Citation Graph (0, 0)][DBLP ] Conf ] Don Coppersmith , Michael Elkin Sparse source-wise and pair-wise distance preservers. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Yusu Wang , Peng Yin Lower bound for sparse Euclidean spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Surender Baswana , Telikepalli Kavitha , Kurt Mehlhorn , Seth Pettie New constructions of (alpha, beta)-spanners and purely additive spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. [Citation Graph (0, 0)][DBLP ] Conf ] Éric Fusy , Dominique Poulalhon , Gilles Schaeffer Dissections and trees, with applications to optimal mesh encoding and to random sampling. [Citation Graph (0, 0)][DBLP ] Conf ] David Gamarnik The expected value of random minimal length spanning tree of a complete graph. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kochol Girth restrictions for the 5-flow conjecture. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Asaf Shapira Linear equations, arithmetic progressions and hypergraph property testing. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Boyar , Lene M. Favrholdt , Kim S. Larsen The relative worst order ratio applied to paging. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Rote Strictly convex drawings of planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Rezaul Alam Chowdhury , Vijaya Ramachandran External-memory exact and approximate all-pairs shortest-paths in undirected graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Feigenbaum , Sampath Kannan , Andrew McGregor , Siddharth Suri , Jian Zhang Graph distances in the streaming model: the value of space. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson Lower bounds for external algebraic decision trees. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert T.-H. Chan , Anupam Gupta , Bruce M. Maggs , Shuheng Zhou On hierarchical routing in doubling metrics. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Even-Dar , Yishay Mansour Fast convergence of selfish rerouting. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , Tom Leighton , Harald Räcke Oblivious routing on node-capacitated and directed graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Harald Räcke , Adi Rosén Distributed online call control on general networks. [Citation Graph (0, 0)][DBLP ] Conf ] Fei Li , Jay Sethuraman , Clifford Stein An optimal online algorithm for packet scheduling with agreeable deadlines. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Lars Arge , Ke Yi An optimal dynamic interval stabbing-max data structure? [Citation Graph (0, 0)][DBLP ] Conf ] Robert Endre Tarjan , Renato Fonseca F. Werneck Self-adjusting top trees. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Pagh , Rasmus Pagh , S. Srinivasa Rao An optimal Bloom filter replacement. [Citation Graph (0, 0)][DBLP ] Conf ] Rina Panigrahy Efficient hashing with lookups in two memory accesses. [Citation Graph (0, 0)][DBLP ] Conf ] A. Robert Calderbank , Anna C. Gilbert , Kirill Levchenko , S. Muthukrishnan , Martin Strauss Improved range-summable random variable construction algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Amin Coja-Oghlan A spectral heuristic for bisecting random graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Guy Kortsarz , Jaikumar Radhakrishnan , Sivaramakrishnan Sivasubramanian Complete partitions of graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Tomás Feder , Pavol Hell , Daniel Král , Jiri Sgall Two algorithms for general list matrix partitions. [Citation Graph (0, 0)][DBLP ] Conf ] Sariel Har-Peled , Bardia Sadri How fast is the k-means method? [Citation Graph (0, 0)][DBLP ] Conf ] Boris Aronov , Sariel Har-Peled On approximating the depth and related problems. [Citation Graph (0, 0)][DBLP ] Conf ] Yuichiro Miyamoto , Tomomi Matsui Multicoloring unit disk graphs on triangular lattice points. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sanders , David Steurer An asymptotic approximation scheme for multigraph edge coloring. [Citation Graph (0, 0)][DBLP ] Conf ] Pinar Heggernes , Jan Arne Telle , Yngve Villanger Computing minimal triangulations in time O(nalpha log n) = o(n2.376 ). [Citation Graph (0, 0)][DBLP ] Conf ] Timothy M. Chan Finding the shortest bottleneck edge in a parametric minimum spanning tree. [Citation Graph (0, 0)][DBLP ] Conf ] Abraham D. Flaxman , Alan M. Frieze , Michael Krivelevich On the random 2-stage minimum spanning tree. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige Rigorous analysis of heuristics for NP-hard problems. [Citation Graph (0, 0)][DBLP ] Conf ] Friedrich Eisenbrand , Fabrizio Grandoni An improved approximation algorithm for virtual private network design. [Citation Graph (0, 0)][DBLP ] Conf ] Ara Hayrapetyan , Chaitanya Swamy , Éva Tardos Network design for information networks. [Citation Graph (0, 0)][DBLP ] Conf ] Julia Chuzhoy , Anupam Gupta , Joseph Naor , Amitabh Sinha On the approximability of some network design problems. [Citation Graph (0, 0)][DBLP ] Conf ] Julia Chuzhoy , Yuval Rabani Approximating k-median with non-uniform capacities. [Citation Graph (0, 0)][DBLP ] Conf ] Naveen Garg , Rohit Khandekar , Vinayaka Pandit Improved approximation for universal facility location. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Cooper , Alan M. Frieze The cover time of two classes of random graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas P. Hayes , Eric Vigoda Coupling with the stationary distribution and improved sampling for colorings and independent sets. [Citation Graph (0, 0)][DBLP ] Conf ] Colin Cooper , Martin E. Dyer , Catherine S. Greenhill Sampling regular graphs and a peer-to-peer network. [Citation Graph (0, 0)][DBLP ] Conf ] S. Muthukrishnan , Gopal Pandurangan The bin-covering technique for thresholding random geometric graph properties. [Citation Graph (0, 0)][DBLP ] Conf ] Stefanie Gerke , Colin McDiarmid , Angelika Steger , Andreas Weißl Random planar graphs with n nodes and a fixed number of edges. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Krishna Kolluri Provably good moving least squares. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos Manifold reconstruction from point samples. [Citation Graph (0, 0)][DBLP ] Conf ] Tamal K. Dey , Joachim Giesen , Samrat Goswami Delaunay triangulations approximate anchor hulls. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson , Kim Whittlesey Greedy optimal homotopy and homology generators. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Funke , Christian Klein , Kurt Mehlhorn , Susanne Schmitt Controlled perturbation for Delaunay triangulations. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Thomas P. Hayes Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Doerr Matrix rounding with low error in small submatrices. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan Can the TPRI structure help us to solve the algebraic eigenproblem? [Citation Graph (0, 0)][DBLP ] Conf ] Sung-il Pae , Michael C. Loui Optimal random number generation from a biased coin. [Citation Graph (0, 0)][DBLP ] Conf ] Elitza N. Maneva , Elchanan Mossel , Martin J. Wainwright A new look at survey propagation and its generalizations. [Citation Graph (0, 0)][DBLP ] Conf ] Andris Ambainis , Julia Kempe , Alexander Rivosh Coins make quantum walks faster. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Magniez , Miklos Santha , Mario Szegedy Quantum algorithms for the triangle problem. [Citation Graph (0, 0)][DBLP ] Conf ] Julia Kempe , Aner Shalev The hidden subgroup problem and permutation group theory. [Citation Graph (0, 0)][DBLP ] Conf ] Damon Mosk-Aoyama , Mihalis Yannakakis Testing hierarchical systems. [Citation Graph (0, 0)][DBLP ] Conf ] Viraj Kumar , Mahesh Viswanathan Conformance testing in the presence of multiple faults. [Citation Graph (0, 0)][DBLP ] Conf ] Ron Lavi , Noam Nisan Online ascending auctions for gradually expiring items. [Citation Graph (0, 0)][DBLP ] Conf ] Avrim Blum , Jason D. Hartline Near-optimal online auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Venkatesan Guruswami , Jason D. Hartline , Anna R. Karlin , David Kempe , Claire Kenyon , Frank McSherry On profit-maximizing envy-free pricing. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Boaz Patt-Shamir , David Peleg , Mark R. Tuttle Improved recommendation systems. [Citation Graph (0, 0)][DBLP ] Conf ] Tim Roughgarden Selfish routing with atomic players. [Citation Graph (0, 0)][DBLP ] Conf ] 