𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 5917 || Boolean-Width of Graphs

✍ Scribed by Chen, Jianer; Fomin, Fedor V.

Book ID
118016975
Publisher
Springer Berlin Heidelberg
Year
2009
Tongue
German
Weight
293 KB
Category
Article
ISBN
3642112692

No coin nor oath required. For personal study only.

✦ Synopsis

This Book Constitutes The Refereed Best Selected Papers Of The 4th International Workshop On Parameterized And Exact Computation, Iwpec 2009, Held In Copenhagen, Denmark, In September 2009. The 25 Revised Full Papers Presented Together With 2 Invited Talks Were Carefully Reviewed And Selected From 52 Submissions. The Topics Addressed Cover Research In All Aspects Of Parameterized And Exact Computation And Complexity, Including But Not Limited To New Techniques For The Design And Analysis Of Parameterized And Exact Algorithms, Parameterized Complexity Theory, Relationship Between Parameterized Complexity And Traditional Complexity Classifications, Applications Of Parameterized And Exact Computation, Implementation Issues Of Parameterized And Exact Algorithms, High-performance Computing And Fixed-parameter Tractability.

πŸ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Para
[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 3162 || A Structural View on Parameterizing Problems: Distance from Triviality
✍ Downey, Rod; Fellows, Michael; Dehne, Frank πŸ“‚ Article πŸ“… 2004 πŸ› Springer Berlin Heidelberg 🌐 German βš– 207 KB

This Book Constitutes The Refereed Proceedings Of The First International Workshop On Parameterized And Exact Computation, Iwpec 2004, Held In Bergen, Norway, In September 2004. The 25 Revised Full Papers Presented Together With An Invited Paper Were Carefully Reviewed And Selected From 47 Submissio

[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] Algo
[Lecture Notes in Computer Science] Algorithms and Computation Volume 6507 || k-cyclic Orientations of Graphs
✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo πŸ“‚ Article πŸ“… 2010 πŸ› Springer Berlin Heidelberg 🌐 German βš– 238 KB

Annotation This Book Constitutes The Refereed Proceedings Of The 21st International Symposium On Algorithms And Computation, Isaac 2010, Held In Jeju, South Korea In December 2010. The 77 Revised Full Papers Presented Were Carefully Reviewed And Selected From 182 Submissions For Inclusion In The Boo