Citations of WALCOM 2011 LNCS 6552 (extracted from Google scholar)

Paper titleCitations
minimum-layer drawings of trees10
on graceful labelings of trees2
counting spanning trees in graphs using modular decomposition0
a polynomial time algorithm for longest paths in biconvex graphs2
de bruijn sequences for the binary strings with maximum density8
hashed patricia trie: efficient longest prefix matching in peer-to-peer systems9
clustering with internal connectedness0
on the discrete unit disk cover problem33
multi cover of a polygon minimizing the sum of areas17
range-aggregate queries involving geometric aggregation operations10
efficient top-k queries for orthogonal ranges15
minimum enclosing circle of a set of fixed points and a mobile point2
analysis of gauss-sieve for solving the shortest vector problem in lattices23
efficient computation of time-dependent centralities in air transportation networks5
k-level crossing minimization is np-hard for trees1
inapproximability of b-matching in k-uniform hypergraphs4
the complexity of acyclic subhypergraph problems3
oblivious buy-at-bulk in planar graphs2
approximation algorithms for minimum chain vertex deletion1
maximum betweenness centrality: approximability and tractable cases22
the physarum computer0
the disjoint paths problem: algorithm and structure4
geometry and topology from point cloud data0