Citations of WALCOM 2013 LNCS 7748 (extracted from Google scholar)

Paper titleCitations
box-rectangular drawings of planar graphs7
on embedding of certain recursive trees and stars into hypercube0
on graphs that are not pcgs29
circular graph drawings with large crossing angles7
an fpt algorithm for tree deletion set5
on directed tree realizations of degree sets1
improved fixed-parameter algorithm for the minimum weight 3-sat problem3
lower bounds for ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs3
fixed-parameter tractability of error correction in graphical linear systems2
generalized rainbow connectivity of graphs1
the cyclical scheduling problem2
alliances and bisection width for planar graphs0
triangle-partitioning edges of planar graphs, toroidal graphs and k-planar graphs1
smoothed analysis of belief propagation for minimum-cost flow and matching14
shared-memory parallel frontier-based search2
broadcasting in conflict-aware multi-channel networks0
daemon conversions in distributed self-stabilizing algorithms14
approximation algorithms for the partition vertex cover problem2
linear-time constant-ratio approximation algorithm and tight bounds for the contiguity of cographs2
exact and approximation algorithms for densest k-subgraph19
a randomised approximation algorithm for the hitting set problem9
approximation schemes for covering and packing22
voronoi game on graphs24
counting maximal points in a query orthogonal rectangle5
base location problems for base-monotone regions1
a competitive strategy for distance-aware online shape allocation2
online exploration and triangulation in orthogonal polygonal regions4
fixed-orientation equilateral triangle matching of point sets10
a novel efficient approach for solving the art gallery problem9
adversarial prediction: lossless predictors and fractal like adversaries0
mobility and computations: some open research directions0