| 2012 | GECCO | Clans and cooperation in the iterated prisoner's dilemma. | Bryant A. Julstrom |
| 2012 | GECCO | Naive and heuristic permutation-coded genetic algorithms for the quadratic knapsack problem. | Bryant A. Julstrom |
| 2012 | GECCO | Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic. | Michael Porta, Bryant A. Julstrom |
| 2010 | GECCO | Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem. | Justin Benjamin, Bryant A. Julstrom |
| 2009 | GECCO | Evolving heuristically difficult instances of combinatorial problems. | Bryant A. Julstrom |
| 2009 | GECCO | Evolutionary codings and operators for the terminal assignment problem. | Bryant A. Julstrom |
| 2009 | GECCO | A data-based coding of candidate strings in the closest string problem. | Bryant A. Julstrom |
| 2009 | GECCO | String- and permutation-coded genetic algorithms for the static weapon-target assignment problem. | Bryant A. Julstrom |
| 2008 | GECCO | An evolutionary algorithm for some cases of the single-source constrained plant location problem. | Bryant A. Julstrom |
| 2008 | GECCO | Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problem. | Arindam Khaled, Bryant A. Julstrom |
| 2008 | SAC | Special track on Applications of Evolutionary Computation: editorial message. | Bryant A. Julstrom |
| 2006 | GECCO | Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming. | Jason Amunrud, Bryant A. Julstrom |
| 2006 | GECCO | The quadratic multiple knapsack problem and three heuristic approaches to it. | Amanda Hiley, Bryant A. Julstrom |
| 2006 | GECCO | A genetic algorithm for the longest common subsequence problem. | Brenda Hinkemeyer, Bryant A. Julstrom |
| 2006 | GECCO | An effective genetic algorithm for the minimum-label spanning tree problem. | Jeremiah Nummela, Bryant A. Julstrom |
| 2006 | PPSN | Starting from Scratch: Growing Longest Common Subsequences with Evolution. | Bryant A. Julstrom, Brenda Hinkemeyer |
| 2006 | SAC | Editorial message: track on applications of evolutionary computation. | Bryant A. Julstrom |
| 2005 | GECCO | The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem. | Bryant A. Julstrom |
| 2005 | GECCO | Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. | Bryant A. Julstrom |
| 2005 | GECCO | Evolving petri nets to represent metabolic pathways. | Jeremiah Nummela, Bryant A. Julstrom |
| 2005 | SAC | Call me e-mail: arranging the keyboard with a permutation-coded genetic algorithm. | Jeffrey S. Goettl, Alexander W. Brugh, Bryant A. Julstrom |
| 2005 | SAC | Editorial message: special track on applications of evolutionary computation. | Bryant A. Julstrom |
| 2004 | GECCO | Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. | Bryant A. Julstrom |
| 2004 | GECCO | Three Evolutionary Codings of Rectilinear Steiner Arborescences. | Bryant A. Julstrom, Athos Antoniades |
| 2004 | GECCO | How Are We Doing? Predicting Evolutionary Algorithm Performance. | Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Julstrom |
| 2004 | SAC | Editorial message: special track on evolutionary computation and optimization. | Bryant A. Julstrom |
| 2004 | SAC | Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. | Bryant A. Julstrom, Athos Antoniades |
| 2003 | GECCO | Evolutionary Algorithms for Two Problems from the Calculus of Variations. | Bryant A. Julstrom |
| 2003 | SAC | A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles. | Rita M. Hare, Bryant A. Julstrom |
| 2003 | SAC | Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. | Gnther R. Raidl, Bryant A. Julstrom |
| 2002 | CEC | A scalable genetic algorithm for the rectilinear Steiner problem. | Bryant A. Julstrom |
| 2002 | GECCO | Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. | Bryant A. Julstrom |
| 2002 | PPSN | On Weight-Biased Mutation for Graph Problems. | Gnther R. Raidl, Gabriele Kodydek, Bryant A. Julstrom |
| 2002 | SAC | Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges. | Bryant A. Julstrom, Gnther R. Raidl |
| 2001 | SAC | Encoding rectilinear Steiner trees as lists of edges. | Bryant A. Julstrom |
| 2001 | SAC | Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. | Bryant A. Julstrom, Gnther R. Raidl |
| 2000 | CEC | Simulating exponential normalization with weighted k-tournaments. | Bryant A. Julstrom, David H. Robinson |
| 2000 | SAC | A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. | Gnther R. Raidl, Bryant A. Julstrom |
| 1999 | CEC | It's all the same to me: revisiting rank-based probabilities and tournaments. | Bryant A. Julstrom |
| 1999 | SAC | Coding TSP Tours as Permutations via an Insertion Heuristic. | Bryant A. Julstrom |
| 1998 | SAC | A weight-coded genetic algorithm for the minimum weight triangulation problem. | Kerry Capp, Bryant A. Julstrom |
| 1998 | SAC | Comparing decoding algorithms in a weight-coded GA for TSP. | Bryant A. Julstrom |
| 1997 | ICEC | Design of vector quantization codebooks using a genetic algorithm. | Yiaowei Zheng, Bryant A. Julstrom, Weidong Cheng |
| 1997 | SAC | Adaptive operator probabilities in a genetic algorithm that applies three operators. | Bryant A. Julstrom |
| 1996 | SAC | Representing rectilinear Steiner trees in genetic algorithms. | Bryant A. Julstrom |
| 1996 | SAC | Evolutionary discovery of DFA size and structure. | Bryant A. Julstrom |
| 1995 | SAC | Very greedy crossover in a genetic algorithm for the traveling salesman problem. | Bryant A. Julstrom |
| 1994 | SAC | Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem. | Bryant A. Julstrom |