arXiv 2019-04-19 EN An Efficient Algorithm for the Fast Delivery Problem Carvalho, Iago A. · Erlebach, Thomas · Papadopoulos, Kleitos
arXiv 2018-02-20 EN Selection from heaps, row-sorted matrices and X+Y using soft heaps Kaplan, Haim · Kozma, László · Zamir, Or · Zwick, Uri
arXiv 2018-01-10 EN FPT algorithms for embedding into low complexity graphic metrics Ghosh, Arijit · Kolay, Sudeshna · Mishra, Gopinath
arXiv 2016-09-28 EN StruClus: Structural Clustering of Large-Scale Graph Databases Schäfer, Till · Mutzel, Petra
arXiv 2015-06-21 EN An elementary approach to tangent space variation on Riemannian submanifolds Boissonnat, Jean-Daniel · Dyer, Ramsay · Ghosh, Arijit
arXiv 2015-05-20 EN A probabilistic approach to reducing the algebraic complexity of computing Delaunay triangulations Boissonnat, Jean-Daniel · Dyer, Ramsay · Ghosh, Arijit
arXiv 2014-12-23 EN Search Methods for Tile Sets in Patterned DNA Self-Assembly Göös, Mika · Lempiäinen, Tuomo · Czeizler, Eugen · Orponen, Pekka
arXiv 2014-10-26 EN Only distances are required to reconstruct submanifolds Boissonnat, Jean-Daniel · Dyer, Ramsay · Ghosh, Arijit · Oudot, Steve Y.
arXiv 2007-02-09 EN Polyhedral representation conversion up to symmetries Bremner, David · Sikiric, Mathieu Dutour · Schuermann, Achill
