Verfügbarkeit: Combinatorial algorithms

Combinatorial algorithms: 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	IWOCA Pisa (VerfasserIn)
Weitere Verfasser:	Colbourn, Charles J. 1953- (HerausgeberIn), Grossi, Roberto (HerausgeberIn), Pisanti, Nadia (HerausgeberIn)
Format:	Elektronisch Tagungsbericht E-Book
Sprache:	English
Veröffentlicht:	Cham Springer [2019] Cham
Schriftenreihe:	Lecture notes in computer science 11638 : Theoretical computer science and general issues
Schlagworte:	Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Data Structures Arithmetic and Logic Structures Computer Graphics Computational complexity Computer software Data structures (Computer scienc Computer science Computer graphics Kombinatorik Algorithmus Konferenzschrift
Online-Zugang:	BTU01 FHA01 FHI01 FHM01 FHN01 FHR01 FKE01 FLA01 FRO01 FWS01 FWS02 HTW01 TUM01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UER01 UPA01 Volltext
Beschreibung:	1 Online-Ressource (xix, 456 Seiten) Illustrationen, Diagramme
ISBN:	9783030250058
DOI:	10.1007/978-3-030-25005-8

Internformat

MARC


LEADER	00000nmm a2200000zcb4500
001	BV046083708
003	DE-604
005	20210630
006	a \|\|\|\| 10\|\|\|
007	cr\|uuu---uuuuu
008	190802s2019 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
020			\|a 9783030250058 \|c Online \|9 978-3-030-25005-8
024	7		\|a 10.1007/978-3-030-25005-8 \|2 doi
035			\|a (ZDB-2-SCS)9783030250058
035			\|a (ZDB-2-LNC)9783030250058
035			\|a (OCoLC)1111861309
035			\|a (DE-599)BVBBV046083708
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
049			\|a DE-355 \|a DE-860 \|a DE-91 \|a DE-19 \|a DE-Aug4 \|a DE-898 \|a DE-861 \|a DE-523 \|a DE-859 \|a DE-473 \|a DE-29 \|a DE-863 \|a DE-20 \|a DE-862 \|a DE-92 \|a DE-573 \|a DE-M347 \|a DE-703 \|a DE-706 \|a DE-739 \|a DE-634
082	0		\|a 004.0151 \|2 23
084			\|a SS 4800 \|0 (DE-625)143528: \|2 rvk
084			\|a DAT 537 \|2 stub
084			\|a DAT 000 \|2 stub
111	2		\|a IWOCA \|n 30. \|d 2019 \|c Pisa \|j Verfasser \|0 (DE-588)1192827538 \|4 aut
245	1	0	\|a Combinatorial algorithms \|b 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings \|c Charles J. Colbourn, Roberto Grossi, Nadia Pisanti (Eds.)
264		1	\|a Cham \|b Springer \|c [2019]
264		1	\|a Cham \|b Springer
300			\|a 1 Online-Ressource (xix, 456 Seiten) \|b Illustrationen, Diagramme
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 11638 \|a Theoretical computer science and general issues
650		4	\|a Discrete Mathematics in Computer Science
650		4	\|a Algorithm Analysis and Problem Complexity
650		4	\|a Data Structures
650		4	\|a Arithmetic and Logic Structures
650		4	\|a Computer Graphics
650		4	\|a Computational complexity
650		4	\|a Computer software
650		4	\|a Data structures (Computer scienc
650		4	\|a Computer science
650		4	\|a Computer graphics
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 \|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 Colbourn, Charles J. \|d 1953- \|0 (DE-588)111343380 \|4 edt
700	1		\|a Grossi, Roberto \|4 edt
700	1		\|a Pisanti, Nadia \|0 (DE-588)130150193 \|4 edt
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-030-25004-1
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-030-25006-5
830		0	\|a Lecture notes in computer science \|v 11638 : Theoretical computer science and general issues \|w (DE-604)BV014880109 \|9 11638
856	4	0	\|u https://doi.org/10.1007/978-3-030-25005-8 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
912			\|a ZDB-2-SCS \|a ZDB-2-LNC
940	1		\|q ZDB-2-SCS_2019
940	1		\|q ZDB-2-LNC_2019
999			\|a oai:aleph.bib-bvb.de:BVB01-031464765
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l BTU01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FHA01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FHI01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FHM01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FHN01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FHR01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FKE01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FLA01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FRO01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FWS01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l FWS02 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l HTW01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l TUM01 \|p ZDB-2-LNC \|q ZDB-2-LNC_2019 \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UBG01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UBM01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UBR01 \|p ZDB-2-SCS \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UBT01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UBW01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UBY01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UER01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-3-030-25005-8 \|l UPA01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext

Datensatz im Suchindex

DE-BY-FWS_katkey	732261
_version_	1806189001697132544
any_adam_object
author2	Colbourn, Charles J. 1953- Grossi, Roberto Pisanti, Nadia
author2_role	edt edt edt
author2_variant	c j c cj cjc r g rg n p np
author_GND	(DE-588)111343380 (DE-588)130150193
author_corporate	IWOCA Pisa
author_corporate_role	aut
author_facet	Colbourn, Charles J. 1953- Grossi, Roberto Pisanti, Nadia IWOCA Pisa
author_sort	IWOCA Pisa
building	Verbundindex
bvnumber	BV046083708
classification_rvk	SS 4800
classification_tum	DAT 537 DAT 000
collection	ZDB-2-SCS ZDB-2-LNC
ctrlnum	(ZDB-2-SCS)9783030250058 (ZDB-2-LNC)9783030250058 (OCoLC)1111861309 (DE-599)BVBBV046083708
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
doi_str_mv	10.1007/978-3-030-25005-8
format	Electronic Conference Proceeding eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04863nmm a2200937zcb4500</leader><controlfield tag="001">BV046083708</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210630 </controlfield><controlfield tag="006">a \|\|\|\| 10\|\|\| </controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">190802s2019 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030250058</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-030-25005-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-030-25005-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9783030250058</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-LNC)9783030250058</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1111861309</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046083708</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">IWOCA</subfield><subfield code="n">30.</subfield><subfield code="d">2019</subfield><subfield code="c">Pisa</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1192827538</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorial algorithms</subfield><subfield code="b">30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings</subfield><subfield code="c">Charles J. Colbourn, Roberto Grossi, Nadia Pisanti (Eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2019]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xix, 456 Seiten)</subfield><subfield code="b">Illustrationen, Diagramme</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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">11638</subfield><subfield code="a">Theoretical computer science and general issues</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Arithmetic and Logic Structures</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer scienc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer graphics</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="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">Colbourn, Charles J.</subfield><subfield code="d">1953-</subfield><subfield code="0">(DE-588)111343380</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grossi, Roberto</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pisanti, Nadia</subfield><subfield code="0">(DE-588)130150193</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-030-25004-1</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-030-25006-5</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">11638 : Theoretical computer science and general issues</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">11638</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2019</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-LNC_2019</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031464765</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FWS01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">FWS02</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">HTW01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="q">ZDB-2-LNC_2019</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-030-25005-8</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift gnd-content
genre_facet	Konferenzschrift
id	DE-604.BV046083708
illustrated	Not Illustrated
indexdate	2024-08-01T14:41:01Z
institution	BVB
institution_GND	(DE-588)1192827538
isbn	9783030250058
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-031464765
oclc_num	1111861309
open_access_boolean
owner	DE-355 DE-BY-UBR DE-860 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634
owner_facet	DE-355 DE-BY-UBR DE-860 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-Aug4 DE-898 DE-BY-UBR DE-861 DE-523 DE-859 DE-473 DE-BY-UBG DE-29 DE-863 DE-BY-FWS DE-20 DE-862 DE-BY-FWS DE-92 DE-573 DE-M347 DE-703 DE-706 DE-739 DE-634
physical	1 Online-Ressource (xix, 456 Seiten) Illustrationen, Diagramme
psigel	ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2019 ZDB-2-LNC_2019 ZDB-2-LNC ZDB-2-LNC_2019
publishDate	2019
publishDateSearch	2019
publishDateSort	2019
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science Theoretical computer science and general issues
spellingShingle	Combinatorial algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings Lecture notes in computer science Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Data Structures Arithmetic and Logic Structures Computer Graphics Computational complexity Computer software Data structures (Computer scienc Computer science Computer graphics 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 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings
title_auth	Combinatorial algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings
title_exact_search	Combinatorial algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings
title_full	Combinatorial algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings Charles J. Colbourn, Roberto Grossi, Nadia Pisanti (Eds.)
title_fullStr	Combinatorial algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings Charles J. Colbourn, Roberto Grossi, Nadia Pisanti (Eds.)
title_full_unstemmed	Combinatorial algorithms 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings Charles J. Colbourn, Roberto Grossi, Nadia Pisanti (Eds.)
title_short	Combinatorial algorithms
title_sort	combinatorial algorithms 30th international workshop iwoca 2019 pisa italy july 23 25 2019 proceedings
title_sub	30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019 : proceedings
topic	Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Data Structures Arithmetic and Logic Structures Computer Graphics Computational complexity Computer software Data structures (Computer scienc Computer science Computer graphics Kombinatorik (DE-588)4031824-2 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Data Structures Arithmetic and Logic Structures Computer Graphics Computational complexity Computer software Data structures (Computer scienc Computer science Computer graphics Kombinatorik Algorithmus Konferenzschrift
url	https://doi.org/10.1007/978-3-030-25005-8
volume_link	(DE-604)BV014880109
work_keys_str_mv	AT iwocapisa combinatorialalgorithms30thinternationalworkshopiwoca2019pisaitalyjuly23252019proceedings AT colbourncharlesj combinatorialalgorithms30thinternationalworkshopiwoca2019pisaitalyjuly23252019proceedings AT grossiroberto combinatorialalgorithms30thinternationalworkshopiwoca2019pisaitalyjuly23252019proceedings AT pisantinadia combinatorialalgorithms30thinternationalworkshopiwoca2019pisaitalyjuly23252019proceedings

Verfügbarkeit

Volltext öffnen

MARC

Datensatz im Suchindex

Ähnliche Einträge