Algorithms – ESA 2007 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540755197

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

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

2007 ◽

pp. 605-617 ◽

Cited By ~ 1

Author(s):

Giorgio Ausiello ◽

Camil Demetrescu ◽

Paolo G. Franciosa ◽

Giuseppe F. Italiano ◽

Andrea Ribichini

Keyword(s):

New Algorithms

Download Full-text

Determining the Smallest k Such That G Is k-Outerplanar

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-75520-3_33 ◽

2007 ◽

pp. 359-370 ◽

Cited By ~ 5

Author(s):

Frank Kammer

Download Full-text

Linear-Time Ranking of Permutations

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-75520-3_18 ◽

2007 ◽

pp. 187-193 ◽

Cited By ~ 7

Author(s):

Martin Mareš ◽

Milan Straka

Keyword(s):

Linear Time

Download Full-text

Tradeoffs and Average-Case Equilibria in Selfish Routing

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-75520-3_8 ◽

2007 ◽

pp. 63-74 ◽

Cited By ~ 3

Author(s):

Martin Hoefer ◽

Alexander Souza

Keyword(s):

Selfish Routing ◽

Average Case

Download Full-text

On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-75520-3_51 ◽

2007 ◽

pp. 570-581 ◽

Cited By ~ 3

Author(s):

Amos Israeli ◽

Dror Rawitz ◽

Oran Sharon

Keyword(s):

Ieee 802.16

Download Full-text

Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

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

2007 ◽

pp. 2-11 ◽

Cited By ~ 8

Author(s):

Pierre Fraigniaud

Keyword(s):

Model Analysis ◽

Small Worlds

Download Full-text

Dynamic Plane Transitive Closure

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

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

2007 ◽

pp. 594-604 ◽

Cited By ~ 2

Author(s):

Krzysztof Diks ◽

Piotr Sankowski

Keyword(s):

Transitive Closure ◽

Dynamic Plane

Download Full-text

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-75520-3_52 ◽

2007 ◽

pp. 582-593 ◽

Cited By ~ 7

Author(s):

Cyril Gavoille ◽

Arnaud Labourel

Keyword(s):

Planar Graphs ◽

Implicit Representation ◽

Bounded Treewidth

Download Full-text

On the Size of Succinct Indices

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

10.1007/978-3-540-75520-3_34 ◽

2007 ◽

pp. 371-382 ◽

Cited By ~ 14

Author(s):

Alexander Golynski ◽

Roberto Grossi ◽

Ankur Gupta ◽

Rajeev Raman ◽

Satti Srinivasa Rao

Download Full-text

k-Anonymization with Minimal Loss of Information

Algorithms – ESA 2007 - Lecture Notes in Computer Science ◽

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

2007 ◽

pp. 439-450 ◽

Cited By ~ 5

Author(s):

Aristides Gionis ◽

Tamir Tassa

Keyword(s):

Loss Of Information ◽

Minimal Loss

Download Full-text

Algorithms – ESA 2007 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments

Determining the Smallest k Such That G Is k-Outerplanar

Linear-Time Ranking of Permutations

Tradeoffs and Average-Case Equilibria in Selfish Routing

On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems

Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation

Dynamic Plane Transitive Closure

Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs

On the Size of Succinct Indices

k-Anonymization with Minimal Loss of Information

Algorithms – ESA 2007 - Lecture Notes in Computer Science
Latest Publications