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

Paper titleCitations
Mobility and Computations: Some Open Research Directions0
Adversarial Prediction: Lossless Predictors and Fractal Like Adversaries0
A Novel Efficient Approach for Solving the Art Gallery Problem9
Fixed-Orientation Equilateral Triangle Matching of Point Sets10
Online Exploration and Triangulation in Orthogonal Polygonal Regions4
A Competitive Strategy for Distance-Aware Online Shape Allocation2
Base Location Problems for Base-Monotone Regions1
Counting Maximal Points in a Query Orthogonal Rectangle5
Voronoi Game on Graphs21
Approximation Schemes for Covering and Packing21
A Randomised Approximation Algorithm for the Hitting Set Problem6
Exact and Approximation Algorithms for Densest k-Subgraph18
Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs2
Approximation Algorithms for the Partition Vertex Cover Problem7
Daemon Conversions in Distributed Self-stabilizing Algorithms14
Broadcasting in Conflict-Aware Multi-channel Networks0
Shared-Memory Parallel Frontier-Based Search2
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching14
Triangle-Partitioning Edges of Planar Graphs, Toroidal Graphs and k-Planar Graphs1
Alliances and Bisection Width for Planar Graphs0
The Cyclical Scheduling Problem0
Generalized Rainbow Connectivity of Graphs1
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems2
Lower Bounds for Ramsey Numbers for Complete Bipartite and 3-Uniform Tripartite Subgraphs2
Improved Fixed-Parameter Algorithm for the Minimum Weight 3-SAT Problem3
On Directed Tree Realizations of Degree Sets1
An FPT Algorithm for Tree Deletion Set4
Circular Graph Drawings with Large Crossing Angles7
On Graphs That Are Not PCGs27
On Embedding of Certain Recursive Trees and Stars into Hypercube0
Box-Rectangular Drawings of Planar Graphs6
proceeding 20130