default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Journal of Experimental Algorithmics, Volume 16
Volume 16, May 2011
- Stefan Huber
, Martin Held:
Motorcycle graphs: Stochastic properties motivate an efficient yet simple implementation. - Leonid Boytsov:
Indexing methods for approximate dictionary searching: Comparative analysis. - Dimitrios Michail:
An experimental comparison of single-sided preference matching algorithms. - Péter Biró, Robert W. Irving, Ildikó Schlotter:
Stable matching with couples: An empirical study. - Andriy Kot, Andrey N. Chernikov, Nikos Chrisochoides:
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software. - Patrick Prosser, Chris Unsworth:
Limited discrepancy search revisited. - Lionel Tabourier, Camille Roth, Jean-Philippe Cointet:
Generating constrained random graphs using multiple edge switches. - Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz:
Approximation algorithms for speeding up dynamic programming and denoising aCGH data.
- Jan Vahrenhold:
Preface. - Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov:
Computing elevation maxima by searching the gauss sphere. - Randolf Rotta, Andreas Noack:
Multilevel local search algorithms for modularity clustering. - Paolo Bertasi, Marco Bressan, Enoch Peserico:
psort, yet another fast stable sorting software.
- Irene Finocchi, John Hershberger:
Guest editors' foreword. - Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna:
Theory and practice of monotone minimal perfect hashing. - Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom rumor spreading: An experimental analysis. - Herman J. Haverkort, Freek van Walderveen:
Four-dimensional hilbert curves for R-trees. - Cosmin Silvestru Negruseri, Mircea Bogdan Pasoi, Barbara Stanley, Clifford Stein, Cristian George Strat:
Solving maximum flow problems on real-world bipartite graphs. - Siamak Tazari, Matthias Müller-Hannemann:
Dealing with large hidden constants: engineering a planar steiner tree PTAS.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
