| 2026 | EvoCOP | A Denoising Diffusion Adaptive Search for the α-Domination Problem on Social Graphs. | Martin Wustinger, Enrico Iurlano, Gnther R. Raidl |
| 2026 | GECCO | Evolutionary Computation meets Machine Learning for Combinatorial Optimisation. | Yi Mei, Gnther R. Raidl |
| 2026 | INOC | Putting Tutte's counterexample to Tait's conjecture in perspective to Hamiltonicity and non-Hamiltonicity in certain planar cubic graphs. | Herbert Fleischner, Enrico Iurlano, Gnther R. Raidl |
| 2026 | PPSN | Determining Destroy Sets in Large Neighborhood Search by Generative Flow Networks. | Maria Bresich, Jingyi Peng, Gnther R. Raidl, Steffen Limmer |
| 2026 | PPSN | SAT-Based Search for Minwise Independent Families. | Enrico Iurlano, Gnther R. Raidl |
| 2025 | CEC | Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problem. | William Huang, Yi Mei, Gnther R. Raidl, Fangfang Zhang, Laurenz Tomandl, Steffen Limmer, Mengjie Zhang, Tobias Rodemann |
| 2025 | ECAI | A Hybrid CMSA-Column Generation Approach to Variable-Sized Bin Packing. | Mehmet Anil Akbay, Christian Blum, Gnther R. Raidl |
| 2025 | FCT | Complexity of Positive Influence Domination on Partial Grids. | Enrico Iurlano, Gnther R. Raidl |
| 2025 | GECCO | Evolutionary Computation meets Machine Learning for Combinatorial Optimisation. | Yi Mei, Gnther R. Raidl |
| 2024 | EvoCOP | A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem. | Jaume Reixach, Christian Blum, Marko Djukanovic, Gnther R. Raidl |
| 2024 | GECCO | Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion. | Maria Bresich, Gnther R. Raidl, Steffen Limmer |
| 2024 | GECCO | Evolutionary Computation meets Machine Learning for Combinatorial Optimisation. | Yi Mei, Gnther R. Raidl |
| 2023 | GECCO | Multi-Objective Policy Evolution for a Same-Day Delivery Problem with Soft Deadlines. | Nikolaus Frohner, Gnther R. Raidl, Francisco Chicano |
| 2022 | CPAIOR | A Learning Large Neighborhood Search for the Staff Rerostering Problem. | Fabio Francisco Oberweger, Gnther R. Raidl, Elina Rnnberg, Marc Huber |
| 2022 | SoCS | Parallel Beam Search for Combinatorial Optimization (Extended Abstract). | Nikolaus Frohner, Jan Gmys, Nouredine Melab, Gnther R. Raidl, El-Ghazali Talbi |
| 2021 | CPAIOR | Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems. | Adrian Bracher, Nikolaus Frohner, Gnther R. Raidl |
| 2021 | CPAIOR | A | Matthias Horn, Gnther R. Raidl |
| 2020 | PPSN | A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. | Thomas Kaufmann, Matthias Horn, Gnther R. Raidl |
| 2015 | INISTA | On solving the most strings with few bad columns problem: An ILP model and heuristics. | Evelia Lizrraga, Maria J. Blesa, Christian Blum, Gnther R. Raidl |
| 2014 | PPSN | Balancing Bicycle Sharing Systems: An Analysis of Path Relinking and Recombination within a GRASP Hybrid. | Petrina Papazek, Christian Kloimllner, Bin Hu, Gnther R. Raidl |
| 2014 | PPSN | A Memetic Algorithm for Multi Layer Hierarchical Ring Network Design. | Christian Schauer, Gnther R. Raidl |
| 2012 | CPAIOR | Hybrid Heuristics for Multimodal Homecare Scheduling. | Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger, Gnther R. Raidl |
| 2012 | GECCO | An evolutionary algorithm with solution archives and bounding extension for the generalized minimum spanning tree problem. | Bin Hu, Gnther R. Raidl |
| 2012 | PPSN | Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design. | Christian Schauer, Gnther R. Raidl |
| 2011 | FedCSIS | A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application. | Andreas M. Chwatal, Corinna Thni, Karin Oberlechner, Gnther R. Raidl |
| 2011 | INOC | Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints. | Johannes Infhr, Gnther R. Raidl |
| 2011 | INOC | Stabilized Branch-and-Price for the Rooted Delay-Constrained Steiner Tree Problem. | Markus Leitner, Mario Ruthmair, Gnther R. Raidl |
| 2011 | IPCO | A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems. | Mario Ruthmair, Gnther R. Raidl |
| 2010 | GECCO | Fitting multi-planet transit models to photometric time-data series by evolution strategies. | Andreas M. Chwatal, Gnther R. Raidl, Michael Zch |
| 2010 | PPSN | Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem. | Mario Ruthmair, Gnther R. Raidl |
| 2010 | RCIS | Similarity Searching in Sequences of Complex Events. | Hannes Obweger, Martin Suntinger, Josef Schiefer, Gnther R. Raidl |
| 2009 | GECCO | Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances. | Martin Gruber, Gnther R. Raidl |
| 2009 | GECCO | Meta-heuristics for reconstructing cross cut shredded text documents. | Matthias Prandtstetter, Gnther R. Raidl |
| 2009 | HIS | A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem. | Bin Hu, Gnther R. Raidl |
| 2008 | GECCO | Finding consensus trees by evolutionary, variable neighborhood search, and hybrid algorithms. | Sandro Pirkwieser, Gnther R. Raidl |
| 2008 | HIS | Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem. | Bin Hu, Gnther R. Raidl |
| 2006 | GECCO | Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO. | Martin Gruber, Jano I. van Hemert, Gnther R. Raidl |
| 2005 | IWINAC | Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification. | Jakob Puchinger, Gnther R. Raidl |
| 2004 | GECCO | Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. | Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra Mutzel, Philipp Neuner, Ulrich Pferschy, Gnther R. Raidl, Ren Weiskircher |
| 2004 | PPSN | An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem. | Gabriele Koller, Gnther R. Raidl |
| 2004 | PPSN | An Evolutionary Algorithm for Column Generation in Integer Programming: An Effective Approach for 2D Bin Packing. | Jakob Puchinger, Gnther R. Raidl |
| 2004 | SAC | An improved hybrid genetic algorithm for the generalized assignment problem. | Harald Feltl, Gnther R. Raidl |
| 2003 | SAC | Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. | Gnther R. Raidl, Bryant A. Julstrom |
| 2002 | CEC | Letting ants labeling point features [sic.: for 'labeling' read 'label']. | Michael Schreyer, Gnther R. Raidl |
| 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 |
| 2002 | SAC | Evolutionary computation and optimization track: SAC 2002. | Roger L. Wainwright, Gnther R. Raidl |
| 2001 | SAC | Weight-biased edge-crossover in evolutionary algorithms for wto graph problems. | Bryant A. Julstrom, Gnther R. Raidl |
| 2001 | SAC | Evolutionary computation and optimization track. | Roger L. Wainwright, Gnther R. Raidl |
| 2000 | CEC | An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. | Gnther R. Raidl |
| 2000 | GECCO | The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search. | Jens Gottlieb, Gnther R. Raidl |
| 2000 | PPSN | A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. | Ivana Ljubic, Gnther R. Raidl, Jozef Kratica |
| 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 | Weight-codings in a genetic algorithm for the multi-constraint knapsack problem. | Gnther R. Raidl |
| 1999 | SAC | A Weight-Coded Genetic Algorithm for the Multiple Container Packing Problem. | Gnther R. Raidl |
| 1998 | PPSN | Genetic Algorithms for the Multiple Container Packing Problem. | Gnther R. Raidl, Gabriele Kodydek |
| 1997 | ICEC | Finding a perceptual uniform color space with evolution strategies. | Gnther R. Raidl, Ingeborg Tastl |