Algorithms and Computation - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

79

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540771180

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Parameterized Complexity of the Unique Coverage Problem

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_54 ◽

2007 ◽

pp. 621-631 ◽

Author(s):

Hannes Moser ◽

Venkatesh Raman ◽

Somnath Sikdar

Keyword(s):

Parameterized Complexity ◽

Coverage Problem

Download Full-text

Sensor Network Gossiping or How to Break the Broadcast Lower Bound

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_22 ◽

2007 ◽

pp. 232-243 ◽

Author(s):

Martín Farach-Colton ◽

Miguel A. Mosteiro

Keyword(s):

Lower Bound ◽

Download Full-text

On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_13 ◽

2007 ◽

pp. 124-136 ◽

Author(s):

Uffe Flarup ◽

Pascal Koiran ◽

Laurent Lyaudet

Keyword(s):

Perfect Matching ◽

Expressive Power ◽

Bounded Treewidth

Download Full-text

A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_53 ◽

2007 ◽

pp. 609-620 ◽

Author(s):

Yoshio Okamoto ◽

Takeaki Uno

Keyword(s):

Polynomial Time ◽

Polynomial Space ◽

Enumeration Problems

Download Full-text

Coloring Triangle-Free Graphs on Surfaces

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_2 ◽

2007 ◽

pp. 2-4

Author(s):

Zdeněk Dvořák ◽

Daniel Král’ ◽

Robin Thomas

Keyword(s):

Graphs On Surfaces

Download Full-text

Computing Upward Topological Book Embeddings of Upward Planar Digraphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_17 ◽

2007 ◽

pp. 172-183 ◽

Author(s):

F. Giordano ◽

G. Liotta ◽

T. Mchedlidze ◽

A. Symvonis

Keyword(s):

Book Embeddings

Download Full-text

Succinct Representation of Labeled Graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_29 ◽

2007 ◽

pp. 316-328 ◽

Author(s):

Jérémy Barbay ◽

Luca Castelli Aleardi ◽

Meng He ◽

J. Ian Munro

Keyword(s):

Download Full-text

More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_30 ◽

2007 ◽

pp. 329-340

Author(s):

Mordecai Golin ◽

Jian Li

Keyword(s):

Efficient Algorithms

Download Full-text

Approximate Range Searching in External Memory

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_47 ◽

2007 ◽

pp. 536-548 ◽

Author(s):

Micha Streppel ◽

Ke Yi

Keyword(s):

External Memory ◽

Range Searching

Download Full-text

A Constant-Competitive Algorithm for Online OVSF Code Assignment

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77120-3_40 ◽

2007 ◽

pp. 452-463 ◽

Author(s):

F. Y. L. Chin ◽

H. F. Ting ◽

Y. Zhang

Keyword(s):

Code Assignment ◽

Competitive Algorithm

Download Full-text