✦ LIBER ✦

[Lecture Notes in Computer Science] Fundamentals of Computation Theory Volume 380 || The jump number problem for biconvex graphs and rectangle covers of rectangular regions

✍ Scribed by Csirik, J.; Demetrovics, J.; Gécseg, F.

Book ID: 121483244
Publisher: Springer Berlin Heidelberg
Year: 1989
Weight: 507 KB
Category: Article
ISBN: 354048180X
DOI: 10.1007/3-540-51498-8_7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Fund

[Lecture Notes in Computer Science] Fundamentals of Computation Theory Volume 380 || Decision problems and Coxeter groups

✍ Csirik, J.; Demetrovics, J.; Gécseg, F. 📂 Article 📅 1989 🏛 Springer Berlin Heidelberg ⚖ 909 KB

[Lecture Notes in Computer Science] Theo

[Lecture Notes in Computer Science] Theory and Applications of Models of Computation Volume 4484 || On the Treewidth and Pathwidth of Biconvex Bipartite Graphs

✍ Cai, Jin-Yi; Cooper, S. Barry; Zhu, Hong 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 517 KB

[Lecture Notes in Computer Science] Fund

[Lecture Notes in Computer Science] Fundamentals of Computation Theory Volume 3623 || New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem

✍ Liśkiewicz, Maciej; Reischuk, Rüdiger 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 216 KB

This Volume Is Dedicated To The 15th Symposium On Fundamentals Of Computation Theory Fct 2005, Held In Lubeck, Germany, On August 17–20, 2005.

[Lecture Notes in Computer Science] SOFS

[Lecture Notes in Computer Science] SOFSEM 2010: Theory and Practice of Computer Science Volume 5901 || Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem

✍ van Leeuwen, Jan; Muscholl, Anca; Peleg, David; Pokorný, Jaroslav; Rumpe, Bernha 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 229 KB

This Book Constitutes The Refereed Proceedings Of The 36th Conference On Current Trends In Theory And Practice Of Computer Science, Sofsem 2010, Held In Špindleruv Mlýn, Czech Republic, In January 2009. The 53 Revised Full Papers, Presented Together With 11 Invited Contributions, Were Carefully Revi

[Lecture Notes in Computer Science] Logi

[Lecture Notes in Computer Science] Logic and Machines: Decision Problems and Complexity Volume 171 || Recurrence relations for the number of labeled structures on a finite set

✍ Börger, E.; Hasenjaeger, G.; Rödding, D. 📂 Article 📅 1984 🏛 Springer Berlin Heidelberg ⚖ 510 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization and Applications Volume 5573 || A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices

✍ Du, Ding-Zhu; Hu, Xiaodong; Pardalos, Panos M. 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 509 KB