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

Paper title | Citations |
---|---|

Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications | 44 |

Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns | 0 |

Dynamic Sum-Radii Clustering | 6 |

How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments | 2 |

On Guarding Orthogonal Polygons with Sliding Cameras | 10 |

Bundling Two Simple Polygons to Minimize Their Convex Hull | 1 |

Tangle and Maximal Ideal | 1 |

A Width Parameter Useful for Chordal and Co-comparability Graphs | 11 |

Byzantine Gathering in Networks with Authenticated Whiteboards | 5 |

Generating All Patterns of Graph Partitions Within a Disparity Bound | 15 |

An Experimental Study on the Ply Number of Straight-Line Drawings | 5 |

Complexity Measures for Mosaic Drawings | 0 |

Fast Optimal Labelings for Rotating Maps | 2 |

Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover | 7 |

Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem | 5 |

Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs | 0 |

A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques | 2 |

Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs | 7 |

Online Inserting Points Uniformly on the Sphere | 3 |

Computing the Center Region and Its Variants | 1 |

Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas | 2 |

Gathering Asynchronous Robots in the Presence of Obstacles | 0 |

A Space-Efficient Algorithm for the Dynamic DFS Problem in Undirected Graphs | 6 |

Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon | 9 |

Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals | 0 |

Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest | 2 |

The Complexity of (List) Edge-Coloring Reconfiguration Problem | 8 |

An Upper Bound for Resolution Size: Characterization of Tractable SAT Instances | 1 |

Finding Triangles for Maximum Planar Subgraphs | 5 |

An Approximation Algorithm for Maximum Internal Spanning Tree | 3 |

Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems | 1 |

Improved Approximation for Two Dimensional Strip Packing with Polynomial Bounded Width | 10 |

An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths | 3 |

Sequentially Swapping Colored Tokens on Graphs | 9 |

The Time Complexity of the Token Swapping Problem and Its Parallel Variants | 17 |

Sliding Tokens on Block Graphs | 4 |

proceeding 2017 | 0 |

Total | 207 |