Methodology of Algorithm Engineering

Research on algorithms has drastically increased in recent years. Various sub-disciplines of computer science investigate algorithms according to different objectives and standards. This plurality of the field has led to various methodological advances that have not yet been transferred to neighboring sub-disciplines. The central roadblock for a better knowledge exchange is the lack of a common methodological framework integrating the perspectives of these sub-disciplines. It is the objective of this article to develop such a research framework for algorithm engineering. Our framework builds on three areas discussed in the philosophy of science: ontology, epistemology and methodology. The framework helps us to identify and discuss various validity concerns relevant for any contribution on algorithms in various areas of computer science.

Authors

Institutions

Publication Details

Journal
ACM Computing Surveys
Published
2025-09-22
DOI
https://doi.org/10.1145/3769071
Citations
3
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
3.83
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Methodology of Algorithm Engineering

Henning Meyerhenke, Henrik Leopold, Benoît Depaire, Jan Mendling
3 citations
ACM Computing Surveys
Graph Theory and Algorithms
3.83
article

Methodology of Algorithm Engineering

Henning Meyerhenke, Henrik Leopold, Benoît Depaire, Jan Mendling
article en
3 citations

Abstract

Research on algorithms has drastically increased in recent years. Various sub-disciplines of computer science investigate algorithms according to different objectives and standards. This plurality of the field has led to various methodological advances that have not yet been transferred to neighboring sub-disciplines. The central roadblock for a better knowledge exchange is the lack of a common methodological framework integrating the perspectives of these sub-disciplines. It is the objective of this article to develop such a research framework for algorithm engineering. Our framework builds on three areas discussed in the philosophy of science: ontology, epistemology and methodology. The framework helps us to identify and discuss various validity concerns relevant for any contribution on algorithms in various areas of computer science.

ACM Computing SurveysVol. 58(4)
Vienna University of Economics and Business (AT), Karlsruhe Institute of Technology (DE), Hasso Plattner Institute (DE), University of Potsdam (DE), Kühne Logistics University (DE), Humboldt-Universität zu Berlin (DE), Weizenbaum Institute (DE), Hasselt University (BE)
Openalex Percentile: Top 6%
Graph Theory and Algorithms
3.83
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Methodology of Algorithm Engineering — Henning Meyerhenke, Henrik Leopold, et al. · ACM Computing Surveys (2025) | TGRS Research Map | TGRS