WALCOM: Algorithms and Computation 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings

Name: WALCOM: Algorithms and Computation 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010, Proceedings
Price: 55.74 USD
Availability: InStock
ISBN: 9783642114397

ISBN-10: 3642114393

ISBN-13: 9783642114397

Edition: 2010

Authors: Saidur Rahman, Satoshi Fujita

List price: $44.99

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $55.74

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

This book constitutes the proceedings of the 4th International Workshop on algorithms and Computation, held in Dhaka, Bangladesh, in February 2010. The 23 revised full papers were carefully reviewed and selected from 60 submissions. The volume also contains 4 invited papers.The topics covered are graph drawing, computational geometry, graph algorithms, computational biology and strings, combinatorial optimization, approximation algorithms, and parameterized complexity.

Book details

List price: $44.99
Copyright year: 2010
Publisher: Springer Berlin / Heidelberg
Publication date: 1/20/2010
Binding: Paperback
Pages: 305
Size: 6.10" wide x 9.25" long x 0.75" tall
Weight: 1.078
Language: English



Invited Talks


Crossings between Curves with Many Tangencies



Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon



Approximation Algorithms for Art Gallery Problems in Polygons and Terrains



The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing



Graph Drawing


Small Grid Drawings of Planar Graphs with Balanced Bipartition



Switch-Regular Upward Planar Embeddings of Trees



A Global k-Level Crossing Reduction Algorithm



Computational Geometry


Computation of Non-dominated Points Using Compact Voronoi Diagrams



Cutting a Convex Polyhedron Out of a Sphere



A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion



Graph Algorithms I


Acyclically 3-Colorable Planar Graphs



Reconstruction Algorithm for Permutation Graphs



Harmonious Coloring on Subclasses of Colinear Graphs



Computational Biology and Strings


Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions



The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time



Parallel Algorithms for Encoding and Decoding Blob Code



Combinatorial Optimization


A Rooted-Forest Partition with Uniform Vertex Demand



A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique



Graph Algorithms II


On Some Simple Widths



A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques



Approximation Algorithms


The Covert Set-Cover Problem with Application to Network Discovery



Variants of Spreading Messages



On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost



Real Root Isolation of Multi-Exponential Polynomials with Application



Parameterized Complexity


FPT Algorithms for Connected Feedback Vertex Set



A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs



Pathwidth and Searching in Parameterized Threshold Graphs



Author Index