WALCOM: Algorithms and Computation

Invited Talks.- Vertex Domination in Dynamic Networks.- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis.- Simple Geometrical Intersection Graphs.- Bioinformatics Algorithms.- On the Approximability of Comparing Genomes with Duplicates.- Indexing Circular Patterns.- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs.- Computational Geometry and Graph Drawing.- Cover Ratio of Absolute Neighbor.- Computing ?-Drawings of 2-Outerplane Graphs in Linear Time.- Upward Drawings of Trees on the Minimum Number of Layers.- Guarding Exterior Region of a Simple Polygon.- Computing Nice Projections of Convex Polyhedra.- Graph Algorithms I.- A Compact Encoding of Plane Triangulations with Efficient Query Supports.- Four-Connected Spanning Subgraphs of Doughnut Graphs.- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs.- Algorithm Engineering.- Linear-Time 3-Approximation Algorithmfor the r-Star Covering Problem.- Multi-commodity Source Location Problems and Price of Greed.- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs.- Optimal Algorithms for Detecting Network Stability.- On Certain New Models for Paging with Locality of Reference.- Graph Algorithms II.- Listing All Plane Graphs.- Pairwise Compatibility Graphs.- Multilevel Bandwidth and Radio Labelings of Graphs.