top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Parameterized and exact computation : 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011 : revised selected papers / Dániel Marx, Peter Rossmanith (eds.).
Parameterized and exact computation : 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011 : revised selected papers / Dániel Marx, Peter Rossmanith (eds.).
Creatore [IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]
Estensione 1 online resource (viii, 271 pages) : illustrations
Disciplina 004.01/51
Accesso persona Marx, Dániel, 1977- editor
Rossmanith, Peter, editor
Genere/Forma Electronic books
ISBN 9783642280498
3642280498
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-005475105
[IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: Duke University
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
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
Creatore [IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]
Estensione 1 online resource (viii, 271 pages).
Disciplina 511.352
Accesso persona Marx, Daniel
Rossmanith, Peter
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Information theory
Computer software
Computational complexity
Algebra -- Data processing
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Theory of Computation
Symbolic and Algebraic Manipulation
Computation by Abstract Devices
ISBN 9783642280504
3642280501
9783642280498
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Multiway Cut Parameterized above Lower Bounds / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- Parameterized Complexity of Firefighting Revisited / 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 -- 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 -- 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 -- 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 -- 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.
Record Nr. NYU-004374531
[IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: New York University
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
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
Creatore [IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]
Estensione 1 online resource (viii, 271 pages).
Disciplina 511.352
Accesso persona Marx, Daniel
Rossmanith, Peter
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Information theory
Computer software
Computational complexity
Algebra -- Data processing
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Theory of Computation
Symbolic and Algebraic Manipulation
Computation by Abstract Devices
ISBN 9783642280504
3642280501
9783642280498
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Multiway Cut Parameterized above Lower Bounds / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- Parameterized Complexity of Firefighting Revisited / 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 -- 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 -- 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 -- 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 -- 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.
Record Nr. NYU-004622018
[IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: New York University
Parameterized and exact computation [electronic resource] : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers / edited by Dániel Marx, Peter Rossmanith
Parameterized and exact computation [electronic resource] : 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised selected papers / edited by Dániel Marx, Peter Rossmanith
Creatore [IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]
Estensione 1 online resource (viii, 271 p.)
Disciplina 511.352
Accesso persona Marx, Daniel
Rossmanith, Peter
Genere/Forma Electronic books
Soggetto non controllato Computer science
Information theory
Computer software
Computational complexity
Algebra -- Data processing
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Theory of Computation
Symbolic and Algebraic Manipulation
Computation by Abstract Devices
ISBN 9783642280504 (electronic bk.)
3642280501 (electronic bk.)
9783642280498
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Multiway Cut Parameterized above Lower Bounds / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- Parameterized Complexity of Firefighting Revisited / 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 -- 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 -- 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 -- 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 -- 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.
Record Nr. UPENN-9960092993503681
[IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
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
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
Creatore [IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]
Estensione 1 online resource (viii, 271 pages).
Accesso persona Marx, Dániel
Rossmanith, Peter
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Information theory
Computer software
Computational complexity
Algebra -- Data processing
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Theory of Computation
Symbolic and Algebraic Manipulation
Computation by Abstract Devices
ISBN 9783642280504
3642280501
9783642280498
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Multiway Cut Parameterized above Lower Bounds / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- Parameterized Complexity of Firefighting Revisited / 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 -- 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 -- 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 -- 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 -- 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.
Record Nr. UCHICAGO-11076741
[IPEC (Symposium) (6th : 2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: University of Chicago