Andreas.
Physicist turned software engineer.
I focus on performance engineering, algorithms, and complex systems, complemented by open-source contributions in C++, Python, and Go.
I focus on performance engineering, algorithms, and complex systems, complemented by open-source contributions in C++, Python, and Go.

I’m a software engineer with a background in theoretical physics, working primarily with C++ and Python on performance-sensitive and safety-critical software. Over roughly ten years, my work has included C++ development for sensor-related systems (camera, LiDAR, radar), Python-based sensor data analysis, and the development and maintenance of automotive-safe C++ core libraries.
In parallel, I contribute to open-source projects such as NetworKit, Gonum, DuckDB, and NetworkX. These contributions focus on performance engineering, graph and numerical algorithms, correctness fixes, code-quality cleanup, and the addition of tests and benchmarks.
I’m especially interested in algorithms, data structures, and performance engineering — not just in theory, but in how systems behave in practice under profiling and reproducible benchmarks. More recently, I have also been deepening my work in Go, build systems, and containerized development workflows, with a growing interest in scalable and distributed software.
Product Ownership & Leadership
Hands-on Engineering
Development of an automotive header-only C++ library
C++
Python & CI
Leadership
Task force support: Refactored GPS-Based Route Prediction Component
C++
Python
Leadership
Developed and maintained C++ modules for camera image and metadata processing to support labeling and training workflows.
Administered an Azure-hosted SQL database for image metadata and label storage, ensuring reliable data access and schema evolution.
Integrated Azure DevOps and Azure ML pipelines to automate label data deliveries and schema updates.
Expanded Azure ML pipelines and SQL-based workflows to improve data handling, scalability, and pipeline functionality.
Developed a deep-learning–based prototype for LiDAR blockage detection in Python, achieving ~90% detection probability in staged pollution scenarios.
Performed in-depth analysis of LiDAR sensor performance under diverse contamination scenarios, identifying key factors affecting accuracy and reliability.
Engineered and extended a Python preprocessing framework for point cloud data, supporting multiple LiDAR types (multi-return, intensity, and other features) to streamline training data generation and augmentation.
Created accurate LiDAR sensor models to enable comprehensive sensor-set evaluations.
Leadership
Projects
Leadership
BucketPriorityQueue optimization · NetworKit
Replaced allocation-heavy std::list buckets with an array-backed representation while preserving constant-time insertion, removal, and key changes.
Local benchmarks showed ~3.5×–6.7× speedups, depending on API and workload; Callgrind measured 72% fewer instruction references for the largest change-and-remove workload.
PR #1446
Left–Right Planarity performance rewrite · NetworKit
Reworked the near-linear-time planarity implementation after the initial algorithm contribution, improving cache behavior and reducing overhead while preserving the tested algorithmic behavior. ≈100× faster in isolated runtime in Google Benchmark and up to ≈20× faster planarity test-suite.

Dilogarithm optimization · Gonum
Optimized a numerically stable special-function implementation with benchmarks across input regions, producing very large speedups for suitable argument ranges.

Templated graph architecture & performance evaluation · NetworKit
Driving the migration to a templated graph representation with configurable node-ID and edge-weight types to improve memory footprint and cache behavior. Rebased the prototype, migrated core algorithms, and developed rigorous benchmarks across type configurations.
Demonstrated small but consistent runtime improvements from 32-bit node identifiers across benchmark configurations.
Tracked in Issue #1415 · Analysis in PR #1324
Successive Shortest Path min-cost flow · NetworKit
Added a min-cost flow algorithm for capacities and supplies/demands.
PR #1349
SimRank edge scoring · NetworKit
Added an OpenMP-parallel C++ edge-scoring implementation based on iterative SimRank similarity and exposed it through the Python API.
PR #1406,
PR #1407
Dinic’s max-flow algorithm · Gonum
Implemented max-flow using level graphs and blocking flows.
PR #2051
Dilogarithm (Li₂) special function · Gonum
Implemented a numerically stable special function used in physics and number theory.
PR #2059
Transitive Reduction for directed acyclic graphs · Gonum
Implemented optimized DAG transitive reduction using pruned DFS, dense indexing with generation counters, and reusable scratch buffers to minimize allocations; benchmarked for runtime and memory improvements.
PR #2070
NetworKit graph and Python API correctness · C++ & Python
• Prevented Python edge-iteration callbacks from crashing on invalid or removed nodes:
PR #1424
• Fixed unsafe Graph.addEdges handling for int32 weight arrays and added regression coverage:
PR #1386
• Fixed binary graph I/O for graphs with deleted node IDs and for empty graphs:
PR #1385,
PR #1338
DuckDB correctness fixes · C++ & Python
• Resolved a segmentation fault in the DuckDB core overwrite path and added a targeted regression test:
PR #20468
• Fixed TRY_CAST(… AS BIGNUM) handling for invalid string inputs, returning
NULL instead of raising a conversion error:
PR #22450
• Fixed a memory leak in the DuckDB Python bindings by correcting object lifetime handling;
added regression coverage:
PR #245
DuckDB dependency and code-quality cleanup · C++
• Removed hundreds of unused headers across DuckDB core and storage layers, improving compile-time dependency hygiene and long-term maintainability.
PR #18422,
PR #20407