| Paper title | Citations |
|---|
| sliding tokens on block graphs | 4 |
| the time complexity of the token swapping problem and its parallel variants | 17 |
| sequentially swapping colored tokens on graphs | 9 |
| an fptas for computing the distribution function of the longest path length in dags with uniformly distributed edge lengths | 3 |
| improved approximation for two dimensional strip packing with polynomial bounded width | 10 |
| approximation algorithm for cycle-star hub network design problems and cycle-metric labeling problems | 1 |
| an approximation algorithm for maximum internal spanning tree | 3 |
| finding triangles for maximum planar subgraphs | 5 |
| an upper bound for resolution size: characterization of tractable sat instances | 1 |
| the complexity of (list) edge-coloring reconfiguration problem | 8 |
| algorithms for automatic ranking of participants and tasks in an anonymized contest | 2 |
| space-efficient and output-sensitive implementations of greedy algorithms on intervals | 0 |
| time-space trade-off for finding the k-visibility region of a point in a polygon | 9 |
| a space-efficient algorithm for the dynamic dfs problem in undirected graphs | 6 |
| gathering asynchronous robots in the presence of obstacles | 0 |
| fault-tolerant spanners in networks with symmetric directional antennas | 2 |
| computing the center region and its variants | 1 |
| online inserting points uniformly on the sphere | 3 |
| approximation algorithm for the distance-3 independent set problem on cubic graphs | 7 |
| a fast deterministic detection of small pattern graphs in graphs without large cliques | 2 |
| minimum weight connectivity augmentation for planar straight-line graphs | 1 |
| tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem | 5 |
| recognizing simple-triangle graphs by restricted 2-chain subgraph cover | 7 |
| fast optimal labelings for rotating maps | 2 |
| complexity measures for mosaic drawings | 0 |
| an experimental study on the ply number of straight-line drawings | 5 |
| generating all patterns of graph partitions within a disparity bound | 16 |
| byzantine gathering in networks with authenticated whiteboards | 5 |
| a width parameter useful for chordal and co-comparability graphs | 0 |
| tangle and maximal ideal | 1 |
| bundling two simple polygons to minimize their convex hull | 1 |
| on guarding orthogonal polygons with sliding cameras | 11 |
| how to extend visibility polygons by mirrors to cover invisible segments | 4 |
| dynamic sum-radii clustering | 7 |
| efficient enumeration of flat-foldable single vertex crease patterns | 1 |
| efficient algorithms for finding maximum and maximal cliques and their applications | 13 |
| Total | 172 |