Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642197536, 9783642197543

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

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

2011 ◽

pp. 81-91 ◽

Cited By ~ 1

Author(s):

Mark de Berg ◽

Atlas F. Cook

Keyword(s):

Fréchet Distance ◽

Frechet Distance ◽

Polygonal Curves

Download Full-text

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_11 ◽

2011 ◽

pp. 92-103 ◽

Cited By ~ 6

Author(s):

Pierluigi Crescenzi ◽

Roberto Grossi ◽

Leonardo Lanzi ◽

Andrea Marino

Keyword(s):

Real World ◽

Distance Distribution

Download Full-text

Robust Line Planning in Case of Multiple Pools and Disruptions

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_6 ◽

2011 ◽

pp. 33-44 ◽

Cited By ~ 3

Author(s):

Apostolos Bessas ◽

Spyros Kontogiannis ◽

Christos Zaroliagis

Keyword(s):

Line Planning

Download Full-text

3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_17 ◽

2011 ◽

pp. 163-174 ◽

Cited By ~ 1

Author(s):

Iyad A. Kanj ◽

Fenghui Zhang

Keyword(s):

Lower Bounds ◽

Upper And Lower Bounds ◽

Kernel Size ◽

Bounded Degree ◽

Hitting Set

Download Full-text

Energy-Efficient Due Date Scheduling

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_9 ◽

2011 ◽

pp. 69-80

Author(s):

Ho-Leung Chan ◽

Tak-Wah Lam ◽

Rongbin Li

Keyword(s):

Energy Efficient ◽

Due Date

Download Full-text

Improved Approximation Algorithms for the Max-Edge Coloring Problem

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

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

2011 ◽

pp. 206-216

Author(s):

Giorgio Lucarelli ◽

Ioannis Milis

Keyword(s):

Approximation Algorithms ◽

Edge Coloring ◽

Coloring Problem

Download Full-text

Multi-channel Assignment for Communication in Radio Networks

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_19 ◽

2011 ◽

pp. 181-192

Author(s):

Dariusz R. Kowalski ◽

Mariusz A. Rokicki

Keyword(s):

Channel Assignment ◽

Radio Networks

Download Full-text

Distributed Decision Problems: The Locality Angle

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_1 ◽

2011 ◽

pp. 1-5

Author(s):

Shay Kutten

Keyword(s):

Decision Problems ◽

Distributed Decision

Download Full-text

Exact Algorithms for Intervalizing Colored Graphs

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_7 ◽

2011 ◽

pp. 45-56 ◽

Cited By ~ 2

Author(s):

Hans L. Bodlaender ◽

Johan M. M. van Rooij

Keyword(s):

Exact Algorithms ◽

Colored Graphs

Download Full-text

An Approximative Criterion for the Potential of Energetic Reasoning

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-642-19754-3_23 ◽

2011 ◽

pp. 229-239 ◽

Cited By ~ 5

Author(s):

Timo Berthold ◽

Stefan Heinz ◽

Jens Schulz

Keyword(s):

Energetic Reasoning

Download Full-text

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves

A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs

Robust Line Planning in Case of Multiple Pools and Disruptions

3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size

Energy-Efficient Due Date Scheduling

Improved Approximation Algorithms for the Max-Edge Coloring Problem

Multi-channel Assignment for Communication in Radio Networks

Distributed Decision Problems: The Locality Angle

Exact Algorithms for Intervalizing Colored Graphs

An Approximative Criterion for the Potential of Energetic Reasoning

Theory and Practice of Algorithms in (Computer) Systems - Lecture Notes in Computer Science
Latest Publications