| Publication | Date of Publication | Type |
|---|
| Optimal strategies for the static black-peg AB game with two and three pegs | 2024-11-13 | Paper |
| Assessing the effect of multiple cost changes using reverse set tolerances | 2024-06-20 | Paper |
| Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs | 2024-04-18 | Paper |
| Super domination: graph classes, products and enumeration | 2024-04-02 | Paper |
| Enumeration of sets of mutually orthogonal Latin rectangles | 2024-03-19 | Paper |
| Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems | 2022-10-24 | Paper |
| Optimal Strategies for Static Black-Peg AB Game With Two and Three Pegs | 2022-10-10 | Paper |
| Bounds for the static permutation mastermind game | 2021-01-27 | Paper |
| The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \) | 2020-01-16 | Paper |
| Triples of orthogonal Latin and Youden rectangles for small orders | 2019-07-19 | Paper |
| An optimal strategy for static black-peg mastermind with three pegs | 2018-11-08 | Paper |
| Extending single tolerances to set tolerances | 2018-09-06 | Paper |
| Bounds for static black-peg AB mastermind | 2018-03-26 | Paper |
| An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs | 2017-02-01 | Paper |
| The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability | 2016-07-15 | Paper |
| On the Zero Forcing Number of Bijection Graphs | 2016-04-04 | Paper |
| Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory | 2015-09-15 | Paper |
| Bounding memory for Mastermind might not make it harder | 2015-07-24 | Paper |
| The worst case number of questions in generalized AB game with and without white-peg answers | 2015-04-28 | Paper |
| SAT and IP based algorithms for magic labeling including a complete search for total magic labelings | 2015-03-24 | Paper |
| SAT and IP Based Algorithms for Magic Labeling with Applications | 2014-01-17 | Paper |
| The computational efficiency of Ji-Lee-Li algorithm for the assignment problem | 2013-12-11 | Paper |
| The number of pessimistic guesses in generalized black-peg mastermind | 2013-04-04 | Paper |
| The b-Matching Problem in Hypergraphs: Hardness and Approximability | 2012-11-02 | Paper |
| An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem | 2011-01-21 | Paper |
| The number of pessimistic guesses in Generalized Mastermind | 2010-08-16 | Paper |
| Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction | 2010-07-20 | Paper |
| A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem | 2010-06-22 | Paper |
| Complete Parsimony Haplotype Inference Problem and Algorithms | 2009-10-29 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order | 2009-01-27 | Paper |
| Tolerance-based Algorithms for the Traveling Salesman Problem | 2008-12-01 | Paper |
| Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP | 2008-04-17 | Paper |
| Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP | 2008-04-15 | Paper |
| Some Basics on Tolerances | 2008-01-04 | Paper |
| Solving Generalized Maximum Dispersion with Linear Programming | 2008-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5422563 | 2007-10-29 | Paper |
| Improved approximation algorithms for maximum graph partitioning problems | 2006-02-08 | Paper |
| Reduction of Smith normal form transformation matrices | 2005-08-17 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Constructions of sparse asymmetric connectors with number theoretic methods | 2005-06-01 | Paper |
| Algorithms for the computation of the Smith normal form and their implementation on parallel machines | 2001-09-13 | Paper |
