Verlag: Springer-Nature New York Inc, 2023
ISBN 10: 3031270509 ISBN 13: 9783031270505
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 119,89
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 411 pages. 9.25x6.10x0.85 inches. In Stock.
Verlag: Springer Nature Switzerland, 2023
ISBN 10: 3031270509 ISBN 13: 9783031270505
Sprache: Englisch
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. WALCOM: Algorithms and Computation | 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings | Chun-Cheng Lin (u. a.) | Taschenbuch | xiii | Englisch | 2023 | Springer Nature Switzerland | EAN 9783031270505 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Verlag: Springer Nature Switzerland, 2023
ISBN 10: 3031270509 ISBN 13: 9783031270505
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023.The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.
Verlag: Springer Nature Switzerland, 2023
ISBN 10: 3031270509 ISBN 13: 9783031270505
Sprache: Englisch
Anbieter: Buchpark, Trebbin, Deutschland
EUR 48,14
Anzahl: 3 verfügbar
In den WarenkorbZustand: Hervorragend. Zustand: Hervorragend | Seiten: 412 | Sprache: Englisch | Produktart: Bücher | This book constitutes the proceedings of the 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, which took place in Hsinchu, Taiwan, in March 2023.The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 75 submissions. They cover topics such as: computational geometry; string algorithm; optimization; graph algorithm; approximation algorithm; and parameterized complexity.