Coverart for item
The Resource Parameterized and exact computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings, Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.), (electronic book)

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

Label
Parameterized and exact computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings
Title
Parameterized and exact computation
Title remainder
7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings
Statement of responsibility
Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.)
Title variation
IPEC 2012
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
519.5/44
Index
index present
LC call number
QA276.8
LC item number
.I64 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
IPEC 2012
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Thilikos, Dimitrios M
  • Woeginger, Gerhard
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 1, Theoretical computer science and general issues
Series volume
7535
http://library.link/vocab/subjectName
  • Parameter estimation
  • Computer algorithms
Label
Parameterized and exact computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings, Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.), (electronic book)
Instantiates
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Color
multicolored
Contents
  • 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
  • The Path Taken for k-Path
  • 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 --
  • 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
  • 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
  • Instance Compression for the Polynomial Hierarchy and beyond
  • 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
  • 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
Control code
SPR809794476
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642332937
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Parameterized and exact computation : 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings, Dimitrios M. Thilikos, Gerhard J. Woeginger (eds.), (electronic book)
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
unknown
Color
multicolored
Contents
  • 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
  • The Path Taken for k-Path
  • 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 --
  • 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
  • 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
  • Instance Compression for the Polynomial Hierarchy and beyond
  • 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
  • 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
Control code
SPR809794476
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642332937
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...