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
2002On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.Marcus Poggi de Arago, Renato Fonseca F. Werneck
2002Partitioning Planar Graphs with Costs and Weights.Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
2001New Algorithmic Challenges Arising in Measurement-Driven Networking Research.Walter Willinger
2001Network Tomography through End-to-End Measurements.Donald F. Towsley
2001PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets.Saurabh Sethia, Martin Held, Joseph S. B. Mitchell
2001Estimating Resemblance of MIDI Documents.Michael Mitzenmacher, Sean Owen
2001CNOP - A Package for Constrained Network Optimization.Kurt Mehlhorn, Mark Ziegelmann
2001An Empirical Study of a New Approach to Nearest Neighbor Searching.Songrit Maneewongvatana, David M. Mount
2001Trade Off Between Compression and Search Times in Compact Suffix Array.Veli Mkinen
2001Experimental Results on Statistical Approaches to Page Replacement Policies.Vitus J. Leung, Sandy Irani
2001Spectral Analysis for Data Mining.Anna R. Karlin
2001Implementation of a PTAS for Scheduling with Release Dates.Clint Hepner, Clifford Stein
2001Hierarchical Clustering of Trees: Algorithms and Experiments.Irene Finocchi, Rossella Petreschi
2001Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.Sndor P. Fekete, Henk Meijer, Andr Rohe, Walter Tietze
2001Biased Skip Lists for Highly Skewed Access Patterns.Funda Ergn, Sleyman Cenk Sahinalp, Jonathan Sharp, Rakesh K. Sinha
2001Experiments on Adaptive Set Intersections for Text Retrieval Systems.Erik D. Demaine, Alejandro Lpez-Ortiz, J. Ian Munro
2001The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests.Jill Cirasella, David S. Johnson, Lyle A. McGeoch, Weixiong Zhang
2001A Probabilistic Spell for the Curse of Dimensionality.Edgar Chvez, Gonzalo Navarro
2001Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube.Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail
2001Travel Planning with Self-Made Maps.Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
1999Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm.Martin Zachariasen, Pawel Winter
1999Practical Point-in-Polygon Tests Using CSG Representations of Polygons.Robert J. Walker, Jack Snoeyink
1999Heuristics and Experimental Design for Bigraph Crossing Number Minimization.Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh
1999Circular Drawings of Biconnected Graphs.Janet M. Six, Ioannis G. Tollis
1999Computing theTetsuo Shibuya
426450 of 465← PreviousNext →

Comparable venues

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