Contact The DL Team Contact Us | Switch to tabbed view

top of pageABSTRACT

An abstract is not available.
Advertisements



top of pageAUTHORS



Author image not provided  Madhukar R. Korupolu

No contact information provided yet.

Bibliometrics: publication history
Publication years1997-2016
Publication count25
Citation Count355
Available for download8
Downloads (6 Weeks)198
Downloads (12 Months)2,177
Downloads (cumulative)8,895
Average downloads per article1,111.88
Average citations per article14.20
View colleagues of Madhukar R. Korupolu


Author image not provided  Vijaya Ramachandran

No contact information provided yet.

Bibliometrics: publication history
Publication years1997-1997
Publication count2
Citation Count0
Available for download0
Downloads (6 Weeks)0
Downloads (12 Months)0
Downloads (cumulative)0
Average downloads per article0.00
Average citations per article0.00
View colleagues of Vijaya Ramachandran

top of pageREFERENCES

References are not available

top of pageCITED BY

Citings are not available

top of pageINDEX TERMS

Index Terms are not available

top of pagePUBLICATION

Title ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms table of contents
Editors Rainer Burkard
Gerhard J. Woeginger
Pages 326-340
Publication Date1997-09-15 (yyyy-mm-dd)
PublisherSpringer-Verlag London, UK ©1997
ISBN: 3-540-63397-9

APPEARS IN
LNCS: Lecture Notes In Computer Science

top of pageREVIEWS


Reviews are not available for this item
Computing Reviews logo

top of pageCOMMENTS

Be the first to comment To Post a comment please sign in or create a free Web account

top of pageTable of Contents

Proceedings of the 5th Annual European Symposium on Algorithms
Table of Contents
Scheduling Independent Multiprocessor Tasks
Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
Pages: 1-12
On Local Search for Weighted k-Set Packing
Esther M. Arkin, Refael Hassin
Pages: 13-22
On-Line Machine Covering
Yossi Azar, Leah Epstein
Pages: 23-36
Area-Efficient Static and Incremental Graph Drawings
Therese C. Biedl, Michael Kaufmann
Pages: 37-52
Denesting by Bounded Degree Radicals
Johannes Blömer
Pages: 53-63
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs (Extended Abstract)
Ulrik Brandes, Dorothea Wagner
Pages: 64-77
Distance Approximating Trees for Chordal and Dually Chordal Graphs (Extended Abstract)
Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
Pages: 78-91
Decomposition of Integer Programs and of Generating Sets
Gérard Cornuéjols, Regina Urbaniak, Robert Weismantel, Laurence A. Wolsey
Pages: 92-102
Bounded Degree Spanning Trees (Extended Abstract)
Artur Czumaj, Willy-Bernhard Strothmann
Pages: 104-117
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract)
Krzysztof Diks, Andrzej Pelc
Pages: 118-129
Weighted Graph Separators and Their Applications
Hristo Djidjev
Pages: 130-143
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems
Sándor P. Fekete, Jörg Schepers
Pages: 144-156
Dynamic Data Structures for Realtime Management of Large Geormetric Scences (Extended Abstract)
Matthias Fischer, Friedhelm Meyer auf der Heide, Willy-Bernhard Strothmann
Pages: 157-170
Solving Rectilinear Steiner Tree Problems Exactly in Theory and Practice
Ulrich Fößmeier, Michael Kaufmann
Pages: 171-185
Dynamically Switching Vertices in Planar Graphs (Extended Abstract)
Daniele Frigioni, Giuseppe F. Italiano
Pages: 186-199
A New Family of Randomized Algorithms for List Accessing
Theodoulos Garefalakis
Pages: 200-216
On-Line Construction of Two-Dimensional Suffix Trees
Raffaele Giancarlo, Daniela Guaiana
Pages: 217-231
Scheduling Multiclass Queueing Networks on Parallel Servers: Approximate and Heavy-Traffic Optimality of Klimov's Priority Rule
Kevin D. Glazebrook, José Niño-Mora
Pages: 232-245
Optimal Reconstruction of Graphs Under the Additive Model
Vladimir Grebinski, Gregory Kucherov
Pages: 246-258
Fixing Variables in Semidefinite Relaxations
Christoph Helmberg
Pages: 259-270
Test Sets of the Knapsack Problem and Simultaneous Diophantine Approximations
Martin Henk, Robert Weismantel
Pages: 271-283
Three-Dimensional Meshes are Less Powerful than Two-Dimensional Ones in Oblivious Routing
Kazuo Iwama, Eiji Miyano
Pages: 284-295
Fault-Tolerant Real-Time Scheduling
Bala Kalyanasundaram, Kirk Pruhs
Pages: 296-307
Collecting Garbage Pages in a Distributed Shared Memory with Reduced Memory and Communication Overhead
Dmitry Kogan, Assaf Schuster
Pages: 308-325
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
Madhukar R. Korupolu, Vijaya Ramachandran
Pages: 326-340
Minimum Spanning Trees in d Dimensions
Drago Krznaric, Christos Levcopoulos, Bengt J. Nilsson
Pages: 341-349
Relaxed Balance for Search Trees with Local Rebalancing
Kim S. Larsen, Thomas Ottmann, Eljas Soisalon-Soininen
Pages: 350-363
Improved Approximations for Minimum Cardinality Quadrangulations of Finite Element Meshes
Matthias Müller-Hannemann, Karsten Weihe
Pages: 364-377
Dynamic Storage Allocation with Known Durations
Joseph (Seffi) Naor, Ariel Orda, Yael Petruschka
Pages: 378-387
Coloring in Sublinear Time
Andreas Nolte, Rainer Schrader
Pages: 388-401
Competivive Analysis of on-line Stack-Up Algorithms
Jochen Rethmann, Egon Wanke
Pages: 402-415
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
Andreas S. Schulz, Martin Skutella
Pages: 416-429
On Piercing Sets of Axis-Parallel Rectangles and Rings
Michael Segal
Pages: 430-442
Seven Problems: So Different yet Close
Sergey V. Sevastianov
Pages: 443-458
Linear-Time Reconstruction of Delaunay Triangulations with Applications
Jack Snoeyink, Marc J. van Kreveld
Pages: 459-471
Approximating Satisfiable Satisfiability Problems (Extended Abstract)
Luca Trevisan
Pages: 472-485
Algorithms for Computing Signs of 2×2 Determinants: Dynamics and Average-Case Analysis
Brigitte Vallée
Pages: 486-499
Reconstructing the Topology of a CAD Model: A Discrete Approach
Karsten Weihe, Thomas Willhalm
Pages: 500-513

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2016 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Reader    QuickTime    Windows Media Player    Real Player
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder