Travelled to:1 × Czech Republic
1 × Greece
1 × Portugal
1 × Switzerland
2 × Germany
2 × USA
Collaborated with:∅ B.Bollig B.Voigt K.Lenz M.Krause P.Savický J.Jain K.Mohanram D.Moundanos Y.Lu
Talks about:function (4) complex (4) obdd (3) quadrat (2) problem (2) boolean (2) optim (2) evolutionari (1) combinatori (1) metropoli (1)
Person: Ingo Wegener
DBLP: Wegener:Ingo
Facilitated 2 volumes:
EdEdContributed to:
20052001
200020001999
19881987
1978
1987Wrote 9 papers:
- ICALP-2005-Wegener #combinator #optimisation
- Simulated Annealing Beats Metropolis in Combinatorial Optimization (IW), pp. 589–601.
- ICALP-2001-Wegener #algorithm #aspect-oriented
- Theoretical Aspects of Evolutionary Algorithms (IW), pp. 64–78.
- DAC-2000-JainMMWL #analysis #canonical #complexity #composition #graph #how
- Analysis of composition complexity and how to obtain smaller canonical graphs (JJ, KM, DM, IW, YL), pp. 681–686.
- ICALP-2000-BolligW #bound #problem
- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (BB, IW), pp. 187–198.
- ICALP-1999-KrauseSW #approximate #problem
- Approximations by OBDDs and the Variable Ordering Problem (MK, PS, IW), pp. 493–502.
- CSL-1988-VoigtW
- A Remark on Minimal Polynomials of Boolean Functions (BV, IW), pp. 372–383.
- CSL-1987-LenzW #complexity #polynomial
- The Conjunctive Complexity of Quadratic Boolean Functions (KL, IW), pp. 138–150.
- STOC-1978-Wegener #complexity #polynomial
- Switching Functions Whose Monotone Complexity Is Nearly Quadratic (IW), pp. 143–149.
- CAAP-1987-Wegener #branch #clique #complexity #on the #source code
- On the Complexity of Branching Programs and Decision Trees for Clique Functions (IW), pp. 1–12.