Citations of WALCOM 2016 LNCS 9627 (extracted from Google scholar)

Paper titleCitations
finding mode using equality comparisons1
semimetric properties of sørensen-dice and?tversky indexes10
a lagrangian relaxation-based heuristic to?solve large extended graph partitioning problems4
fully dynamically maintaining minimal integral separator for threshold and difference graphs0
optimal online algorithms for the multi-objective time series search problem9
parameterization of strategy-proof mechanisms in the obnoxious facility game1
approximation algorithms for three dimensional protein folding2
approximation algorithms for generalized bounded tree cover0
fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers0
shortest reconfiguration of sliding tokens on a caterpillar12
as close as it gets8
large independent sets in subquartic planar graphs4
counting subgraphs in relational event graphs4
efficient generation of top-k procurements in a multi-item auction1
covering points with convex sets of minimum size2
an optimal algorithm for computing the integer closure of utvpi constraints1
a general framework for searching on a line11
computing a minimum-width square annulus in arbitrary orientation15
mixing times of markov chains of?2-orientations0
a necessary condition and a sufficient condition for pairwise compatibility graphs10
on aligned bar 1-visibility graphs3
formation of general position by asynchronous mobile robots under one-axis agreement14
optimal distributed searching in the plane with?and without uncertainty4
lower bounds for graph exploration using?local policies1
vertex-coloring with star-defects1
on hamiltonian colorings of block graphs1
tropical dominating sets in vertex-coloured graphs13
popping superbubbles and discovering clumps: recent developments in biological sequence analysis5