| Paper title | Citations |
|---|
| multilevel bandwidth and radio labelings of graphs | 0 |
| pairwise compatibility graphs | 31 |
| listing all plane graphs | 7 |
| on certain new models for paging with locality of reference | 6 |
| optimal algorithms for detecting network stability | 1 |
| inverse booking problem: inverse chromatic number problem in interval graphs | 5 |
| multi-commodity source location problems and price of greed | 1 |
| linear-time 3-approximation algorithm for the r-star covering problem | 7 |
| exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs | 10 |
| four-connected spanning subgraphs of doughnut graphs | 5 |
| a compact encoding of plane triangulations with efficient query supports | 11 |
| computing nice projections of convex polyhedra | 2 |
| guarding exterior region of a simple polygon | 1 |
| upward drawings of trees on the minimum number of layers | 4 |
| computing β-drawings of 2-outerplane graphs in linear time | 2 |
| cover ratio of absolute neighbor | 3 |
| a fast algorithm to calculate powers of a boolean matrix for diameter computation of random graphs | 4 |
| indexing circular patterns | 31 |
| on the approximability of comparing genomes with duplicates | 16 |
| simple geometrical intersection graphs | 22 |
| closing the gap between theory and practice: new measures for on-line algorithm analysis | 5 |
| vertex domination in dynamic networks | 2 |
| Total | 176 |