Parameterized Complexity of the Firefighter Problem
Identifieur interne : 001518 ( Istex/Corpus ); précédent : 001517; suivant : 001519Parameterized Complexity of the Firefighter Problem
Auteurs : Cristina Bazgan ; Morgan Chopin ; Michael R. FellowsSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
English descriptors
- KwdEn :
- Algorithm, Bipartite graphs, Busy gadget, Busy gadgets, Clique, Computable function, Cubic graphs, Discrete mathematics, Equivalent instance, Former problem, General graphs, Heidelberg, Input instance, Kernel, Maximum degree, Output instance, Parameter tractability, Parameterized, Parameterized complexity, Parameterized intractability, Parameterized problem, Parameterized problems, Planar graphs, Poly kernel, Polynomial kernel, Polynomial kernels, Polynomial time, Problem parameterized, Protection strategy, Reduction rule, Regular clique, Same number, Several cases, Subset, Time proof, Time step, Tractable, Valid strategy, Vertex, Vulnerable vertex.
- Teeft :
- Algorithm, Bipartite graphs, Busy gadget, Busy gadgets, Clique, Computable function, Cubic graphs, Discrete mathematics, Equivalent instance, Former problem, General graphs, Heidelberg, Input instance, Kernel, Maximum degree, Output instance, Parameter tractability, Parameterized, Parameterized complexity, Parameterized intractability, Parameterized problem, Parameterized problems, Planar graphs, Poly kernel, Polynomial kernel, Polynomial kernels, Polynomial time, Problem parameterized, Protection strategy, Reduction rule, Regular clique, Same number, Several cases, Subset, Time proof, Time step, Tractable, Valid strategy, Vertex, Vulnerable vertex.
Abstract
Abstract: In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k -Vertices and its dual Saving All But k -Vertices are both W[1]-hard for parameter k even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable. For instance, Saving k -Vertices is fixed-parameter tractable on planar graphs for parameter k. Moreover, we prove a lower bound to polynomial kernelization for Saving All But k -Vertices.
Url:
DOI: 10.1007/978-3-642-25591-5_66
Links to Exploration step
ISTEX:70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Parameterized Complexity of the Firefighter Problem</title><author><name sortKey="Bazgan, Cristina" sort="Bazgan, Cristina" uniqKey="Bazgan C" first="Cristina" last="Bazgan">Cristina Bazgan</name><affiliation><mods:affiliation>LAMSADE, Université Paris-Dauphine, France</mods:affiliation></affiliation><affiliation><mods:affiliation>Institut Universitaire de France, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bazgan@lamsade.dauphine.fr</mods:affiliation></affiliation></author><author><name sortKey="Chopin, Morgan" sort="Chopin, Morgan" uniqKey="Chopin M" first="Morgan" last="Chopin">Morgan Chopin</name><affiliation><mods:affiliation>LAMSADE, Université Paris-Dauphine, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: chopin@lamsade.dauphine.fr</mods:affiliation></affiliation></author><author><name sortKey="Fellows, Michael R" sort="Fellows, Michael R" uniqKey="Fellows M" first="Michael R." last="Fellows">Michael R. Fellows</name><affiliation><mods:affiliation>Charles Darwin University, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: michael.fellows@cdu.edu.au</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-25591-5_66</idno><idno type="url">https://api.istex.fr/document/70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001518</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001518</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Parameterized Complexity of the Firefighter Problem</title><author><name sortKey="Bazgan, Cristina" sort="Bazgan, Cristina" uniqKey="Bazgan C" first="Cristina" last="Bazgan">Cristina Bazgan</name><affiliation><mods:affiliation>LAMSADE, Université Paris-Dauphine, France</mods:affiliation></affiliation><affiliation><mods:affiliation>Institut Universitaire de France, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bazgan@lamsade.dauphine.fr</mods:affiliation></affiliation></author><author><name sortKey="Chopin, Morgan" sort="Chopin, Morgan" uniqKey="Chopin M" first="Morgan" last="Chopin">Morgan Chopin</name><affiliation><mods:affiliation>LAMSADE, Université Paris-Dauphine, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: chopin@lamsade.dauphine.fr</mods:affiliation></affiliation></author><author><name sortKey="Fellows, Michael R" sort="Fellows, Michael R" uniqKey="Fellows M" first="Michael R." last="Fellows">Michael R. Fellows</name><affiliation><mods:affiliation>Charles Darwin University, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: michael.fellows@cdu.edu.au</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Bipartite graphs</term><term>Busy gadget</term><term>Busy gadgets</term><term>Clique</term><term>Computable function</term><term>Cubic graphs</term><term>Discrete mathematics</term><term>Equivalent instance</term><term>Former problem</term><term>General graphs</term><term>Heidelberg</term><term>Input instance</term><term>Kernel</term><term>Maximum degree</term><term>Output instance</term><term>Parameter tractability</term><term>Parameterized</term><term>Parameterized complexity</term><term>Parameterized intractability</term><term>Parameterized problem</term><term>Parameterized problems</term><term>Planar graphs</term><term>Poly kernel</term><term>Polynomial kernel</term><term>Polynomial kernels</term><term>Polynomial time</term><term>Problem parameterized</term><term>Protection strategy</term><term>Reduction rule</term><term>Regular clique</term><term>Same number</term><term>Several cases</term><term>Subset</term><term>Time proof</term><term>Time step</term><term>Tractable</term><term>Valid strategy</term><term>Vertex</term><term>Vulnerable vertex</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Bipartite graphs</term><term>Busy gadget</term><term>Busy gadgets</term><term>Clique</term><term>Computable function</term><term>Cubic graphs</term><term>Discrete mathematics</term><term>Equivalent instance</term><term>Former problem</term><term>General graphs</term><term>Heidelberg</term><term>Input instance</term><term>Kernel</term><term>Maximum degree</term><term>Output instance</term><term>Parameter tractability</term><term>Parameterized</term><term>Parameterized complexity</term><term>Parameterized intractability</term><term>Parameterized problem</term><term>Parameterized problems</term><term>Planar graphs</term><term>Poly kernel</term><term>Polynomial kernel</term><term>Polynomial kernels</term><term>Polynomial time</term><term>Problem parameterized</term><term>Protection strategy</term><term>Reduction rule</term><term>Regular clique</term><term>Same number</term><term>Several cases</term><term>Subset</term><term>Time proof</term><term>Time step</term><term>Tractable</term><term>Valid strategy</term><term>Vertex</term><term>Vulnerable vertex</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k -Vertices and its dual Saving All But k -Vertices are both W[1]-hard for parameter k even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable. For instance, Saving k -Vertices is fixed-parameter tractable on planar graphs for parameter k. Moreover, we prove a lower bound to polynomial kernelization for Saving All But k -Vertices.</div></front></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>parameterized</json:string><json:string>time step</json:string><json:string>valid strategy</json:string><json:string>parameterized complexity</json:string><json:string>subset</json:string><json:string>algorithm</json:string><json:string>tractable</json:string><json:string>polynomial kernel</json:string><json:string>busy gadgets</json:string><json:string>bipartite graphs</json:string><json:string>planar graphs</json:string><json:string>heidelberg</json:string><json:string>vertex</json:string><json:string>general graphs</json:string><json:string>protection strategy</json:string><json:string>polynomial kernels</json:string><json:string>same number</json:string><json:string>busy gadget</json:string><json:string>reduction rule</json:string><json:string>output instance</json:string><json:string>kernel</json:string><json:string>clique</json:string><json:string>polynomial time</json:string><json:string>equivalent instance</json:string><json:string>maximum degree</json:string><json:string>parameterized intractability</json:string><json:string>vulnerable vertex</json:string><json:string>cubic graphs</json:string><json:string>discrete mathematics</json:string><json:string>time proof</json:string><json:string>poly kernel</json:string><json:string>former problem</json:string><json:string>parameter tractability</json:string><json:string>problem parameterized</json:string><json:string>regular clique</json:string><json:string>parameterized problem</json:string><json:string>several cases</json:string><json:string>input instance</json:string><json:string>computable function</json:string><json:string>parameterized problems</json:string></teeft></keywords><author><json:item><name>Cristina Bazgan</name><affiliations><json:string>LAMSADE, Université Paris-Dauphine, France</json:string><json:string>Institut Universitaire de France, France</json:string><json:string>E-mail: bazgan@lamsade.dauphine.fr</json:string></affiliations></json:item><json:item><name>Morgan Chopin</name><affiliations><json:string>LAMSADE, Université Paris-Dauphine, France</json:string><json:string>E-mail: chopin@lamsade.dauphine.fr</json:string></affiliations></json:item><json:item><name>Michael R. Fellows</name><affiliations><json:string>Charles Darwin University, Australia</json:string><json:string>E-mail: michael.fellows@cdu.edu.au</json:string></affiliations></json:item></author><arkIstex>ark:/67375/1BB-DSR10BHT-V</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k -Vertices and its dual Saving All But k -Vertices are both W[1]-hard for parameter k even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable. For instance, Saving k -Vertices is fixed-parameter tractable on planar graphs for parameter k. Moreover, we prove a lower bound to polynomial kernelization for Saving All But k -Vertices.</abstract><qualityIndicators><refBibsNative>false</refBibsNative><abstractWordCount>80</abstractWordCount><abstractCharCount>510</abstractCharCount><keywordCount>0</keywordCount><score>7.81</score><pdfWordCount>4850</pdfWordCount><pdfCharCount>22309</pdfCharCount><pdfVersion>1.6</pdfVersion><pdfPageCount>10</pdfPageCount><pdfPageSize>429.442 x 659.895 pts</pdfPageSize></qualityIndicators><title>Parameterized Complexity of the Firefighter Problem</title><chapterId><json:string>66</json:string><json:string>Chap66</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2011</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor></serie><host><title>Algorithms and Computation</title><language><json:string>unknown</json:string></language><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-25591-5</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-642-25591-5</json:string></eisbn><bookId><json:string>978-3-642-25591-5</json:string></bookId><isbn><json:string>978-3-642-25590-8</json:string></isbn><volume>7074</volume><pages><first>643</first><last>652</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Takao Asano</name><affiliations><json:string>Chuo University, Kasuga, Bunkyo-ku, 112-8551, Tokyo, Japan</json:string><json:string>E-mail: asano@ise.chuo-u.ac.jp</json:string></affiliations></json:item><json:item><name>Shin-ichi Nakano</name><affiliations><json:string>Gunma University, 1-5-1 Tenjin-Cho, 376-8515, Kiryu-Shi, Japan</json:string><json:string>E-mail: nakano@cs.gunma-u.ac.jp</json:string></affiliations></json:item><json:item><name>Yoshio Okamoto</name><affiliations><json:string>Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan</json:string><json:string>E-mail: okamotoy@jaist.ac.jp</json:string></affiliations></json:item><json:item><name>Osamu Watanabe</name><affiliations><json:string>Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, 152-8552, Tokyo, Japan</json:string><json:string>E-mail: watanabe@is.titech.ac.jp</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Discrete Mathematics in Computer Science</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Computer Graphics</value></json:item><json:item><value>Data Structures</value></json:item><json:item><value>Numeric Computing</value></json:item></subject></host><namedEntities><unitex><date><json:string>2011</json:string></date><geogName></geogName><orgName><json:string>Australian Research Council</json:string></orgName><orgName_funder></orgName_funder><orgName_provider></orgName_provider><persName><json:string>E. Consider</json:string><json:string>G. Let</json:string><json:string>Morgan Chopin</json:string><json:string>G. Notice</json:string><json:string>Michael R. Fellows</json:string><json:string>G. Theorem</json:string><json:string>C. Bazgan</json:string><json:string>M.R. Fellows</json:string><json:string>By</json:string><json:string>M. Chopin</json:string></persName><placeName><json:string>Heidelberg</json:string></placeName><ref_url></ref_url><ref_bibl><json:string>[4]</json:string><json:string>[12]</json:string><json:string>[11]</json:string><json:string>[8]</json:string><json:string>[1]</json:string><json:string>[10]</json:string><json:string>[3]</json:string><json:string>[5]</json:string><json:string>T. Asano et al.</json:string><json:string>[7]</json:string><json:string>Cygan et al. [5]</json:string><json:string>[2]</json:string><json:string>[6,9]</json:string></ref_bibl><bibl></bibl></unitex></namedEntities><ark><json:string>ark:/67375/1BB-DSR10BHT-V</json:string></ark><categories><inist><json:string>1 - sciences appliquees, technologies et medecines</json:string><json:string>2 - sciences exactes et technologie</json:string><json:string>3 - sciences et techniques communes</json:string><json:string>4 - mathematiques</json:string></inist></categories><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-25591-5_66</json:string></doi><id>70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Parameterized Complexity of the Firefighter Problem</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://publisher-list.data.istex.fr">Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><licence><p>Springer-Verlag GmbH Berlin Heidelberg, 2011</p></licence><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</p></availability><date>2011</date></publicationStmt><notesStmt><note type="conference" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Parameterized Complexity of the Firefighter Problem</title><author xml:id="author-0000"><persName><forename type="first">Cristina</forename><surname>Bazgan</surname></persName><email>bazgan@lamsade.dauphine.fr</email><affiliation>LAMSADE, Université Paris-Dauphine, France</affiliation><affiliation>Institut Universitaire de France, France</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Morgan</forename><surname>Chopin</surname></persName><email>chopin@lamsade.dauphine.fr</email><affiliation>LAMSADE, Université Paris-Dauphine, France</affiliation></author><author xml:id="author-0002"><persName><forename type="first">Michael</forename><surname>Fellows</surname></persName><email>michael.fellows@cdu.edu.au</email><affiliation>Charles Darwin University, Australia</affiliation></author><idno type="istex">70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3</idno><idno type="ark">ark:/67375/1BB-DSR10BHT-V</idno><idno type="DOI">10.1007/978-3-642-25591-5_66</idno><idno type="ChapterID">66</idno><idno type="ChapterID">Chap66</idno></analytic><monogr><title level="m">Algorithms and Computation</title><title level="m" type="sub">22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings</title><idno type="DOI">10.1007/978-3-642-25591-5</idno><idno type="pISBN">978-3-642-25590-8</idno><idno type="eISBN">978-3-642-25591-5</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="book-title-id">300163</idno><idno type="book-id">978-3-642-25591-5</idno><idno type="book-chapter-count">78</idno><idno type="book-volume-number">7074</idno><idno type="book-sequence-number">7074</idno><idno type="PartChapterCount">4</idno><editor xml:id="book-author-0000"><persName><forename type="first">Takao</forename><surname>Asano</surname></persName><email>asano@ise.chuo-u.ac.jp</email><affiliation>Chuo University, Kasuga, Bunkyo-ku, 112-8551, Tokyo, Japan</affiliation></editor><editor xml:id="book-author-0001"><persName><forename type="first">Shin-ichi</forename><surname>Nakano</surname></persName><email>nakano@cs.gunma-u.ac.jp</email><affiliation>Gunma University, 1-5-1 Tenjin-Cho, 376-8515, Kiryu-Shi, Japan</affiliation></editor><editor xml:id="book-author-0002"><persName><forename type="first">Yoshio</forename><surname>Okamoto</surname></persName><email>okamotoy@jaist.ac.jp</email><affiliation>Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan</affiliation></editor><editor xml:id="book-author-0003"><persName><forename type="first">Osamu</forename><surname>Watanabe</surname></persName><email>watanabe@is.titech.ac.jp</email><affiliation>Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, 152-8552, Tokyo, Japan</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2011"></date><biblScope unit="volume">7074</biblScope><biblScope unit="page" from="643">643</biblScope><biblScope unit="page" to="652">652</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor xml:id="serie-author-0000"><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor xml:id="serie-author-0001"><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor xml:id="serie-author-0002"><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor xml:id="serie-author-0003"><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor xml:id="serie-author-0004"><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor xml:id="serie-author-0005"><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor xml:id="serie-author-0006"><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor xml:id="serie-author-0007"><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor xml:id="serie-author-0008"><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor xml:id="serie-author-0009"><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor xml:id="serie-author-0010"><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor xml:id="serie-author-0011"><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor xml:id="serie-author-0012"><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor xml:id="serie-author-0013"><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor xml:id="serie-author-0014"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-id">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k -Vertices and its dual Saving All But k -Vertices are both W[1]-hard for parameter k even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable. For instance, Saving k -Vertices is fixed-parameter tractable on planar graphs for parameter k. Moreover, we prove a lower bound to polynomial kernelization for Saving All But k -Vertices.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I16021</label><label>I17028</label><label>I13022</label><label>I22013</label><label>I15017</label><label>I1701X</label><item><term>Computer Science</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Discrete Mathematics in Computer Science</term></item><item><term>Computer Communication Networks</term></item><item><term>Computer Graphics</term></item><item><term>Data Structures</term></item><item><term>Numeric Computing</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2011">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-10-3">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-25591-5</BookID><BookTitle>Algorithms and Computation</BookTitle><BookSubTitle>22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings</BookSubTitle><BookVolumeNumber>7074</BookVolumeNumber><BookSequenceNumber>7074</BookSequenceNumber><BookDOI>10.1007/978-3-642-25591-5</BookDOI><BookTitleID>300163</BookTitleID><BookPrintISBN>978-3-642-25590-8</BookPrintISBN><BookElectronicISBN>978-3-642-25591-5</BookElectronicISBN><BookChapterCount>78</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag GmbH Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Code="I17028" Priority="2" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject><BookSubject Code="I13022" Priority="3" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I22013" Priority="4" Type="Secondary">Computer Graphics</BookSubject><BookSubject Code="I15017" Priority="5" Type="Secondary">Data Structures</BookSubject><BookSubject Code="I1701X" Priority="6" Type="Secondary">Numeric Computing</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Takao</GivenName><FamilyName>Asano</FamilyName></EditorName><Contact><Email>asano@ise.chuo-u.ac.jp</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Shin-ichi</GivenName><FamilyName>Nakano</FamilyName></EditorName><Contact><Email>nakano@cs.gunma-u.ac.jp</Email></Contact></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Yoshio</GivenName><FamilyName>Okamoto</FamilyName></EditorName><Contact><Email>okamotoy@jaist.ac.jp</Email></Contact></Editor><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Osamu</GivenName><FamilyName>Watanabe</FamilyName></EditorName><Contact><Email>watanabe@is.titech.ac.jp</Email></Contact></Editor><Affiliation ID="Aff16"><OrgName>Chuo University</OrgName><OrgAddress><Street>Kasuga, Bunkyo-ku</Street><Postcode>112-8551</Postcode><City>Tokyo</City><Country>Japan</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>Gunma University</OrgName><OrgAddress><Street>1-5-1 Tenjin-Cho</Street><Postcode>376-8515</Postcode><City>Kiryu-Shi</City><Country>Japan</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgName>Japan Advanced Institute of Science and Technology</OrgName><OrgAddress><Street>1-1 Asahidai</Street><Postcode>923-1292</Postcode><City>Nomi</City><State>Ishikawa</State><Country>Japan</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgName>Tokyo Institute of Technology</OrgName><OrgAddress><Street>2-12-1 Ookayama, Meguro-ku</Street><Postcode>152-8552</Postcode><City>Tokyo</City><Country>Japan</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part19"><PartInfo TocLevels="0"><PartID>19</PartID><PartSequenceNumber>19</PartSequenceNumber><PartTitle>Parameterized Algorithms II</PartTitle><PartChapterCount>4</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Algorithms and Computation</BookTitle></PartContext></PartInfo><Chapter ID="Chap66" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>66</ChapterID><ChapterDOI>10.1007/978-3-642-25591-5_66</ChapterDOI><ChapterSequenceNumber>66</ChapterSequenceNumber><ChapterTitle Language="En">Parameterized Complexity of the Firefighter Problem</ChapterTitle><ChapterFirstPage>643</ChapterFirstPage><ChapterLastPage>652</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>19</PartID><BookID>978-3-642-25591-5</BookID><BookTitle>Algorithms and Computation</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff20 Aff21"><AuthorName DisplayOrder="Western"><GivenName>Cristina</GivenName><FamilyName>Bazgan</FamilyName></AuthorName><Contact><Email>bazgan@lamsade.dauphine.fr</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Morgan</GivenName><FamilyName>Chopin</FamilyName></AuthorName><Contact><Email>chopin@lamsade.dauphine.fr</Email></Contact></Author><Author AffiliationIDS="Aff22"><AuthorName DisplayOrder="Western"><GivenName>Michael</GivenName><GivenName>R.</GivenName><FamilyName>Fellows</FamilyName></AuthorName><Contact><Email>michael.fellows@cdu.edu.au</Email></Contact></Author><Affiliation ID="Aff20"><OrgDivision>LAMSADE</OrgDivision><OrgName>Université Paris-Dauphine</OrgName><OrgAddress><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgName>Institut Universitaire de France</OrgName><OrgAddress><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff22"><OrgName>Charles Darwin University</OrgName><OrgAddress><Country>Australia</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that <Emphasis Type="SmallCaps">Saving </Emphasis><Emphasis Type="Italic">k</Emphasis><Emphasis Type="SmallCaps">-Vertices</Emphasis> and its dual <Emphasis Type="SmallCaps">Saving All But </Emphasis><Emphasis Type="Italic">k</Emphasis><Emphasis Type="SmallCaps">-Vertices</Emphasis> are both W[1]-hard for parameter <Emphasis Type="Italic">k</Emphasis> even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable. For instance, <Emphasis Type="SmallCaps">Saving </Emphasis><Emphasis Type="Italic">k</Emphasis><Emphasis Type="SmallCaps">-Vertices</Emphasis> is fixed-parameter tractable on planar graphs for parameter <Emphasis Type="Italic">k</Emphasis>. Moreover, we prove a lower bound to polynomial kernelization for <Emphasis Type="SmallCaps">Saving All But </Emphasis><Emphasis Type="Italic">k</Emphasis><Emphasis Type="SmallCaps">-Vertices</Emphasis>.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Parameterized Complexity of the Firefighter Problem</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Parameterized Complexity of the Firefighter Problem</title></titleInfo><name type="personal"><namePart type="given">Cristina</namePart><namePart type="family">Bazgan</namePart><affiliation>LAMSADE, Université Paris-Dauphine, France</affiliation><affiliation>Institut Universitaire de France, France</affiliation><affiliation>E-mail: bazgan@lamsade.dauphine.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Morgan</namePart><namePart type="family">Chopin</namePart><affiliation>LAMSADE, Université Paris-Dauphine, France</affiliation><affiliation>E-mail: chopin@lamsade.dauphine.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Michael</namePart><namePart type="given">R.</namePart><namePart type="family">Fellows</namePart><affiliation>Charles Darwin University, Australia</affiliation><affiliation>E-mail: michael.fellows@cdu.edu.au</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2011</dateIssued><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: In this paper we study the parameterized complexity of the firefighter problem. More precisely, we show that Saving k -Vertices and its dual Saving All But k -Vertices are both W[1]-hard for parameter k even for bipartite graphs. We also investigate several cases for which the firefighter problem is tractable. For instance, Saving k -Vertices is fixed-parameter tractable on planar graphs for parameter k. Moreover, we prove a lower bound to polynomial kernelization for Saving All But k -Vertices.</abstract><relatedItem type="host"><titleInfo><title>Algorithms and Computation</title><subTitle>22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Takao</namePart><namePart type="family">Asano</namePart><affiliation>Chuo University, Kasuga, Bunkyo-ku, 112-8551, Tokyo, Japan</affiliation><affiliation>E-mail: asano@ise.chuo-u.ac.jp</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Shin-ichi</namePart><namePart type="family">Nakano</namePart><affiliation>Gunma University, 1-5-1 Tenjin-Cho, 376-8515, Kiryu-Shi, Japan</affiliation><affiliation>E-mail: nakano@cs.gunma-u.ac.jp</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Yoshio</namePart><namePart type="family">Okamoto</namePart><affiliation>Japan Advanced Institute of Science and Technology, 1-1 Asahidai, 923-1292, Nomi, Ishikawa, Japan</affiliation><affiliation>E-mail: okamotoy@jaist.ac.jp</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Osamu</namePart><namePart type="family">Watanabe</namePart><affiliation>Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, 152-8552, Tokyo, Japan</affiliation><affiliation>E-mail: watanabe@is.titech.ac.jp</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic><topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic><topic authority="SpringerSubjectCodes" authorityURI="I1701X">Numeric Computing</topic></subject><identifier type="DOI">10.1007/978-3-642-25591-5</identifier><identifier type="ISBN">978-3-642-25590-8</identifier><identifier type="eISBN">978-3-642-25591-5</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">300163</identifier><identifier type="BookID">978-3-642-25591-5</identifier><identifier type="BookChapterCount">78</identifier><identifier type="BookVolumeNumber">7074</identifier><identifier type="BookSequenceNumber">7074</identifier><identifier type="PartChapterCount">4</identifier><part><date>2011</date><detail type="part"><title>Parameterized Algorithms II</title></detail><detail type="volume"><number>7074</number><caption>vol.</caption></detail><extent unit="pages"><start>643</start><end>652</end></extent></part><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag GmbH Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3</identifier><identifier type="ark">ark:/67375/1BB-DSR10BHT-V</identifier><identifier type="DOI">10.1007/978-3-642-25591-5_66</identifier><identifier type="ChapterID">66</identifier><identifier type="ChapterID">Chap66</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag GmbH Berlin Heidelberg, 2011</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2011</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/document/70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3/metadata/json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001518 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001518 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:70BD68B8E1DA56DBB7F6C3404A53D5FD25290EE3
|texte= Parameterized Complexity of the Firefighter Problem
}}
| This area was generated with Dilib version V0.6.33. |  |