Parameterized and exact computation: 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
2012
|
Schriftenreihe: | Lecture notes in computer science
7112 |
Schlagworte: | |
Online-Zugang: | Inhaltstext Inhaltsverzeichnis |
Beschreibung: | VIII, 271 S. graph. Darst. 235 mm x 155 mm |
ISBN: | 9783642280498 3642280498 9783642280504 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV039981196 | ||
003 | DE-604 | ||
005 | 20130215 | ||
007 | t| | ||
008 | 120326s2012 xx d||| |||| 10||| eng d | ||
015 | |a 12,N02 |2 dnb | ||
016 | 7 | |a 1018439129 |2 DE-101 | |
020 | |a 9783642280498 |c Pb. : ca. EUR 49.22 (DE) (freier Pr.), ca. EUR 50.60 (AT) (freier Pr.), ca. sfr 61.50 (freier Pr.) |9 978-3-642-28049-8 | ||
020 | |a 3642280498 |9 3-642-28049-8 | ||
020 | |a 9783642280504 |c eISBN |9 978-3-642-28050-4 | ||
024 | 3 | |a 9783642280498 | |
028 | 5 | 2 | |a Best.-Nr.: 86046690 |
035 | |a (OCoLC)794832580 | ||
035 | |a (DE-599)DNB1018439129 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-706 |a DE-83 |a DE-91G |a DE-11 | ||
082 | 0 | |a 511.352 |2 22/ger | |
082 | 0 | |a 004.0151 |2 22/ger | |
084 | |a 004 |2 sdnb | ||
084 | |a 510 |2 sdnb | ||
084 | |a DAT 517f |2 stub | ||
245 | 1 | 0 | |a Parameterized and exact computation |b 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers |c Dániel Marx ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 2012 | |
300 | |a VIII, 271 S. |b graph. Darst. |c 235 mm x 155 mm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Lecture notes in computer science |v 7112 | |
650 | 0 | 7 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2011 |z Saarbrücken |2 gnd-content | |
689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 0 | 1 | |a Parametrisierte Komplexität |0 (DE-588)4818897-9 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Marx, Dániel |e Sonstige |0 (DE-588)136564097 |4 oth | |
711 | 2 | |a IPEC |n 6 |d 2011 |c Saarbrücken |j Sonstige |0 (DE-588)16344553-9 |4 oth | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |t Parameterized and Exact Computation |
830 | 0 | |a Lecture notes in computer science |v 7112 |w (DE-604)BV000000607 |9 7112 | |
856 | 4 | 2 | |m X:MVB |q text/html |u http://deposit.dnb.de/cgi-bin/dokserv?id=3950273&prov=M&dok_var=1&dok_ext=htm |3 Inhaltstext |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024838532&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-024838532 |
Datensatz im Suchindex
_version_ | 1820875380050886656 |
---|---|
adam_text |
IMAGE 1
TABLE O F C O N T E N T S
ON MULTIWAY C U T PARAMETERIZED ABOVE LOWER BOUNDS 1
MAREK CYGAN, MARCIN PILIPCZUK, MICHAL PILIPCZUK, AND JAKUB ONUFRY
WOJTASZCZYK
PARAMETERIZED COMPLEXITY OF FIREFIGHTING REVISITED 13
MAREK CYGAN, FEDOR V. FOMIN, AND ERIK JAN VAN LEEUWEN
PARAMETERIZED COMPLEXITY IN MULTIPLE-INTERVAL GRAPHS: DOMINATION . . . .
27 MINGHUI JIANG AND YONG ZHANG
A FASTER ALGORITHM FOR DOMINATING SET ANALYZED BY THE POTENTIAL METHOD
41
YOICHI IWATA
CONTRACTING GRAPHS T O PATHS AND TREES 55
PINAR HEGGERNES, PIRN VAN 'T HOF, BENJAMIN LEVEQUE, DANIEL LOKSHTANOV,
AND CHRISTOPHE PAUL
INCREASING THE MINIMUM DEGREE OF A GRAPH BY CONTRACTIONS 67
PETR A. GOLOVACH, MARCIN KAMINSKI, DANIEL PAULUSRNA, AND DIMITRIOS M.
THILIKOS
PLANAR DISJOINT-PATHS COMPLETION 80
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 94
PETER DAMASCHKE
NEW UPPER BOUNDS FOR MAX-2-SAT AND MAX-2-CSP W.R.T. T H E AVERAGE
VARIABLE DEGREE 106
ALEXANDER GOLOVNEV
IMPROVED PARAMETERIZED ALGORITHMS FOR ABOVE AVERAGE CONSTRAINT
SATISFACTION 118
E U N JUNG K I M AND RYAN WILLIAMS
ON POLYNOMIAL KERNELS FOR STRUCTURAL PARAMETERIZATIONS OF ODD CYCLE
TRANSVERSAL 132
BART M.P. JANSEN AND STEFAN KRATSCH
KERNEL BOUNDS FOR P A T H AND CYCLE PROBLEMS 145
HANS L. BODLAENDER, BART M.P. JANSEN, AND STEFAN KRATSCH
HTTP://D-NB.INFO/1018439129
IMAGE 2
VIII TABLE OF C O N T E N T S
O N THE HARDNESS OF LOSING WIDTH 159
MAREK CYGAN, DANIEL LOKSHTANOV, MARCIN PILIPCZUK, MICHAL PILIPCZUK, AND
SAKET SAURABH
SAFE APPROXIMATION AND ITS RELATION T O KERNELIZATION 169
JIONG GUO, IYAD KANJ, AND STEFAN KRATSCH
SIMPLER LINEAR-TIME KERNELIZATION FOR PLANAR DOMINATING SET 181
TORBEN HAGERUP
LINEAR-TIME COMPUTATION OF A LINEAR PROBLEM KERNEL FOR DOMINATING SET ON
PLANAR GRAPHS 194
RENE VAN BEVERN, SEPP HARTUNG, FRANK KAMMER, ROLF NIEDERMEIER, AND
MATHIAS WELLER
TIGHT COMPLEXITY BOUNDS FOR F P T SUBGRAPH PROBLEMS PARAMETERIZED BY
CLIQUE-WIDTH 207
HAJO BROERSMA, PETR A. GOLOVACH, AND VIRESH PATEL
FINDING GOOD DECOMPOSITIONS FOR DYNAMIC PROGRAMMING ON DENSE GRAPHS 219
EIVIND MAGNUS HVIDEVOLD, SADIA SHARMIN, JAN ARNE TELLE, AND MARTIN
VATSHELLE
PARAMETERIZED MAXIMUM P A T H COLORING 232
MICHAEL LAMPIS
O N CUTWIDTH PARAMETERIZED BY VERTEX COVER 246
MAREK CYGAN, DANIEL LOKSHTANOV, MARCIN PILIPCZUK, MICHAL PILIPCZUK, AND
SAKET SAURABH
TWIN-COVER: BEYOND VERTEX COVER IN PARAMETERIZED ALGORITHMICS 259 ROBERT
GANIAN
A U T H O R I N D E X 273 |
any_adam_object | 1 |
author_GND | (DE-588)136564097 |
building | Verbundindex |
bvnumber | BV039981196 |
classification_rvk | SS 4800 |
classification_tum | DAT 517f |
ctrlnum | (OCoLC)794832580 (DE-599)DNB1018439129 |
dewey-full | 511.352 004.0151 |
dewey-hundreds | 500 - Natural sciences and mathematics 000 - Computer science, information, general works |
dewey-ones | 511 - General principles of mathematics 004 - Computer science |
dewey-raw | 511.352 004.0151 |
dewey-search | 511.352 004.0151 |
dewey-sort | 3511.352 |
dewey-tens | 510 - Mathematics 000 - Computer science, information, general works |
discipline | Informatik Mathematik |
format | Conference Proceeding Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV039981196</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130215</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">120326s2012 xx d||| |||| 10||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">12,N02</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1018439129</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642280498</subfield><subfield code="c">Pb. : ca. EUR 49.22 (DE) (freier Pr.), ca. EUR 50.60 (AT) (freier Pr.), ca. sfr 61.50 (freier Pr.)</subfield><subfield code="9">978-3-642-28049-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642280498</subfield><subfield code="9">3-642-28049-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642280504</subfield><subfield code="c">eISBN</subfield><subfield code="9">978-3-642-28050-4</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783642280498</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">Best.-Nr.: 86046690</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)794832580</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1018439129</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.352</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">004</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parameterized and exact computation</subfield><subfield code="b">6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers</subfield><subfield code="c">Dániel Marx ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2012</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 271 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">235 mm x 155 mm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7112</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2011</subfield><subfield code="z">Saarbrücken</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Parametrisierte Komplexität</subfield><subfield code="0">(DE-588)4818897-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Marx, Dániel</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)136564097</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">IPEC</subfield><subfield code="n">6</subfield><subfield code="d">2011</subfield><subfield code="c">Saarbrücken</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16344553-9</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="t">Parameterized and Exact Computation</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">7112</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">7112</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">X:MVB</subfield><subfield code="q">text/html</subfield><subfield code="u">http://deposit.dnb.de/cgi-bin/dokserv?id=3950273&prov=M&dok_var=1&dok_ext=htm</subfield><subfield code="3">Inhaltstext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024838532&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024838532</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 2011 Saarbrücken gnd-content |
genre_facet | Konferenzschrift 2011 Saarbrücken |
id | DE-604.BV039981196 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:14:42Z |
institution | BVB |
institution_GND | (DE-588)16344553-9 |
isbn | 9783642280498 3642280498 9783642280504 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024838532 |
oclc_num | 794832580 |
open_access_boolean | |
owner | DE-706 DE-83 DE-91G DE-BY-TUM DE-11 |
owner_facet | DE-706 DE-83 DE-91G DE-BY-TUM DE-11 |
physical | VIII, 271 S. graph. Darst. 235 mm x 155 mm |
publishDate | 2012 |
publishDateSearch | 2012 |
publishDateSort | 2012 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers Dániel Marx ... (eds.) Berlin [u.a.] Springer 2012 VIII, 271 S. graph. Darst. 235 mm x 155 mm txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 7112 Parametrisierte Komplexität (DE-588)4818897-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2011 Saarbrücken gnd-content Berechnungskomplexität (DE-588)4134751-1 s Parametrisierte Komplexität (DE-588)4818897-9 s DE-604 Marx, Dániel Sonstige (DE-588)136564097 oth IPEC 6 2011 Saarbrücken Sonstige (DE-588)16344553-9 oth Erscheint auch als Online-Ausgabe Parameterized and Exact Computation Lecture notes in computer science 7112 (DE-604)BV000000607 7112 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3950273&prov=M&dok_var=1&dok_ext=htm Inhaltstext DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024838532&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers Lecture notes in computer science Parametrisierte Komplexität (DE-588)4818897-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
subject_GND | (DE-588)4818897-9 (DE-588)4134751-1 (DE-588)1071861417 |
title | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers |
title_auth | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers |
title_exact_search | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers |
title_full | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers Dániel Marx ... (eds.) |
title_fullStr | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers Dániel Marx ... (eds.) |
title_full_unstemmed | Parameterized and exact computation 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers Dániel Marx ... (eds.) |
title_short | Parameterized and exact computation |
title_sort | parameterized and exact computation 6th international symposium ipec 2011 saarbrucken germany september 6 8 2011 revised selected papers |
title_sub | 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6 - 8, 2011 ; revised selected papers |
topic | Parametrisierte Komplexität (DE-588)4818897-9 gnd Berechnungskomplexität (DE-588)4134751-1 gnd |
topic_facet | Parametrisierte Komplexität Berechnungskomplexität Konferenzschrift 2011 Saarbrücken |
url | http://deposit.dnb.de/cgi-bin/dokserv?id=3950273&prov=M&dok_var=1&dok_ext=htm http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=024838532&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT marxdaniel parameterizedandexactcomputation6thinternationalsymposiumipec2011saarbruckengermanyseptember682011revisedselectedpapers AT ipecsaarbrucken parameterizedandexactcomputation6thinternationalsymposiumipec2011saarbruckengermanyseptember682011revisedselectedpapers |