Paper title | Citations |
---|

Geometry and Topology from Point Cloud Data | 1 |

The Disjoint Paths Problem: Algorithm and Structure | 4 |

The Physarum Computer | 0 |

Maximum Betweenness Centrality: Approximability and Tractable Cases | 21 |

Approximation Algorithms for Minimum Chain Vertex Deletion | 1 |

Oblivious Buy-at-Bulk in Planar Graphs | 2 |

The Complexity of Acyclic Subhypergraph Problems | 3 |

Inapproximability of b-Matching in k-Uniform Hypergraphs | 4 |

k-Level Crossing Minimization Is NP-Hard for Trees | 1 |

Efficient Computation of Time-Dependent Centralities in Air Transportation Networks | 5 |

Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices | 22 |

Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point | 6 |

Efficient Top-k Queries for Orthogonal Ranges | 14 |

Range-Aggregate Queries Involving Geometric Aggregation Operations | 10 |

Multi Cover of a Polygon Minimizing the Sum of Areas | 14 |

On the Discrete Unit Disk Cover Problem | 33 |

Clustering with Internal Connectedness | 0 |

Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems | 9 |

De Bruijn Sequences for the Binary Strings with Maximum Density | 8 |

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs | 2 |

Counting Spanning Trees in Graphs Using Modular Decomposition | 0 |

On Graceful Labelings of Trees | 2 |

Minimum-Layer Drawings of Trees | 10 |

proceeding 2011 | 0 |

Total | 172 |