| 2025 | FCT | Determining the Metric Dimension of K | Valentin Gledel, Gerold Jger |
| 2018 | SAGT | An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. | Gerold Jger, Frank Drewes |
| 2017 | COCOA | Bounds for Static Black-Peg AB Mastermind. | Christian Glazik, Gerold Jger, Jan Schiemann, Anand Srivastav |
| 2016 | COCOA | An Optimal Strategy for Static Black-Peg Mastermind with Two Pegs. | Gerold Jger |
| 2015 | IWOCA | On the Zero Forcing Number of Bijection Graphs. | Denys Shcherbak, Gerold Jger, Lars-Daniel hman |
| 2014 | IWOCA | Playing Several Variants of Mastermind with Constant-Size Memory is not Harder than with Unbounded Memory. | Gerold Jger, Marcin Peczarski |
| 2013 | IWOCA | SAT and IP Based Algorithms for Magic Labeling with Applications. | Gerold Jger |
| 2012 | COCOA | The b-Matching Problem in Hypergraphs: Hardness and Approximability. | Mourad El Ouali, Gerold Jger |
| 2010 | AAIM | Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction. | Christian Ernst, Changxing Dong, Gerold Jger, Dirk Richter, Paul Molitor |
| 2010 | CSR | A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem. | Gerold Jger, Weixiong Zhang |
| 2009 | AAIM | Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges. | Changxing Dong, Gerold Jger, Dirk Richter, Paul Molitor |
| 2009 | ESA | Complete Parsimony Haplotype Inference Problem and Algorithms. | Gerold Jger, Sharlee Climer, Weixiong Zhang |
| 2008 | COCOA | Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order. | Gerold Jger, Paul Molitor |
| 2007 | AAIM | Solving Generalized Maximum Dispersion with Linear Programming. | Gerold Jger, Anand Srivastav, Katja Wolf |
| 2006 | AAIM | Some Basics on Tolerances. | Boris Goldengorin, Gerold Jger, Paul Molitor |