Coverart for item
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)

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
Creator
Contributor
Subject
Genre
Language
eng
Member of
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)
Instantiates
Publication
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)
Publication
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 Locations

Processing Feedback ...