Studieren in Chemnitz. Wissen, was gut ist.






  • Anmelden

Veröffentlichungen

zeitlich absteigend sortiert

Logo

 

 

 

  1. F. Göring, C. Helmberg, and S. Reiss.
    Graph Realizations Associated with Minimizing the Maximum Eigenvalue of the Laplacian
    Mathematical Programming, Volume 131, Issue 1 (2012), Page 95 - 111.
    (Preprint 2009-10, Technische Universität Chemnitz, Fakultät für Mathematik, May 2009.)
     
  2. A. Fischer
    The Asymmetric Quadratic Traveling Salesman Problem
    Preprint 2011-19, Technische Universität Chemnitz, Fakultät für Mathematik, December 2011.
     
  3. F. Fischer, C. Helmberg.
    Dynamic Graph Generation for Large Scale Operational Train Timetabling
    Preprint 2011-10, Technische Universität Chemnitz, Fakultät für Mathematik, Juli 2011.
     
  4. A. Fischer, C. Helmberg.
    The Symmetric Quadratic Traveling Salesman Problem
    Preprint 2011-08, Technische Universität Chemnitz, Fakultät für Mathematik, April 2011.
     
  5. M. Armbruster, C. Helmberg, M. Fügenschuh, and A. Martin.
    LP and SDP Branch-and-Cut Algorithms for the Minimum Graph Bisection Problem: A Computational Comparison
    Preprint 2011-6, Technische Universität Chemnitz, Fakultät für Mathematik, March 2011.
     
  6. F. Göring, C. Helmberg, and S. Reiss.
    On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations
    Preprint 2011-04, Technische Universität Chemnitz, Fakultät für Mathematik, Februar 2011.
     
  7. F. Göring, C. Helmberg, and M. Wappler.
    The Rotational Dimension of a Graph
    Journal of Graph Theory, Volume 66, Issue 4, April 2011, pp. 283-302.
    (Preprint 2008-16, Technische Universität Chemnitz, Fakultät für Mathematik,October 2008.)
     
  8. F. Fischer and C. Helmberg.
    Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
    Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, T. Erlebach and M. Lübbecke (Eds.), OpenAccess Series in Informatics (OASIcs) 14, Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Germany, Sep. 2010, pp. 45--60.
     
  9. F. Göring, J. Harant
    Prescribed edges and forbidden edges for a cycle in a planar graph
    Preprint 2010-17, Technische Universität Chemnitz, Fakultät für Mathematik, September 2010.
     
  10. F. Göring, J. Harant
    Hamiltonian cycles through prescribed edges of at least 4-connected maximal planar graphs
    Discrete mathematics, Volume 310, Issue 9, May 2010, Pages 1491 - 1494.
     
  11. C. Helmberg and S. Reiss.
    A note on Fiedler vectors interpreted as graph realizations
    Operations Research Letters, Volume 38, Issue 4, July 2010, Pages 320-321.
    (Preprint 2010-1, Technische Universität Chemnitz, Fakultät für Mathematik, January 2010.)
     
  12. F. Fischer, G. Jäger, A. Lau, and P. Molitor.
    Complexity and Algorithms for the Traveling Salesman Problem and the Assignment Problem of Second Order
    Preprint 2009-16, Technische Universität Chemnitz, Fakultät für Mathematik, October 2009.
     
  13. C. Helmberg.
    Network Models with Convex Cost Structure like Bundle Methods
    Proceedings of Dagstuhl Seminar 09261 - Models and Algorithms for Optimization in Logistics, 2009.
     
  14. F. Fischer, C. Helmberg, J. Janßen, B. Krostitz
    Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation
    Proceedings of 8th Workshop on Algorithmic Methods and Models for Optimization of Railways, September 2008.
     
  15. S.Artmann, F.Göring, J.Harant, D.Rautenbach, I.Schiermeyer
    Random Procedures for Dominating Sets in Graphs
    Preprint 2008-10, Technische Universität Chemnitz, Fakultät für Mathematik, Mai 2008.
     
  16. M. Armbruster, M. Fügenschuh, C. Helmberg, A. Martin.
    On the Graph Bisection Cut Polytope
    SIAM J. Discrete Math. (2008), Vol. 22, No. 3, pp. 1073-1098.
    (Preprint 2006-20, Technische Universität Chemnitz, Fakultät für Mathematik, November 2006.)
     
  17. F. Göring, C. Helmberg, M. Wappler.
    Embedded in the Shadow of the Separator
    SIAM J. Optim. (2008), Vol. 19, No. 1, pp. 472-501.
    (Preprint 2005-12, Technische Universität Chemnitz, Fakultät für Mathematik, September 2005.)
     
  18. M. Armbruster, M. Fügenschuh, C. Helmberg, and A. Martin.
    A comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
    Integer Programming and Combinatorial Optimization, Proceedings of the 13th International IPCO Conference, Bertinoro, Italy, May 2008, A. Lodi, A. Panconesi, G. Rinaldi (Eds.), Lecture Notes in Computer Science 5035, Springer 2008, pp. 112-124.
     
  19. F. Göring, J. Harant, D.Rautenbach, I.Schiermeyer.
    Locally Dense Independent Sets in Regular Graphs of Large Girth
    Preprint 2007-19, Technische Universität Chemnitz, Fakultät für Mathematik, Oktober 2007
     
  20. F. Göring, J. Harant, D.Rautenbach, I.Schiermeyer.
    On F-Independence in Graphs
    Preprint 2007-18, Technische Universität Chemnitz, Fakultät für Mathematik, Oktober 2007
     
  21. C. Helmberg, S. Röhl.
    A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses
    Operations Research 55(4), 733-752, 2007
    (Preprint 2005-3, Technische Universität Chemnitz, Fakultät für Mathematik, January 2005)
     
  22. M. Armbruster.
    Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems,
    PhD Thesis, Chemnitz University of Technology, 2007.
     
  23. T. Böhme, F. Göring, Zs.Tuza, Herwig Unger.
    Learning of Winning Strategies for Terminal Games with Linear-Size Memory
    Preprint 2006-25, Technische Universität Chemnitz, Fakultät für Mathematik, Dezember 2006.
     
  24. F. Göring, Gyula Y. Katona.
    Local topological toughness
    Graphs and Combinatorics.23(2007) 387-399
    (Preprint 2006-24, Technische Universität Chemnitz, Fakultät für Mathematik, Dezember 2006).
     
  25. F.Göring, T. Gerlach, J. Harant, M.Tká?.
    On cycles through specified vertices
    Discrete Mathematics 306(2006) 831-835.
     
  26. F.Göring.
    Mader Tools ,
    DMTCS , Proceedings of EuroComb 2005.
     
  27. F.Göring, J. Harant.
    On domination in graphs
    Discussiones Mathematicae, Graph Theory 25 (2005) 7-12
     
  28. F. Göring, J. Harant, E. Hexel, Zs.Tuza.
    On short cycles through prescribed vertices of a graph,
    Discrete Mathematics 286 (2004), 67-74.
     
Valid HTML 4.0 Transitional