| Description |
1 online resource (xiii, 304 pages) : illustrations |
| Series |
Lecture notes in computer science, 0302-9743 ; 5942 |
|
LNCS sublibrary: SL 1-theoretical computer science and general issues |
|
Lecture notes in computer science ; 5942.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
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(nlogn) 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 |
| Summary |
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 |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Computer algorithms -- Congresses
|
|
Data structures (Computer science) -- Congresses
|
|
Graph theory -- Congresses
|
|
Algorithms
|
|
Database Management Systems
|
|
algorithms.
|
|
Informatique.
|
|
Computer algorithms
|
|
Data structures (Computer science)
|
|
Graph theory
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Rahman, Md. Saidur, 1966-
|
|
Fujita, Satoshi
|
| LC no. |
2009942780 |
| ISBN |
9783642114403 |
|
3642114407 |
|
