Citations of WALCOM 2008 LNCS 4921 (extracted from Google scholar)

Paper titleCitations
Vertex Domination in Dynamic Networks0
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis5
Simple Geometrical Intersection Graphs22
On the Approximability of Comparing Genomes with Duplicates57
Indexing Circular Patterns31
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs4
Cover Ratio of Absolute Neighbor3
Computing β-Drawings of 2-Outerplane Graphs in Linear Time2
Upward Drawings of Trees on the Minimum Number of Layers4
Guarding Exterior Region of a Simple Polygon1
Computing Nice Projections of Convex Polyhedra2
A Compact Encoding of Plane Triangulations with Efficient Query Supports11
Four-Connected Spanning Subgraphs of Doughnut Graphs5
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs10
Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem6
Multi-commodity Source Location Problems and Price of Greed1
Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs5
Optimal Algorithms for Detecting Network Stability1
On Certain New Models for Paging with Locality of Reference6
Listing All Plane Graphs7
Pairwise Compatibility Graphs0
Multilevel Bandwidth and Radio Labelings of Graphs0
proceeding 20082