Aktuelle Veröffentlichungen

Petra Schwille, Joachim Spatz, Katharina Landfester, Eberhard Bodenschatz, Stephan Herminghaus,Victor Sourjik, Tobias Erb, Philippe Bastiaens, Reinhard Lipowsky, Anthony Hyman, Peter Dabrock, Jean-Christophe Baret, Tanja Vidakovic-Koch, Peter Bieling, Rumiana Dimova, Hannes Mutschler, Tom Robinson,Dora Tang, Seraphine Wegner, Kai Sundmacher
MaxSynBio ‐ Avenues towards creating cells from the bottom up
Angewandte Chemie, 11 May 2018
DOI: 10.1002/ange.201802288

Peter Benner, Venera Khoromskaia, and Boris N. Khoromskij
Range-Separated Tensor Format for Many-Particle Modeling
SIAM Journal on Scientific Computing, Vol. 40, Issue 2, 2018, pp. A1034–A1062.
DOI: 10.1137/16M1098930

Hannes K. Buchholz, Matthias Stein
Accurate lattice energies of organic molecular crystals from periodic turbomole calculations
Journal of Computational Chemistry, 5. März 2018, DOI: 10.1002/jcc.25205

Xing Liu, Justin M. Reitsma, Jennifer L. Mamrosh, Yaru Zhang, Ronny Straube, Raymond J. Deshaies
Cand1-mediated adaptive exchange mechanism enables variation in F-box protein expression
Molecular Cell, Volume 69, Issue 5, pp 773 - 786, 1. März 2018
DOI: 10.1016/j.molcel.2018.01.038

Susann Triemer, Kerry Gilmore, Giang T. Vu, Peter H. Seeberger, Andreas Seidel-Morgenstern
Literally green chemical synthesis of artemisinin from plant extracts
Angewandte Chemie International Edition, 21. Februar 2018
DOI: 10.1002/anie.201801424

Zu ausgewählten Publikationen ...

Veranstaltungen

Willkommen am Max-Planck-Institut Magdeburg

Nachrichten

MALOC Event Series

3439 1446721298

Magdeburg Lectures on Optimization and Control: No Small Linear Program Approximates Vertex Cover within a Factor 2-ε

The vertex cover problem is one of the most important and intensively studied combinatorial optimization problems. Khot and Regev (2003) proved that the problem is NP-hard to approximate within a factor 2-ε, assuming Khot's famous Unique Games Conjecture (UGC). This is tight because the problem has an easy 2-approximation algorithm. We prove the following unconditional result about linear programming (LP) relaxations of the problem: every LP relaxation that approximates vertex cover within a factor 2-ε has super-polynomially many inequalities. [mehr]

MALOC Event Series

3889 1452171036

Magdeburg Lectures on Optimization and Control: "Concepts of Function Space Oriented Optimization"

Many large scale nonlinear optimization problems are discretizations of optimization problems in function space and thus, we expect that additional functional analytic structure should be present. The goal of function space oriented optimization is to exploit this structure. This may comprise the efficient computation of steps by iterative solvers, problem suited globalization strategies, or the use of adaptive mesh refinement inside an optimization method. In this talk we will give an overview of a couple of ideas, and explain at concrete examples how they can be implemented. Short CV Anton Shiela is a professor for applied mathematics at the University of Bayreuth. His fields of research are optimization with PDEs, in particular the development of algorithms for the solution of optimization problems in function space. Before moving to Bayreuth in 2014, he was an associate professor at Technische Universitaet Hamburg-Harburg (2013-2014) and Matheon junior reseach group leader at TU Berlin (2012-2013). He got his PhD in 2007 at Zuse Institute Berlin, where he worked as a reasearch assistant (2002-2012). [mehr]

Magdeburg Lectures on Optimization and Control: Computation and uncertainty — The past, present and future of control

Magdeburg Lectures on Optimization and Control: Matchings and Matroids in Algorithmic Game Theory

Promotionskolloquium: Systematic Methods for Reaction Solvent Design and Integrated Solvent and Process Design

Prof. Dr. Uwe J. Meierhenrich, Kometenmission Rosetta: Analytisch-chemische Experimente auf dem Kern des Kometen

 
Zur Redakteursansicht
loading content