Holdings: WALCOM: algorithms and computation

WALCOM: algorithms and computation: 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings

Saved in:

Bibliographic Details
Corporate Author:	International Conference and Workshops on Algorithms and Computation Kanazawa (Author)
Other Authors:	Uehara, Ryuhei (Editor), Yamanaka, Katsuhisa (Editor), Yen, Hsu-Chun (Editor)
Format:	Electronic Conference Proceeding eBook
Language:	English
Published:	Singapore Springer [2024]
Series:	Lecture notes in computer science 14549
Subjects:	Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Design and Analysis of Algorithms Computer Graphics Computer Application in Administrative Data Processing Computer science Computer science / Mathematics Discrete mathematics Numerical analysis Algorithms Computer graphics Information technology / Management Graphenzeichnen Algorithmische Geometrie Algorithmus Berechnungskomplexität Graph Approximationsalgorithmus Konferenzschrift > 2024 > Kanazawa
Online Access:	BFB01 BTU01 FHA01 FHD01 FHI01 FHM01 FHN01 FHR01 FKE01 FLA01 FRO01 FWS01 FWS02 HTW01 TUM01 UBA01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UEI01 UER01 UPA01 Volltext
Physical Description:	1 Online-Ressource (xi, 429 Seiten) 86 Illustrationen
ISBN:	9789819705665
ISSN:	1611-3349
DOI:	10.1007/978-981-97-0566-5

Staff View

MARC


LEADER	00000nmm a2200000zcb4500
001	BV049594351
003	DE-604
005	20240315
006	a \|\|\|\| 10\|\|\|
007	cr\|uuu---uuuuu
008	240304s2024 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d
020			\|a 9789819705665 \|c Online \|9 978-981-97-0566-5
024	7		\|a 10.1007/978-981-97-0566-5 \|2 doi
035			\|a (ZDB-2-SCS)9789819705665
035			\|a (ZDB-2-LNC)9789819705665
035			\|a (OCoLC)1427324829
035			\|a (DE-599)BVBBV049594351
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
049			\|a DE-860 \|a DE-91 \|a DE-19 \|a DE-83 \|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-1050 \|a DE-20 \|a DE-862 \|a DE-92 \|a DE-355 \|a DE-824 \|a DE-522 \|a DE-384 \|a DE-M347 \|a DE-573 \|a DE-703 \|a DE-706 \|a DE-739 \|a DE-634
082	0		\|a 004.0151 \|2 23
084			\|a DAT 530 \|2 stub
111	2		\|a International Conference and Workshops on Algorithms and Computation \|n 18. \|d 2024 \|c Kanazawa \|j Verfasser \|0 (DE-588)1323595198 \|4 aut
245	1	0	\|a WALCOM: algorithms and computation \|b 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings \|c Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, editors
264		1	\|a Singapore \|b Springer \|c [2024]
300			\|a 1 Online-Ressource (xi, 429 Seiten) \|b 86 Illustrationen
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 14549 \|x 1611-3349
650		4	\|a Theory of Computation
650		4	\|a Discrete Mathematics in Computer Science
650		4	\|a Numerical Analysis
650		4	\|a Design and Analysis of Algorithms
650		4	\|a Computer Graphics
650		4	\|a Computer Application in Administrative Data Processing
650		4	\|a Computer science
650		4	\|a Computer science / Mathematics
650		4	\|a Discrete mathematics
650		4	\|a Numerical analysis
650		4	\|a Algorithms
650		4	\|a Computer graphics
650		4	\|a Information technology / Management
650	0	7	\|a Graphenzeichnen \|0 (DE-588)4706480-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmische Geometrie \|0 (DE-588)4130267-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graph \|0 (DE-588)4021842-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2024 \|z Kanazawa \|2 gnd-content
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0	1	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	0		\|5 DE-604
689	1	0	\|a Approximationsalgorithmus \|0 (DE-588)4500954-5 \|D s
689	1		\|5 DE-604
689	2	0	\|a Graphenzeichnen \|0 (DE-588)4706480-8 \|D s
689	2		\|5 DE-604
689	3	0	\|a Graph \|0 (DE-588)4021842-9 \|D s
689	3	1	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	3		\|5 DE-604
689	4	0	\|a Algorithmische Geometrie \|0 (DE-588)4130267-9 \|D s
689	4		\|5 DE-604
700	1		\|a Uehara, Ryuhei \|0 (DE-588)1205764194 \|4 edt
700	1		\|a Yamanaka, Katsuhisa \|4 edt
700	1		\|a Yen, Hsu-Chun \|4 edt
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-981-97-0565-8
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-981-97-0567-2
830		0	\|a Lecture notes in computer science \|v 14549 \|w (DE-604)BV014880109 \|9 14549
856	4	0	\|u https://doi.org/10.1007/978-981-97-0566-5 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
912			\|a ZDB-2-SCS \|a ZDB-2-LNC
940	1		\|q ZDB-2-SCS_2024
940	1		\|q ZDB-2-LNC_2024
999			\|a oai:aleph.bib-bvb.de:BVB01-034938933
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l BFB01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l BTU01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FHA01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FHD01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FHI01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FHM01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FHN01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FHR01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FKE01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FLA01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FRO01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FWS01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l FWS02 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l HTW01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l TUM01 \|p ZDB-2-LNC \|q ZDB-2-LNC_2024 \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UBA01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UBG01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UBM01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UBR01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UBT01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UBW01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UBY01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UEI01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UER01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-97-0566-5 \|l UPA01 \|p ZDB-2-LNC \|x Verlag \|3 Volltext

Record in the Search Index

DE-BY-FWS_katkey	1067229
_version_	1824553757411639297
adam_txt
any_adam_object
any_adam_object_boolean
author2	Uehara, Ryuhei Yamanaka, Katsuhisa Yen, Hsu-Chun
author2_role	edt edt edt
author2_variant	r u ru k y ky h c y hcy
author_GND	(DE-588)1205764194
author_corporate	International Conference and Workshops on Algorithms and Computation Kanazawa
author_corporate_role	aut
author_facet	Uehara, Ryuhei Yamanaka, Katsuhisa Yen, Hsu-Chun International Conference and Workshops on Algorithms and Computation Kanazawa
author_sort	International Conference and Workshops on Algorithms and Computation Kanazawa
building	Verbundindex
bvnumber	BV049594351
classification_tum	DAT 530
collection	ZDB-2-SCS ZDB-2-LNC
ctrlnum	(ZDB-2-SCS)9789819705665 (ZDB-2-LNC)9789819705665 (OCoLC)1427324829 (DE-599)BVBBV049594351
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
discipline_str_mv	Informatik
doi_str_mv	10.1007/978-981-97-0566-5
format	Electronic Conference Proceeding eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05987nmm a2201141zcb4500</leader><controlfield tag="001">BV049594351</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240315 </controlfield><controlfield tag="006">a \|\|\|\| 10\|\|\| </controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">240304s2024 \|\|\|\| o\|\|u\| \|\|\|\|\|\|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789819705665</subfield><subfield code="c">Online</subfield><subfield code="9">978-981-97-0566-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-981-97-0566-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9789819705665</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-LNC)9789819705665</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1427324829</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV049594351</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-860</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-83</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-1050</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-573</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">DAT 530</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">International Conference and Workshops on Algorithms and Computation</subfield><subfield code="n">18.</subfield><subfield code="d">2024</subfield><subfield code="c">Kanazawa</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1323595198</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">WALCOM: algorithms and computation</subfield><subfield code="b">18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings</subfield><subfield code="c">Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, editors</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">Springer</subfield><subfield code="c">[2024]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xi, 429 Seiten)</subfield><subfield code="b">86 Illustrationen</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">14549</subfield><subfield code="x">1611-3349</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Theory of Computation</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">Numerical Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Design and Analysis of Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Application in Administrative Data Processing</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 science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Numerical analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer graphics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information technology / Management</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</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="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="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-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">2024</subfield><subfield code="z">Kanazawa</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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="1"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Approximationsalgorithmus</subfield><subfield code="0">(DE-588)4500954-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Graphenzeichnen</subfield><subfield code="0">(DE-588)4706480-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Algorithmische Geometrie</subfield><subfield code="0">(DE-588)4130267-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Uehara, Ryuhei</subfield><subfield code="0">(DE-588)1205764194</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yamanaka, Katsuhisa</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yen, Hsu-Chun</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-981-97-0565-8</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-981-97-0567-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">14549</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">14549</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-981-97-0566-5</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_2024</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-LNC_2024</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034938933</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-981-97-0566-5</subfield><subfield code="l">BFB01</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</subfield><subfield code="l">FHD01</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="q">ZDB-2-LNC_2024</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-981-97-0566-5</subfield><subfield code="l">UBA01</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</subfield><subfield code="l">UBR01</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</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-981-97-0566-5</subfield><subfield code="l">UEI01</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-981-97-0566-5</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-981-97-0566-5</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 2024 Kanazawa gnd-content
genre_facet	Konferenzschrift 2024 Kanazawa
id	DE-604.BV049594351
illustrated	Not Illustrated
index_date	2024-07-03T23:33:48Z
indexdate	2025-02-20T06:40:57Z
institution	BVB
institution_GND	(DE-588)1323595198
isbn	9789819705665
issn	1611-3349
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-034938933
oclc_num	1427324829
open_access_boolean
owner	DE-860 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-83 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-1050 DE-20 DE-862 DE-BY-FWS DE-92 DE-355 DE-BY-UBR DE-824 DE-522 DE-384 DE-M347 DE-573 DE-703 DE-706 DE-739 DE-634
owner_facet	DE-860 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-83 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-1050 DE-20 DE-862 DE-BY-FWS DE-92 DE-355 DE-BY-UBR DE-824 DE-522 DE-384 DE-M347 DE-573 DE-703 DE-706 DE-739 DE-634
physical	1 Online-Ressource (xi, 429 Seiten) 86 Illustrationen
psigel	ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2024 ZDB-2-LNC_2024 ZDB-2-LNC ZDB-2-LNC_2024
publishDate	2024
publishDateSearch	2024
publishDateSort	2024
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spellingShingle	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings Lecture notes in computer science Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Design and Analysis of Algorithms Computer Graphics Computer Application in Administrative Data Processing Computer science Computer science / Mathematics Discrete mathematics Numerical analysis Algorithms Computer graphics Information technology / Management Graphenzeichnen (DE-588)4706480-8 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd
subject_GND	(DE-588)4706480-8 (DE-588)4130267-9 (DE-588)4001183-5 (DE-588)4134751-1 (DE-588)4021842-9 (DE-588)4500954-5 (DE-588)1071861417
title	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings
title_auth	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings
title_exact_search	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings
title_exact_search_txtP	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings
title_full	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, editors
title_fullStr	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, editors
title_full_unstemmed	WALCOM: algorithms and computation 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, editors
title_short	WALCOM: algorithms and computation
title_sort	walcom algorithms and computation 18th international conference and workshops on algorithms and computation walcom 2024 kanazawa japan march 18 20 2024 proceedings
title_sub	18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, proceedings
topic	Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Design and Analysis of Algorithms Computer Graphics Computer Application in Administrative Data Processing Computer science Computer science / Mathematics Discrete mathematics Numerical analysis Algorithms Computer graphics Information technology / Management Graphenzeichnen (DE-588)4706480-8 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd
topic_facet	Theory of Computation Discrete Mathematics in Computer Science Numerical Analysis Design and Analysis of Algorithms Computer Graphics Computer Application in Administrative Data Processing Computer science Computer science / Mathematics Discrete mathematics Numerical analysis Algorithms Computer graphics Information technology / Management Graphenzeichnen Algorithmische Geometrie Algorithmus Berechnungskomplexität Graph Approximationsalgorithmus Konferenzschrift 2024 Kanazawa
url	https://doi.org/10.1007/978-981-97-0566-5
volume_link	(DE-604)BV014880109
work_keys_str_mv	AT internationalconferenceandworkshopsonalgorithmsandcomputationkanazawa walcomalgorithmsandcomputation18thinternationalconferenceandworkshopsonalgorithmsandcomputationwalcom2024kanazawajapanmarch18202024proceedings AT uehararyuhei walcomalgorithmsandcomputation18thinternationalconferenceandworkshopsonalgorithmsandcomputationwalcom2024kanazawajapanmarch18202024proceedings AT yamanakakatsuhisa walcomalgorithmsandcomputation18thinternationalconferenceandworkshopsonalgorithmsandcomputationwalcom2024kanazawajapanmarch18202024proceedings AT yenhsuchun walcomalgorithmsandcomputation18thinternationalconferenceandworkshopsonalgorithmsandcomputationwalcom2024kanazawajapanmarch18202024proceedings

Holdings

Get full text

MARC

Record in the Search Index

Similar Items