Citations of WALCOM 2010 LNCS 5942 (extracted from Google scholar)

Paper titleCitations
pathwidth and searching in parameterized threshold graphs0
a simple and fast algorithm for maximum independent set in 3-degree graphs25
fpt algorithms for connected feedback vertex set21
real root isolation of multi-exponential polynomials with application2
on finding a better position of a convex polygon inside a circle to minimize the cutting cost1
variants of spreading messages26
the covert set-cover problem with application to network discovery7
a new model for a scale-free hierarchical structure of isolated cliques6
on some simple widths6
a simple and faster branch-and-bound algorithm for finding a maximum clique200
a rooted-forest partition with uniform vertex demand0
parallel algorithms for encoding and decoding blob code1
the 1.375 approximation algorithm for sorting by transpositions can run in o(nlogn) time7
comparing rna structures with biologically relevant operations cannot be done without strong combinatorial restrictions3
harmonious coloring on subclasses of colinear graphs6
reconstruction algorithm for permutation graphs2
acyclically 3-colorable planar graphs5
a simple algorithm for approximate partial point set pattern matching under rigid motion0
cutting a convex polyhedron out of a sphere2
computation of non-dominated points using compact voronoi diagrams8
a global k-level crossing reduction algorithm17
switch-regular upward planar embeddings of trees2
small grid drawings of planar graphs with balanced bipartition4
the hamiltonian augmentation problem and its applications to graph drawing13
approximation algorithms for art gallery problems in polygons and terrains21
constant-work-space algorithm for a shortest path in a simple polygon6
crossings between curves with many tangencies8