7. ESA 1999:
Prague,
Czech Republic
Jaroslav Nesetril (Ed.):
Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings.
Lecture Notes in Computer Science 1643 Springer 1999, ISBN 3-540-66251-0 BibTeX
@proceedings{DBLP:conf/esa/1999,
editor = {Jaroslav Nesetril},
title = {Algorithms - ESA '99, 7th Annual European Symposium, Prague,
Czech Republic, July 16-18, 1999, Proceedings},
booktitle = {ESA},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1643},
year = {1999},
isbn = {3-540-66251-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively-Secure Distributed Public-Key Systems.
4-27
Electronic Edition (Springer LINK) BibTeX
- Bernhard Korte:
How Long Does a Bit Live in a Computer? (abstract).
28
Electronic Edition (Springer LINK) BibTeX
- R. Ravi, F. Sibel Salman:
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
29-40
Electronic Edition (Springer LINK) BibTeX
- Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc:
The Impact of Knowledge on Broadcasting Time in Radio Networks.
41-52
Electronic Edition (Springer LINK) BibTeX
- Kazuo Iwama, Eiji Miyano:
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing.
53-64
Electronic Edition (Springer LINK) BibTeX
- Pierluigi Crescenzi, Leandro Dardini, Roberto Grossi:
IP Address Lookup Made Fast and Simple.
65-76
Electronic Edition (Springer LINK) BibTeX
- Amotz Bar-Noy, Ari Freund, Joseph Naor:
On-Line Load Banancing in a Hierarchical Server Topology.
77-88
Electronic Edition (Springer LINK) BibTeX
- Friedhelm Meyer auf der Heide, Berthold Vöcking, Matthias Westermann:
Provably Good and Practical Strategies for Non-Uniform Data Management in Networks.
89-100
Electronic Edition (Springer LINK) BibTeX
- Steven J. Phillips, Jeffery Westbrook:
Approximation Algorithms for Restoration Capacity Planning.
101-115
Electronic Edition (Springer LINK) BibTeX
- Reuven Bar-Yehuda, Dror Rawitz:
Efficient Algorithms for Integer Programs with Two Variables per Constraint.
116-126
Electronic Edition (Springer LINK) BibTeX
- Martin Skutella:
Convex Quadratic Programming Relaxations for Network Scheduling Problems.
127-138
Electronic Edition (Springer LINK) BibTeX
- Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
139-150
Electronic Edition (Springer LINK) BibTeX
- Leah Epstein, Jiri Sgall:
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
151-162
Electronic Edition (Springer LINK) BibTeX
- Yossi Azar, Oded Regev:
Off-Line Temporary Tasks Assignment.
163-171
Electronic Edition (Springer LINK) BibTeX
- Stefan Bischof, Thomas Schickinger, Angelika Steger:
Load Balancing Using Bisectors - A Tight Average-Case Analysis.
172-183
Electronic Edition (Springer LINK) BibTeX
- Thomas Jansen, Ingo Wegener:
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help.
184-193
Electronic Edition (Springer LINK) BibTeX
- Pierre Nicodème, Bruno Salvy, Philippe Flajolet:
Motif Statistics.
194-211
Electronic Edition (Springer LINK) BibTeX
- Volker Heun:
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices.
212-223
Electronic Edition (Springer LINK) BibTeX
- Andreas Crauser, Paolo Ferragina:
On Constructing Suffix Arrays in External Memory.
224-235
Electronic Edition (Springer LINK) BibTeX
- Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa:
Strategies for Searching with Different Access Costs.
236-247
Electronic Edition (Springer LINK) BibTeX
- Ting Chen, Ming-Yang Kao:
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees.
248-256
Electronic Edition (Springer LINK) BibTeX
- Ferdinando Cicalese, Daniele Mundici:
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness.
257-266
Electronic Edition (Springer LINK) BibTeX
- Salvador Roura:
Improving Mergesort for Linked Lists.
267-276
Electronic Edition (Springer LINK) BibTeX
- Giovanni Manzini:
Efficient Algorithms foe On-Line Symbol Ranking Compression.
277-288
Electronic Edition (Springer LINK) BibTeX
- Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks:
On List Update and Work Function Algorithms.
289-300
Electronic Edition (Springer LINK) BibTeX
- Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore:
The 3-Server Problem in the Plane.
301-312
Electronic Edition (Springer LINK) BibTeX
- Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham:
Quartet Cleaning: Improved Algorithms and Simulations.
313-324
Electronic Edition (Springer LINK) BibTeX
- Bernd Gärtner:
Fast and Robust Smallest Enclosing Balls.
325-338
Electronic Edition (Springer LINK) BibTeX
- Enrico Nardelli, Maurizio Talamo, Paola Vocca:
Efficient Searching for Multi-dimensional Data Made Simple.
339-353
Electronic Edition (Springer LINK) BibTeX
- Bernard Chazelle:
Geometric Searching over the Rationals.
354-365
Electronic Edition (Springer LINK) BibTeX
- Daniele V. Finocchiaro, Marco Pellegrini:
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space.
365-377
Electronic Edition (Springer LINK) BibTeX
- Stavros G. Kolliopoulos, Satish Rao:
A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem.
378-389
Electronic Edition (Springer LINK) BibTeX
- Amotz Bar-Noy, Magnús M. Halldórsson, Guy Kortsarz, Ravit Salman, Hadas Shachnai:
Sum Multi-coloring of Graphs.
390-401
Electronic Edition (Springer LINK) BibTeX
- Piotr Krysta, Krzysztof Lorys:
Efficient Approximation Algorithms for the Achromatic Number.
402-413
Electronic Edition (Springer LINK) BibTeX
- Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki:
Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.
414-425
Electronic Edition (Springer LINK) BibTeX
- Bram Verweij, Karen Aardal:
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling.
426-437
Electronic Edition (Springer LINK) BibTeX
- 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.
438-449
Electronic Edition (Springer LINK) BibTeX
- Limor Drori, David Peleg:
Faster Exact Solutions for Some NP-Hard Problems.
450-461
Electronic Edition (Springer LINK) BibTeX
- Lucia Moura:
A Polyhedral Algorithm for Packings and Designs.
462-475
Electronic Edition (Springer LINK) BibTeX
- Ali Akhavi:
Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms.
476-489
Electronic Edition (Springer LINK) BibTeX
- Alexander A. Ageev:
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.
490-497
Electronic Edition (Springer LINK) BibTeX
- 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.
498-509
Electronic Edition (Springer LINK) BibTeX
- Joseph Cheriyan, Tibor Jordán, R. Ravi:
On 2-Coverings and 2-Packings of Laminar Families.
510-520
Electronic Edition (Springer LINK) BibTeX
- Igor Pak:
Random Cayley Graphs with O(log[G]) Generators Are Expanders.
521-526
Electronic Edition (Springer LINK) BibTeX
- Pavol Hell, Ron Shamir, Roded Sharan:
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs.
527-539
Electronic Edition (Springer LINK) BibTeX
- Xin He, Ming-Yang Kao, Hsueh-I Lu:
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs.
540-549
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:10:38 2009
by Michael Ley (ley@uni-trier.de)
