✦ LIBER ✦

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

✍ Scribed by Coppo, Mario; Lodi, Elena; Pinna, G. Michele

Book ID: 120155356
Publisher: Springer Berlin Heidelberg
Year: 2005
Tongue: German
Weight: 548 KB
Category: Article
ISBN: 3540320245
DOI: 10.1007/11560586_30

No coin nor oath required. For personal study only.

✦ Synopsis

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 Carefully Reviewed And Selected From 83 Submissions. The Papers Address All Current Issues In Theoretical Computer Science And Focus Especially On Analysis And Design Of Algorithms, Computability, Computational Complexity, Cryptography, Formal Languages And Automata, Foundations Of Programming Languages And Program Analysis, Natural Computing Paradigms (quantum Computing, Bioinformatics), Program Specification And Verification, Term Rewriting, Theory Of Logical Design And Layout, Type Theory, Security, And Symbolic And Algebraic Computation.

📜 SIMILAR VOLUMES

[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] 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] Dist

[Lecture Notes in Computer Science] Distributed Computing Volume 5805 || A Local 2-Approximation Algorithm for the Vertex Cover Problem

✍ Keidar, Idit 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 325 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 7535 || Randomized Techniques for Parameterized Algorithms

✍ Thilikos, Dimitrios M.; Woeginger, Gerhard J. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 49 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parameterized and Exact Computation Volume 5917 || Even Faster Algorithm for Set Splitting!

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

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 5

[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