Paper title | Citations |
---|

Vertex Domination in Dynamic Networks | 0 |

Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis | 5 |

Simple Geometrical Intersection Graphs | 22 |

On the Approximability of Comparing Genomes with Duplicates | 57 |

Indexing Circular Patterns | 31 |

A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs | 4 |

Cover Ratio of Absolute Neighbor | 3 |

Computing β-Drawings of 2-Outerplane Graphs in Linear Time | 2 |

Upward Drawings of Trees on the Minimum Number of Layers | 4 |

Guarding Exterior Region of a Simple Polygon | 1 |

Computing Nice Projections of Convex Polyhedra | 2 |

A Compact Encoding of Plane Triangulations with Efficient Query Supports | 11 |

Four-Connected Spanning Subgraphs of Doughnut Graphs | 5 |

Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs | 10 |

Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem | 6 |

Multi-commodity Source Location Problems and Price of Greed | 1 |

Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs | 5 |

Optimal Algorithms for Detecting Network Stability | 1 |

On Certain New Models for Paging with Locality of Reference | 6 |

Listing All Plane Graphs | 7 |

Pairwise Compatibility Graphs | 0 |

Multilevel Bandwidth and Radio Labelings of Graphs | 0 |

proceeding 2008 | 2 |

Total | 185 |