Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

68

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642450297, 9783642450303

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Train Delivery Problem Revisited

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_56 ◽

2013 ◽

pp. 601-611

Author(s):

Jing Chen ◽

He Guo ◽

Xin Han ◽

Kazuo Iwama

Keyword(s):

Delivery Problem

Download Full-text

Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_54 ◽

2013 ◽

pp. 579-589 ◽

Author(s):

Bodo Manthey ◽

Rianne Veenstra

Keyword(s):

Gaussian Noise ◽

Smoothed Analysis ◽

Polynomial Bounds

Download Full-text

Detecting and Counting Small Pattern Graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_51 ◽

2013 ◽

pp. 547-557 ◽

Author(s):

Peter Floderus ◽

Mirosław Kowaluk ◽

Andrzej Lingas ◽

Eva-Marta Lundell

Download Full-text

On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_4 ◽

2013 ◽

pp. 33-43

Author(s):

Sergey Bereg ◽

Seok-Hee Hong ◽

Naoki Katoh ◽

Sheung-Hung Poon ◽

Shin-ichi Tanigawa

Keyword(s):

Minimum Weight ◽

Download Full-text

Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_38 ◽

2013 ◽

pp. 405-412 ◽

Author(s):

Timothy M. Chan ◽

J. Ian Munro ◽

Venkatesh Raman

Keyword(s):

Read Only Memory ◽

Selection Algorithms ◽

Efficient Selection

Download Full-text

Abstract Voronoi Diagrams with Disconnected Regions

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_29 ◽

2013 ◽

pp. 306-316 ◽

Author(s):

Cecilia Bohler ◽

Rolf Klein

Keyword(s):

Voronoi Diagrams

Download Full-text

The Solvable Cases of a Scheduling Algorithm

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_22 ◽

2013 ◽

pp. 229-239

Author(s):

Sam Walker ◽

Yakov Zinder

Keyword(s):

Scheduling Algorithm

Download Full-text

On Determining Deep Holes of Generalized Reed-Solomon Codes

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_10 ◽

2013 ◽

pp. 100-110 ◽

Author(s):

Qi Cheng ◽

Jiyou Li ◽

Jincheng Zhuang

Keyword(s):

Reed Solomon Codes

Download Full-text

Better Bounds for Online k-Frame Throughput Maximization in Network Switches

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_21 ◽

2013 ◽

pp. 218-228 ◽

Author(s):

Jun Kawahara ◽

Koji M. Kobayashi ◽

Shuichi Miyazaki

Keyword(s):

Throughput Maximization ◽

Network Switches

Download Full-text

Exact Algorithms for Maximum Independent Set

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-642-45030-3_31 ◽

2013 ◽

pp. 328-338 ◽

Author(s):

Mingyu Xiao ◽

Hiroshi Nagamochi

Keyword(s):

Independent Set ◽

Exact Algorithms ◽

Maximum Independent Set

Download Full-text