Lecture Notes in Computer Science - Algorithms and Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540343752, 9783540343783

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation Algorithms for Capacitated Rectangle Stabbing

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_5 ◽

2006 ◽

pp. 18-29 ◽

Cited By ~ 2

Author(s):

Guy Even ◽

Dror Rawitz ◽

Shimon (Moni) Shahar

Keyword(s):

Approximation Algorithms

Download Full-text

Fixed-Parameter Tractable Generalizations of Cluster Editing

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_33 ◽

2006 ◽

pp. 344-355 ◽

Cited By ~ 3

Author(s):

Peter Damaschke

Keyword(s):

Fixed Parameter Tractable ◽

Cluster Editing ◽

Fixed Parameter

Download Full-text

On Search Problems in Complexity Theory and in Logic (Abstract)

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_3 ◽

2006 ◽

pp. 5-5

Author(s):

Pavel Pudlák

Keyword(s):

Complexity Theory ◽

Search Problems

Download Full-text

Beware of the Model: Reflections on Algorithmic Research

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_2 ◽

2006 ◽

pp. 3-4

Author(s):

Franco P. Preparata

Download Full-text

Deciding the FIFO Stability of Networks in Polynomial Time

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_11 ◽

2006 ◽

pp. 81-92 ◽

Cited By ~ 4

Author(s):

Maik Weinard

Keyword(s):

Polynomial Time

Download Full-text

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_31 ◽

2006 ◽

pp. 320-331 ◽

Cited By ~ 17

Author(s):

Michael Dom ◽

Jiong Guo ◽

Falk Hüffner ◽

Rolf Niedermeier ◽

Anke Truß

Keyword(s):

Fixed Parameter Tractability ◽

Fixed Parameter ◽

Feedback Set

Download Full-text

In-Place Randomized Slope Selection

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_6 ◽

2006 ◽

pp. 30-41

Author(s):

Henrik Blunck ◽

Jan Vahrenhold

Keyword(s):

Slope Selection

Download Full-text

Network Discovery and Verification with Distance Queries

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_10 ◽

2006 ◽

pp. 69-80 ◽

Cited By ~ 5

Author(s):

Thomas Erlebach ◽

Alexander Hall ◽

Michael Hoffmann ◽

Matúš Mihaľák

Keyword(s):

Network Discovery

Download Full-text

On the Hardness of Range Assignment Problems

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_15 ◽

2006 ◽

pp. 127-138 ◽

Cited By ~ 4

Author(s):

Bernhard Fuchs

Keyword(s):

Assignment Problems ◽

Range Assignment

Download Full-text

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Lecture Notes in Computer Science - Algorithms and Complexity ◽

10.1007/11758471_34 ◽

2006 ◽

pp. 356-367 ◽

Cited By ~ 2

Author(s):

Gregory Gutin ◽

Arash Rafiey ◽

Stefan Szeider ◽

Anders Yeo

Keyword(s):

Linear Arrangement ◽

Arrangement Problem ◽

Linear Arrangement Problem

Download Full-text

Lecture Notes in Computer Science - Algorithms and ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Approximation Algorithms for Capacitated Rectangle Stabbing

Fixed-Parameter Tractable Generalizations of Cluster Editing

On Search Problems in Complexity Theory and in Logic (Abstract)

Beware of the Model: Reflections on Algorithmic Research

Deciding the FIFO Stability of Networks in Polynomial Time

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

In-Place Randomized Slope Selection

Network Discovery and Verification with Distance Queries

On the Hardness of Range Assignment Problems

The Linear Arrangement Problem Parameterized Above Guaranteed Value

Lecture Notes in Computer Science - Algorithms and Complexity
Latest Publications