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

Paper titleCitations
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications44
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns0
Dynamic Sum-Radii Clustering6
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments2
On Guarding Orthogonal Polygons with Sliding Cameras10
Bundling Two Simple Polygons to Minimize Their Convex Hull1
Tangle and Maximal Ideal1
A Width Parameter Useful for Chordal and Co-comparability Graphs11
Byzantine Gathering in Networks with Authenticated Whiteboards5
Generating All Patterns of Graph Partitions Within a Disparity Bound15
An Experimental Study on the Ply Number of Straight-Line Drawings5
Complexity Measures for Mosaic Drawings0
Fast Optimal Labelings for Rotating Maps2
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover7
Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem5
Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs0
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques2
Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs7
Online Inserting Points Uniformly on the Sphere3
Computing the Center Region and Its Variants1
Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas2
Gathering Asynchronous Robots in the Presence of Obstacles0
A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs6
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon9
Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals0
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest2
The Complexity of (List) Edge-Coloring Reconfiguration Problem8
An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances1
Finding Triangles for Maximum Planar Subgraphs5
An Approximation Algorithm for Maximum Internal Spanning Tree3
Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems1
Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width10
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths3
Sequentially Swapping Colored Tokens on Graphs9
The Time Complexity of the Token Swapping Problem and Its Parallel Variants17
Sliding Tokens on Block Graphs4
proceeding 20170