About Me

Me in a picture



  • A Note on the Approximability of Deepest-Descent Circuit Steps Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann

  • Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines Johannes Zink

  • New Bounds on Augmenting Steps of Block-Structured Integer Programs Lin Chen, Lei Xu, Weidong Shi

  • Multi-party Campaigning Nimrod Talmon

  • Scheduling Kernels via Configuration LP Dušan Knop


  • Parameterized Algorithms for MILPs with Small Treedepth Cornelius Brand, Sebastian Ordyniak

  • Multitype Integer Monoid Optimization and Applications Dušan Knop, Asaf Levin, Matthias Mnich, Shmuel Onn

  • Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming Timothy F.N. Chan, Jacob W. Cooper, Daniel Kráľ, Kristýna Pekárková

  • An Algorithmic Theory of Integer Programming Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Asaf Levin, Shmuel Onn


  • Approximating Max-Cut under Graph-MSO Constraints Jon Lee, Viswanath Nagarajan, Xiangkun Shen


  • A Unifying Framework for Manipulation Problems Dušan Knop, Matthias Mnich

  • Opinion Diffusion and Campaigning on Society Graphs Piotr Faliszewski, Rica Gonen, Nimrod Talmon

  • A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs Asaf Levin, Shmuel Onn

  • Evaluating and Tuning n-fold Integer Programming Kateřina Altmanová, Dušan Knop

  • Integer Programming Toolbox (two short articles in June and December 2018 issues of FPT News: The Parameterized Complexity Newsletter)


  • Approximate Shifted Combinatorial Optimization Asaf Levin, Syed M Meesum, Shmuel Onn

  • Integer Programming in Parameterized Complexity: Three/Five Miniatures Tomáš Gavenčiak, Dušan Knop

  • Combinatorial n-Fold Integer Programming and Applications Dušan Knop, Matthias Mnich

  • Parameterized Shifted Combinatorial Optimization Petr Hliněný, Jakub Gajarský, Shmuel Onn

  • Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity (Best Student Paper Award at WG 2017!) Dušan Knop, Tomáš Masařík, Tomáš Toufar

  • Parameterized Resiliency Problems via Integer Linear Programming Jason Crampton, Gregory Gutin, Rémi Watrigant


  • Voting and Bribing in Single-exponential Time Dušan Knop, Matthias Mnich


  • Graver Basis Optimization (a short article in May 2016 issue of FPT News: The Parameterized Complexity Newsletter)

  • Scheduling meets n-fold Integer Programming Dušan Knop


  • Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems Jiří Fiala, Tomáš Gavenčiak, Dušan Knop, Jan Kratochvíl


  • Extension Complexity, MSO Logic, and Treewidth Petr Kolman, Hans Raj Tiwary

  • Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth Petr Kolman


I passed on to you what was most important and what had also been passed on to me. Christ died for our sins, just as the Scriptures said. He was buried, and he was raised from the dead on the third day, just as the Scriptures said. He was seen by Peter and then by the Twelve. After that, he was seen by more than 500 of his followers at one time, most of whom are still alive, though some have died. Then he was seen by James and later by all the apostles. Last of all, as though I had been born at the wrong time, I also saw him.

Paul of Tarsus, The First Epistle to the Corinthians, likely written no more than five years after Jesus' death (one of the oldest New Testament fragments).

I believe this. If you're curious, feel free to ask!