Paper title | Citations |
---|

Crossings between Curves with Many Tangencies | 8 |

Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon | 6 |

Approximation Algorithms for Art Gallery Problems in Polygons and Terrains | 19 |

The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing | 10 |

Small Grid Drawings of Planar Graphs with Balanced Bipartition | 4 |

Switch-Regular Upward Planar Embeddings of Trees | 2 |

A Global k-Level Crossing Reduction Algorithm | 17 |

Computation of Non-dominated Points Using Compact Voronoi Diagrams | 8 |

Cutting a Convex Polyhedron Out of a Sphere | 3 |

A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion | 0 |

Acyclically 3-Colorable Planar Graphs | 9 |

Reconstruction Algorithm for Permutation Graphs | 2 |

Harmonious Coloring on Subclasses of Colinear Graphs | 6 |

Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions | 3 |

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time | 8 |

Parallel Algorithms for Encoding and Decoding Blob Code | 1 |

A Rooted-Forest Partition with Uniform Vertex Demand | 5 |

A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique | 190 |

On Some Simple Widths | 6 |

A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques | 6 |

The Covert Set-Cover Problem with Application to Network Discovery | 6 |

Variants of Spreading Messages | 26 |

On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost | 1 |

Real Root Isolation of Multi-Exponential Polynomials with Application | 2 |

FPT Algorithms for Connected Feedback Vertex Set | 35 |

A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs | 25 |

Pathwidth and Searching in Parameterized Threshold Graphs | 0 |

proceeding 2010 | 2 |

Total | 410 |