| Paper title | Citations |
|---|
| finding mode using equality comparisons | 1 |
| semimetric properties of sørensen-dice and?tversky indexes | 10 |
| a lagrangian relaxation-based heuristic to?solve large extended graph partitioning problems | 4 |
| fully dynamically maintaining minimal integral separator for threshold and difference graphs | 0 |
| optimal online algorithms for the multi-objective time series search problem | 9 |
| parameterization of strategy-proof mechanisms in the obnoxious facility game | 1 |
| approximation algorithms for three dimensional protein folding | 2 |
| approximation algorithms for generalized bounded tree cover | 0 |
| fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers | 0 |
| shortest reconfiguration of sliding tokens on a caterpillar | 12 |
| as close as it gets | 8 |
| large independent sets in subquartic planar graphs | 4 |
| counting subgraphs in relational event graphs | 4 |
| efficient generation of top-k procurements in a multi-item auction | 1 |
| covering points with convex sets of minimum size | 2 |
| an optimal algorithm for computing the integer closure of utvpi constraints | 1 |
| a general framework for searching on a line | 11 |
| computing a minimum-width square annulus in arbitrary orientation | 15 |
| mixing times of markov chains of?2-orientations | 0 |
| a necessary condition and a sufficient condition for pairwise compatibility graphs | 10 |
| on aligned bar 1-visibility graphs | 3 |
| formation of general position by asynchronous mobile robots under one-axis agreement | 14 |
| optimal distributed searching in the plane with?and without uncertainty | 4 |
| lower bounds for graph exploration using?local policies | 1 |
| vertex-coloring with star-defects | 1 |
| on hamiltonian colorings of block graphs | 1 |
| tropical dominating sets in vertex-coloured graphs | 13 |
| popping superbubbles and discovering clumps: recent developments in biological sequence analysis | 5 |
| Total | 137 |