Walcom: Algorithms and Computation: 15th International Conference and Workshops, Walcom 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceeding, Uehara Ryuhei, Hong Seok-Hee, Nandy Subhas C.
Автор: Sheung-Hung Poon; Md. Saidur Rahman; Hsu-Chun Yen Название: WALCOM: Algorithms and Computation ISBN: 3319539248 ISBN-13(EAN): 9783319539249 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. graph algorithms;
Автор: Shin-ichi Nakano; Md. Saidur Rahman Название: WALCOM: Algorithms and Computation ISBN: 354077890X ISBN-13(EAN): 9783540778905 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Second International Workshop WALCOM 2008 Dhaka Bangladesh February 7-8 2008 Proceedings.
Описание: This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions.
Автор: M. Sohel Rahman; Wing-Kin Sung; Ryuhei Uehara Название: WALCOM: Algorithms and Computation ISBN: 3319751719 ISBN-13(EAN): 9783319751719 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
This book constitutes the proceedings of the 12th International Workshop on Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, in March 2018.
The 22 full papers presented were carefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data structures, graph and network algorithms, and online algorithms.
Автор: Md. Saidur Rahman; Satoshi Fujita Название: WALCOM: Algorithms and Computation ISBN: 3642114393 ISBN-13(EAN): 9783642114397 Издательство: Springer Рейтинг: Цена: 10480.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 4th International Workshop WALCOM 2010 Dhaka Bangladesh February 1012 2010 Proceedings. .
Автор: Mohammad Kaykobad; Rossella Petreschi Название: WALCOM: Algorithms and Computation ISBN: 3319301381 ISBN-13(EAN): 9783319301389 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions.
Автор: Gautam K. Das; Partha S. Mandal; Krishnendu Mukhop Название: WALCOM: Algorithms and Computation ISBN: 3030105636 ISBN-13(EAN): 9783030105631 Издательство: Springer Рейтинг: Цена: 9222.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 13th International Conference and Workshop on Algorithms and Computation, WALCOM 2019, held in Guwahati, India, in February/ March 2019.The 30 full papers presented were carefully reviewed and selected from 100 submissions. The papers are organized in topical headings on the facility location problem; computational geometry; graph drawing; graph algorithms; approximation algorithms; miscellaneous; data structures; parallel and distributed algorithms; and packing and covering.
Автор: Subir Kumar Ghosh; Takeshi Tokuyama Название: WALCOM: Algorithms and Computation ISBN: 3642360645 ISBN-13(EAN): 9783642360640 Издательство: Springer Рейтинг: Цена: 6986.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Computational Geometry.- Approximation and Randomized Algorithms.- Parallel and Distributed Computing.- Graph Algorithms.- Complexity and Bounds.- Graph Drawing.
Автор: Sandip Das; Ryuhei Uehara Название: WALCOM: Algorithms and Computation ISBN: 3642002013 ISBN-13(EAN): 9783642002014 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. This book presents the papers that feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms.
Автор: M. Sohel Rahman; Etsuji Tomita Название: WALCOM: Algorithms and Computation ISBN: 331915611X ISBN-13(EAN): 9783319156118 Издательство: Springer Рейтинг: Цена: 7826.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Encoding Data Structures.- Fast Algorithms for Constrained Graph Density Problems.- The Directed Ring Loading with Penalty Cost.- Edge-Colorings of Weighted Graphs (Extended Abstract).- Unit Covering in Color-Spanning Set Model.- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem.- A Practical Succinct Data Structure for Tree-Like Graphs.- Forming Plurality at Minimum Cost.- Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs.- Straight-Path Queries in Trajectory Data.- Folding a Paper Strip to Minimize Thickness.- An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments (Extended Abstract).- PTAS's for Some Metric p-source Communication Spanning Tree Problems.- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement.- Enumerating Eulerian Trails via Hamiltonian Path Enumeration.- The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees.- An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks.- Dynamic Online Multiselection in Internal and External Memory.- Competitive Analysis for Multi-objective Online Algorithms.- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends.- An Improved Algorithm for Parameterized Edge Dominating Set Problem.- On Bar (1, j)-Visibility Graphs (Extended Abstract).- Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs.- Non-repetitive Strings over Alphabet Lists.- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes.- Common Unfolding of Regular Tetrahedron and Johnson-Zalgaller Solid.- Threshold Circuits for Global Patterns in 2-Dimensional Maps.- Superset Generation on Decision Diagrams.- On Triangle Cover Contact Graphs.- Logspace and FPT Algorithms for Graph Isomorphism for Subclasses of Bounded Tree-Width Graphs.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
