✦ LIBER ✦

[Lecture Notes in Computer Science] Experimental Algorithms Volume 8504 || An Exact Algorithm for the Discrete Chromatic Art Gallery Problem

✍ Scribed by Gudmundsson, Joachim; Katajainen, Jyrki

Book ID: 125838256
Publisher: Springer International Publishing
Year: 2014
Tongue: English
Weight: 293 KB
Edition: 1
Category: Article
ISBN: 331907959X
DOI: 10.1007/978-3-319-07959-2_6

No coin nor oath required. For personal study only.

✦ Synopsis

This book constitutes the refereed proceedings of the 13th International Symposium on Experimental Algorithms, SEA 2014, held in Copenhagen, Denmark, in June/July 2014. The 36 revised full papers presented together with 3 invited presentations were carefully reviewed and selected from 81 submissions. The papers are organized in topical sections on combinatorial optimization, data structures, graph drawing, shortest path, strings, graph algorithms and suffix structures.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 5038 || Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem

✍ McGeoch, Catherine C. 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 281 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 5917 || An Exact Algorithm for the Maximum Leaf Spanning Tree Problem

✍ Chen, Jianer; Fomin, Fedor V. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 220 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 3341 || Efficient Algorithms for the Longest Path Problem

✍ Fleischer, Rudolf; Trippen, Gerhard 📂 Article 📅 2004 🏛 Springer Berlin Heidelberg ⚖ 204 KB

[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

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theoretical Computer Science Volume 3701 || Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems

✍ Coppo, Mario; Lodi, Elena; Pinna, G. Michele 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 548 KB

This Book Constitutes The Refereed Proceedings Of The 9th International Conference On Theoretical Computer Science, Ictcs 2005, Held At The Certosa Di Pontignano, Siena, Italy, In October 2005. The 29 Revised Full Papers Presented Together With An Invited Paper And Abstracts Of 2 Invited Talks Were

[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