| Publication | Date of Publication | Type |
|---|
Optimal strategies for the static black-peg AB game with two and three pegs
Discrete Mathematics, Algorithms and Applications | 2024-11-13 | Paper |
Assessing the effect of multiple cost changes using reverse set tolerances
Discrete Applied Mathematics | 2024-06-20 | Paper |
Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
Super domination: graph classes, products and enumeration
Discrete Applied Mathematics | 2024-04-02 | Paper |
Enumeration of sets of mutually orthogonal Latin rectangles
The Electronic Journal of Combinatorics | 2024-03-19 | Paper |
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Theoretical Computer Science | 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
Discrete Mathematics | 2021-01-27 | Paper |
The metric dimension of \(\mathbb{Z}_n \times \mathbb{Z}_n \times \mathbb{Z}_n\) is \(\lfloor 3n/2 \rfloor \)
Theoretical Computer Science | 2020-01-16 | Paper |
Triples of orthogonal Latin and Youden rectangles for small orders
Journal of Combinatorial Designs | 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
Discrete Applied Mathematics | 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
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
Journal of Discrete Algorithms | 2016-07-15 | Paper |
On the zero forcing number of bijection graphs
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Bounding memory for Mastermind might not make it harder
Theoretical Computer Science | 2015-07-24 | Paper |
The worst case number of questions in generalized AB game with and without white-peg answers
Discrete Applied Mathematics | 2015-04-28 | Paper |
SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
Journal of Discrete Algorithms | 2015-03-24 | Paper |
SAT and IP based algorithms for magic labeling with applications
Lecture Notes in Computer Science | 2014-01-17 | Paper |
The computational efficiency of Ji-Lee-Li algorithm for the assignment problem
Algorithmic Operations Research | 2013-12-11 | Paper |
The number of pessimistic guesses in generalized black-peg mastermind
Information Processing Letters | 2013-04-04 | Paper |
The \(b\)-matching problem in hypergraphs: hardness and approximability
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem
Journal of Artificial Intelligence Research | 2011-01-21 | Paper |
The number of pessimistic guesses in Generalized Mastermind
Information Processing Letters | 2010-08-16 | Paper |
Finding good tours for huge Euclidean TSP instances by iterative backbone contraction
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
A SAT based effective algorithm for the directed Hamiltonian cycle problem
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Complete Parsimony Haplotype Inference Problem and Algorithms
Lecture Notes in Computer Science | 2009-10-29 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Tolerance-based Algorithms for the Traveling Salesman Problem
Mathematical Programming and Game Theory for Decision Making | 2008-12-01 | Paper |
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP
Combinatorial and Algorithmic Aspects of Networking | 2008-04-15 | Paper |
Some Basics on Tolerances
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Solving Generalized Maximum Dispersion with Linear Programming
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
| An efficient algorithm for graph bisection of triangularizations | 2007-10-29 | Paper |
Improved approximation algorithms for maximum graph partitioning problems
Journal of Combinatorial Optimization | 2006-02-08 | Paper |
Reduction of Smith normal form transformation matrices
Computing | 2005-08-17 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Constructions of sparse asymmetric connectors with number theoretic methods
Networks | 2005-06-01 | Paper |
| Algorithms for the computation of the Smith normal form and their implementation on parallel machines | 2001-09-13 | Paper |
