Library of Congress |

Library of Congress

Matches in Library of Congress for { <http://lccn.loc.gov/2012946191> ?p ?o. }

Showing items 1 to 29 of 29 with 100 items per page.

2012946191 alternative "IPEC 2012".
2012946191 contributor B12703583.
2012946191 contributor B12703584.
2012946191 created "c2012.".
2012946191 date "2012".
2012946191 date "c2012.".
2012946191 dateCopyrighted "c2012.".
2012946191 description "Instance Compression for the Polynomial Hierarchy and beyond / Chiranjit Chakraborty and Rahul Santhanam -- Polynomial Time and Parameterized Approximation Algorithms for Boxicity / Abhijin Adiga, Jasine Babu and L. Sunil Chandran -- Homomorphic Hashing for Sparse Coefficient Extraction / Petteri Kaski, Mikko Koivisto and Jesper Nederlof -- Fast Monotone Summation over Disjoint Sets / Petteri Kaski, Mikko Koivisto and Janne H. Korhonen -- Weighted Counting of k-Matchings Is #W[1]-Hard / Markus Bläser and Radu Curticapean -- Computing Directed Pathwidth in O(1.89n) Time / Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki and Toshihiro Tano -- MSOL Restricted Contractibility to Planar Graphs / James Abello, Pavel Klavík, Jan Kratochvíl and Tomáš Vyskočil -- On the Space Complexity of Parameterized Problems / Michael Elberfeld, Christoph Stockhusen and Till Tantau -- On Tractable Parameterizations of Graph Isomorphism / Adam Bouland, Anuj Dawar and Eryk Kopczyński -- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / Sepp Hartung, Christian Komusiewicz and André Nichterlein -- Finding Dense Subgraphs of Sparse Graphs / Christian Komusiewicz and Manuel Sorge -- Enumerating Neighbour and Closest Strings / Naomi Nishimura and Narges Simjour -- An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem / Faisal N. Abu-Khzam and Mazen Bou Khuzam.".
2012946191 description "The Path Taken for k-Path / Andreas Björklund -- Randomized Techniques for Parameterized Algorithms / Dániel Marx -- Finding a Maximum Induced Degenerate Subgraph Faster Than 2n / Marcin Pilipczuk and Michał Pilipczuk -- The Exponential Time Hypothesis and the Parameterized Clique Problem / Yijia Chen, Kord Eickmeyer and Jörg Flum -- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos and Mingyu Xiao -- A New Algorithm for Parameterized MAX-SAT / Ivan Bliznets and Alexander Golovnev -- Restricted and Swap Common Superstring: A Parameterized View / Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis -- Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging / Łukasz Kowalik -- Some Definitorial Suggestions for Parameterized Proof Complexity / Jörg Flum and Moritz Müller -- An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs / Petr A. Golovach, Pinar Heggernes, Dieter Kratsch and Reza Saei -- Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? / Fedor V. Fomin, Bart M. P. Jansen and Michał Pilipczuk -- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs / Cédric Bentz --".
2012946191 extent "x, 273 p. :".
2012946191 identifier "3642332927 (pkb. : alk. paper)".
2012946191 identifier "9783642332920 (pkb. : alk. paper)".
2012946191 isPartOf "LNCS sublibrary. SL 1, Theoretical computer science and general issues".
2012946191 isPartOf "LNCS sublibrary. SL 1, Theoretical computer science and general issues.".
2012946191 isPartOf "Lecture notes in computer science ; 7535.".
2012946191 isPartOf "Lecture notes in computer science, 0302-9743 ; 7535".
2012946191 issued "2012".
2012946191 issued "c2012.".
2012946191 language "eng".
2012946191 publisher "Berlin ; New York : Springer,".
2012946191 subject "519.5/44 23".
2012946191 subject "Computer algorithms Congresses.".
2012946191 subject "Parameter estimation Congresses.".
2012946191 subject "QA276.8 .I64 2012".
2012946191 tableOfContents "Instance Compression for the Polynomial Hierarchy and beyond / Chiranjit Chakraborty and Rahul Santhanam -- Polynomial Time and Parameterized Approximation Algorithms for Boxicity / Abhijin Adiga, Jasine Babu and L. Sunil Chandran -- Homomorphic Hashing for Sparse Coefficient Extraction / Petteri Kaski, Mikko Koivisto and Jesper Nederlof -- Fast Monotone Summation over Disjoint Sets / Petteri Kaski, Mikko Koivisto and Janne H. Korhonen -- Weighted Counting of k-Matchings Is #W[1]-Hard / Markus Bläser and Radu Curticapean -- Computing Directed Pathwidth in O(1.89n) Time / Kenta Kitsunai, Yasuaki Kobayashi, Keita Komuro, Hisao Tamaki and Toshihiro Tano -- MSOL Restricted Contractibility to Planar Graphs / James Abello, Pavel Klavík, Jan Kratochvíl and Tomáš Vyskočil -- On the Space Complexity of Parameterized Problems / Michael Elberfeld, Christoph Stockhusen and Till Tantau -- On Tractable Parameterizations of Graph Isomorphism / Adam Bouland, Anuj Dawar and Eryk Kopczyński -- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / Sepp Hartung, Christian Komusiewicz and André Nichterlein -- Finding Dense Subgraphs of Sparse Graphs / Christian Komusiewicz and Manuel Sorge -- Enumerating Neighbour and Closest Strings / Naomi Nishimura and Narges Simjour -- An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem / Faisal N. Abu-Khzam and Mazen Bou Khuzam.".
2012946191 tableOfContents "The Path Taken for k-Path / Andreas Björklund -- Randomized Techniques for Parameterized Algorithms / Dániel Marx -- Finding a Maximum Induced Degenerate Subgraph Faster Than 2n / Marcin Pilipczuk and Michał Pilipczuk -- The Exponential Time Hypothesis and the Parameterized Clique Problem / Yijia Chen, Kord Eickmeyer and Jörg Flum -- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos and Mingyu Xiao -- A New Algorithm for Parameterized MAX-SAT / Ivan Bliznets and Alexander Golovnev -- Restricted and Swap Common Superstring: A Parameterized View / Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri and Italo Zoppis -- Nonblocker in H-Minor Free Graphs: Kernelization Meets Discharging / Łukasz Kowalik -- Some Definitorial Suggestions for Parameterized Proof Complexity / Jörg Flum and Moritz Müller -- An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs / Petr A. Golovach, Pinar Heggernes, Dieter Kratsch and Reza Saei -- Preprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help? / Fedor V. Fomin, Bart M. P. Jansen and Michał Pilipczuk -- A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs / Cédric Bentz --".
2012946191 title "IPEC 2012".
2012946191 title "Parameterized and exact computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.).".
2012946191 type "text".