Parameterized and exact computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings / Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.).

By: (7th : IPEC (Symposium) (7th : 2012 : Ljubljana, Slovenia)
Contributor(s): Thilikos, Dimitrios M | Woeginger, Gerhard
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 7535.; LNCS sublibrary: Publisher: Berlin ; New York : Springer, ©2012Description: 1 online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642332937; 3642332935; 3642332927; 9783642332920Other title: IPEC 2012Subject(s): Parameter estimation -- Congresses | Computer algorithms -- Congresses | Informatique | Computer algorithms | Parameter estimation | Computer science | Data structures (Computer science) | Computer software | Electronic data processing | Computational complexity | Algorithms | Algorithm Analysis and Problem Complexity | Numeric ComputingGenre/Form: Electronic books. | Conference papers and proceedings. | Computer software. Additional physical formats: Print version:: Parameterized and exact computation.DDC classification: 519.5/44 LOC classification: QA276.8 | .I64 2012Online resources: Click here to access online
Contents:
The Path Taken for k-Path / Andreas Björklund -- Randomized Techniques for Parameterized Algorithms / Dá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 Jörg Flum -- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / Bruno Escoffier, Jérô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 / Jörg Flum and Moritz Mü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 / Cédric Bentz.
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 Blä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 Klavík, Jan Kratochvíl and Tomáš Vyskoč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 Kopczyński -- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / Sepp Hartung, Christian Komusiewicz and André 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.
Summary: This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms; fixed-parameter tractability results; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; and implementation issues of parameterized and exact algorithms.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

The Path Taken for k-Path / Andreas Björklund -- Randomized Techniques for Parameterized Algorithms / Dá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 Jörg Flum -- New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set / Bruno Escoffier, Jérô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 / Jörg Flum and Moritz Mü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 / Cédric Bentz.

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 Blä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 Klavík, Jan Kratochvíl and Tomáš Vyskoč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 Kopczyński -- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs / Sepp Hartung, Christian Komusiewicz and André 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.

This book constitutes the refereed proceedings of the 7th International Symposium on Parameterized and Exact Computation, IPEC 2012, in Ljubljana, Slovenia, in September 2012. The 21 revised full papers presented together with 2 keynote talks were carefully reviewed and selected from 37 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms; fixed-parameter tractability results; parameterized complexity theory; relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact computation; and implementation issues of parameterized and exact algorithms.

Includes bibliographical references and index.

English.

There are no comments for this item.

to post a comment.

Powered by Koha