| 2012 | ||
|---|---|---|
| j13 | Marcus Oswald, Gerhard Reinelt, Stefan Wiesberg: Exact solution of the 2-dimensional grid arrangement problem. Discrete Optimization 9(3): 189-199 (2012) | |
| j12 | Angel Corberán, Marcus Oswald, Isaac Plana, Gerhard Reinelt, José M. Sanchis: New results on the Windy Postman Problem. Math. Program. 132(1-2): 309-332 (2012) | |
| 2011 | ||
| j11 | Steffen Rebennack, Marcus Oswald, Dirk Oliver Theis, Hanna Seitz, Gerhard Reinelt, Panos M. Pardalos: A Branch and Cut solver for the maximum stable set problem. J. Comb. Optim. 21(4): 434-457 (2011) | |
| j10 | Alberto Caprara, Marcus Oswald, Gerhard Reinelt, Robert Schwarz, Emiliano Traversi: Optimal linear arrangements using betweenness variables. Math. Program. Comput. 3(3): 261-280 (2011) | |
| 2010 | ||
| j9 | Gunnar Schramm, Stefan Wiesberg, Nicolle Diessl, Anna-Lena Kranz, Vitalia Sagulenko, Marcus Oswald, Gerhard Reinelt, Frank Westermann, Roland Eils, Rainer König: PathWave: discovering patterns of differentially regulated enzymes in metabolic pathways. Bioinformatics 26(9): 1225-1231 (2010) | |
| j8 | Christoph Buchheim, Frauke Liers, Marcus Oswald: Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. Math. Program. 124(1-2): 513-535 (2010) | |
| 2009 | ||
| j7 | József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt: Improved analysis of an algorithm for the coupled task problem with UET jobs. Oper. Res. Lett. 37(2): 93-96 (2009) | |
| j6 | Marcus Oswald, Gerhard Reinelt: The simultaneous consecutive ones problem. Theor. Comput. Sci. 410(21-23): 1986-1992 (2009) | |
| 2008 | ||
| j5 | Christoph Buchheim, Frauke Liers, Marcus Oswald: Local cuts revisited. Oper. Res. Lett. 36(4): 430-433 (2008) | |
| c9 | Christoph Buchheim, Frauke Liers, Marcus Oswald: A Basic Toolbox for Constrained Quadratic 0/1 Optimization. WEA 2008: 249-262 | |
| 2007 | ||
| j4 | Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis: On the graphical relaxation of the symmetric traveling salesman polytope. Math. Program. 110(1): 175-193 (2007) | |
| c8 | Kitiporn Plaimas, Marcus Oswald, Roland Eils, Rainer König: Integrating Genomic and Transcriptomic Data into Graph Based Approaches for Defining Essential Reactions in the Metabolic Network of Escherichia Coli. LWA 2007: 55-60 | |
| c7 | Frank Noé, Marcus Oswald, Gerhard Reinelt: Optimizing in Graphs with Expensive Computation of Edge Weights. OR 2007: 435-440 | |
| c6 | Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T. Vo, Marcus Oswald, Gerhard Reinelt: Compression of Digital Road Networks. SSTD 2007: 423-440 | |
| 2006 | ||
| j3 | Rainer König, Gunnar Schramm, Marcus Oswald, Hanna Seitz, Sebastian Sager, Marc Zapatka, Gerhard Reinelt, Roland Eils: Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms. BMC Bioinformatics 7: 119 (2006) | |
| c5 | Gunnar Schramm, Marcus Oswald, Hanna Seitz, Sebastian Sager, Marc Zapatka, Gerhard Reinelt, Roland Eils, Rainer König: Pattern recognition of gene expression data on biochemical networks with simple wavelet transforms. LWA 2006: 350-355 | |
| 2005 | ||
| c4 | Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis: Not Every GTSP Facet Induces an STSP Facet. IPCO 2005: 468-482 | |
| 2004 | ||
| j2 | Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt: An exact algorithm for scheduling identical coupled tasks. Math. Meth. of OR 59(2): 193-203 (2004) | |
| 2003 | ||
| j1 | Marcus Oswald, Gerhard Reinelt: The weighted consecutive ones problem for a fixed number of rows or columns. Oper. Res. Lett. 31(3): 350-356 (2003) | |
| 2001 | ||
| c3 | Marcus Oswald, Gerhard Reinelt: Constructing New Facets of the Consecutive Ones Polytope. Combinatorial Optimization 2001: 147-157 | |
| 2000 | ||
| c2 | Marcus Oswald, Gerhard Reinelt: Polyhedral Aspects of the Consecutive Ones Problem. COCOON 2000: 373-382 | |
| 1998 | ||
| c1 | Thomas Christof, Marcus Oswald, Gerhard Reinelt: Consecutive Ones and a Betweenness Problem in Computational Biology. IPCO 1998: 213-228 | |
Data released under the ODC-BY 1.0 license — See also our legal information page