WALCOM: Algorithms and Computation, Subir Kumar Ghosh; Takeshi Tokuyama

Автор: 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;

Автор: D.T. Lee; Shang-Hua Teng
Название: Algorithms and Computation
ISBN: 3540412557 ISBN-13(EAN): 9783540412557
Издательство: Springer
Рейтинг:
Цена: 14673.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The 46 revised papers presented here are organized in topical sections on algorithms and data structures, combinatorial optimization, approximation and randomized algorithms, graph drawing and graph algorithms, automata, and cryptography.

Автор: 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.

Автор: 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.

Автор: 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.

Автор: 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. .

Автор: 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.

Автор: Kyung-Yong Chwa; Oscar H. Ibarra
Название: Algorithms and Computation
ISBN: 3540653856 ISBN-13(EAN): 9783540653851
Издательство: Springer
Рейтинг:
Цена: 12577.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Takeshi Tokuyama
Название: Algorithms and Computation
ISBN: 3540771182 ISBN-13(EAN): 9783540771180
Издательство: Springer
Рейтинг:
Цена: 17468.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, held in Sendai, Japan, in December 2007. This book presents 77 revised full papers together with 2 invited talks that were reviewed and selected from 220 submissions.

Автор: Leizhen Cai; Siu-Wing Cheng; Tak-Wah Lam
Название: Algorithms and Computation
ISBN: 3642450296 ISBN-13(EAN): 9783642450297
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Invited Talk Paper.- Market Approach to Social Ads: The MyLikes Example and Related Problems.- Session 1A: Computational Geometry I.- Geodesic-Preserving Polygon Simplification.- Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information.- On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs.- Structure and Computation of Straight Skeletons in 3-Space.- Session 1B: Pattern Matching.- Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms.- Single and Multiple Consecutive Permutation Motif Search.- Beating O(nm) in Approximate LZW-Compressed Pattern Matching.- Less Space: Indexing for Queries with Wildcards.- Session 2A: Computational Complexity I.- On Determining Deep Holes of Generalized Reed-Solomon Codes.- Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes.- Determinantal Complexities and Field Extensions.- Session 2B: Internet and Social Network Algorithms I.- Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs.- Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs.- The Complexity of Finding a Large Subgraph under Anonymity Constraints.- Session 3A: Graph Theory and Algorithms I.- On the Number of Edges of Fan-Crossing Free Graphs.- Cops and Robbers on Intersection Graphs.- SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graph.- Hardness and Algorithms for Variants of Line Graphs of Directed Graphs.- Session 3B: Scheduling Algorithms.- Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds.- Better Bounds for Online k-Frame Throughput Maximization in Network Switches.- The Solvable Cases of a Scheduling Algorithm.- Session 4A: Computational Complexity II.- Exact Sublinear Binomial Sampling.- Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas.- Dynamic Point Labeling is Strongly PSPACE-Complete.- Unsatisfiable CNF Formulas Contain Many Conflicts.- Session 4B: Computational Geometry II.- Pursuit Evasion on Polyhedral Surfaces.- Algorithms for Tolerated Tverberg Partitions.- Abstract Voronoi Diagrams with Disconnected Regions.- Terrain Visibility with Multiple Viewpoints.- Session 5A: Graph Theory and Algorithms II.- Exact Algorithms for Maximum Independent Set.- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs.- Testing Mutual Duality of Planar Graph .- Session 5B: Fixed-Parameter Tractable Algorithms.- Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.- Myhill-Nerode Methods for Hypergraphs.- Augmenting Graphs to Minimize the Diameter.- Session 6A: Algorithms and Data Structures I.- Top-k Document Retrieval in Compact Space and Near-Optimal Time.- Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers.- Trajectory-Based Dynamic Map Labeling.- Session 6B: Internet and Social Network.- Algorithms II.- Asynchronous Rumor Spreading on Random Graphs.- Unit Cost Buyback Problem.- Faster Rumor Spreading with Multiple Calls.- Session 7A: Algorithmic Game Theory.- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy.- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items.- New Results on the Online Pricing Problem.- Session 7B: Algorithms and Data Structures II.- RAM-Efficient External Memory Sorting.- Succinct Data Structures for Representing Equivalence Classes.- Sliding Bloom Filters.- Session 8A: Graph Theory and Algorithms III.- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs.- Bounded Representations of Interval and Proper Interval Graphs.- Detecting and Counting Small Pattern Graphs.- An O∗(1.1939n) Time Algorithm for Minimum Weighted Dominating Induced Matching.- Session 8B: Approximation Algorithms I.- New Inappr

Автор: Hon Wai Leong; Hiroshi Imai; Sanjay Jain
Название: Algorithms and Computation
ISBN: 3540638903 ISBN-13(EAN): 9783540638902
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC`97, held in Singapore in December 1997. The scope of the volume spans the whole area of algorithms from discrete mathematics and complexity theory to algorithms design and evaluation in a variety of applicational areas.