Lecture Notes in Computer Science - Algorithms and Complexity
Latest Publications

TOTAL DOCUMENTS

25
(FIVE YEARS 0)

H-INDEX

9
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540671596, 9783540465218
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Lovász Number of Certain Circulant Graphs

2000 ◽  
pp. 291-305 ◽  
Author(s):  
Valentin E. Brimkov ◽  
Bruno Codenotti ◽  
Valentino Crespi ◽  
Mauro Leoncini
Keyword(s):  
Circulant Graphs ◽  
Lovász Number

The Online Dial-a-Ride Problem under Reasonable Load

2000 ◽  
pp. 125-136 ◽  
Author(s):  
Dietrich Hauptmeier ◽  
Sven O. Krumke ◽  
Jörg Rambau

Dynamically Maintaining the Widest k-Dense Corridor

2000 ◽  
pp. 187-198
Author(s):  
Subhas C. Nandy ◽  
Tomohiro Harayama ◽  
Tetsuo Asano

On Salesmen, Repairmen, Spiders, and Other Traveling Agents

2000 ◽  
pp. 1-16 ◽  
Author(s):  
Giorgio Ausiello ◽  
Stefano Leonardi ◽  
Alberto Marchetti-Spaccamela

scholarly journals The Online-TSP against Fair Adversaries

2000 ◽  
pp. 137-149 ◽  
Author(s):  
Michiel Blom ◽  
Sven O. Krumke ◽  
Willem de Paepe ◽  
Leen Stougie

scholarly journals An Efficient Algorithm for the Approximate Median Selection Problem

2000 ◽  
pp. 226-238 ◽  
Author(s):  
Sebastiano Battiato ◽  
Domenico Cantone ◽  
Dario Catalano ◽  
Gianluca Cincotti ◽  
Micha Hofri
Keyword(s):  
Efficient Algorithm ◽  
Selection Problem

QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms

2000 ◽  
pp. 150-162 ◽  
Author(s):  
Domenico Cantone ◽  
Gianluca Cincotti
Keyword(s):  
Sorting Algorithms

Online Strategies for Backups

2000 ◽  
pp. 63-71
Author(s):  
Peter Damaschke
Keyword(s):  
Online Strategies
Load More ...
Sign in / Sign up

Export Citation Format

Share Document