default search action
ACM Journal of Experimental Algorithmics, Volume 17
Volume 17, Number 1, March 2012
- Charles Reams:
Anatree: A Fast Data Structure for Anagrams. - Robert Geisberger, Michael N. Rice, Peter Sanders, Vassilis J. Tsotras
:
Route planning with flexible edge restrictions. - Matthias F. Stallmann:
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study. - Kai Christian Bader, Mikhail J. Atallah, Christian Grothoff
:
Efficient relaxed search in hierarchically clustered sequence datasets. - John M. Ennis, Charles M. Fayle, Daniel M. Ennis:
Assignment-minimum clique coverings. - Peter Sanders, Dominik Schultes:
Engineering highway hierarchies. - Christian Bachmaier, Wolfgang Brunner, Andreas Gleißner
:
Grid sifting: Leveling and crossing reduction.
- Guy E. Blelloch, Dan Halperin:
Introduction to special issue ALENEX'10. - Eduardo Uchoa
, Renato Fonseca F. Werneck:
Fast local search for the steiner problem in graphs. - Alexander Kröller, Tobias Baumgartner, Sándor P. Fekete, Christiane Schmidt
:
Exact solutions and bounds for general art gallery problems. - Marcel R. Ackermann, Marcus Märtens
, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler
:
StreamKM++: A clustering algorithm for data streams.
- Matthias Müller-Hannemann
, Renato Fonseca F. Werneck:
Introduction to special issue ALENEX'11. - Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh:
A topological sorting algorithm for large graphs. - Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel
:
An SDP approach to multi-level crossing minimization. - Iulian Moraru, David G. Andersen:
Exact pattern matching with feed-forward bloom filters. - Isabelle Stanton, Ali Pinar:
Constructing and sampling graphs with a prescribed joint degree distribution.
- David A. Bader
, Philippas Tsigas
:
ACM journal on experimental algorithmics special issue on multicore algorithms. - Tolu Alabi, Jeffrey D. Blanchard
, Bradley Gordon, Russel Steinbach:
Fast k-selection algorithms for graphics processing units. - Matthew Dellinger, Aaron Lindsay, Binoy Ravindran
:
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms. - Daniel Delling, Bastian Katz
, Thomas Pajor:
Parallel computation of best connections in public transportation networks. - Jyothish Soman, Kishore Kothapalli, P. J. Narayanan
:
Discrete range searching primitive for the GPU and its applications.
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.