| Paper title | Citations |
|---|
| on the parallel parameterized complexity of the graph isomorphism problem | 1 |
| complexity of the maximum k-path vertex cover problem | 1 |
| on structural parameterizations of happy coloring, empire coloring and boxicity | 6 |
| fpt algorithms exploiting carving decomposition for eulerian orientations and ice-type models | 1 |
| on multiple longest common subsequence and common motifs with gaps (extended abstract) | 3 |
| boosting over non-deterministic zdds | 1 |
| a simple, fast, filter-based algorithm for circular sequence comparison | 3 |
| fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement | 6 |
| online facility assignment | 4 |
| a note on online colouring problems in overlap graphs and their complements | 1 |
| computing periods …… | 0 |
| scheduling batch processing in flexible flowshop with job dependent buffer requirements: lagrangian relaxation approach | 2 |
| random popular matchings with incomplete preference lists | 1 |
| an improvement of the algorithm of hertli for the unique 3sat problem | 1 |
| faster network algorithms based on graph decomposition | 0 |
| two new schemes in the bitprobe model | 7 |
| minimum-width square annulus intersecting polygons | 0 |
| minimum-width annulus with outliers: circular, square, and rectangular cases | 0 |
| approximating partially bounded degree deletion on directed graphs | 0 |
| secret key amplification from uniformly leaked key exchange complete graph | 0 |
| enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs | 1 |
| a simple algorithm for r-gatherings on the line | 7 |
| Total | 46 |