Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Journal of Experimental Algorithmics, Volume 10
Volume 10, 2005
- Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah:
Adaptive data structures for IP lookups. - Neal Lesh, Joe Marks, A. McMahon, Michael Mitzenmacher:
New heuristic and interactive approaches to 2D rectangular strip packing. - Dorothea Wagner, Thomas Willhalm, Christos D. Zaroliagis
:
Geometric containers for efficient shortest-path computation. - Alejandro López-Ortiz, Mehdi Mirzazadeh, Mohammad Ali Safari, M. Hossein Sheikh Attar:
Fast string sorting using order-preserving compression.
- Ranjan Sinha, Justin Zobel:
Using random sampling to build approximate tries for efficient string sorting. - Celso C. Ribeiro, Simone L. Martins:
Preface. - Evandro C. Bracht, Luis A. A. Meira, Flávio Keidi Miyazawa:
A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique. - Cid C. de Souza, André M. Lima, Guido Araujo, Nahri Moreano:
The datapath merging problem in reconfigurable systems: Complexity, dual bounds and heuristic evaluation. - Jingde Du, Stavros G. Kolliopoulos:
Implementing approximation algorithms for the single-source unsplittable flow problem. - Amalia Duch, Conrado Martínez:
Improving the performance of multidimensional search using fingers. - Martin Holzer, Frank Schulz, Dorothea Wagner, Thomas Willhalm:
Combining speed-up techniques for shortest-path computations. - Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro:
Increased bit-parallelism for approximate and multiple string matching. - Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke:
In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. - Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman:
Approximating interval coloring and max-coloring in chordal graphs. - Haroldo G. Santos, Luiz Satoru Ochi, Marcone J. F. Souza:
A Tabu search heuristic with efficient diversification strategies for the class/teacher timetabling problem.
a service of 
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-04-19 19:20 CEST 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:
