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

Paper titleCitations
Crossings between Curves with Many Tangencies8
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon6
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains19
The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing10
Small Grid Drawings of Planar Graphs with Balanced Bipartition4
Switch-Regular Upward Planar Embeddings of Trees2
A Global k-Level Crossing Reduction Algorithm17
Computation of Non-dominated Points Using Compact Voronoi Diagrams8
Cutting a Convex Polyhedron Out of a Sphere3
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motion0
Acyclically 3-Colorable Planar Graphs9
Reconstruction Algorithm for Permutation Graphs2
Harmonious Coloring on Subclasses of Colinear Graphs6
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combinatorial Restrictions3
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time8
Parallel Algorithms for Encoding and Decoding Blob Code1
A Rooted-Forest Partition with Uniform Vertex Demand5
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique190
On Some Simple Widths6
A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques6
The Covert Set-Cover Problem with Application to Network Discovery6
Variants of Spreading Messages26
On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost1
Real Root Isolation of Multi-Exponential Polynomials with Application2
FPT Algorithms for Connected Feedback Vertex Set35
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs25
Pathwidth and Searching in Parameterized Threshold Graphs0
proceeding 20102