Dr. Dominik Krupke

cpsat-primer. The CP-SAT Primer: Using and Understanding Google OR-Tools' CP-SAT Solver

CP-SAT-Log-Analyzer. A webapp that visualizes and annotates your ortools' CP-SAT logs. Partially inspired by gurobi-logtools.

ALENEX24-partial-coverage-path-planning. Code and Data for the Paper "Near-Optimal Coverage Path Planning with Turn Costs" ALENEX 2024

cpsat-autotune. WIP: Tune the hyperparameters of Google's OR-Tools' CP-SAT solver for specific models

slurminade. A decorator-based slurm runner.

CheckMyTex. A tool to comfortably check complex LaTeX documents, e.g., dissertations.

flachtex. A simple Python-library to flatten LaTeX

AlgBench. Experiment execution and result management for empirical evaluations of algorithms in Python.

AlgLab-WS2425-material. Material for the AlgLab (Winter 2024/2025) @ TU Braunschweig

skbuild-conan. An extension for scikit-build to add C++-dependencies as easily as Python dependencies via conan.

cpsat-utils. A utils package for Google's ortools CP-SAT solver

pyvispoly. CGAL Visibility Polygons in Python

cpsat-logutils. Utils for parsing the logs of OR-Tools' CP-SAT solver.

close-enough-tsp. A Branch&Bound-based solver for the close-enough TSP, optimized as subroutine for coverage path planning.

AlgLab-WS2526-material. Material for the AlgLab (Winter 2025/2026) @ TU Braunschweig

turncost. Implementation of solver for covering grid graphs with minimal turn costs

pyaccft. Python bindings for the Implementation of the Caprara, Fischetti, and Toth algorithm for the Set Covering problem.

AeMeasure. A macro-benchmarking tool with a serverless database

AlgLab-summer25-material. Material for the Algorithms Lab for summer 2025 @ TU Braunschweig

dispersive_agp_solver. An exact solver for the Dispersive Art Gallery Problem

primal_dual_weighted_set_cover. A primal dual algorithm for weighted set cover. Especially for the case when the number of sets an element can occur in is limited (like in Vertex Cover for which this algorithm is a 2-APX).

bipartite_vertex_cover. Optimal vertex covers in bipartite graphs in C++ and Boost Graph Library. Simple interface and copy&paste integration.

eurocg18-angularft. Material for "Beam It Up, Scotty: Angular Freeze-Tag with Directional Antennas" - Fekete and Krupke - EuroCG 2018 Berlin

thesis-manager. A simple management server for Student Theses. It helps institutes keep track of their supervised theses.