Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarACM Journal of Experimental Algorithmics, Volume 14
Volume 14, December 2009
- Bryant A. Julstrom:
Greedy heuristics for the bounded diameter minimum spanning tree problem. - Robert W. Irving, David Manlove:
Finding large stable matchings. - Mohammad Farshi, Joachim Gudmundsson:
Experimental study of geometric t-spanners. - Daniel Cederman, Philippas Tsigas:
GPU-Quicksort: A practical Quicksort algorithm for graphics processors. - Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos D. Zaroliagis:
Engineering planar separator algorithms. - Alaubek Avdil, Karsten Weihe:
Local search starting from an LP solution: Fast and quite good. - Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera:
Reduction rules deliver efficient FPT-algorithms for covering points with lines. - Jesús A. De Loera, David C. Haws, Jon Lee, Allison O'Hair:
Computation in multicriteria matroid optimization.
- J. Ian Munro, Dorothea Wagner:
Preface. - Daniel Dumitriu
, Stefan Funke, Martin Kutz, Nikola Milosavljevic:
How much geometry it takes to reconstruct a 2-manifold in R3. - Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani:
Geometric algorithms for optimal airspace design and air traffic controller workload balancing. - Reinhard Bauer, Daniel Delling:
SHARC: Fast and robust unidirectional routing. - Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel:
Obtaining optimal k-cardinality trees fast. - Tom Coleman, Anthony Wirth:
Ranking tournaments: Local search and a new algorithm. - Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck:
Shortest-path feasibility algorithms: An experimental evaluation.
- Maria J. Serna, Carme Àlvarez:
Preface to special section of selected papers from WEA 2006. - Jens Maue, Peter Sanders, Domagoj Matijevic:
Goal-directed shortest-path queries using precomputed cluster distances. - Matthias Englert, Heiko Röglin, Matthias Westermann:
Evaluation of online strategies for reordering buffers. - Markus Chimani, Carsten Gutwenger, Petra Mutzel:
Experiments on exact crossing minimization using column generation. - Leonor Frias, Jordi Petit, Salvador Roura:
Lists revisited: Cache-conscious STL lists. - Karina Figueroa, Edgar Chávez, Gonzalo Navarro, Rodrigo Paredes:
Speeding up spatial approximation search in metric spaces. - Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu, Alejandro Salinger:
An experimental investigation of set intersection algorithms for text searching.
- Camil Demetrescu:
Preface. - Niko Välimäki, Veli Mäkinen, Wolfgang Gerlach, Kashyap Dixit:
Engineering a compressed suffix tree implementation. - Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu:
Algorithms for longer OLED lifetime. - Felix Putze, Peter Sanders, Johannes Singler:
Cache-, hash-, and space-efficient bloom filters. - Robert Endre Tarjan, Renato Fonseca F. Werneck:
Dynamic trees in practice. - Vladimir G. Deineko, Alexander Tiskin:
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough?
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 2020-07-06 22:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
