Verfügbarkeit: Graph-theoretic concepts in computer science

Graph-theoretic concepts in computer science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers

Gespeichert in:

Bibliographische Detailangaben
Weitere beteiligte Personen:	Brandstädt, Andreas 1949- (HerausgeberIn)
Format:	Tagungsbericht Buch
Sprache:	Englisch
Veröffentlicht:	Berlin [u.a.] Springer 2013
Schriftenreihe:	Lecture notes in computer science 8165 : Advanced research in computing and software science
Schlagwörter:	Theoretische Informatik Graphentheorie Informatik Konferenzschrift > 2013 > Lübeck
Links:	http://deposit.dnb.de/cgi-bin/dokserv?id=4484448&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=026920594&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
Umfang:	XIX, 430 S. graph. Darst.
ISBN:	9783642450426 9783642450433

Internformat

MARC


LEADER	00000nam a22000008cb4500
001	BV041474517
003	DE-604
005	20140220
007	t\|
008	131211s2013 gw d\|\|\| \|\|\|\| 00\|\|\| eng d
016	7		\|a 1043390863 \|2 DE-101
020			\|a 9783642450426 \|c print \|9 978-3-642-45042-6
020			\|a 9783642450433 \|9 978-3-642-45043-3
035			\|a (OCoLC)872055793
035			\|a (DE-599)DNB1043390863
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-11 \|a DE-83 \|a DE-91G \|a DE-739
082	0		\|a 004.0151
084			\|a DAT 537f \|2 stub
084			\|a MAT 055f \|2 stub
245	1	0	\|a Graph-theoretic concepts in computer science \|b 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
264		1	\|a Berlin [u.a.] \|b Springer \|c 2013
300			\|a XIX, 430 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 8165 : Advanced research in computing and software science
650	0	7	\|a Theoretische Informatik \|0 (DE-588)4196735-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphentheorie \|0 (DE-588)4113782-6 \|2 gnd \|9 rswk-swf
650	0	7	\|a Informatik \|0 (DE-588)4026894-9 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2013 \|z Lübeck \|2 gnd-content
689	0	0	\|a Informatik \|0 (DE-588)4026894-9 \|D s
689	0	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	0		\|5 DE-604
689	1	0	\|a Theoretische Informatik \|0 (DE-588)4196735-5 \|D s
689	1	1	\|a Graphentheorie \|0 (DE-588)4113782-6 \|D s
689	1		\|8 1\p \|5 DE-604
700	1		\|a Brandstädt, Andreas \|d 1949- \|0 (DE-588)133631737 \|4 edt
711	2		\|a WG \|n 39 \|d 2013 \|c Lübeck \|j Sonstige \|0 (DE-588)1045782270 \|4 oth
830		0	\|a Lecture notes in computer science \|v 8165 : Advanced research in computing and software science \|w (DE-604)BV000000607 \|9 8165
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=4484448&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=026920594&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-026920594

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 001z 2001 A 999-8165
DE-BY-TUM_katkey	1985981
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040007890202
_version_	1821935033102893056
adam_text	TABLE OF CONTENTS TREE-LIKE STRUCTURES IN GRAPHS: A METRIC POINT OF VIEW 1 FEODOR F. DRAGAN OVERVIEW OF NEW APPROACHES FOR APPROXIMATING TSP 5 OLA SVENSSON LINEAR RANK-WIDTH AND LINEAR CLIQUE-WIDTH OF TREES 12 ISOLDE ADLER AND MAMADOU MOUSTAPHA KANTE THRESHOLD-COLORING AND UNIT-CUBE CONTACT REPRESENTATION OF GRAPHS 26 MD. JAWAHERUL ALAM, STEVEN CHAPLICK, GASPER FIJAVZ, MICHAEL KAUFMANN, STEPHEN G. KOBOUROV, AND SERGEY PUPYREV ROLLING UPWARD PLANARITY TESTING OF STRONGLY CONNECTED GRAPHS 38 CHRISTOPHER AUER, CHRISTIAN BACHMAIER, FRANZ J. BRANDENBURG, AND KATHRIN HANA,UER TOWARDS A PROVABLY RESILIENT SCHEME FOR GRAPH-BASED WATERMARKING 50 LUCILA MARIA SOUZA BENTO, DAVIDSON BOCCARDO, RAPHAEL CARLOS SANTOS MACHADO, VIMCIUS GUSMAO PEREIRA DE SD, AND JAYME LUIZ SZWARCFITER THE NORMAL GRAPH CONJECTURE FOR CLASSES OF SPARSE GRAPHS 64 ANNE BERRY AND ANNEGRET WAGLER ON THE PARAMETERIZED COMPLEXITY OF COMPUTING GRAPH BISECTIONS 76 RENE VAN BEVERN, ANDREAS ERNIL FELDMANN, MANUEL SORGE, AND ONDFEJ SUCHY FIXED-PARAMETER TRACT.ABILITY AND CHARACTERIZATIONS OF SMALL SPECIAL TREEWIDTH 88 HANS L. BODLAENDER, STEFAN KRATSCH, AND VINCENT J.C. KREUZEN THE 05-GRAPH IS A SPANNER 100 PROSENJIT BOSE, PAT MORIN, ANDRE VAN RENSSEN, AND SANDER VERDONSCHOT GRAPHS OF EDGE-INTERSECTING NON-SPLITTING PATHS IN A TREE: TOWARDS HOLE REPRESENTATIONS (EXTENDED ABSTRACT) 115 ARMAN BOYACI, TIN.AZ EKIM, MORDECHAI SHALOM, AND, SHMUEL ZAKS HTTP://D-NB.INFO/1043390863 XVII] TABLE OF CONTENTS LINEAR-TIME ALGORITHMS FOR SCATTERING NUMBER AND HAMILTON- CONNECTIVITY OF INTERVAL GRAPHS 127 HAJO BROERSMA, JIN FIALA, PETR A. GOLOVACH, TORNDS KAISER, DANIEL PAULUSMA, AND ANDRZEJ PROSKUROWSKI EQUILATERAL L-CONTACT GRAPHS 139 STEVEN CHAPLICK, STEPHEN G. KOBOUROV, AND TORSI EN UECKERDT PARAMETERIZED AND APPROXIMATION ALGORITHMS FOR THE MAF PROBLEM IN MULTIFURCATING TREES 152 JIANER CHEN, JIA-HAO FAN, AND SING-HOI SZE LINEAR SEPARATION OF TOTAL DOMINATING SETS IN GRAPHS 165 NINA CHIARELLI AND, MARTIN MILANIC SPARSE SQUARE ROOTS 177 MANFRED, COCHEFERT, JEAN-FRANGOIS COUTURIER, PETR A. GOLOVACH, DIETER KRATSCH, AND DANIEL PA,ULUSMA COMPLETING COLORED GRAPHS TO MEET A TARGET PROPERTY 189 KATHRYN COOK, ELAINE M. ESEHEN, R. SRITH.A.MN, AND XIAOQIANG WANG COLOURING OF GRAPHS WITH RAMSEY-TYPE FORBIDDEN SUBGRAPHS 201 KONRAD K. DABROWSKI, PETR A. GOLOVACH, AND, DANIEL PAULUNMA LOWER AND UPPER BOUNDS FOR LONG INDUCED PATHS IN 3-CONNECTED PLANAR GRAPHS 213 EMILIO DI, GIACOMO, GIUSEPPE LIOTTA, AND, TARN,AM MCHEDLIDZE COMPUTING MINIMUM CYCLE BASES IN WEIGHTED PARTIAL 2-TREES IN LINEAR TIME 225 CA.ROLA, DOERR, G. RAMAKRISHNA, AND, JENS M. SCHMIDT THICKNESS AND COLORABILITY OF GEOMETRIC GRAPHS 237 STEPHANE DUROCHER, ELLEN GETHNER, AND, DEBAJYOTI MONDAL THE SAME UPPER BOUND FOR BOTH: THE 2-PAGE AND THE RECTILINEAR CROSSING NUMBERS OF THE N-CUBE 249 LUERBIO FARIA, CELINA M.H. DE FIGUEIREDO, R. BRUCE RICHTER, AND, HNRICH, VRT'O FPT IS CHARACTERIZED BY USEFUL OBSTRUCTION SETS 261 MICHAEL R. FELLOWS AND, BART M.P. JANSEN EXCLUDING GRAPHS AS IMMERSIONS IN SURFACE EMBEDDED GRAPHS 274 ARCHONTIA, C. GIANNOPOULOU, MA,REIN KAMINSKI, AND, DIMITRIOS M. THILIKOS OBDD-BASED REPRESENTATION OF INTERVAL GRAPHS 286 MARC GILLE TABLE OF CONTENTS XIX TIGHT UPPER BOUNDS FOR MINIMUM FEEDBACK ARC SETS OF REGULAR GRAPHS 298 KATHRIN HANAUER, FRANZ J. BRANDENBURG, AND CHRISTOPHER AUER A LINEAR-TIME KERNELIZATION FOR THE ROOTED A;-LEAF OUTBRANCHING PROBLEM 310 FRANK KAMMER ON RETRACTS, ABSOLUTE RETRACTS, AND FOLDS IN COGRAPHS 321 TON KLOKS AND YUE-LI WANG COLORING TRIANGLE-FREE RECTANGULAR FRAME INTERSECTION GRAPHS WITH 0(LOG LOG N) COLORS 333 TOMASZ KMWCZYK, ARKADIUSZ PA/UILIK, AND BARTOSZ WALCZAK ON FINDING TUCKER SUBRNATRICES AND LEKKERKERKER-BOLAND SUBGRAPHS . . . 345 NATHAN LINDZEY AND ROSS M. MCCONNELL CERTIFYING 3-EDGE-CONNECTIVITY 358 KURT MEHLHOM. ADRIAN NEUMANN, AND JENS M. SCHMIDT PARAMETERIZED ALGORITHMS FOR MAX COLORABLE INDUCED SUBGRAPH PROBLEM ON PERFECT GRAPHS 370 NEELDHARA, MISRA, FAHAD, PANOLAN, ASHUTOSH RA.I, VENKATESH RAMAN, AND, SAKET SAURABH CHARACTERIZING AND COMPUTING THE STRUCTURE OF CLIQUE INTERSECTIONS IN STRONGLY CHORDAL GRAPHS 382 RAGNAR NCURIES AND. CHRISTIAN ROSENKE BEYOND KNIGHTS AND KNAVES 394 CHRISTINE T. CHENG, ANDREW MCCONVEY, DREW ONDERKO, NATHANIEL SHAR, AND CHARLES TOMLINSON DRAWING GRAPHS WITH FEW ARCS 406 ANDRE SCHULZ CONNECTING TERMINALS AND 2-DISJOINT CONNECTED SUBGRAPHS 418 JAN ARNE TELLE AND YNGVE VILLANGER AUTHOR INDEX 429
any_adam_object	1
author2	Brandstädt, Andreas 1949-
author2_role	edt
author2_variant	a b ab
author_GND	(DE-588)133631737
author_facet	Brandstädt, Andreas 1949-
building	Verbundindex
bvnumber	BV041474517
classification_rvk	SS 4800
classification_tum	DAT 537f MAT 055f
ctrlnum	(OCoLC)872055793 (DE-599)DNB1043390863
dewey-full	004.0151
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.0151
dewey-search	004.0151
dewey-sort	14.0151
dewey-tens	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 a22000008cb4500</leader><controlfield tag="001">BV041474517</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20140220</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">131211s2013 gw d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1043390863</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642450426</subfield><subfield code="c">print</subfield><subfield code="9">978-3-642-45042-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642450433</subfield><subfield code="9">978-3-642-45043-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)872055793</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1043390863</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph-theoretic concepts in computer science</subfield><subfield code="b">39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIX, 430 S.</subfield><subfield code="b">graph. Darst.</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">8165 : Advanced research in computing and software science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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">2013</subfield><subfield code="z">Lübeck</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Brandstädt, Andreas</subfield><subfield code="d">1949-</subfield><subfield code="0">(DE-588)133631737</subfield><subfield code="4">edt</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">WG</subfield><subfield code="n">39</subfield><subfield code="d">2013</subfield><subfield code="c">Lübeck</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)1045782270</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">8165 : Advanced research in computing and software science</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">8165</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=4484448&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=026920594&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-026920594</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2013 Lübeck gnd-content
genre_facet	Konferenzschrift 2013 Lübeck
id	DE-604.BV041474517
illustrated	Illustrated
indexdate	2025-01-11T19:06:33Z
institution	BVB
institution_GND	(DE-588)1045782270
isbn	9783642450426 9783642450433
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-026920594
oclc_num	872055793
open_access_boolean
owner	DE-11 DE-83 DE-91G DE-BY-TUM DE-739
owner_facet	DE-11 DE-83 DE-91G DE-BY-TUM DE-739
physical	XIX, 430 S. graph. Darst.
publishDate	2013
publishDateSearch	2013
publishDateSort	2013
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spellingShingle	Graph-theoretic concepts in computer science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers Lecture notes in computer science Theoretische Informatik (DE-588)4196735-5 gnd Graphentheorie (DE-588)4113782-6 gnd Informatik (DE-588)4026894-9 gnd
subject_GND	(DE-588)4196735-5 (DE-588)4113782-6 (DE-588)4026894-9 (DE-588)1071861417
title	Graph-theoretic concepts in computer science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
title_auth	Graph-theoretic concepts in computer science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
title_exact_search	Graph-theoretic concepts in computer science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
title_full	Graph-theoretic concepts in computer science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
title_fullStr	Graph-theoretic concepts in computer science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
title_full_unstemmed	Graph-theoretic concepts in computer science 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
title_short	Graph-theoretic concepts in computer science
title_sort	graph theoretic concepts in computer science 39th international workshop wg 2013 lubeck germany june 19 21 2013 revised selected papers
title_sub	39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 ; revised selected papers
topic	Theoretische Informatik (DE-588)4196735-5 gnd Graphentheorie (DE-588)4113782-6 gnd Informatik (DE-588)4026894-9 gnd
topic_facet	Theoretische Informatik Graphentheorie Informatik Konferenzschrift 2013 Lübeck
url	http://deposit.dnb.de/cgi-bin/dokserv?id=4484448&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=026920594&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT brandstadtandreas graphtheoreticconceptsincomputerscience39thinternationalworkshopwg2013lubeckgermanyjune19212013revisedselectedpapers AT wglubeck graphtheoreticconceptsincomputerscience39thinternationalworkshopwg2013lubeckgermanyjune19212013revisedselectedpapers

Verfügbarkeit

Bestellen (Login erforderlich)

Inhaltsverzeichnis
Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 001z 2001 A 999-8165 Lageplan
Exemplar 1	Ausleihbar Am Standort