| Paper title | Citations |
|---|
| minimum-layer drawings of trees | 10 |
| on graceful labelings of trees | 2 |
| counting spanning trees in graphs using modular decomposition | 0 |
| a polynomial time algorithm for longest paths in biconvex graphs | 2 |
| de bruijn sequences for the binary strings with maximum density | 8 |
| hashed patricia trie: efficient longest prefix matching in peer-to-peer systems | 9 |
| clustering with internal connectedness | 0 |
| on the discrete unit disk cover problem | 33 |
| multi cover of a polygon minimizing the sum of areas | 17 |
| range-aggregate queries involving geometric aggregation operations | 10 |
| efficient top-k queries for orthogonal ranges | 15 |
| minimum enclosing circle of a set of fixed points and a mobile point | 2 |
| analysis of gauss-sieve for solving the shortest vector problem in lattices | 23 |
| efficient computation of time-dependent centralities in air transportation networks | 5 |
| k-level crossing minimization is np-hard for trees | 1 |
| inapproximability of b-matching in k-uniform hypergraphs | 4 |
| the complexity of acyclic subhypergraph problems | 3 |
| oblivious buy-at-bulk in planar graphs | 2 |
| approximation algorithms for minimum chain vertex deletion | 1 |
| maximum betweenness centrality: approximability and tractable cases | 22 |
| the physarum computer | 0 |
| the disjoint paths problem: algorithm and structure | 4 |
| geometry and topology from point cloud data | 0 |
| Total | 173 |