Paper title | Citations |
---|

pathwidth and searching in parameterized threshold graphs | 0 |

a simple and fast algorithm for maximum independent set in 3-degree graphs | 25 |

fpt algorithms for connected feedback vertex set | 21 |

real root isolation of multi-exponential polynomials with application | 2 |

on finding a better position of a convex polygon inside a circle to minimize the cutting cost | 1 |

variants of spreading messages | 26 |

the covert set-cover problem with application to network discovery | 7 |

a new model for a scale-free hierarchical structure of isolated cliques | 6 |

on some simple widths | 6 |

a simple and faster branch-and-bound algorithm for finding a maximum clique | 200 |

a rooted-forest partition with uniform vertex demand | 0 |

parallel algorithms for encoding and decoding blob code | 1 |

the 1.375 approximation algorithm for sorting by transpositions can run in o(nlogn) time | 7 |

comparing rna structures with biologically relevant operations cannot be done without strong combinatorial restrictions | 3 |

harmonious coloring on subclasses of colinear graphs | 6 |

reconstruction algorithm for permutation graphs | 2 |

acyclically 3-colorable planar graphs | 5 |

a simple algorithm for approximate partial point set pattern matching under rigid motion | 0 |

cutting a convex polyhedron out of a sphere | 2 |

computation of non-dominated points using compact voronoi diagrams | 8 |

a global k-level crossing reduction algorithm | 17 |

switch-regular upward planar embeddings of trees | 2 |

small grid drawings of planar graphs with balanced bipartition | 4 |

the hamiltonian augmentation problem and its applications to graph drawing | 13 |

approximation algorithms for art gallery problems in polygons and terrains | 21 |

constant-work-space algorithm for a shortest path in a simple polygon | 6 |

crossings between curves with many tangencies | 8 |

Total | 399 |