Paper title | Citations |
---|

correction to: weighted upper edge cover: complexity and approximability | 0 |

capacitated discrete unit disk cover | 1 |

minimum membership covering and hitting | 0 |

covering and packing of rectilinear subdivision | 0 |

packing 2d disks into a 3d container | 0 |

arbitrary pattern formation on infinite grid by asynchronous oblivious robots | 15 |

towards work-efficient parallel parameterized algorithms | 0 |

applications of v-order: suffix arrays, the burrows-wheeler transform | 0 |

a two query adaptive bitprobe scheme storing five elements | 1 |

greedy consensus tree and maximum greedy consensus tree problems | 1 |

analyzing the quantum annealing approach for solving linear least squares problems | 8 |

efficient algorithm for box folding | 6 |

matching sets of line segments | 0 |

linear pseudo-polynomial factor algorithm for automaton constrained tree knapsack problem | 2 |

weighted upper edge cover: complexity and approximability | 4 |

multilevel planarity | 0 |

a fast algorithm for unbounded monotone integer linear systems with two variables per inequality via graph decomposition | 0 |

the upper bound on the eulerian recurrent lengths of complete graphs obtained by an ip solver | 0 |

on the algorithmic complexity of double vertex-edge domination in graphs | 3 |

computing the metric dimension by decomposing graphs into extended biconnected components | 3 |

drawing clustered graphs on disk arrangements | 1 |

(k,?p)-planarity: a relaxation of hybrid planarity | 3 |

flat-foldability for 1?×?n maps with square/diagonal grid patterns | 0 |

optimal partition of a tree with social distance | 0 |

probabilistic analysis of optimization problems on generalized random shortest path metrics | 2 |

the prefix fréchet similarity | 0 |

hard and easy instances of l-tromino tilings | 1 |

maximum-width empty square and rectangular annulus | 2 |

a linear time algorithm for the r-gathering problem on the line (extended abstract) | 2 |

topological stability of kinetic k-centers | 3 |

r-gatherings on a star | 0 |

parameterized computational geometry via decomposition theorems | 0 |

graph profile realizations and applications to social networks | 6 |

Total | 64 |