Conferences in DBLP
Daniel Bienstock epsilon-Approximate linear programs: new bounds and computation. [Citation Graph (0, 0)][DBLP ] Conf ] Markus Eiglsperger , Ulrich Fößmeier , Michael Kaufmann Orthogonal graph drawing with constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Alberto Caprara , Giuseppe Lancia , See-Kiong Ng Fast practical solution of sorting by reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Mayur Datar , Abhiram G. Ranade Commuting with delay prone buses. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Christian Scheideler Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Kratochvíl , Zsolt Tuza On the complexity of bicoloring clique hypergraphs of graphs (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Ryan Hayward , Jeremy Spinrad , R. Sritharan Weakly chordal graph algorithms via handles. [Citation Graph (0, 0)][DBLP ] Conf ] Vasek Chvátal , Jean Fonlupt , L. Sun , A. Zemirline Recognizing dart-free perfect graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Langerman , William L. Steiger An optimal algorithm for hyperplane depth in the plane. [Citation Graph (0, 0)][DBLP ] Conf ] Hanno Lefmann On Heilbronn's problem in higher dimension. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Below , Jesús A. De Loera , Jürgen Richter-Gebert Finding minimal triangulations of convex 3-polytopes is NP-hard. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Murphy , David M. Mount , Carl W. Gable A point-placement strategy for conforming Delaunay tetrahedralization. [Citation Graph (0, 0)][DBLP ] Conf ] Robin Thomas Digraph minors and algorithms (abstract only). [Citation Graph (0, 0)][DBLP ] Conf ] Michel X. Goemans , Martin Skutella Cooperative facility location games. [Citation Graph (0, 0)][DBLP ] Conf ] Neal E. Young K -medians, facility location, and the Chernoff-Wald bound.Citation Graph (0, 0)][DBLP ] Conf ] Takao Asano , David P. Williamson Improved approximation algorithms for MAX SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Carr , Lisa Fleischer , Vitus J. Leung , Cynthia A. Phillips Strengthening integrality gaps for capacitated network design and covering problems. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Carr , Santosh Vempala , Jacques Mandler Towards a 4/3 approximation for the asymmetric traveling salesman problem. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Dubois , Yacine Boufkhad , Jacques Mandler Typical random 3-SAT formulae and the satisfiability threshold. [Citation Graph (0, 0)][DBLP ] Conf ] Pavel Pudlák , Russell Impagliazzo A lower bound for DLL algorithms for k -SAT (preliminary version). [Citation Graph (0, 0)][DBLP ] Conf ] Toshiya Itoh , Yoshinori Takei , Jun Tarui On permutations with limited independence. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Uriel Feige Min-Wise versus linear independence (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Felsner , Ferran Hurtado , Marc Noy , Ileana Streinu Hamiltonicity and colorings of arrangement graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Joan Feigenbaum , Sampath Kannan , Martin Strauss , Mahesh Viswanathan Testing and spot-checking of data streams (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Donald F. Caldwell , Kenneth Ward Church , Glenn S. Fowler , S. Muthukrishnan Engineering the compression of massive tables: an experimental approach. [Citation Graph (0, 0)][DBLP ] Conf ] Z. Cohen , Yossi Matias , S. Muthukrishnan , Süleyman Cenk Sahinalp , Jacob Ziv On the temporal HZY compression scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Charles Knessl , Wojciech Szpankowski Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Cormode , Mike Paterson , Süleyman Cenk Sahinalp , Uzi Vishkin Communication complexity of document exchange. [Citation Graph (0, 0)][DBLP ] Conf ] Petra Schuurman , Gerhard J. Woeginger Scheduling a pipelined operator graph. [Citation Graph (0, 0)][DBLP ] Conf ] Chandra Chekuri , Sanjeev Khanna A PTAS for the multiple knapsack problem. [Citation Graph (0, 0)][DBLP ] Conf ] Leana Golubchik , Sanjeev Khanna , Samir Khuller , Ramakrishna Thurimella , An Zhu Approximation algorithms for data placement on parallel disks. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Espelage , Egon Wanke Movement minimization in conveyor flow shop processing. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf H. Möhring , Martin Skutella , Frederik Stork Forcing relations for AND/OR precedence constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Arratia , Béla Bollobás , Gregory B. Sorkin The interlace polynomial: a new graph polynomial. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Catherine S. Greenhill The complexity of counting graph homomorphisms (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Frank Ruskey , Joe Sawada A fast algorithm to generate unlabeled necklaces. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Kuhlmann , Hans-Ulrich Simon Construction of visual secret sharing schemes with almost optimal contrast. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Di Crescenzo Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio. [Citation Graph (0, 0)][DBLP ] Conf ] Deborah Goldman , Sorin Istrail , Giuseppe Lancia , Antonio Piccolboni , Brian Walenz Algorithmic strategies in combinatorial chemistry. [Citation Graph (0, 0)][DBLP ] Conf ] David Bryant , John Tsang , Paul E. Kearney , Ming Li Computing the quartet distance between evolutionary trees. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Berry , David Bryant , Tao Jiang , Paul E. Kearney , Ming Li , Todd Wareham , Haoyong Zhang A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Laxmi Parida , Isidore Rigoutsos , Aris Floratos , Daniel E. Platt , Yuan Gao Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Yi Li , Philip M. Long , Aravind Srinivasan Improved bounds on the sample complexity of learning. [Citation Graph (0, 0)][DBLP ] Conf ] Samir Khuller , Randeep Bhatia , Robert Pless On local search and placement of meters in networks. [Citation Graph (0, 0)][DBLP ] Conf ] Eran Halperin Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. [Citation Graph (0, 0)][DBLP ] Conf ] Goran Konjevod , R. Ravi An approximation algorithm for the covering Steiner problem. [Citation Graph (0, 0)][DBLP ] Conf ] Robert D. Carr , Srinivas Doddi , Goran Konjevod , Madhav V. Marathe On the red-blue set cover problem. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk , Suresh Venkatasubramanian Approximate congruence in nearly linear time. [Citation Graph (0, 0)][DBLP ] Conf ] Peter N. Yianilos Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Indyk Dimensionality reduction techniques for proximity problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sunil Arya , Ho-Yam Addy Fu Expected-case complexity of approximate nearest neighbor searching. [Citation Graph (0, 0)][DBLP ] Conf ] Ting Chen , Ming-Yang Kao , Matthew Tepel , John Rush , George M. Church A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry. [Citation Graph (0, 0)][DBLP ] Conf ] Éva Czabarka , Goran Konjevod , Madhav V. Marathe , Allon G. Percus , David C. Torney Algorithms for optimizing production DNA sequencing. [Citation Graph (0, 0)][DBLP ] Conf ] J. Kevin Lanctot , Ming Li , En-Hui Yang Estimating DNA sequence entropy. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel G. Brown , Todd J. Vision , Steven D. Tanksley Selective mapping: a discrete optimization approach to selecting a population subset for use in a high-density genetic mapping project. [Citation Graph (0, 0)][DBLP ] Conf ] David Applegate , Robert E. Bixby , Vasek Chvátal , William Cook Cutting planes and the traveling salesman problem (abstract only). [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Berthold Vöcking , Matthias Westermann Caching in networks (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews Instability of FIFO in session-oriented networks. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew Andrews , Lisa Zhang The effects of temporary sessions on network performance. [Citation Graph (0, 0)][DBLP ] Conf ] Costas Busch , Maurice Herlihy , Roger Wattenhofer Randomized greedy hot-potato routing. [Citation Graph (0, 0)][DBLP ] Conf ] David Gamarnik On deciding stability of scheduling policies in queueing systems. [Citation Graph (0, 0)][DBLP ] Conf ] William S. Evans , David G. Kirkpatrick Restructuring ordered binary trees. [Citation Graph (0, 0)][DBLP ] Conf ] Rasmus Pagh Faster deterministic dictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] Michael T. Goodrich Competitive tree-structured dictionaries. [Citation Graph (0, 0)][DBLP ] Conf ] Mikkel Thorup Even strongly universal hashing is pretty fast. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Jens P. Secher , Mikkel Thorup Word encoding tree connectivity works. [Citation Graph (0, 0)][DBLP ] Conf ] Yunhong Zhou , Subhash Suri Algorithms for minimum volume enclosing simplex in R3 . [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Boris Aronov , Micha Sharir Exact and approximation algorithms for minimum-width cylindrical shells. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Devillers , Franco P. Preparata Evaluating the cylindricity of a nominally cylindrical point set. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Pavan K. Desikan Approximation algorithms for layered manufacturing. [Citation Graph (0, 0)][DBLP ] Conf ] Pankaj K. Agarwal , Cecilia Magdalena Procopiuc Approximation algorithms for projective clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Luca Becchetti , Stefano Leonardi , S. Muthukrishnan Scheduling to minimize average stretch without migration. [Citation Graph (0, 0)][DBLP ] Conf ] Yair Bartal , S. Muthukrishnan Minimizing maximum response time in scheduling broadcasts. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Brehob , Eric Torng , Patchrawat Uthaisombut Applying extra-resource analysis to load balancing. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel , Kamesh Munagala Balancing Steiner trees and shortest path trees online. [Citation Graph (0, 0)][DBLP ] Conf ] Todd Gormley , Nick Reingold , Eric Torng , Jeffery Westbrook Generating adversaries for request-answer games. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Jeffery Westbrook Maintaining hierarchical graph views. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Z. Broder , Robert Krauthgamer , Michael Mitzenmacher Improved classification via connectivity information. [Citation Graph (0, 0)][DBLP ] Conf ] Omer Berkman , Michal Parnas , Jiri Sgall Efficient dynamic traitor tracing. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Khanna , Francis Zane Watermarking maps: hiding information in structured data. [Citation Graph (0, 0)][DBLP ] Conf ] April Rasala , Gordon T. Wilfong Strictly non-blocking WDM cross-connects. [Citation Graph (0, 0)][DBLP ] Conf ] Martin E. Dyer , Leslie Ann Goldberg , Catherine S. Greenhill , Mark Jerrum , Michael Mitzenmacher An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Mark Huber A faster method for sampling independent sets. [Citation Graph (0, 0)][DBLP ] Conf ] László Babai , Igor Pak Strong bias of group generators: an obstacle to the ``product replacement algorithm''. [Citation Graph (0, 0)][DBLP ] Conf ] Dana Randall , Gary D. Yngve Random three-dimensional tilings of Aztec octahedra and tetrahedra: an extension of domino tilings. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Rémila An algebraic method to compute a shortest path of local flips between two tilings. [Citation Graph (0, 0)][DBLP ] Conf ] Geir Agnarsson , Magnús M. Halldórsson Coloring powers of planar graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Khanna , Joseph Naor , F. Bruce Shepherd Directed network design with orientation constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Mirela Damian-Iordache , Sriram V. Pemmaraju A (2 + epsilon)-approximation scheme for minimum domination on circle graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Sundar Vishwanathan An approximation algorithm for finding a long path in Hamiltonian graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Ernst Althaus , Kurt Mehlhorn TSP-based curve reconstruction in polynomial time. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein , Srikanta Tirthapura , Daniel Sharvit , Benjamin B. Kimia A tree-edit-distance algorithm for comparing simple, closed shapes. [Citation Graph (0, 0)][DBLP ] Conf ] Nancy M. Amato , Michael T. Goodrich , Edgar A. Ramos Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling. [Citation Graph (0, 0)][DBLP ] Conf ] Danny Z. Chen , Ovidiu Daescu , Yang Dai , Naoki Katoh , Xiaodong Wu , Jinhui Xu Optimizing the sum of linear fractional functions and applications. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Frieze Edge-disjoint paths in expander graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Wun-Tat Chan , Francis Y. L. Chin , Hing-Fung Ting Escaping a grid by edge-disjoint paths. [Citation Graph (0, 0)][DBLP ] Conf ] Matthew S. Levine Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts. [Citation Graph (0, 0)][DBLP ] Conf ] Erik D. Demaine , Alejandro López-Ortiz , J. Ian Munro Adaptive set intersections, unions, and differences. [Citation Graph (0, 0)][DBLP ] Conf ] Gene Myers The whole genome assembly of Drosophila. [Citation Graph (0, 0)][DBLP ] Conf ] Sanjeev Arora , George Karakostas A 2+epsilon approximation algorithm for the k -MST problem. [Citation Graph (0, 0)][DBLP ] Conf ] David S. Johnson , Maria Minkoff , Steven Phillips The prize collecting Steiner tree problem: theory and practice. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Robins , Alexander Zelikovsky Improved Steiner tree approximation in graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Weiping Shi , Chen Su The rectilinear Steiner arborescence problem is NP-complete. [Citation Graph (0, 0)][DBLP ] Conf ] Anupam Gupta Improved bandwidth approximation for trees. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Moshe Lewenstein , Ely Porat Faster algorithms for string matching with k mismatches. [Citation Graph (0, 0)][DBLP ] Conf ] Gad M. Landau , Michal Ziv-Ukelson On the shared substring alignment problem. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Ayelet Butman , Moshe Lewenstein Real scaled matching. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Gad M. Landau , Dina Sokol Inplace run-length 2d compressed search. [Citation Graph (0, 0)][DBLP ] Conf ] Stephen Alstrup , Gerth Stølting Brodal , Theis Rauhe Pattern matching in dynamic texts. [Citation Graph (0, 0)][DBLP ] Conf ] Sandeep Sen , Siddhartha Chatterjee Towards a theory of cache-efficient algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Matias , Eran Segal , Jeffrey Scott Vitter Efficient bundle sorting. [Citation Graph (0, 0)][DBLP ] Conf ] Peter Sanders , Sebastian Egner , Jan H. M. Korst Fast concurrent access to parallel disks. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Michael H. Goldwasser , Suresh Venkatasubramanian , Jeffery Westbrook On external memory graph traversal. [Citation Graph (0, 0)][DBLP ] Conf ] Bogdan S. Chlebus , Leszek Gasieniec , Alan Gibbons , Andrzej Pelc , Wojciech Rytter Deterministic broadcasting in unknown radio networks. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Queyranne , Maxim Sviridenko New and improved algorithms for minsum shop scheduling. [Citation Graph (0, 0)][DBLP ] Conf ] Cynthia A. Phillips , R. N. Uma , Joel Wein Off-line admission control for general scheduling problems. [Citation Graph (0, 0)][DBLP ] Conf ] Esther M. Arkin , Refael Hassin Approximating the maximum quadratic assignment problem. [Citation Graph (0, 0)][DBLP ] Conf ] Donald Aingworth , Rajeev Motwani , Jeffrey D. Oldham Accurate approximations for Asian options. [Citation Graph (0, 0)][DBLP ] Conf ] Jeff Erickson Finite-resolution hidden surface removal. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Leonidas J. Guibas , Olaf A. Hall-Holt , Li Zhang On incremental rendering of silhouette maps of polyhedral scene. [Citation Graph (0, 0)][DBLP ] Conf ] Hamish Carr , Jack Snoeyink , Ulrike Axen Computing contour trees in all dimensions. [Citation Graph (0, 0)][DBLP ] Conf ] Alon Efrat , Leonidas J. Guibas , Sariel Har-Peled , David C. Lin , Joseph S. B. Mitchell , T. M. Murali Sweeping simple polygons with a chain of guards. [Citation Graph (0, 0)][DBLP ] Conf ] Philip N. Klein Finding the closest lattice vector when it's unusually close. [Citation Graph (0, 0)][DBLP ] Conf ] José Coelho de Pina , José Soares A new bound for the Carathéodory rank of the bases of a matroid. [Citation Graph (0, 0)][DBLP ] Conf ] S. Thomas McCormick , Akiyoshi Shioura Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. [Citation Graph (0, 0)][DBLP ] Conf ] Victor Y. Pan Nearly optimal computations with structured matrices. [Citation Graph (0, 0)][DBLP ] Conf ] 