Conferences in DBLP
Mohammad Ali Abam , Mark de Berg , Mohammad Farshi , Joachim Gudmundsson Region-fault tolerant geometric spanners. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph S. B. Mitchell A PTAS for TSP with neighborhoods among fat regions in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Yoav Giyora , Haim Kaplan Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. [Citation Graph (0, 0)][DBLP ] Conf ] David Eppstein Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk A near linear time constant factor approximation for Euclidean bichromatic matching (cost). [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Carr , Goran Konjevod , Greg Little , Venkatesh Natarajan , Ojas Parekh Compacting cuts: a new linear formulation for minimum cut. [Citation Graph (0, 0)][DBLP ] Conf ] Wenceslas Fernandez de la Vega , Claire Kenyon-Mathieu Linear programming relaxations of maxcut. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Konstantin Makarychev , Yury Makarychev Near-optimal algorithms for maximum constraint satisfaction problems. [Citation Graph (0, 0)][DBLP ] Conf ] Qiaoming Han , Donglei Du , Juan Vera , Luis F. Zuluaga Improved bounds for the symmetric rendezvous value on the line. [Citation Graph (0, 0)][DBLP ] Conf ] Fabián A. Chudak , Kiyohito Nagano Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Cabello , Erin W. Chambers Multiple source shortest paths in a genus g graph. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Cabello , Günter Rote Obnoxious centers in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Raphael Yuster , Uri Zwick Maximum matching in graphs with an excluded minor. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Sankowski Faster dynamic matchings and vertex connectivity. [Citation Graph (0, 0)][DBLP ] Conf ] Ramesh Hariharan , Telikepalli Kavitha , Debmalya Panigrahi Efficient algorithms for computing all low s-t edge connectivities and related problems. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe Flajolet Analytic combinatorics: a calculus of discrete structures. [Citation Graph (0, 0)][DBLP ] Conf ] Roee Engelberg , Joseph Naor Equilibria in online games. [Citation Graph (0, 0)][DBLP ] Conf ] Xi Chen , Shang-Hua Teng , Paul Valiant The approximation complexity of win-lose games. [Citation Graph (0, 0)][DBLP ] Conf ] Steve Chien , Alistair Sinclair Convergence to approximate Nash equilibria in congestion games. [Citation Graph (0, 0)][DBLP ] Conf ] Amos Fiat , Yishay Mansour , Uri Nadav Efficient contention resolution protocols for selfish agents. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Andelman , Michal Feldman , Yishay Mansour Strong price of anarchy. [Citation Graph (0, 0)][DBLP ] Conf ] Fei Li , Jay Sethuraman , Clifford Stein Better online buffer management. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Englert , Matthias Westermann Considering suppressed packets improves buffer management in QoS switches. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews Instability of FIFO in the permanent sessions model at arbitrarily small network loads. [Citation Graph (0, 0)][DBLP ] Conf ] Spyros Angelopoulos , Reza Dorrigiv , Alejandro López-Ortiz On the separation and equivalence of paging strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Julien Robert , Nicolas Schabanel Pull-based data broadcast with dependencies: be fair to users, not to items. [Citation Graph (0, 0)][DBLP ] Conf ] Spyros Angelopoulos Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi , Hamid Mahini , Amin S. Sayedi-Roshkhar , Shayan Oveis Gharan , Morteza Zadimoghaddam Minimizing movement. [Citation Graph (0, 0)][DBLP ] Conf ] Ayelet Butman , Danny Hermelin , Moshe Lewenstein , Dror Rawitz Optimization problems in multiple-interval graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Mohammad Taghi Hajiaghayi , Bojan Mohar Approximation algorithms via contraction decomposition. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Shuichi Miyazaki , Naoya Yamauchi A 1.875: approximation algorithm for the stable marriage problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jianer Chen , Songjian Lu , Sing-Hoi Sze , Fenghui Zhang Improved algorithms for path, matching, and packing problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Kamesh Munagala Model-driven optimization using adaptive probes. [Citation Graph (0, 0)][DBLP ] Conf ] Parikshit Gopalan , T. S. Jayram , Robert Krauthgamer , Ravi Kumar Estimating the sortedness of a data stream. [Citation Graph (0, 0)][DBLP ] Conf ] Amit Chakrabarti , Graham Cormode , Andrew McGregor A near-optimal algorithm for computing the entropy of a stream. [Citation Graph (0, 0)][DBLP ] Conf ] Xiaoming Sun , David P. Woodruff The communication and streaming complexity of computing the longest common and increasing subsequences. [Citation Graph (0, 0)][DBLP ] Conf ] T. S. Jayram , Satyen Kale , Erik Vee Efficient aggregation algorithms for probabilistic data. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Bodirsky , Éric Fusy , Mihyun Kang , Stefan Vigerske An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. [Citation Graph (0, 0)][DBLP ] Conf ] Mickey Brautbar , Alex Samorodnitsky Approximating entropy from sublinear samples. [Citation Graph (0, 0)][DBLP ] Conf ] David Galvin , Dana Randall Torpid mixing of local Markov chains on 3-colorings of the discrete torus. [Citation Graph (0, 0)][DBLP ] Conf ] Constantinos Daskalakis , Alexandros G. Dimakis , Richard M. Karp , Martin J. Wainwright Probabilistic analysis of linear programming decoding. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Smith Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes. [Citation Graph (0, 0)][DBLP ] Conf ] Anke van Zuylen , Rajneesh Hegde , Kamal Jain , David P. Williamson Deterministic pivoting algorithms for constrained ranking and clustering problems. [Citation Graph (0, 0)][DBLP ] Conf ] Nir Ailon Aggregation of partial rankings, p -ratings and top-m lists. [Citation Graph (0, 0)][DBLP ] Conf ] Rajat Bhattacharjee , Ashish Goel Algorithms and incentives for robust ranking. [Citation Graph (0, 0)][DBLP ] Conf ] Moshe Babaioff , Nicole Immorlica , Robert Kleinberg Matroids, secretary problems, and online mechanisms. [Citation Graph (0, 0)][DBLP ] Conf ] Nicholas J. A. Harvey An algebraic algorithm for weighted linear matroid intersection. [Citation Graph (0, 0)][DBLP ] Conf ] Noga Alon , Oded Schwartz , Asaf Shapira An elementary construction of constant-degree expanders. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Fernholz , Vijaya Ramachandran The k -orientability thresholds for G n, p [Citation Graph (0, 0)][DBLP ] Conf ] Julie Anne Cain , Peter Sanders , Nicholas C. Wormald The random graph threshold for k -orientiability and a fast algorithm for optimal multiple-choice allocation. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Brightwell , Konstantinos Panagiotou , Angelika Steger On extremal subgraphs of random graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Marciniszyn , Reto Spöhel Online vertex colorings of random graphs without monochromatic subgraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Christian Sohler On testable properties in bounded degree graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ittai Abraham , Yair Bartal , Ofer Neiman Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Badoiu , Piotr Indyk , Anastasios Sidiropoulos Approximation algorithms for embedding general metrics into trees. [Citation Graph (0, 0)][DBLP ] Conf ] Nariankadu D. Shyamalkumar , Kasturi Varadarajan Efficient subspace approximation algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Moses Charikar , Konstantin Makarychev , Yury Makarychev A divide and conquer algorithm for d -dimensional arrangement. [Citation Graph (0, 0)][DBLP ] Conf ] Irene Finocchi , Fabrizio Grandoni , Giuseppe F. Italiano Resilient search trees. [Citation Graph (0, 0)][DBLP ] Conf ] Mihai Patrascu , Mikkel Thorup Randomization does not help searching predecessors. [Citation Graph (0, 0)][DBLP ] Conf ] Tsvi Kopelowitz , Moshe Lewenstein Dynamic weighted ancestors. [Citation Graph (0, 0)][DBLP ] Conf ] Jesper Jansson , Kunihiko Sadakane , Wing-Kin Sung Ultra-succinct representation of ordered trees. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Andrzej Pelc , Tomasz Radzik , Xiaohui Zhang Tree exploration with logarithmic memory. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Chudnovsky , Paul D. Seymour Testing for a theta. [Citation Graph (0, 0)][DBLP ] Conf ] Amnon Ta-Shma , Uri Zwick Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Jérémie Chalopin , Daniel Gonçalves , Pascal Ochem Planar graphs are in 1-STRING. [Citation Graph (0, 0)][DBLP ] Conf ] Julia Böttcher , Mathias Schacht , Anusch Taraz On the bandwidth conjecture for 3-colourable graphs. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Igor Gorodezky Sandpile transience on the grid is polynomially bounded. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Hunter , Stephan Kreutzer Digraph measures: Kelly decompositions, games, and orderings. [Citation Graph (0, 0)][DBLP ] Conf ] C. Thach Nguyen , Jian Shen , Minmei Hou , Li Sheng , Webb Miller , Louxin Zhang Approximating the spanning star forest problem and its applications to genomic sequence alignment. [Citation Graph (0, 0)][DBLP ] Conf ] Jing Xiao , Lan Liu , Lirong Xia , Tao Jiang Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree. [Citation Graph (0, 0)][DBLP ] Conf ] Max A. Alekseyev , Pavel A. Pevzner Whole genome duplications, multi-break rearrangements, and genome halving problem. [Citation Graph (0, 0)][DBLP ] Conf ] Jérémy Barbay , Meng He , J. Ian Munro , S. Srinivasa Rao Succinct indexes for strings, binary relations and multi-labeled trees. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Ferragina , Rossano Venturini A simple storage scheme for strings achieving entropy bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Eyal Even-Dar , Michael Kearns , Siddharth Suri A network formation game for bipartite exchange economies. [Citation Graph (0, 0)][DBLP ] Conf ] Ning Chen , Anna R. Karlin Cheap labor can be expensive. [Citation Graph (0, 0)][DBLP ] Conf ] Patrick Briest , Piotr Krysta Buying cheap is expensive: hardness of non-parametric multi-product pricing. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Ning Chen , Neva Cherniavsky , Atri Rudra , Baruch Schieber , Maxim Sviridenko Dynamic pricing for impatient bidders. [Citation Graph (0, 0)][DBLP ] Conf ] Edith Elkind Designing and learning optimal finite support auctions. [Citation Graph (0, 0)][DBLP ] Conf ] Frank Nielsen , Jean-Daniel Boissonnat , Richard Nock On Bregman Voronoi diagrams. [Citation Graph (0, 0)][DBLP ] Conf ] Tetsuo Asano , Jirí Matousek , Takeshi Tokuyama Zone diagrams: existence, uniqueness and algorithmic challenge. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Hyeon-Suk Na , Antoine Vigneron , Yajun Wang Approximate shortest paths in anisotropic regions. [Citation Graph (0, 0)][DBLP ] Conf ] Liam Roditty , Michael Segal On bounded leg shortest paths problems. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Natan Rubin , Micha Sharir , Elad Verbin Counting colors in boxes. [Citation Graph (0, 0)][DBLP ] Conf ] Ho-Leung Chan , Wun-Tat Chan , Tak Wah Lam , Lap-Kei Lee , Kin-Sum Mak , Prudence W. H. Wong Energy efficient online deadline scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Kirk Pruhs , Clifford Stein Speed scaling for weighted flow time. [Citation Graph (0, 0)][DBLP ] Conf ] James Aspnes , Yang Richard Yang , Yitong Yin Path-independent load balancing with unreliable machines. [Citation Graph (0, 0)][DBLP ] Conf ] Qingbo Cai , Vincenzo Liberatore Layered multicast scheduling for the Linfinity objective. [Citation Graph (0, 0)][DBLP ] Conf ] Wei-Lung Dustin Tseng , David Kirkpatrick Lower bounds on average-case delay for video-on-demand broadcast protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Jan M. Hochstein , Karsten Weihe Maximum s-t -flow with k crossings in O (k 3 n log n ) time. [Citation Graph (0, 0)][DBLP ] Conf ] Günter Rote , Martin Zachariasen Matrix scaling by network flow. [Citation Graph (0, 0)][DBLP ] Conf ] Henning Bruhn , Jakub Cerný , Alexander Hall , Petr Kolman Single source multiroute flows and cuts on uniform capacity networks. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew McGregor , Bruce Shepherd Island hopping and path colouring with applications to WDM network design. [Citation Graph (0, 0)][DBLP ] Conf ] Vadim V. Lozin , Martin Milanic Maximum independent sets in graphs of low degree. [Citation Graph (0, 0)][DBLP ] Conf ] Richard M. Karp , Robert Kleinberg Noisy binary search and its applications. [Citation Graph (0, 0)][DBLP ] Conf ] Luc Devroye , Gábor Lugosi , GaHyun Park , Wojciech Szpankowski Multiple choice tries and distributed hash tables. [Citation Graph (0, 0)][DBLP ] Conf ] Milan Ruzic Making deterministic signatures quickly. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Allulli , Peter Lichodzijewski , Norbert Zeh A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. [Citation Graph (0, 0)][DBLP ] Conf ] Liam Roditty On the K -simple shortest paths problem in weighted directed graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Mohammad Taghi Hajiaghayi , Robert Kleinberg , Tom Leighton Semi-oblivious routing: lower bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Goran Konjevod , Andréa W. Richa , Donglin Xia Optimal scale-free compact routing schemes in networks of low doubling dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Rohit Khandekar , Satish Rao Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Funke , Nikola Milosavljevic Network sketching or: "How Much Geometry Hides in Connectivity?--Part II". [Citation Graph (0, 0)][DBLP ] Conf ] Alan Frieze , Jon M. Kleinberg , R. Ravi , Warren Debany Line-of-sight networks. [Citation Graph (0, 0)][DBLP ] Conf ] Asaf Shapira , Raphael Yuster , Uri Zwick All-pairs bottleneck paths in vertex weighted graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Andrzej Lingas Finding a heaviest triangle is not harder than matrix multiplication. [Citation Graph (0, 0)][DBLP ] Conf ] Ryan Williams Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). [Citation Graph (0, 0)][DBLP ] Conf ] Ioannis Koutis , Gary L. Miller A linear work, O(n1/6 ) time, parallel algorithm for solving planar Laplacians. [Citation Graph (0, 0)][DBLP ] Conf ] Alin Bostan , Frédéric Chyzak , F. Ollivier , Bruno Salvy , Éric Schost , Alexandre Sedoglavic Fast computation of power series solutions of systems of differential equations. [Citation Graph (0, 0)][DBLP ] Conf ] Monika Rauch Henzinger Combinatorial algorithms for web search engines: three success stories. [Citation Graph (0, 0)][DBLP ] Conf ] David Arthur , Sergei Vassilvitskii k-means++: the advantages of careful seeding. [Citation Graph (0, 0)][DBLP ] Conf ] Anirban Dasgupta , John E. Hopcroft , Ravi Kannan , Pradipta Prometheus Mitra Spectral clustering with limited independence. [Citation Graph (0, 0)][DBLP ] Conf ] Kamalika Chaudhuri , Eran Halperin , Satish Rao , Shuheng Zhou A rigorous analysis of population stratification with limited data. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Alon Efrat , Shaili Jain , Suresh Venkatasubramanian , Ke Yi Restricted strip covering and the sensor cover problem. [Citation Graph (0, 0)][DBLP ] Conf ] David Applegate , Gruia Calinescu , David S. Johnson , Howard J. Karloff , Katrina Ligett , Jia Wang Compressing rectilinear pictures and minimizing access control lists. [Citation Graph (0, 0)][DBLP ] Conf ] Leonidas J. Guibas , Steve Oudot Reconstruction using witness complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Edgar A. Ramos , Bardia Sadri Geometric and topological guarantees for the WRAP reconstruction algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Siu-Wing Cheng , Tamal K. Dey , Edgar A. Ramos Delaunay refinement for piecewise smooth complexes. [Citation Graph (0, 0)][DBLP ] Conf ] Nina Amenta , Dominique Attali , Olivier Devillers Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. [Citation Graph (0, 0)][DBLP ] Conf ] Adrian Dumitrescu , Csaba D. Tóth On the number of tetrahedra with minimum, unit, and distinct volumes in three-space. [Citation Graph (0, 0)][DBLP ] Conf ] Ravi Kannan , Thorsten Theobald Games of fixed rank: a hierarchy of bimatrix games. [Citation Graph (0, 0)][DBLP ] Conf ] Chaitanya Swamy The effectiveness of Stackelberg strategies and tolls for network congestion games. [Citation Graph (0, 0)][DBLP ] Conf ] Ahuva Mu'alem , Michael Schapira Setting lower bounds on truthfulness: extended abstract. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta , Jochen Könemann , Stefano Leonardi , R. Ravi , Guido Schäfer An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. [Citation Graph (0, 0)][DBLP ] Conf ] George Christodoulou , Elias Koutsoupias , Angelina Vidali A lower bound for scheduling mechanisms. [Citation Graph (0, 0)][DBLP ] Conf ] Satoru Iwata , Kenjiro Takazawa The independent even factor problem. [Citation Graph (0, 0)][DBLP ] Conf ] Yuji Matsuoka Fractional packing in ideal clutters. [Citation Graph (0, 0)][DBLP ] Conf ] Ken-ichi Kawarabayashi Half integral packing, Erdős-Posá-property and graph minors. [Citation Graph (0, 0)][DBLP ] Conf ] Nikhil Bansal , Xin Han , Kazuo Iwama , Maxim Sviridenko , Guochuan Zhang Harmonic algorithm for 3-dimensional strip packing problem. [Citation Graph (0, 0)][DBLP ] Conf ] David Karger , Krzysztof Onak Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems. [Citation Graph (0, 0)][DBLP ] Conf ] Gorjan Alagic , Cristopher Moore , Alexander Russell Quantum algorithms for Simon's problem over general groups. [Citation Graph (0, 0)][DBLP ] Conf ] Andrew M. Childs , Wim van Dam Quantum algorithm for a generalized hidden shift problem. [Citation Graph (0, 0)][DBLP ] Conf ] Dave Bacon , Isaac L. Chuang , Aram Wettroth Harrow The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits. [Citation Graph (0, 0)][DBLP ] Conf ] David Gamarnik , Dmitriy Katz Correlation decay and deterministic FPTAS for counting list-colorings of a graph. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Montanari , Devavrat Shah Counting good truth assignments of random k -SAT formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Mohammad Taghi Hajiaghayi , Guy Kortsarz , Mohammad R. Salavatipour Approximation algorithms for node-weighted buy-at-bulk network design. [Citation Graph (0, 0)][DBLP ] Conf ] Yogeshwer Sharma , Chaitanya Swamy , David P. Williamson Approximation algorithms for prize collecting forest problems with submodular penalty functions. [Citation Graph (0, 0)][DBLP ] Conf ] Glencora Borradaile , Claire Kenyon-Mathieu , Philip N. Klein A polynomial-time approximation scheme for Steiner tree in planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Englert , Heiko Röglin , Berthold Vöcking Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract. [Citation Graph (0, 0)][DBLP ] Conf ] Aravind Srinivasan Approximation algorithms for stochastic and risk-averse optimization. [Citation Graph (0, 0)][DBLP ] Conf ] 