Conferences in DBLP
Yair Frankel , Philip D. MacKenzie , Moti Yung Adaptively-Secure Distributed Public-Key Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Korte How Long Does a Bit Live in a Computer? (abstract). [Citation Graph (0, 0)][DBLP ] Conf ] R. Ravi , F. Sibel Salman Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design. [Citation Graph (0, 0)][DBLP ] Conf ] Krzysztof Diks , Evangelos Kranakis , Danny Krizanc , Andrzej Pelc The Impact of Knowledge on Broadcasting Time in Radio Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Kazuo Iwama , Eiji Miyano Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Pierluigi Crescenzi , Leandro Dardini , Roberto Grossi IP Address Lookup Made Fast and Simple. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Ari Freund , Joseph Naor On-Line Load Banancing in a Hierarchical Server Topology. [Citation Graph (0, 0)][DBLP ] Conf ] Friedhelm Meyer auf der Heide , Berthold Vöcking , Matthias Westermann Provably Good and Practical Strategies for Non-Uniform Data Management in Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Steven J. Phillips , Jeffery Westbrook Approximation Algorithms for Restoration Capacity Planning. [Citation Graph (0, 0)][DBLP ] Conf ] Reuven Bar-Yehuda , Dror Rawitz Efficient Algorithms for Integer Programs with Two Variables per Constraint. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Skutella Convex Quadratic Programming Relaxations for Network Scheduling Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf H. Möhring , Andreas S. Schulz , Frederik Stork , Marc Uetz Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Leah Epstein , Jiri Sgall Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Yossi Azar , Oded Regev Off-Line Temporary Tasks Assignment. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Bischof , Thomas Schickinger , Angelika Steger Load Balancing Using Bisectors - A Tight Average-Case Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Jansen , Ingo Wegener On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. [Citation Graph (0, 0)][DBLP ] Conf ] Pierre Nicodème , Bruno Salvy , Philippe Flajolet Motif Statistics. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Heun Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Crauser , Paolo Ferragina On Constructing Suffix Arrays in External Memory. [Citation Graph (0, 0)][DBLP ] Conf ] Eduardo Sany Laber , Ruy Luiz Milidiú , Artur Alves Pessoa Strategies for Searching with Different Access Costs. [Citation Graph (0, 0)][DBLP ] Conf ] Ting Chen , Ming-Yang Kao On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Ferdinando Cicalese , Daniele Mundici Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness. [Citation Graph (0, 0)][DBLP ] Conf ] Salvador Roura Improving Mergesort for Linked Lists. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanni Manzini Efficient Algorithms foe On-Line Symbol Ranking Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Eric J. Anderson , Kirsten Hildrum , Anna R. Karlin , April Rasala , Michael E. Saks On List Update and Work Function Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang W. Bein , Marek Chrobak , Lawrence L. Larmore The 3-Server Problem in the Plane. [Citation Graph (0, 0)][DBLP ] Conf ] Vincent Berry , Tao Jiang , Paul E. Kearney , Ming Li , Todd Wareham Quartet Cleaning: Improved Algorithms and Simulations. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd Gärtner Fast and Robust Smallest Enclosing Balls. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Nardelli , Maurizio Talamo , Paola Vocca Efficient Searching for Multi-dimensional Data Made Simple. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Chazelle Geometric Searching over the Rationals. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele V. Finocchiaro , Marco Pellegrini On Computing the Diameter of a Point Set in High Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP ] Conf ] Stavros G. Kolliopoulos , Satish Rao A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Magnús M. Halldórsson , Guy Kortsarz , Ravit Salman , Hadas Shachnai Sum Multi-coloring of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Krysta , Krzysztof Lorys Efficient Approximation Algorithms for the Achromatic Number. [Citation Graph (0, 0)][DBLP ] Conf ] Toshimasa Ishii , Hiroshi Nagamochi , Toshihide Ibaraki Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph. [Citation Graph (0, 0)][DBLP ] Conf ] Bram Verweij , Karen Aardal An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Limor Drori , David Peleg Faster Exact Solutions for Some NP-Hard Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Lucia Moura A Polyhedral Algorithm for Packings and Designs. [Citation Graph (0, 0)][DBLP ] Conf ] Ali Akhavi Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander A. Ageev On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] András A. Benczúr , Jörg Förster , Zoltán Király Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Cheriyan , Tibor Jordán , R. Ravi On 2-Coverings and 2-Packings of Laminar Families. [Citation Graph (0, 0)][DBLP ] Conf ] Igor Pak Random Cayley Graphs with O(log[G]) Generators Are Expanders. [Citation Graph (0, 0)][DBLP ] Conf ] Pavol Hell , Ron Shamir , Roded Sharan A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Xin He , Ming-Yang Kao , Hsueh-I Lu A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] 