High-Performance Benchmarking Suite for Matrix Algorithms | Bachelor Thesis Project | Python, NumPy, Performance Engineering
-
Updated
Mar 15, 2026 - Python
High-Performance Benchmarking Suite for Matrix Algorithms | Bachelor Thesis Project | Python, NumPy, Performance Engineering
Cache-conscious C++17 Pareto routing engine for transit networks, with a 38-network empirical study of when multi-objective routing actually matters.
Evidence-driven harness for open-ended algorithm optimization: trials, stress tests, budget gates, heuristic registry, and regression packs.
Repo for Algorithm Engineering Projects Team: Suffering IRL
Personal Academic Homepage
Graph Coloring implementation based on XRLF algorithm
A buffered streaming graph partitioner using prioritized buffering and multilevel refinement. Robust against adversarial node orderings.
Verified Rust/Python implementation and honest benchmark study of the Duan-Mao-Mao-Shu-Yin sorting-barrier shortest-path algorithm (BMSSP) vs Dijkstra
Technical retrospective and source release for Team Smoop's OGC 2026 Grand Shipyard anytime solver
Curated, auditable Agent Skills for algorithm engineers using Pi and OpenCode — training, evals, debugging, security and reports.
Exact shortest paths with negative edge weights (e.g. EV energy with regenerative braking) using Customizable Contraction Hierarchies — no Bellman–Ford, no potentials. Includes negative-cycle detection, live updates, a battery-constrained variant, baselines (Johnson, ALT, bidirectional A*), and DIMACS benchmarks. Pure Python.
The first implementation of the Duan–Mao–Shu–Yin O(m√(log n·log log n)) directed SSSP algorithm (arXiv:2602.07868) — measured against Dijkstra, audited, and proved.
Automated rooftop solar panel placement system combining computer vision, grid-based modeling, and search/optimization algorithms.
Secretly a Master's Thesis
FPT-based data reduction and kernelization for the maximum cut problem
Collection of our hypergraph partitioning experiments
Streaming Process Mapping
Fully dynamic solver for the Maximum (Weight) Independent Set problem
Fully dynamic exact and heuristic algorithms for edge orientation (delta-orientation)
To associate your repository with the algorithm-engineering topic, visit your repo's landing page and select "manage topics."