| 2008 | GECCO | Precision, local search and unimodal functions. | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
| 2008 | STACS | Tight Bounds for Blind Search on the Integers. | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
| 2008 | SOFSEM | Exact OBDD Bounds for Some Fundamental Functions. | Beate Bollig, Niko Range, Ingo Wegener |
| 2006 | GECCO | Maximum cardinality matchings on trees by randomized local search. | Oliver Giel, Ingo Wegener |
| 2006 | GECCO | On the local performance of simulated annealing and the (1+1) evolutionary algorithm. | Thomas Jansen, Ingo Wegener |
| 2005 | GECCO | Minimum spanning trees made easier via multi-objective optimization. | Frank Neumann, Ingo Wegener |
| 2005 | ICALP | Simulated Annealing Beats Metropolis in Combinatorial Optimization. | Ingo Wegener |
| 2004 | GECCO | The Ising Model on the Ring: Mutation Versus Recombination. | Simon Fischer, Ingo Wegener |
| 2004 | GECCO | Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. | Frank Neumann, Ingo Wegener |
| 2004 | PPSN | Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. | Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Rglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener |
| 2004 | PPSN | The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. | Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Rglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener |
| 2003 | GECCO | Real Royal Road Functions for Constant Population Size. | Tobias Storch, Ingo Wegener |
| 2003 | GECCO | On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. | Ingo Wegener, Carsten Witt |
| 2003 | MFCS | On Converting CNF to DNF. | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
| 2003 | MFCS | Towards a Theory of Randomized Search Heuristics. | Ingo Wegener |
| 2003 | STACS | Evolutionary Algorithms and the Maximum Matching Problem. | Oliver Giel, Ingo Wegener |
| 2002 | FOGA | A New Framework for the Valuation of Algorithms for Black-Box Optimization. | Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener |
| 2002 | PPSN | Fitness Landscapes Based on Sorting and Shortest Paths Problems. | Jens Scharnow, Karsten Tinnefeld, Ingo Wegener |
| 2001 | ICALP | Theoretical Aspects of Evolutionary Algorithms. | Ingo Wegener |
| 2000 | DAC | Analysis of composition complexity and how to obtain smaller canonical graphs. | Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo Wegener, Yuan Lu |
| 2000 | FOGA | Dynamic Parameter Control in Simple Evolutionary Algorithms. | Stefan Droste, Thomas Jansen, Ingo Wegener |
| 2000 | ICALP | Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. | Beate Bollig, Ingo Wegener |
| 2000 | ICALP | Introduction: Workshop on Boolean Functions and Applications. | Juraj Hromkovic, Ingo Wegener |
| 2000 | PPSN | Distributed Hybrid Genetic Programming for Learning Boolean Functions. | Stefan Droste, Dominic Heutelbeck, Ingo Wegener |
| 2000 | PPSN | On the Choice of the Mutation Probability for the (1+1) EA. | Thomas Jansen, Ingo Wegener |
| 2000 | STACS | On the Performance of WEAK-HEAPSORT. | Stefan Edelkamp, Ingo Wegener |
| 2000 | WG | On the Expected Runtime and the Success Probability of Evolutionary Algorithms. | Ingo Wegener |
| 1999 | ESA | On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. | Thomas Jansen, Ingo Wegener |
| 1999 | GECCO | Perhaps Not a Free Lunch But At Least a Free Appetizer. | Stefan Droste, Thomas Jansen, Ingo Wegener |
| 1999 | ICALP | Approximations by OBDDs and the Variable Ordering Problem. | Matthias Krause, Petr Savick, Ingo Wegener |
| 1999 | STACS | Relating Branching Program Size and Formula Size over the Full Binary Basis. | Martin Sauerhoff, Ingo Wegener, Ralph Werchner |
| 1998 | PPSN | On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. | Stefan Droste, Thomas Jansen, Ingo Wegener |
| 1997 | MFCS | Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. | Beate Bollig, Ingo Wegener |
| 1997 | MFCS | On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. | Stasys Jukna, Alexander A. Razborov, Petr Savick, Ingo Wegener |
| 1996 | STACS | Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. | Beate Bollig, Ingo Wegener |
| 1994 | WG | New Lower Bounds and Hierarchy Results for Restricted Branching Programs. | Detlef Sieling, Ingo Wegener |
| 1993 | WG | The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. | Ingo Wegener |
| 1991 | STACS | The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n. | Ingo Wegener |
| 1990 | MFCS | Bottom-Up-Heap Sort, a New Variant of Heap Sort Beating on Average Quick Sort (if n is not very small). | Ingo Wegener |
| 1990 | MFCS | Symmetric Functions in AC | Ingo Wegener, Norbert Wurm, Sang-Zin Yi |
| 1988 | CSL | A Remark on Minimal Polynomials of Boolean Functions. | Bernd Voigt, Ingo Wegener |
| 1987 | CSL | The Conjunctive Complexity of Quadratic Boolean Functions. | Katja Lenz, Ingo Wegener |
| 1986 | MFCS | Properties of Complexity Measures for PRAMs and WRAMs. | Siegfried Bublitz, Ute Schrfeld, Bernd Voigt, Ingo Wegener |
| 1985 | FCT | The critical complexity of all (monotone) Boolean functions and monotone graph properties. | Ingo Wegener |
| 1984 | MFCS | On the Complexity of Slice Functions. | Ingo Wegener |
| 1978 | STOC | Switching Functions Whose Monotone Complexity Is Nearly Quadratic | Ingo Wegener |