𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Fixed Parameter Algorithms for Planar Dominating Set and Related Problems

✍ Scribed by Alber, Jochen

Book ID
121387224
Publisher
Springer Berlin Heidelberg
Year
2000
Tongue
German
Weight
202 KB
Category
Article
ISBN
354044985X

No coin nor oath required. For personal study only.

✦ Synopsis

This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The Papers Are Organized In Sections On Data Structures, Dynamic Partitions, Graph Algorithms, Online Algorithms, Approximation Algorithms, Matchings, Network Design, Computational Geometry, Strings And Algorithm Engineering, External Memory Algorithms, Optimization, And Distributed And Fault-tolerant Computing.

πŸ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Efficient Expected-Case Algorithms for Planar Point Location
✍ Arya, Sunil πŸ“‚ Article πŸ“… 2000 πŸ› Springer Berlin Heidelberg 🌐 German βš– 184 KB

This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The P

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Coping with the NP-Hardness of the Graph Bandwidth Problem
✍ Feige, Uriel πŸ“‚ Article πŸ“… 2000 πŸ› Springer Berlin Heidelberg 🌐 German βš– 107 KB

This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The P

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || Coping with the NP-Hardness of the Graph Bandwidth Problem
✍ Feige, Uriel πŸ“‚ Article πŸ“… 2000 πŸ› Springer Berlin Heidelberg 🌐 German βš– 107 KB

This book constitutes the refereed proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000, held in Bergen, Norway, in July 2000.The 43 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from a total of 105 submissions. The pa

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithms and Computation Volume 7074 || Two Fixed-Parameter Algorithms for the Cocoloring Problem
✍ Asano, Takao; Nakano, Shin-ichi; Okamoto, Yoshio; Watanabe, Osamu πŸ“‚ Article πŸ“… 2011 πŸ› Springer Berlin Heidelberg 🌐 German βš– 195 KB

This Book Constitutes The Refereed Proceedings Of The 22nd International Symposium On Algorithms And Computation, Isaac 2011, Held In Yokohama, Japan In December 2011. The 76 Revised Full Papers Presented Together With Two Invited Talks Were Carefully Reviewed And Selected From 187 Submissions For I

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
✍ Berman, Piotr πŸ“‚ Article πŸ“… 2000 πŸ› Springer Berlin Heidelberg 🌐 German βš– 184 KB

This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The P

[Lecture Notes in Computer Science] Grap
[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 3353 || Exact (Exponential) Algorithms for the Dominating Set Problem
✍ Hromkovič, Juraj; Nagl, Manfred; Westfechtel, Bernhard πŸ“‚ Article πŸ“… 2004 πŸ› Springer Berlin Heidelberg 🌐 German βš– 220 KB

During Its 30-year Existence, The International Workshop On Graph-theoretic Concepts In Computer Science Has Become A Distinguished And High-quality Computer Science Event. The Workshop Aims At Uniting Theory And Practice By Demonstrating How Graph-theoretic Concepts Can Successfully Be Applied To V