Skip to content

Workshop on Algorithm Engineering and Experiments

ALENEX

A

CORE rank

CORE rank (raw)

A

Fields of research

Theory of Computation

Papers indexed

465

1999–2026

Papers per year

199926 peak2026

ALENEX papers

465 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2007Computing Visibility on Terrains in External Memory.Herman J. Haverkort, Laura Toma, Yi Zhuang
20070/1 Vertex and Facet Enumeration with BDDs.Markus Behle, Friedrich Eisenbrand
2007In Transit to Constant Time Shortest-Path Queries in Road Networks.Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes
2007Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service.Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa
2007Locating Guards for Visibility Coverage of Polygons.Yoav Amit, Joseph S. B. Mitchell, Eli Packer
2007Improved External Memory BFS Implementation.Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
2006Distributed Routing in Small-World Networks.Oskar Sandberg
2006Optimal Incremental Sorting.Rodrigo Paredes, Gonzalo Navarro
2006Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching.David M. Mount
2006Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty.Grzegorz Malewicz
2006Distance-Sensitive Bloom Filters.Adam Kirsch, Michael Mitzenmacher
2006Fast Reconfiguration of Data Placement in Parallel Disks.Srinivas R. Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik
2006An Experimental Study of Old and New Depth Measures.John Hugg, Eynat Rafalin, Kathryn Seyboth, Diane L. Souvaine
2006Engineering Multi-Level Overlay Graphs for Shortest-Path Queries.Martin Holzer, Frank Schulz, Dorothea Wagner
2006Summarizing Spatial Data Streams Using ClusterHulls.John Hershberger, Nisheeth Shrivastava, Subhash Suri
2006An Experimental Study of Point Location in General Planar Arrangements.Idit Haran, Dan Halperin
2006Data Reduction, Exact, and Heuristic Algorithms for Clique Cover.Jens Gramm, Jiong Guo, Falk Hffner, Rolf Niedermeier
2006Reach for A*: Efficient Point-to-Point Shortest Path Algorithms.Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
2006Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications.Efi Fogel, Dan Halperin
2006Force-Directed Approaches to Sensor Localization.Alon Efrat, David Forrester, Anand Iyer, Stephen G. Kobourov, Cesim Erten
2006Compact Routing on Power Law Graphs with Additive Stretch.Arthur Brady, Lenore J. Cowen
2006Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover.Eyjlfur Ingi sgeirsson, Cliff Stein
2005Drawing Graphs to Speed Up Shortest-Path Computations.Dorothea Wagner, Thomas Willhalm
2005Approximating the True Evolutionary Distance between Two Genomes.Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret
2005An Incomplex Algorithm for Fast Suffix Array Construction.Klaus-Bernd Schrmann, Jens Stoye
326350 of 465← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.