Giter VIP home page Giter VIP logo

PostDoc Researcher at the Algorithms Group (Prof. Fekete), TU Braunschweig, Germany.


I specialize in solving NP-hard optimization problems in practice, combining techniques such as Mixed Integer Programming, Constraint Programming, SAT solvers, and Meta-Heuristics. My current preferred framework is Adaptive Large Neighborhood Search, which allows me to effectively mix various ideas to obtain high-quality solutions even for complex problems. I describe myself as an algorithm engineer because my strength lies in engineering algorithms with any means necessary. It is difficult to fit me into a single discipline or role, so let me explain the different aspects of my work.

As a software engineer, I write high-quality code and have experience setting up, maintaining, deploying, and managing software projects. Algorithms can become complex and often require frequent iterations, so it is essential to properly modularize them to keep them testable and maintainable. I am comfortable with tools like Git, Docker, and CI pipelines, which help me integrate and deliver solutions efficiently. I am also familiar with low-level details like caching, branch prediction, linking, and mixing languages. While I quickly learn new frameworks, I sometimes need a refresher on topics like design patterns since I am not a full-time developer.

In theoretical computer science, I have a strong foundation, with my Masterโ€™s thesis and much of my PhD work focused on this field. I understand concepts like complexity, reductions, and approximation, and can quickly identify problem types like Set Cover or opportunities for dynamic programming. My Masterโ€™s thesis addressed a notable open problem (#53 of the Open Problems Project), and I have enjoyed working on topics like Minimum Scan Cover, which involved elegant theoretical proofs. However, I have become less interested in lengthy NP-hardness proofs or abstract concepts that do not have practical applications.

In mathematical optimization, I enjoy translating problems into quantifiable mathematical formulations and am familiar with concepts like cutting planes, integrality gaps, duality, symmetry breaking, and decomposition methods. While I might not be fluent in every technical term and might resort to some hand-waving when explaining more complex methods like the ellipsoid method, I am comfortable bending the rules of mathematical precision to achieve practical results.

As an operations researcher, I build efficient models and apply algorithmic techniques, especially when standard approaches fall short. I value the power of meta-heuristics for tasks like warm-starting or providing quick feedback. Although I am not deeply involved in the business aspects and prefer working directly with solvers rather than using modeling languages, I find that I am particularly valuable when a problem requires more than just running a straightforward solve command.

As a data scientist, I regularly work with data using SQL, NoSQL, Pandas, and other frameworks. Data analysis and visualization are essential for the empirical evaluation of algorithms. I often apply techniques from machine learning, such as PCA and clustering for benchmark building, and have successfully used reinforcement learning for an optimization problem where classical methods failed. I take satisfaction in creating clean and well-documented data pipelines, often using tools like Pydantic. However, these are just tools for me, and while I am interested in AI and eager to explore new techniques, my experience with complex machine learning projects is limited.

In my role as an instructor, I have co-designed and taught courses on algorithm engineering, supervised numerous theses, and developed engaging lab exercises, which are my preferred teaching method. I received a lot of positive feedback for the CP-SAT Primer, which started as a cheat sheet but is now close to becoming a complete book. While I find teaching fulfilling, I recognize that it would not be enough to sustain me if it involved repeatedly covering the same material.

As a researcher, I have co-authored numerous papers and enjoy diving deep into new topics. I have presented at various conferences and collaborated with many peers from different fields. However, I often find the academic system frustratingly slow and inefficient. In contrast, I appreciate the faster pace and smoother processes in consulting work, where progress is more tangible and less encumbered by bureaucracy. Nonetheless, I enjoy the freedom academia provides and the collaborative, non-competitive community it fosters.

Outside of my professional roles, I am passionate about powerlifting and take a strategic approach to my training, aiming to maximize gains with minimal time investment. Given that I rarely have more than three 45-minute sessions per week, I face an intriguing optimization challenge: how to make the most progress while minimizing the risk of injury. This involves carefully balancing training variables, despite the noisy feedback from factors like sleep quality, which can significantly impact performance. The challenge of fine-tuning my regimen to account for these variables mirrors the problem-solving mindset I apply in my work.


๐Ÿ”ฌ Research ๐Ÿ“– Publications ๐ŸŽ“ Dissertation
Explore my ongoing research projects. Discover my published works. My dissertation for a coherrent sample of my work (2017-2022).

๐Ÿค Let's Connect!

I am open to research stays and collaborative opportunities to broaden my expertise and contribute to groundbreaking research. Let's work together to solve challenging problems and make a lasting impact.

Dr. Dominik Krupke's Projects

aemeasure icon aemeasure

A macro-benchmarking tool with a serverless database

algbench icon algbench

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

bipartite_vertex_cover icon bipartite_vertex_cover

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

checkmytex icon checkmytex

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

close-enough-tsp icon close-enough-tsp

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

cp-sat-log-analyzer icon cp-sat-log-analyzer

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

cpsat-autotune icon cpsat-autotune

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

cpsat-primer icon cpsat-primer

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

eurocg18-angularft icon eurocg18-angularft

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

flachtex icon flachtex

A simple Python-library to flatten LaTeX

folder_compiler icon folder_compiler

A simple python util to 'compile' a folder, e.g. for static webpages.

mabwiser icon mabwiser

[IJAIT 2021] MABWiser: Contextual Multi-Armed Bandits Library

mlst-inga icon mlst-inga

A Maximum Leaf Spanning Tree (based on Algorithm of Habibi and McLurkin) implemented for INGA-Wireless Sensor Nodes. Leaves of this tree are allowed to go offline and thus safe energy. Additionally energy aware variations of this algorithm, considering the power state of the nodes. Nodes with low energy are more likely to become leaves.

mt icon mt

Master's Thesis of Dominik Krupke

primal_dual_weighted_set_cover icon 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).

skbuild-conan icon skbuild-conan

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

topp icon topp

The Open Problems Project

turncost icon turncost

Implementation of solver for covering grid graphs with minimal turn costs

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.