Dr. Marcus Oswald

Institut für Informatik
Universität Heidelberg
Im Neuenheimer Feld 368
D - 69120 Heidelberg
 
Consultation Hours: Wednesday 10.30 - 11.30
 
Office: Room 106, 1st floor
Phone: +49 (0)6221 54-5746
Fax: +49 (0)6221 54-5750
Email: Marcus.Oswald@informatik.uni-heidelberg.de


Scientific Interests

Branch-and-Cut, Branch-and-Bound, Coupled Task Problem, Linear Ordering Problem, Linear Arrangement Problem, Betweenness Problem, Consecutive Ones Problem, PQ-trees

Publications 

  • Path Wave: A tool for gene set enrichment analyses on metabolic networks
    (G. Schramm, S. Wiesberg, N. Diessl, V. Sagulenko, M. Oswald, G. Reinelt, F. Wetermann, R. Eils , R. König)
    Technical Report, 2009
     
  • The Geometry of the Graphical Relaxation of the Symmetric Traveling Salesman Polytope
    (M. Oswald, G. Reinelt, D.O. Theis)
    Technical Report, 2009
     
  • Using Discrete Optimzation for Designing Dental Shade Guides
    (C. Cocking, S. Helling, M. Oswald, P. Rammelsberg, G. Reinelt, A. Hassel)
    To appear in: Color Research and Application, 2009
     
  • The Simultaneous Consecutive Ones Problem
    (M. Oswald, G. Reinelt)
    To appear in: Theoretical Computer Science, 2009
     
  • Improved Analysis of an Algorithm for the Coupled Task Problem with UET Jobs
    (J. Békési, G. Galambos, M. Oswald, G. Reinelt)
    To appear in: Operations Research Letters, 2008
     
  • Applying Mod-k-Cuts for Solving Linear Ordering Problems
    (M. Oswald, G. Reinelt, H. Seitz)
    Submitted to TOP, 2008
     
  • Optimizing in graphs with expensive computation of edge weights
    (F. Noé, M. Oswald, G. Reinelt)
    In: J. Kalcsics and S. Nickel (Eds): Operations Research Proceedings 2007, Selected Papers of OR'2007, Saarbrücken, September 5-7, 2007, 435-440, Springer (2008)
     
  • Discovering functional gene expression patterns in the metabolic network of Escherichia coli with wavelets transforms
    (R. Konig, G. Schramm, M. Oswald, H. Seitz, S. Sager, M. Zapatka, G. Reinelt, R. Eils)
    BMC Bioinformatics 7:119, 2006, reference DOI: 10.1186/1471-2105-7-119

  • Not every GTSP facet induces an STSP facet
    (M. Oswald, D.O. Theis, G. Reinelt)
    Proc. of the 11th Conference on Integer Programming & Combinatorial Optimization (IPCO XI), Berlin, June 08-10, 2005 Springer, 2005, 468-482

  • An Exact Algorithm for Scheduling Identical Coupled Tasks
    (D. Ahr, J. Békési, G. Galambos, M. Oswald, G. Reinelt) 
    Mathematical Methods of Operations Research 59(2), 2004, 193-203

  • Computing Optimal Consecutive Ones Matrices
    (M. Oswald, G. Reinelt) 
    M. Gr÷tschel (ed.): The Sharpest Cut, The Impact of Manfred Padberg and His Work
    MPS/SIAM, Series on Optimization, 2004, 173-184


  • Selected Papers of the International Conference on Operations Research 2003 (OR'03), Heidelberg, September 3-5 2003
    (D. Ahr, R. Fahrion, M. Oswald, G. Reinelt (eds.)) 
    Springer, 2004


  • The Weighted Consecutive Ones Problem for a Fixed Number of Rows or Columns.
    (M. Oswald, G. Reinelt)
    Operations Research Letters 31, 2003, 350-356


  • Constructing New Facets of the Consecutive Ones Polytope.
    (M. Oswald, G. Reinelt)
    M. J’nger et al (eds.) Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds 5th International Workshop, Aussois, France, March 5-9, 2001, Springer, 2003, 147-157


  • Some Relations Between Consecutive Ones and Betweenness Polytopes.
    (M. Oswald, G. Reinelt)
    P. Chamoni et al (eds.) Operations Research Proceedings 2001, Selected Papers of OR³01, Springer, 277-283


  • Polyhedral Aspects of the Consecutive Ones Problem
    (M. Oswald, G. Reinelt)
    Proc. of the 6th Annual International Conference on Computing and Combinatorics, (COCOON 2000), Sydney, Australia, July 26-28 2000,
    Lecture Notes in Computer Science 1858, Springer, 2000, 373-382


  • Polyhedral Aspects of the Consecutive Ones Problem
    (M. Oswald, G. Reinelt) 
    Selected Papers of the Symposium on Operations Research Proceedings 1999, (SOR'99), September 1-3 1999, Magdeburg,
    Springer, 2000, 81-85
     
  • Consecutive Ones and a Betweenness Problem in Computational Biology
    (T.Christof, M. Oswald, G. Reinelt)
    Proc. of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO 98), 1998
    Lecture Notes in Computer Science 1412, Springer, 1998, 213-228


  • PQ-Bäume im Branch-and-Cut-Ansatz für das Physical-Mapping-Problem mit Endprobes 
    (M. Oswald)
    Diplomarbeit, Universität Heidelberg, 1997

Back Top
Research Group Computer Science and Discrete Optimization
Last Update 14.01.2010
webmaster: comopt@informatik.uni-heidelberg.de