Citations of WALCOM 2012 LNCS 7157 (extracted from Google scholar)

Paper titleCitations
calculating average joint hamming weight for minimal weight conversion of d integers1
nash equilibria with minimum potential in undirected broadcast games17
heuristics for the maximum 2-layer rac subgraph problem8
drawing unordered trees on k-grids3
drawing graphs with vertices at specified positions and crossings at large angles6
fat heaps without regular counters6
linear time inference of strings from cover arrays using a binary alphabet7
on the hardness of point-set embeddability10
universal line-sets for drawing planar 3-trees6
on relaxing the constraints in pairwise compatibility graphs19
triangle-free outerplanar 3-graphs are pairwise compatibility graphs15
on the round-trip 1-center and 1-median problems6
comparing and aggregating partial orders with kendall tau distances26
reoptimization of the maximum weighted p k -free subgraph problem under vertex insertion5
approximating the multi-level bottleneck assignment problem21
range aggregate maximal points in the plane17
tight bound for farthest-color voronoi diagrams of line segments2
farthest voronoi diagrams under travel time metrics3
generalized above guarantee vertex cover and r-partization0
bounding the number of reduced trees, cographs, and series-parallel graphs by compression0
on three-dimensional graph drawing and embedding0
approximability of stable matching problems1
combinatorial optimization with noisy inputs: how can we separate the wheat from the chaff?0