Michael Armbruster Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison. Math. Program. Comput. 4(3): 275-306 (2012)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Vladimir Rupanov, Christian Buckl, Ludger Fiege, Michael Armbruster, Alois Knoll, Gernot Spiegelberg: Early safety evaluation of design decisions in E/E architecture according to ISO 26262. ISARCS 2012: 1-10
2011
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Reinhard Reichel, Michael Armbruster: X-by-Wire Plattform - Konzept und Auslegung. Automatisierungstechnik 59(9): 583- (2011)
2008
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Armbruster, Christoph Helmberg, Marzena Fügenschuh, Alexander Martin: On the Graph Bisection Cut Polytope. SIAM J. Discrete Math. 22(3): 1073-1098 (2008)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Alexander Martin: A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem. IPCO 2008: 112-124
2006
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin: Hybrid Genetic Algorithm Within Branch-and-Cut for the Minimum Graph Bisection Problem. EvoCOP 2006: 1-12
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Armbruster, Erik Zimmer, Matthias Lehmann, Reinhard Reichel, E. Sieglin, Gernot Spiegelberg, Armin Sulzmann: Affordable X-By-Wire technology based on an innovative, scalable E/E platform-concept. VTC Spring 2006: 3016-3020
2005
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Oliver Rooks, Michael Armbruster, Armin Sulzmann, Gernot Spiegelberg, Uwe Kiencke: Duo duplex drive-by-wire computer system. Rel. Eng. & Sys. Safety 89(1): 71-80 (2005)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Armbruster, Marzena Fügenschuh, Christoph Helmberg, Nikolay Jetchev, Alexander Martin: LP-based Genetic Algorithm for the Minimum Graph Bisection Problem. OR 2005: 315-320
2003
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Oliver Rooks, Michael Armbruster, S. Büchli, Armin Sulzmann, Gernot Spiegelberg, Uwe Kiencke: Redundancy Management for Drive-by-Wire Computer Systems. SAFECOMP 2003: 249-262
2002
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael Armbruster: A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry. European Journal of Operational Research 141(2): 328-340 (2002)

Coauthor Index

1Christian Buckl
[c6]
2S. Büchli
[c1]
3Ludger Fiege
[c6]
4Marzena Fügenschuh
[j5] [j3] [c5] [c4] [c2]
5Christoph Helmberg
[j5] [j3] [c5] [c4] [c2]
6Nikolay Jetchev
[c4] [c2]
7Uwe Kiencke
[j2] [c1]
8Alois Knoll
[c6]
9Matthias Lehmann
[c3]
10Alexander Martin
[j5] [j3] [c5] [c4] [c2]
11Reinhard Reichel
[j4] [c3]
12Oliver Rooks
[j2] [c1]
13Vladimir Rupanov
[c6]
14E. Sieglin
[c3]
15Gernot Spiegelberg
[c6] [c3] [j2] [c1]
16Armin Sulzmann
[c3] [j2] [c1]
17Erik Zimmer
[c3]

Colors in the list of coauthors

Last update Fri May 24 05:28:21 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page