Navigation

Springe zum Hauptinhalt
Professur Algorithmische und Diskrete Mathematik
Veröffentlichungen

Veröffentlichungen

zeitlich absteigend sortiert
LOGO
  1. T. Jahn and M. Winter.
    Vertex-Facet Assignments for Polytopes
    Preprint, arXiv:1812.08640v1, December 2018.

  2. E.M. Borba and U. Schwerdtfeger.
    Eigenvalue Bounds for the Signless p-Laplacian
    Electronic Journal of Combinatorics, Vol. 25, No. 2, 2018.

  3. E.M. Borba, S. Richter and U.Schwerdtfeger.
    Non-linear Generalizations of Eigenvalues of Graph Laplacians and Algebraic Connectivity
    Preprint 2017-06, Technische Universität Chemnitz, Fakultät für Mathematik, December 2017.

  4. C. Helmberg and A. Pichler.
    Dynamic Scaling and Submodel Selection in Bundle Methods for Convex Optimization
    Preprint 2017-04, Technische Universität Chemnitz, Fakultät für Mathematik, August 2017.
     
  5. C. Helmberg, U. Schwerdtfeger, I. Rocha.
    A Combinatorial Algorithm for Minimizing the Maximum Laplacian Eigenvalue of Weighted Bipartite Graphs,
    SIAM J. Discrete Math., Vol. 31, No. 2, pp. 1196–1216, 2017.
    (Preprint 2015-12, Technische Universität Chemnitz, Fakultät für Mathematik, July 2015.)
     
  6. C. Helmberg, V. Trevisan.
    Spectral threshold dominance, Brouwer's Conjecture and maximality of Laplacian energy,
    Linear Algebra and its Applications, Volume 512, 1 January 2017, Pages 18-31.
    (Preprint 2015-08, Technische Universität Chemnitz, Fakultät für Mathematik, June 2015)
     
  7. S. Richter, I. Rocha.
    Layout of random circulant graphs
    (Preprint 2017-02, Technische Universität Chemnitz, Fakultät für Mathematik, July 2017)
     
  8. E. M. Borba, E. Fritscher, C. Hoppen, S. Richter.
    The p-spectral radius of the Laplacian matrix
    (Preprint 2017-01, Technische Universität Chemnitz, Fakultät für Mathematik, July 2017.)
     
  9. S. Richter, I. Rocha.
    Absolute algebraic connectivity of double brooms
    Discrete Applied Mathematics 201(2016)213-221.
    (Preprint 2014-10, Technische Universität Chemnitz, Fakultät für Mathematik, July 2014.)
     
  10. J. Harant, S. Richter.
    A new eigenvalue bound for independent sets
    Discrete mathematics, Volume 338, Issue 10, October 2015, Pages 1763–1765.
    (Preprint 2014-08, Technische Universität Chemnitz, Fakultät für Mathematik, June 2014.)
     
  11. C. Helmberg, V. Trevisan.
    Threshold Graphs of Maximal Laplacian Energy
    Discrete Mathematics, Vol. 338 (7), 1075 - 1084, July 2015.
    (Preprint 2014-02, Technische Universität Chemnitz, Fakultät für Mathematik, January 2014).
     
  12. C. Helmberg, S. Richter, D. Schupke.
    A Chance Constraint Model for Multi-Failure Resilience in Communication Networks,
    Preprint 2015-09, Technische Universität Chemnitz, Fakultät für Mathematik, June 2015.
     
  13. J. Harant, J. Niebling, and S. Richter
    Eigenvalue conditions for induced subgraphs
    Discussiones Mathematicae Graph Theory 35(2015)355-363.
    (Preprint 2014-12, Technische Universität Chemnitz, Fakultät für Mathematik, July 2014.)
     
  14. C. Helmberg, M. L. Overton, and F. Rendl.
    The Spectral Bundle Method with Second-Order Information
    Optimization Methods and Software,Volume 29, Issue 4, July 2014 (DOI: 10.1080/10556788.2013.858155)
    (Preprint 2012-10, Technische Universität Chemnitz, Fakultät für Mathematik, September 2012.)
     
  15. F. Fischer, C. Helmberg.
    A Parallel Bundle Framework for Asynchronous Subspace Optimisation of Nonsmooth Convex Functions
    SIAM J. Optim, Vol. 24, No. 2, pp. 795-822, 2014.
    (Preprint 2013-08, Technische Universität Chemnitz, Fakultät für Mathematik, July 2013)
     
  16. F. Fischer, C. Helmberg.
    Dynamic Graph Generation for the Shortest Path Problem in Time Expanded Networks
    Mathematical Programming A, Volume 143, Issue 1-2, pp 257-297, February 2014, DOI: 10.1007/s10107-012-0610-3
     
  17. A. Fischer, C. Helmberg.
    The Symmetric Quadratic Traveling Salesman Problem
    Mathematical Programming A, Volume 142, Issue 1-2, pp 205-254, December 2013, DOI: 10.1007/s10107-012-0568-1
    (Preprint 2011-08, Technische Universität Chemnitz, Fakultät für Mathematik, April 2011.)
     
  18. A. Fischer, F. Fischer.
    Complete description for the spanning tree problem with one linearised quadratic term
    Operations Research Letters, Volume 41, Issue 6, November 2013, Pages 701–705, DOI: 10.1016/j.orl.2013.09.011
     
  19. A. Fischer.
    A Polyhedral Study of Quadratic Traveling Salesman Problems
    PhD Thesis, Chemnitz University of Technology, July 2013.
     
  20. F. Fischer.
    Dynamic Graph Generation and an Asynchronous Parallel Bundle Method Motivated by Train Timetabling
    PhD Thesis, Chemnitz University of Technology, July 2013.
     
  21. A. Fischer, F. Fischer.
    An extended approach for lifting clique tree inequalities
    Journal of Combinatorial Optimization (2013), DOI: 10.1007/s10878-013-9647-3
    (Preprint 2012-13, Technische Universität Chemnitz, Fakultät für Mathematik, November 2012)
     
  22. F. Göring, C. Helmberg, and S. Reiss.
    On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations
    SIAM J. Optim. (2013), Vol. 23, No. 2, pp. 834-856, DOI: 10.1137/110859658.
    (Preprint 2011-04, Technische Universität Chemnitz, Fakultät für Mathematik, Februar 2011)
     
  23. M. Armbruster, M. Fügenschuh, C. Helmberg, and A. Martin.
    LP and SDP Branch-and-Cut Algorithms for the Minimum Graph Bisection Problem: A Computational Comparison
    Mathematical Programming C, 4(3) 2012, 275-306, DOI: 10.1007/s12532-012-0040-5
    (Preprint 2011-6, Technische Universität Chemnitz, Fakultät für Mathematik, March 2011.)
     
  24. S. Reiß.
    Optimizing Extremal Eigenvalues of Weighted Graph Laplacians and Associated Graph Realizations
    PhD Thesis, Chemnitz University of Technology, August 2012.
     
  25. F. Fischer, C. Helmberg
    A Parallel Bundle Method for Asynchronous Subspace Optimization in Lagrangian Relaxation
    Preprint 2012-02, Technische Universität Chemnitz, Fakultät für Mathematik, February 2012.
     
  26. F. Göring, C. Helmberg, and S. Reiss.
    Graph Realizations Associated with Minimizing the Maximum Eigenvalue of the Laplacian
    Mathematical Programming A, 131(1-2) 2012, 95-111. DOI: 10.1007/s10107-010-0344-z
    (Preprint 2009-10, Technische Universität Chemnitz, Fakultät für Mathematik, May 2009.)
     
  27. A. Fischer
    The Asymmetric Quadratic Traveling Salesman Problem
    Preprint 2011-19, Technische Universität Chemnitz, Fakultät für Mathematik, December 2011.
     
  28. 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.
     
  29. 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.)
     
  30. 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.
     
  31. 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.
     
  32. 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.
     
  33. 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.)
     
  34. 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.
     
  35. C. Helmberg.
    Network Models with Convex Cost Structure like Bundle Methods
    Proceedings of Dagstuhl Seminar 09261 - Models and Algorithms for Optimization in Logistics, 2009.
     
  36. 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.
     
  37. 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.
     
  38. 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.)
     
  39. 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.)
     
  40. 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.
     
  41. 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
     
  42. 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
     
  43. 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)
     
  44. M. Armbruster.
    Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems,
    PhD Thesis, Chemnitz University of Technology, 2007.
     
  45. 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.
     
  46. 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).
     
  47. F.Göring, T. Gerlach, J. Harant, M.Tká?.
    On cycles through specified vertices
    Discrete Mathematics 306(2006) 831-835.
     
  48. F.Göring.
    Mader Tools ,
    DMTCS , Proceedings of EuroComb 2005.
     
  49. F.Göring, J. Harant.
    On domination in graphs
    Discussiones Mathematicae, Graph Theory 25 (2005) 7-12
     
  50. F. Göring, J. Harant, E. Hexel, Zs.Tuza.
    On short cycles through prescribed vertices of a graph,
    Discrete Mathematics 286 (2004), 67-74.

Presseartikel