The Resource Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book)
Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book)
Resource Information
The item Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.
This item is available to borrow from 1 library branch.
- Extent
- 1 online resource (viii, 271 p.)
- Contents
-
- Contracting Graphs to Paths and Trees
- Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov and Christophe Paul
- Increasing the Minimum Degree of a Graph by Contractions
- Petr A. Golovach, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
- Planar Disjoint-Paths Completion
- Isolde Adler, Stavros G. Kolliopoulos and Dimitrios M. Thilikos
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing
- Peter Damaschke
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
- Alexander Golovnev
- On Multiway Cut Parameterized above Lower Bounds
- Improved Parameterized Algorithms for above Average Constraint Satisfaction
- Eun Jung Kim and Ryan Williams
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
- Bart M. P. Jansen and Stefan Kratsch
- Kernel Bounds for Path and Cycle Problems
- Hans L. Bodlaender, Bart M. P. Jansen and Stefan Kratsch
- On the Hardness of Losing Width
- Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh
- Safe Approximation and Its Relation to Kernelization
- Jiong Guo, Iyad Kanj and Stefan Kratsch
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk
- Simpler Linear-Time Kernelization for Planar Dominating Set
- Torben Hagerup
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
- René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier and Mathias Weller
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
- Hajo Broersma, Petr A. Golovach and Viresh Patel
- Finding Good Decompositions for Dynamic Programming on Dense Graphs
- Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle and Martin Vatshelle
- Parameterized Maximum Path Coloring
- Michael Lampis
- Parameterized Complexity of Firefighting Revisited
- On Cutwidth Parameterized by Vertex Cover
- Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Robert Ganian
- Marek Cygan, Fedor V. Fomin and Erik Jan van Leeuwen
- Parameterized Complexity in Multiple-Interval Graphs: Domination
- Minghui Jiang and Yong Zhang
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method
- Yoichi Iwata
- Isbn
- 9783642280504
- Label
- Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers
- Title
- Parameterized and exact computation
- Title remainder
- 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers
- Statement of responsibility
- edited by Dániel Marx, Peter Rossmanith
- Language
- eng
- Cataloging source
- GW5XE
- Dewey number
- 511.352
- Index
- index present
- LC call number
- QA267.8
- LC item number
- .I96 2011
- Literary form
- non fiction
- http://bibfra.me/vocab/lite/meetingDate
- 2011
- http://bibfra.me/vocab/lite/meetingName
- IPEC 2011
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
-
- Marx, Dániel
- Rossmanith, Peter
- Series statement
-
- Lecture notes in computer science,
- LNCS sublibrary. SL 1, Theoretical computer science and general issues
- Series volume
- 7112
- http://library.link/vocab/subjectName
-
- Parameter estimation
- Computer algorithms
- Computational complexity
- Label
- Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book)
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and author index
- Color
- multicolored
- Contents
-
- Contracting Graphs to Paths and Trees
- Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov and Christophe Paul
- Increasing the Minimum Degree of a Graph by Contractions
- Petr A. Golovach, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
- Planar Disjoint-Paths Completion
- Isolde Adler, Stavros G. Kolliopoulos and Dimitrios M. Thilikos
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing
- Peter Damaschke
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
- Alexander Golovnev
- On Multiway Cut Parameterized above Lower Bounds
- Improved Parameterized Algorithms for above Average Constraint Satisfaction
- Eun Jung Kim and Ryan Williams
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
- Bart M. P. Jansen and Stefan Kratsch
- Kernel Bounds for Path and Cycle Problems
- Hans L. Bodlaender, Bart M. P. Jansen and Stefan Kratsch
- On the Hardness of Losing Width
- Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh
- Safe Approximation and Its Relation to Kernelization
- Jiong Guo, Iyad Kanj and Stefan Kratsch
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk
- Simpler Linear-Time Kernelization for Planar Dominating Set
- Torben Hagerup
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
- René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier and Mathias Weller
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
- Hajo Broersma, Petr A. Golovach and Viresh Patel
- Finding Good Decompositions for Dynamic Programming on Dense Graphs
- Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle and Martin Vatshelle
- Parameterized Maximum Path Coloring
- Michael Lampis
- Parameterized Complexity of Firefighting Revisited
- On Cutwidth Parameterized by Vertex Cover
- Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Robert Ganian
- Marek Cygan, Fedor V. Fomin and Erik Jan van Leeuwen
- Parameterized Complexity in Multiple-Interval Graphs: Domination
- Minghui Jiang and Yong Zhang
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method
- Yoichi Iwata
- Control code
- SPR781093862
- Dimensions
- unknown
- Extent
- 1 online resource (viii, 271 p.)
- File format
- unknown
- Form of item
- electronic
- Isbn
- 9783642280504
- 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 : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book)
- Antecedent source
- unknown
- Bibliography note
- Includes bibliographical references and author index
- Color
- multicolored
- Contents
-
- Contracting Graphs to Paths and Trees
- Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov and Christophe Paul
- Increasing the Minimum Degree of a Graph by Contractions
- Petr A. Golovach, Marcin Kamiński, Daniël Paulusma and Dimitrios M. Thilikos
- Planar Disjoint-Paths Completion
- Isolde Adler, Stavros G. Kolliopoulos and Dimitrios M. Thilikos
- Sparse Solutions of Sparse Linear Systems: Fixed-Parameter Tractability and an Application of Complex Group Testing
- Peter Damaschke
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
- Alexander Golovnev
- On Multiway Cut Parameterized above Lower Bounds
- Improved Parameterized Algorithms for above Average Constraint Satisfaction
- Eun Jung Kim and Ryan Williams
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
- Bart M. P. Jansen and Stefan Kratsch
- Kernel Bounds for Path and Cycle Problems
- Hans L. Bodlaender, Bart M. P. Jansen and Stefan Kratsch
- On the Hardness of Losing Width
- Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh
- Safe Approximation and Its Relation to Kernelization
- Jiong Guo, Iyad Kanj and Stefan Kratsch
- Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk
- Simpler Linear-Time Kernelization for Planar Dominating Set
- Torben Hagerup
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs
- René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier and Mathias Weller
- Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
- Hajo Broersma, Petr A. Golovach and Viresh Patel
- Finding Good Decompositions for Dynamic Programming on Dense Graphs
- Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle and Martin Vatshelle
- Parameterized Maximum Path Coloring
- Michael Lampis
- Parameterized Complexity of Firefighting Revisited
- On Cutwidth Parameterized by Vertex Cover
- Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk and Saket Saurabh
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Robert Ganian
- Marek Cygan, Fedor V. Fomin and Erik Jan van Leeuwen
- Parameterized Complexity in Multiple-Interval Graphs: Domination
- Minghui Jiang and Yong Zhang
- A Faster Algorithm for Dominating Set Analyzed by the Potential Method
- Yoichi Iwata
- Control code
- SPR781093862
- Dimensions
- unknown
- Extent
- 1 online resource (viii, 271 p.)
- File format
- unknown
- Form of item
- electronic
- Isbn
- 9783642280504
- Level of compression
- unknown
- Quality assurance targets
- not applicable
- Reformatting quality
- unknown
- Reproduction note
- Electronic resource.
- Sound
- unknown sound
- Specific material designation
- remote
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Parameterized-and-exact-computation--6th/TqJNSle5yiY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Parameterized-and-exact-computation--6th/TqJNSle5yiY/">Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/Parameterized-and-exact-computation--6th/TqJNSle5yiY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/Parameterized-and-exact-computation--6th/TqJNSle5yiY/">Parameterized and exact computation : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers, edited by Dániel Marx, Peter Rossmanith, (electronic book)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
