Verfügbarkeit: WALCOM: algorithms and computation

WALCOM: algorithms and computation: 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings

Gespeichert in:

Bibliographische Detailangaben
Körperschaft:	WALCOM Chengdu (VerfasserIn)
Weitere Verfasser:	Nakano, Shin-ichi (HerausgeberIn), Xiao, Mingyu (HerausgeberIn)
Format:	Elektronisch Tagungsbericht E-Book
Sprache:	English
Veröffentlicht:	Singapore Springer [2025]
Ausgabe:	1st ed. 2025
Schriftenreihe:	Lecture notes in computer science 15411
Schlagworte:	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 Graph Approximationsalgorithmus Algorithmische Geometrie Graphenzeichnen Berechnungskomplexität Algorithmus Konferenzschrift > 2025 > Chengdu
Online-Zugang:	DE-522 DE-634 DE-Aug4 DE-1050 DE-573 DE-M347 DE-92 DE-898 DE-859 DE-861 DE-863 DE-862 DE-523 DE-91 DE-384 DE-473 DE-19 DE-355 DE-703 DE-20 DE-706 DE-824 DE-29 DE-739 Volltext
Beschreibung:	1 Online-Ressource (xxi, 426 Seiten) 108 Illustratione, 61 in Farbe
ISBN:	9789819628452
ISSN:	1611-3349
DOI:	10.1007/978-981-96-2845-2

Internformat

MARC


LEADER	00000nam a2200000zcb4500
001	BV050193226
003	DE-604
005	20250311
007	cr\|uuu---uuuuu
008	250306s2025 xx a\|\|\| o\|\|\|\| 10\|\|\| eng d
020			\|a 9789819628452 \|c Online \|9 978-981-96-2845-2
024	7		\|a 10.1007/978-981-96-2845-2 \|2 doi
035			\|a (ZDB-2-SCS)9789819628452
035			\|a (ZDB-2-LNC)9789819628452
035			\|a (OCoLC)1510754040
035			\|a (DE-599)BVBBV050193226
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
049			\|a DE-M347 \|a DE-863 \|a DE-862 \|a DE-83 \|a DE-703 \|a DE-92 \|a DE-739 \|a DE-29 \|a DE-91 \|a DE-523 \|a DE-706 \|a DE-19 \|a DE-473 \|a DE-898 \|a DE-861 \|a DE-384 \|a DE-522 \|a DE-1050 \|a DE-20 \|a DE-859 \|a DE-573 \|a DE-824 \|a DE-Aug4 \|a DE-634 \|a DE-355
082	0		\|a 004.0151 \|2 23
084			\|a DAT 530 \|2 stub
111	2		\|a WALCOM \|n 19. \|d 2025 \|c Chengdu \|j Verfasser \|0 (DE-588)1359496157 \|4 aut
245	1	0	\|a WALCOM: algorithms and computation \|b 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings \|c Shin-ichi Nakano, Mingyu Xiao, editors
264		1	\|a Singapore \|b Springer \|c [2025]
300			\|a 1 Online-Ressource (xxi, 426 Seiten) \|b 108 Illustratione, 61 in Farbe
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Lecture notes in computer science \|v 15411 \|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 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
650	0	7	\|a Algorithmische Geometrie \|0 (DE-588)4130267-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Graphenzeichnen \|0 (DE-588)4706480-8 \|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 Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 2025 \|z Chengdu \|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 Nakano, Shin-ichi \|0 (DE-588)134177436 \|4 edt
700	1		\|a Xiao, Mingyu \|4 edt
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-981-96-2844-5
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-981-96-2846-9
830		0	\|a Lecture notes in computer science \|v 15411 \|w (DE-604)BV014880109 \|9 15411
856	4	0	\|u https://doi.org/10.1007/978-981-96-2845-2 \|x Verlag \|z URL des Erstveröffentlichers \|3 Volltext
912			\|a ZDB-2-SCS
912			\|a ZDB-2-LNC
940	1		\|q ZDB-2-SCS_2025
940	1		\|q ZDB-2-LNC_2025
943	1		\|a oai:aleph.bib-bvb.de:BVB01-035528720
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-522 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-634 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-Aug4 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-1050 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-573 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-M347 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-92 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-898 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-859 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-861 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-863 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-862 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-523 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-91 \|p ZDB-2-LNC \|q ZDB-2-LNC_2025 \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-384 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-473 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-19 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-355 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-703 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-20 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-706 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-824 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-29 \|p ZDB-2-LNC \|x Verlag \|3 Volltext
966	e		\|u https://doi.org/10.1007/978-981-96-2845-2 \|l DE-739 \|p ZDB-2-LNC \|x Verlag \|3 Volltext

Datensatz im Suchindex

_version_	1828526146876080129
adam_text
any_adam_object
author2	Nakano, Shin-ichi Xiao, Mingyu
author2_role	edt edt
author2_variant	s i n sin m x mx
author_GND	(DE-588)134177436
author_corporate	WALCOM Chengdu
author_corporate_role	aut
author_facet	Nakano, Shin-ichi Xiao, Mingyu WALCOM Chengdu
author_sort	WALCOM Chengdu
building	Verbundindex
bvnumber	BV050193226
classification_tum	DAT 530
collection	ZDB-2-SCS ZDB-2-LNC
ctrlnum	(ZDB-2-SCS)9789819628452 (ZDB-2-LNC)9789819628452 (OCoLC)1510754040 (DE-599)BVBBV050193226
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-981-96-2845-2
edition	1st ed. 2025
format	Electronic Conference Proceeding eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV050193226</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20250311</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">250306s2025 xx a\|\|\| o\|\|\|\| 10\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789819628452</subfield><subfield code="c">Online</subfield><subfield code="9">978-981-96-2845-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-981-96-2845-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)9789819628452</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-LNC)9789819628452</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1510754040</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050193226</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-M347</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-523</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-355</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">WALCOM</subfield><subfield code="n">19.</subfield><subfield code="d">2025</subfield><subfield code="c">Chengdu</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1359496157</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">19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings</subfield><subfield code="c">Shin-ichi Nakano, Mingyu Xiao, editors</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Singapore</subfield><subfield code="b">Springer</subfield><subfield code="c">[2025]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxi, 426 Seiten)</subfield><subfield code="b">108 Illustratione, 61 in Farbe</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">15411</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">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="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">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">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">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">2025</subfield><subfield code="z">Chengdu</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">Nakano, Shin-ichi</subfield><subfield code="0">(DE-588)134177436</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xiao, Mingyu</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-96-2844-5</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-96-2846-9</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">15411</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">15411</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-981-96-2845-2</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></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2025</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-LNC_2025</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035528720</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-981-96-2845-2</subfield><subfield code="l">DE-522</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-96-2845-2</subfield><subfield code="l">DE-634</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-96-2845-2</subfield><subfield code="l">DE-Aug4</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-96-2845-2</subfield><subfield code="l">DE-1050</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-96-2845-2</subfield><subfield code="l">DE-573</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-96-2845-2</subfield><subfield code="l">DE-M347</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-96-2845-2</subfield><subfield code="l">DE-92</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-96-2845-2</subfield><subfield code="l">DE-898</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-96-2845-2</subfield><subfield code="l">DE-859</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-96-2845-2</subfield><subfield code="l">DE-861</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-96-2845-2</subfield><subfield code="l">DE-863</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-96-2845-2</subfield><subfield code="l">DE-862</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-96-2845-2</subfield><subfield code="l">DE-523</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-96-2845-2</subfield><subfield code="l">DE-91</subfield><subfield code="p">ZDB-2-LNC</subfield><subfield code="q">ZDB-2-LNC_2025</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-96-2845-2</subfield><subfield code="l">DE-384</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-96-2845-2</subfield><subfield code="l">DE-473</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-96-2845-2</subfield><subfield code="l">DE-19</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-96-2845-2</subfield><subfield code="l">DE-355</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-96-2845-2</subfield><subfield code="l">DE-703</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-96-2845-2</subfield><subfield code="l">DE-20</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-96-2845-2</subfield><subfield code="l">DE-706</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-96-2845-2</subfield><subfield code="l">DE-824</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-96-2845-2</subfield><subfield code="l">DE-29</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-96-2845-2</subfield><subfield code="l">DE-739</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 2025 Chengdu gnd-content
genre_facet	Konferenzschrift 2025 Chengdu
id	DE-604.BV050193226
illustrated	Illustrated
indexdate	2025-04-05T04:00:23Z
institution	BVB
institution_GND	(DE-588)1359496157
isbn	9789819628452
issn	1611-3349
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-035528720
oclc_num	1510754040
open_access_boolean
owner	DE-M347 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-83 DE-703 DE-92 DE-739 DE-29 DE-91 DE-BY-TUM DE-523 DE-706 DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-898 DE-BY-UBR DE-861 DE-384 DE-522 DE-1050 DE-20 DE-859 DE-573 DE-824 DE-Aug4 DE-634 DE-355 DE-BY-UBR
owner_facet	DE-M347 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-83 DE-703 DE-92 DE-739 DE-29 DE-91 DE-BY-TUM DE-523 DE-706 DE-19 DE-BY-UBM DE-473 DE-BY-UBG DE-898 DE-BY-UBR DE-861 DE-384 DE-522 DE-1050 DE-20 DE-859 DE-573 DE-824 DE-Aug4 DE-634 DE-355 DE-BY-UBR
physical	1 Online-Ressource (xxi, 426 Seiten) 108 Illustratione, 61 in Farbe
psigel	ZDB-2-SCS ZDB-2-LNC ZDB-2-SCS_2025 ZDB-2-LNC_2025 ZDB-2-LNC ZDB-2-LNC_2025
publishDate	2025
publishDateSearch	2025
publishDateSort	2025
publisher	Springer
record_format	marc
series	Lecture notes in computer science
series2	Lecture notes in computer science
spellingShingle	WALCOM: algorithms and computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings 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 Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-5 gnd Lecture notes in computer science
subject_GND	(DE-588)4021842-9 (DE-588)4500954-5 (DE-588)4130267-9 (DE-588)4706480-8 (DE-588)4134751-1 (DE-588)4001183-5 (DE-588)1071861417
title	WALCOM: algorithms and computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings
title_auth	WALCOM: algorithms and computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings
title_exact_search	WALCOM: algorithms and computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings
title_full	WALCOM: algorithms and computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings Shin-ichi Nakano, Mingyu Xiao, editors
title_fullStr	WALCOM: algorithms and computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings Shin-ichi Nakano, Mingyu Xiao, editors
title_full_unstemmed	WALCOM: algorithms and computation 19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, proceedings Shin-ichi Nakano, Mingyu Xiao, editors
title_short	WALCOM: algorithms and computation
title_sort	walcom algorithms and computation 19th international conference and workshops on algorithms and computation walcom 2025 chengdu china february 28 march 2 2025 proceedings
title_sub	19th International Conference and Workshops on Algorithms and Computation, WALCOM 2025, Chengdu, China, February 28-March 2, 2025, 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 Graph (DE-588)4021842-9 gnd Approximationsalgorithmus (DE-588)4500954-5 gnd Algorithmische Geometrie (DE-588)4130267-9 gnd Graphenzeichnen (DE-588)4706480-8 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Algorithmus (DE-588)4001183-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 Graph Approximationsalgorithmus Algorithmische Geometrie Graphenzeichnen Berechnungskomplexität Algorithmus Konferenzschrift 2025 Chengdu
url	https://doi.org/10.1007/978-981-96-2845-2
volume_link	(DE-604)BV014880109
work_keys_str_mv	AT walcomchengdu walcomalgorithmsandcomputation19thinternationalconferenceandworkshopsonalgorithmsandcomputationwalcom2025chengduchinafebruary28march22025proceedings AT nakanoshinichi walcomalgorithmsandcomputation19thinternationalconferenceandworkshopsonalgorithmsandcomputationwalcom2025chengduchinafebruary28march22025proceedings AT xiaomingyu walcomalgorithmsandcomputation19thinternationalconferenceandworkshopsonalgorithmsandcomputationwalcom2025chengduchinafebruary28march22025proceedings

Verfügbarkeit

Volltext öffnen

MARC

Datensatz im Suchindex

Ähnliche Einträge