Verfügbarkeit: Combinatorial algorithms

Combinatorial algorithms: 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers

Gespeichert in:

Bibliographische Detailangaben
Format:	Tagungsbericht Buch
Sprache:	English
Veröffentlicht:	Berlin [u.a.] Springer 2011
Schriftenreihe:	Lecture notes in computer science 6460
Schlagworte:	Kombinatorik Algorithmus Konferenzschrift > 2010 > London
Online-Zugang:	Inhaltstext Inhaltsverzeichnis
Beschreibung:	XI, 418 S. graph. Darst.
ISBN:	9783642192210 3642192211

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV037291651
003	DE-604
005	20110520
007	t\|
008	110321s2011 xx d\|\|\| \|\|\|\| 10\|\|\| eng d
016	7		\|a 1009641735 \|2 DE-101
020			\|a 9783642192210 \|9 978-3-642-19221-0
020			\|a 3642192211 \|9 3-642-19221-1
035			\|a (OCoLC)846391230
035			\|a (DE-599)DNB1009641735
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-706 \|a DE-91G \|a DE-11 \|a DE-83
082	0		\|a 511.6 \|2 22/ger
084			\|a 004 \|2 sdnb
084			\|a DAT 537f \|2 stub
084			\|a 510 \|2 sdnb
245	1	0	\|a Combinatorial algorithms \|b 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers \|c Costas S. Iliopoulos
264		1	\|a Berlin [u.a.] \|b Springer \|c 2011
300			\|a XI, 418 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 6460
650	0	7	\|a Kombinatorik \|0 (DE-588)4031824-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2010 \|z London \|2 gnd-content
689	0	0	\|a Kombinatorik \|0 (DE-588)4031824-2 \|D s
689	0	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|5 DE-604
700	1		\|a Iliopoulos, Costas S. \|e Sonstige \|4 oth
711	2		\|a IWOCA \|n 21 \|d 2010 \|c London \|j Sonstige \|0 (DE-588)16105096-7 \|4 oth
830		0	\|a Lecture notes in computer science \|v 6460 \|w (DE-604)BV000000607 \|9 6460
856	4	2	\|m X:MVB \|q text/html \|u http://deposit.dnb.de/cgi-bin/dokserv?id=3654995&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=021204213&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
943	1		\|a oai:aleph.bib-bvb.de:BVB01-021204213

Datensatz im Suchindex

_version_	1820875295160270848
adam_text	IMAGE 1 TABLE OF CONTENTS PARAMETERIZED ALGORITHMS FOR THE INDEPENDENT SET PROBLEM IN SOME HEREDITARY GRAPH CLASSES 1 KONRAD DABROWSKI, VADIM LOZIN, HAIKO MUELLER, AND DIETER RAUTENBACH ON THE MAXIMAL SUM OF EXPONENTS OF RUNS IN A STRING 10 MAXIME CROCHEMORE, MARCIN KUBICA, JAKUB RADOSZEWSKI, WOJCIECH RYTTER, AND TOMASZ WALEN PATH-BASED SUPPORTS FOR HYPERGRAPHS 20 ULRIK BRANDES, SABINE CORNELSEN, BARBARA PAMPEL, AND ARNAUD SALLABERRY ON IMPROVED EXACT ALGORITHMS FOR L(2, 1)-LABELING OF GRAPHS 34 KONSTANTY JUNOSZA-SZANIAWSKI AND PAWEL RZQIEWSKI THREAD GRAPHS, LINEAR RANK-WIDTH AND THEIR ALGORITHMIC APPLICATIONS 38 ROBERT GANIAN MINIMUM NUMBER OF HOLES IN UNAVOIDABLE SETS OF PARTIAL WORDS OF SIZE THREE 43 FRANCINE BLANCHET-SADRI, BOB CHEN, AND ALEKSANDAR CHAKAROV SHORTEST PATHS BETWEEN SHORTEST PATHS AND INDEPENDENT SETS 56 MARCIN KAMIRLSKI, PAUL MEDVEDEV, AND MARTIN MILANIC FASTER BIT-PARALLEL ALGORITHMS FOR UNORDERED PSEUDO-TREE MATCHING AND TREE HOMEOMORPHISM 68 YUSAKU KANETA AND HIROKI ARIMURA DICHOTOMY FOR COLORING OF DART GRAPHS 82 MARTIN KOCHOL AND RISTE SKREKOVSKI WORST CASE EFFICIENT SINGLE AND MULTIPLE STRING MATCHING IN THE RAM MODEL 90 DJAMAL BELAZZOUGUI THE (2,1)-TOTAL LABELING NUMBER OF OUTERPLANAR GRAPHS IS AT MOST A + 2 103 TORN HASUNUMA, TOSHIMASA ISHII, HIROTAKA ONO, AND YUSHI UNO UPPER AND LOWER I/O BOUNDS FOR PEBBLING R-PYRAMIDS 107 DESH RANJAN, JOHN SAVAGE, AND MOHAMMAD ZUBAIR BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1009641735 DIGITALISIERT DURCH IMAGE 2 X TABLE OF CONTENTS SINGLE PARAMETER FPT-ALGORITHMS FOR NON-TRIVIAL GAMES 121 VLADIMIR ESTIVILL- CASTRO AND MAHDI PARSA THE COMPLEXITY STATUS OF PROBLEMS RELATED TO SPARSEST CUTS 125 PAUL BONSMA, HAJO BROERSMA, VIRESH PATEL, AND ARTEM PYATKIN ON APPROXIMATION COMPLEXITY OF METRIC DIMENSION PROBLEM 136 MATHIAS HAUPTMANN, RICHARD SCHMIED, AND CLAUS VIEHMANN COLLISION-FREE ROUTING IN SINK-CENTRIC SENSOR NETWORKS WITH COARSE-GRAIN COORDINATES 140 ALFREDO NAVARRA AND CRISTINA M. PINOTTI COMPLEXITY OF MOST VITAL NODES FOR INDEPENDENT SET IN GRAPHS RELATED TO TREE STRUCTURES 154 CRISTINA BAZGAN, SONIA TOUBALINE, AND ZSOLT TUZA COMPUTING ROLE ASSIGNMENTS OF PROPER INTERVAL GRAPHS IN POLYNOMIAL TIME 167 PINAR HEGGERNES, PIRN VAN 'T HOF, AND DANIEL PAULUSMA EFFICIENT CONNECTIVITY TESTING OF HYPERCUBIC NETWORKS WITH FAULTS 181 TOMAS DVORAK, JIFI FINK, PETR GREGOR, VACLAV KOUBEK, AND TOMASZ RADZIK REDUCTIONS OF MATRICES ASSOCIATED WITH NOWHERE-ZERO FLOWS 192 MARTIN KOCHOL, NAD'A KRIVONDKOVD, SILVIA SMEJOVD, AND KATARINA SRANKOVD BLOCKS OF HYPERGRAPHS: APPLIED TO HYPERGRAPHS AND OUTERPLANARITY . . . 201 ULRIK BRANDES, SABINE CORNELSEN, BARBARA PAMPEL, AND ARNAUD SALLABERRY TESTING THE SIMULTANEOUS EMBEDDABILITY OF TWO GRAPHS WHOSE INTERSECTION IS A BICONNECTED GRAPH OR A TREE 212 PATRIZIO ANGELINI, GIUSEPPE DI BATTISTA, FABRIZIO FRATI, MAURIZIO PATRIGNANI, AND IGNAZ RUTTER SKIP LIFT: A PROBABILISTIC ALTERNATIVE TO RED-BLACK TREES 226 PROSENJIT BOSE, KARIM DOMEB, AND PAT MORIN ON A RELATIONSHIP BETWEEN COMPLETELY SEPARATING SYSTEMS AND ANTIMAGIC LABELING OF REGULAR GRAPHS 238 OUDONE PHANALASY, MIRKA MILLER, LEANNE RYLANDS, AND PAULETTE LIEBY PARAMETERIZED COMPLEXITY OF FC-ANONYMITY: HARDNESS AND TRACTABILITY 242 PAOLA BONIZZONI, GIANLUCA DELIA VEDOVA, RICCARDO DONDI, AND YURI PIROLA IMAGE 3 TABLE OF CONTENTS XI ON FAST ENUMERATION OF PSEUDO BICLIQUES 256 ZAREEN ALAMGIR, SAIRA KARIM, AND SYED HUSNINE EFFICIENT CHAINING OF SEEDS IN ORDERED TREES 260 JULIEN ALLALI, CEDRIC CHAUVE, PASCAL FERRARO, AND ANNE-LAURE GAILLARD ON THE COMPUTATIONAL COMPLEXITY OF DEGENERATE UNIT DISTANCE REPRESENTATIONS OF GRAPHS 274 BORIS HORVAT, JAN KRATOCHVIL, AND TOMAZ PISANSKI RECOGNITION OF PROBE PTOLEMAIC GRAPHS (EXTENDED ABSTRACT) 286 MAW-SHANG CHANG AND LING-JU HUNG GRAPHS OF SEPARABILITY AT MOST TWO: STRUCTURAL CHARACTERIZATIONS AND THEIR CONSEQUENCES 291 FERDINANDO CICALESE AND MARTIN MILANIC ON ANTIMAGIC LABELING FOR GENERALIZED WEB AND FLOWER GRAPHS 303 JOE RYAN, OUDONE PHANALASY, MIRKA MILLER, AND LEANNE RYLANDS CHAINS-INTO-BINS PROCESSES 314 TUGKAN BATU, PETRA BERENBRINK, AND COLIN COOPER COMPLEXITY OF LOCALLY INJECTIVE HOMOMORPHISM TO THE THETA GRAPHS . . 326 BERNARD LIDICKY AND MAREK TESAF RANKING AND DRAWING IN SUBEXPONENTIAL TIME 337 HENNING FERNAU, FEDOR V. FOMIN, DANIEL LOKSHTANOV, MATTHIAS MNICH, GEEVARGHESE PHILIP, AND SAKET SAURABH EFFICIENT RECONSTRUCTION OF RC-EQUIVALENT STRINGS 349 FERDINANDO CICALESE, PETER L. ERDOES, AND ZSUZSANNA LIPTDK IMPROVED POINTS APPROXIMATION ALGORITHMS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES 363 DANNY Z. CHEN AND HAITAO WANG THE COVER TIME OF CARTESIAN PRODUCT GRAPHS 377 MOHAMMED ABDULLAH, COLIN COOPER, AND TOMASZ RADZIK DICTIONARY-SYMBOLWISE FLEXIBLE PARSING 390 MAXIME CROCHEMORE, LAURA GIAMBRUNO, ALESSIO LANGIU, FILIPPO MIGNOSI, AND ANTONIO RESTIVO REGULAR LANGUAGE CONSTRAINED SEQUENCE ALIGNMENT REVISITED 404 GREGORY KUCHEROV, TAMAR PINHAS, AND MICHAL ZIV- UKELSON AUTHOR INDEX 417
any_adam_object	1
building	Verbundindex
bvnumber	BV037291651
classification_rvk	SS 4800
classification_tum	DAT 537f
ctrlnum	(OCoLC)846391230 (DE-599)DNB1009641735
dewey-full	511.6
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511.6
dewey-search	511.6
dewey-sort	3511.6
dewey-tens	510 - Mathematics
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">BV037291651</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110520</controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">110321s2011 xx d\|\|\| \|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1009641735</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642192210</subfield><subfield code="9">978-3-642-19221-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3642192211</subfield><subfield code="9">3-642-19221-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)846391230</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1009641735</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-91G</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.6</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">DAT 537f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial algorithms</subfield><subfield code="b">21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers</subfield><subfield code="c">Costas S. Iliopoulos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 418 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">6460</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">2010</subfield><subfield code="z">London</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Iliopoulos, Costas S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">IWOCA</subfield><subfield code="n">21</subfield><subfield code="d">2010</subfield><subfield code="c">London</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)16105096-7</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">6460</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">6460</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=3654995&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=021204213&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-021204213</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift 2010 London gnd-content
genre_facet	Konferenzschrift 2010 London
id	DE-604.BV037291651
illustrated	Illustrated
indexdate	2025-01-10T15:13:22Z
institution	BVB
institution_GND	(DE-588)16105096-7
isbn	9783642192210 3642192211
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-021204213
oclc_num	846391230
open_access_boolean
owner	DE-706 DE-91G DE-BY-TUM DE-11 DE-83
owner_facet	DE-706 DE-91G DE-BY-TUM DE-11 DE-83
physical	XI, 418 S. graph. Darst.
publishDate	2011
publishDateSearch	2011
publishDateSort	2011
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spelling	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers Costas S. Iliopoulos Berlin [u.a.] Springer 2011 XI, 418 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 6460 Kombinatorik (DE-588)4031824-2 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2010 London gnd-content Kombinatorik (DE-588)4031824-2 s Algorithmus (DE-588)4001183-5 s DE-604 Iliopoulos, Costas S. Sonstige oth IWOCA 21 2010 London Sonstige (DE-588)16105096-7 oth Lecture notes in computer science 6460 (DE-604)BV000000607 6460 X:MVB text/html http://deposit.dnb.de/cgi-bin/dokserv?id=3654995&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=021204213&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers Lecture notes in computer science Kombinatorik (DE-588)4031824-2 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4031824-2 (DE-588)4001183-5 (DE-588)1071861417
title	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers
title_auth	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers
title_exact_search	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers
title_full	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers Costas S. Iliopoulos
title_fullStr	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers Costas S. Iliopoulos
title_full_unstemmed	Combinatorial algorithms 21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers Costas S. Iliopoulos
title_short	Combinatorial algorithms
title_sort	combinatorial algorithms 21st international workshop iwoca 2010 london uk july 26 28 2010 revised selected papers
title_sub	21st international workshop, IWOCA 2010, London, UK, July 26-28, 2010 ; revised selected papers
topic	Kombinatorik (DE-588)4031824-2 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Kombinatorik Algorithmus Konferenzschrift 2010 London
url	http://deposit.dnb.de/cgi-bin/dokserv?id=3654995&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=021204213&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
volume_link	(DE-604)BV000000607
work_keys_str_mv	AT iliopouloscostass combinatorialalgorithms21stinternationalworkshopiwoca2010londonukjuly26282010revisedselectedpapers AT iwocalondon combinatorialalgorithms21stinternationalworkshopiwoca2010londonukjuly26282010revisedselectedpapers

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Beschreibung

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge