Citations of WALCOM 2017 LNCS 10167 (extracted from Google scholar)

Paper titleCitations
sliding tokens on block graphs4
the time complexity of the token swapping problem and its parallel variants17
sequentially swapping colored tokens on graphs9
an fptas for computing the distribution function of the longest path length in dags with uniformly distributed edge lengths3
improved approximation for two dimensional strip packing with polynomial bounded width10
approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems1
an approximation algorithm for maximum internal spanning tree3
finding triangles for maximum planar subgraphs5
an upper bound for resolution size: characterization of tractable sat instances1
the complexity of (list) edge-coloring reconfiguration problem8
algorithms for automatic ranking of participants and tasks in an anonymized contest2
space-efficient and output-sensitive implementations of greedy algorithms on intervals0
time-space trade-off for finding the k-visibility region of a point in a polygon9
a space-efficient algorithm for the dynamic dfs problem in undirected graphs6
gathering asynchronous robots in the presence of obstacles0
fault-tolerant spanners in networks with symmetric directional antennas2
computing the center region and its variants1
online inserting points uniformly on the sphere3
approximation algorithm for the distance-3 independent set problem on cubic graphs7
a fast deterministic detection of small pattern graphs in graphs without large cliques2
minimum weight connectivity augmentation for planar straight-line graphs1
tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem5
recognizing simple-triangle graphs by restricted 2-chain subgraph cover7
fast optimal labelings for rotating maps2
complexity measures for mosaic drawings0
an experimental study on the ply number of straight-line drawings5
generating all patterns of graph partitions within a disparity bound16
byzantine gathering in networks with authenticated whiteboards5
a width parameter useful for chordal and co-comparability graphs0
tangle and maximal ideal1
bundling two simple polygons to minimize their convex hull1
on guarding orthogonal polygons with sliding cameras11
how to extend visibility polygons by mirrors to cover invisible segments4
dynamic sum-radii clustering7
efficient enumeration of flat-foldable single vertex crease patterns1
efficient algorithms for finding maximum and maximal cliques and their applications13