Ingo Wegener

Publication Activity (10 Years)

Years Active: 1978-2011
Publications (10 Years): 0

Publications

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Precision, Local Search and Unimodal Functions. Algorithmica 59 (3) (2011)
Benjamin Doerr, Frank Neumann, Ingo Wegener
Editorial. Algorithmica 57 (1) (2010)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers and the Reals. Comb. Probab. Comput. 19 (5-6) (2010)
Beate Bollig, Niko Range, Ingo Wegener
Exact OBDD Bounds for Some Fundamental Functions. Theory Comput. Syst. 47 (2) (2010)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers CoRR (2008)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Precision, local search and unimodal functions. GECCO (2008)
Beate Bollig, Niko Range, Ingo Wegener
Exact OBDD Bounds for Some Fundamental Functions. SOFSEM (2008)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers. STACS (2008)
Frank Neumann, Ingo Wegener
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theor. Comput. Sci. 378 (1) (2007)
Thomas Jansen, Ingo Wegener
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation. Theor. Comput. Sci. 386 (1-2) (2007)
Ingo Wegener, Philipp Woelfel
New Results on the Complexity of the Middle Bit of Multiplication. Comput. Complex. 16 (3) (2007)
Beate Bollig, Niko Range, Ingo Wegener
Exact OBDD Bounds for some Fundamental Functions. Electron. Colloquium Comput. Complex. 14 (049) (2007)
Robin Nunkesser, Thorsten Bernholt, Holger Schwender, Katja Ickstadt, Ingo Wegener
Detecting high-order interactions of single nucleotide polymorphisms using genetic programming. Bioinform. 23 (24) (2007)
Thorsten Bernholt, Roland Fried, Ursula Gather, Ingo Wegener
Modified repeated median filters. Stat. Comput. 16 (2) (2006)
Stefan Droste, Thomas Jansen, Ingo Wegener
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput. Syst. 39 (4) (2006)
Frank Neumann, Ingo Wegener
Minimum spanning trees made easier via multi-objective optimization. Nat. Comput. 5 (3) (2006)
Oliver Giel, Ingo Wegener
Maximum cardinality matchings on trees by randomized local search. GECCO (2006)
Thomas Jansen, Ingo Wegener
On the analysis of a dynamic evolutionary algorithm. J. Discrete Algorithms 4 (1) (2006)
Thomas Jansen, Ingo Wegener
On the local performance of simulated annealing and the (1+1) evolutionary algorithm. GECCO (2006)
Ingo Wegener, Carsten Witt
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. Comb. Probab. Comput. 14 (1-2) (2005)
Ingo Wegener
Rankings oder Ratings: Warum, wie und durch wen?. Inform. Spektrum 28 (2) (2005)
Ingo Wegener, Carsten Witt
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions. J. Discrete Algorithms 3 (1) (2005)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On converting CNF to DNF. Theor. Comput. Sci. 347 (1-2) (2005)
Simon Fischer, Ingo Wegener
The one-dimensional Ising model: Mutation versus recombination. Theor. Comput. Sci. 344 (2-3) (2005)
Ingo Wegener, Philipp Woelfel
New Results on the Complexity of the Middle Bit of Multiplication. Computational Complexity Conference (2005)
Thomas Jansen, Ingo Wegener
Real royal road functions--where crossover provably is essential. Discret. Appl. Math. 149 (1-3) (2005)
Thomas Jansen, Kenneth A. De Jong, Ingo Wegener
On the Choice of the Offspring Population Size in Evolutionary Algorithms. Evol. Comput. 13 (4) (2005)
Frank Neumann, Ingo Wegener
Minimum spanning trees made easier via multi-objective optimization. GECCO (2005)
Matthias Krause, Petr Savický, Ingo Wegener
On the influence of the variable ordering for algorithmic learning using OBDDs. Inf. Comput. 201 (2) (2005)
Ingo Wegener
Simulated Annealing Beats Metropolis in Combinatorial Optimization. ICALP (2005)
Ingo Wegener
Simulated Annealing Beats Metropolis in Combinatorial Optimization Electron. Colloquium Comput. Complex. (089) (2004)
Oliver Giel, Ingo Wegener
Searching Randomly for Maximum Matchings Electron. Colloquium Comput. Complex. (076) (2004)
Ingo Wegener, Philipp Woelfel
New Results on the Complexity of the Middle Bit of Multiplication Electron. Colloquium Comput. Complex. (107) (2004)
Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. PPSN (2004)
Tobias Storch, Ingo Wegener
Real royal road functions for constant population size. Theor. Comput. Sci. 320 (1) (2004)
Ingo Wegener
BDDs--design, analysis, complexity, and applications. Discret. Appl. Math. 138 (1-2) (2004)
Frank Neumann, Ingo Wegener
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem. GECCO (1) (2004)
Jens Scharnow, Karsten Tinnefeld, Ingo Wegener
The analysis of evolutionary algorithms on sorting and shortest paths problems. J. Math. Model. Algorithms 3 (4) (2004)
Ingo Wegener
Randomized Search Heuristics as an Alternative to Exact Optimization. Logic versus Approximation (2004)
Simon Fischer, Ingo Wegener
The Ising Model on the Ring: Mutation Versus Recombination. GECCO (1) (2004)
Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, Michael Leifhelm, Kai Plociennik, Heiko Röglin, Andrea Schweer, Dirk Sudholt, Stefan Tannenbaum, Ingo Wegener
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. PPSN (2004)
Ingo Wegener
Towards a Theory of Randomized Search Heuristics. MFCS (2003)
Béla Bollobás, Ingo Wegener
The Oberwolfach Meeting On Combinatorics, Probability And Computing. Comb. Probab. Comput. 12 (3) (2003)
Tobias Storch, Ingo Wegener
Real Royal Road Functions for Constant Population Size. GECCO (2003)
Oliver Giel, Ingo Wegener
Evolutionary Algorithms and the Maximum Matching Problem. STACS (2003)
Ingo Wegener, Carsten Witt
On the Optimization of Monotone Polynomials by the (1+1) EA and Randomized Local Search. GECCO (2003)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On Converting CNF to DNF. MFCS (2003)
Beate Bollig, Ingo Wegener
Functions that have read-once branching programs of quadratic size are not necessarily testable. Inf. Process. Lett. 87 (1) (2003)
Martin Dietzfelbinger, Bart Naudts, Clarissa Van Hoyweghen, Ingo Wegener
The analysis of a recombinative hill-climber on H-IFF. IEEE Trans. Evol. Comput. 7 (5) (2003)
Stefan Droste, Thomas Jansen, Ingo Wegener
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization Electron. Colloquium Comput. Complex. (048) (2003)
Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener
On Converting CNF to DNF Electron. Colloquium Comput. Complex. 10 (017) (2003)
Stefan Droste, Thomas Jansen, Ingo Wegener
Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions. Theor. Comput. Sci. 287 (1) (2002)
Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt, Ingo Wegener
Komplexitätstheorie, effiziente Algorithmen und die Bundesliga. Inform. Spektrum 25 (6) (2002)
Jens Scharnow, Karsten Tinnefeld, Ingo Wegener
Fitness Landscapes Based on Sorting and Shortest Paths Problems. PPSN (2002)
Hans-Georg Beyer, Hans-Paul Schwefel, Ingo Wegener
How to analyse evolutionary algorithms. Theor. Comput. Sci. 287 (1) (2002)
Stefan Droste, Thomas Jansen, Karsten Tinnefeld, Ingo Wegener
A New Framework for the Valuation of Algorithms for Black-Box Optimization. FOGA (2002)
Stefan Droste, Thomas Jansen, Ingo Wegener
On the analysis of the (1+1) evolutionary algorithm. Theor. Comput. Sci. 276 (1-2) (2002)
Beate Bollig, Martin Sauerhoff, Ingo Wegener
On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. Inf. Comput. 178 (1) (2002)
Ingo Wegener
A simplified correctness proof for a well-known algorithm computing strongly connected components. Inf. Process. Lett. 83 (1) (2002)
Thomas Jansen, Ingo Wegener
The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. Algorithmica 34 (1) (2002)
Ingo Wegener
Teaching Nondeterminism as a Special Case of Randomization. Informatica Didact. 4 (2001)
Philipp Kersting, Ingo Wegener
Hardware for Basic Arithmetic Operations as a Subject of Computer Science Courses in High Schools. Informatica Didact. 2 (2001)
Beate Bollig, Martin Sauerhoff, Ingo Wegener
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. Computational Complexity Conference (2001)
Detlef Sieling, Ingo Wegener
A Comparison of Free BDDs and Transformed BDDs. Formal Methods Syst. Des. 19 (3) (2001)
Thomas Jansen, Ingo Wegener
Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. Evol. Comput. 5 (6) (2001)
Ingo Wegener
Theoretical Aspects of Evolutionary Algorithms. ICALP (2001)
Jawahar Jain, Ingo Wegener, Masahiro Fujita
A Note on Complexity of OBDD Composition and Efficiency of Partitioned-OBDDs over OBDDs. IEEE Trans. Computers 50 (11) (2001)
Martin Sauerhoff, Ingo Wegener, Ralph Werchner
Optimal ordered binary decision diagrams for read-once formulas. Discret. Appl. Math. 103 (1-3) (2000)
Stefan Droste, Dominic Heutelbeck, Ingo Wegener
Distributed Hybrid Genetic Programming for Learning Boolean Functions. PPSN (2000)
Beate Bollig, Ingo Wegener
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. J. Comput. Syst. Sci. 61 (3) (2000)
Stefan Edelkamp, Ingo Wegener
On the Performance of WEAK-HEAPSORT. STACS (2000)
Stefan Droste, Thomas Jansen, Ingo Wegener
Dynamic Parameter Control in Simple Evolutionary Algorithms. FOGA (2000)
Juraj Hromkovic, Ingo Wegener
Introduction: Workshop on Boolean Functions and Applications. ICALP Satellite Workshops (2000)
Ingo Wegener
On the Expected Runtime and the Success Probability of Evolutionary Algorithms. WG (2000)
Ryuhei Uehara, Kensei Tsuchida, Ingo Wegener
Identification of Partial Disjunction, Parity, and Threshold Functions. Theor. Comput. Sci. 230 (1-2) (2000)
Beate Bollig, Ingo Wegener
Approximability and Nonapproximability by Binary Decision Diagrams Electron. Colloquium Comput. Complex. 7 (52) (2000)
Thomas Jansen, Ingo Wegener
On the Choice of the Mutation Probability for the (1+1) EA. PPSN (2000)
Ingo Wegener
Worst case examples for operations on OBDDs. Inf. Process. Lett. 74 (3-4) (2000)
Jawahar Jain, K. Mohanram, Dinos Moundanos, Ingo Wegener, Yuan Lu
Analysis of composition complexity and how to obtain smaller canonical graphs. DAC (2000)
Beate Bollig, Ingo Wegener
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. ICALP (2000)
Stefan Droste, Thomas Jansen, Ingo Wegener
Perhaps Not a Free Lunch But At Least a Free Appetizer. GECCO (1999)
Paul Fischer, Norbert Klasner, Ingo Wegener
On the Cut-off Point for Combinatorial Group Testing. Discret. Appl. Math. 91 (1-3) (1999)
Beate Bollig, Ingo Wegener
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems Electron. Colloquium Comput. Complex. (48) (1999)
Martin Sauerhoff, Ingo Wegener, Ralph Werchner
Relating Branching Program Size and Formula Size over the Full Binary Basis. STACS (1999)
Matthias Krause, Petr Savický, Ingo Wegener
Approximations by OBDDs and the variable ordering problem Electron. Colloquium Comput. Complex. 6 (11) (1999)
Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener
On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theor. Informatics Appl. 33 (2) (1999)
Stefan Edelkamp, Ingo Wegener
On the performance of WEAK-HEAPSORT Electron. Colloquium Comput. Complex. 6 (28) (1999)
Matthias Krause, Petr Savický, Ingo Wegener
Approximations by OBDDs and the Variable Ordering Problem. ICALP (1999)
Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
On P versus NP cap co-NP for decision trees and read-once branching programs. Comput. Complex. 8 (4) (1999)
Beate Bollig, Ingo Wegener
Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. Theory Comput. Syst. 32 (4) (1999)
Thomas Jansen, Ingo Wegener
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. ESA (1999)
Beate Bollig, Ingo Wegener
A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. Inf. Process. Lett. 66 (2) (1998)
Olaf Schröer, Ingo Wegener
The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours. Formal Methods Syst. Des. 13 (3) (1998)
Stefan Droste, Thomas Jansen, Ingo Wegener
A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs. Evol. Comput. 6 (2) (1998)
Martin Löbbing, Detlef Sieling, Ingo Wegener
Parity OBDDs Cannot be Handled Efficiently Enough. Inf. Process. Lett. 67 (4) (1998)
Beate Bollig, Ingo Wegener
Completeness and Non-Completeness Results with Respect to Read-Once Projections. Inf. Comput. 143 (1) (1998)
Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
IBDDs. Theor. Comput. Sci. 205 (1-2) (1998)
Stefan Droste, Thomas Jansen, Ingo Wegener
On the Optimization of Unimodal Functions with the (1 + 1) Evolutionary Algorithm. PPSN (1998)
Olaf Kyek, Ian Parberry, Ingo Wegener
Bounds on the Number of Knight's Tours. Discret. Appl. Math. 74 (2) (1997)
Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs Electron. Colloquium Comput. Complex. 4 (23) (1997)

Ingo Wegener.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Ingo Wegener