Prof. Dr. rer. nat. habil. Torsten Sander

• Seit 2010
  Professur für Wirtschaftsinformatik an der Ostfalia Hochschule für angewandte Wissenschaften.
• 2009
  Habilitation Fachrichtung Mathematik an der TU Clausthal
• 2004
  Promotion Fachrichtung Mathematik an der TU Clausthal
• 1999
  Abschluss Studium Fachrichtung Technomathematik an der TU Clausthal

Interessensgebiete

• E-Learning / E-Teaching
• Software Engineering & Development
• Betriebliche Prozesse / Prozessqualität / Assessment
• Computational Geometry
• Diskrete Mathematik und Optimierung
• Algebraische Graphentheorie
   

IT-Sicherheit (Online, B.Sc.)

• Datenbanken (seit WS2016/17)
• Einführung in die sichere Softwareentwicklung (seit SS2024)
• Hardware-Sicherheit (seit SS2025)
• Retro-Computing (WPF, seit WS2024/25)

Wirtschaftsinformatik (Online, B.Sc.)

• Datenbanken (seit WS2016/17)
• Retro-Computing (WPF, seit WS2024/25)
• Operations Research (seit SS2011)
• Wirtschaftsinformatik-Projekt/Labor (seit WS2010/11)
• Projektphase/Praxisprojekt (siehe Moodle-Kurs "Projektphase (FHBSWF WINF)")

Wirtschaftsinformatik (Online, M.Sc.)

• Quantitative Entscheidungslehre (seit WS2014/15)
   

1. J.W. Sander and T. Sander, Characterisation of all integral circulant graphs with multiplicative divisor sets and few eigenvalues, J. Algebr. Comb. (2023) (Full Text)
2. M. Abudayah, O. Alomari and T. Sander, Incidence matrices and line graphs of mixed graphs, Special Matrices, Vol. 11 (2023), pp.20220176 (Full Text)
3. M. Abudayah, O. Alomari and T. Sander, Hermitian Adjacency Matrices of Mixed Graphs, Eur. J. Pure Appl. Math., Vol. 15 (2022), pp. 841-855 (Full Text)
4. M. Abudayah, O. Alomari and T. Sander, On the N-spectrum of oriented graphs, Open Math., Vol. 18 (2020), pp. 486-495 (Full Text)
5. O. Alomari, M. Abudayah and T. Sander, The non-negative spectrum of a digraph, Open Math., Vol. 18 (2020), pp. 22-35 (Full Text)
6. M. Abudayah, O. Alomari and T. Sander, Spectrum of free-form Sudoku graphs, Open Math., Vol. 16 (2018), pp. 1445-1454 (Full Text)
7. O. Alomari, M. Abudayah and T. Sander, Integral Free-Form Sudoku Graphs, Electron. Notes Discrete Math., Vol. 68 (2018), pp. 47-52 (Abstract)
8. W. Klotz and T. Sander, Wie kommt Sudoku zu ganzzahligen Eigenwerten? Ch.8 in: Jörn Steuding and Klaus Volkert, Facetten der Mathematik. 85 Jahre Mathematische Semesterberichte., Springer Spektrum, 2018
9. W. Klotz and T. Sander, Uniquely Colorable Cayley Graphs, Ars Math. Contemp., Vol. 12 (2017), pp. 145-155 (Full Text)
10. J.W. Sander and T. Sander, Recent developments on the edge between number theory and graph theory, Ch.24 in: Jürgen Sander et al. (eds.), From Arithmetic to Zeta-Functions, Springer, 2016
11. J.W. Sander and T. Sander, On So's conjecture for integral circulant graphs, Appl. Anal. Discrete Math., Vol. 9 (2015), pp. 59-72 (Full Text)
12. T. Sander and K.H. Nazzal, Minimum flows in the total graph of a finite commutative ring, Trans. Comb., Vol. 3 (2014), pp. 11-20 (Full Text)
13. J.W. Sander and T. Sander, The exact maximal energy of integral circulant graphs with prime power order, Contrib. Discrete Math., Vol.8 (2013), pp. 19-40 (Full Text)
14. W. Klotz and T. Sander, Gcd-graphs and NEPS of complete graphs, Ars Math. Contemp., Vol. 6 (2013), pp. 289-299 (Full Text)
15. J.W. Sander and T. Sander, Adding generators in cyclic groups, J. Number Theory, Vol. 133 (2013), pp. 705-718 (Full text, Preprint)
16. W. Klotz and T. Sander, Distance Powers and Distance Matrices of Integral Cayley Graphs over Abelian Groups, Electr. J. Combin., Vol. 19 (2012), Research Paper P25, 8 pp. (electronic). (Full Text, Longer Preprint)
17. J.W. Sander and T. Sander, The maximal energy of classes of integral circulant graphs, Discrete Appl. Math., Vol.160 (2012), pp.2015-2029 (Full text, Preprint)
18. W. Klotz and T. Sander, Pandiagonal Sudokus, Electr. J. Combin., Vol. 19 (2012), Research Paper P18, 13 pp. (electronic). (Full text)
19. J.W. Sander and T. Sander, Integral circulant graphs of prime power order with maximal energy, Linear Algebra Appl., Vol. 435 (2011), pp. 3212-3232 (Full text, Preprint).
20. W. Klotz and T. Sander, Integral Cayley graphs defined by greatest common divisors, Electr. J. Combin., Vol. 18 (2011), Research Paper P94, 15 pp. (electronic). (Full text)
21. J.W. Sander and T. Sander, The energy of integral circulant graphs with prime power order, Appl. Anal. Discrete Math., Vol. 5 (2011), pp. 22-36 (Full text)
22. W. Klotz and T. Sander, Wie kommt Sudoku zu ganzzahligen Eigenwerten?, Math. Semesterber., Vol. 57 (2010), pp. 169-183. (Full text)
23. W. Klotz and T. Sander, Integral Cayley graphs over abelian groups, Electr. J. Combin., Vol. 17 (2010), Research Paper R81, 13 pp. (electronic). (Full text)
24. T. Sander, Eigenspaces of Hamming Graphs and Unitary Cayley Graphs, Ars Math. Contemp., Vol. 3 (2010), pp. 13-19. (Full text)
25. J.W. Sander and T. Sander, On the eigenvalues of distance powers of circuits, Linear Algebra Appl., Vol. 432 (2010), pp. 3132-3140. (Full text, Preprint)
26. J.W. Sander and T. Sander, On the Kernel of the Coprime Graph of Integers. Integers, Vol. 9 (2009) (Full text)
27. T. Sander and P. Wehner, On A* search with stopover areas, International Journal of Geographical Information Science, Vol. 23, No. 6, (2009), pp. 799-819 (Abstract)
28. T. Sander, Sudoku Graphs are Integral, Electronic J. Combin., Vol. 16 (2009), Research Note N25, 7 pp. (electronic) (Full text)
29. T. Sander, Inclusion Relations of Certain Graph Eigenspaces, Rocky Mountain J. Math., Vol. 39, No. 3 (2009), pp. 937-946 (Full Text)
30. T. Sander and J.W. Sander, Tree decomposition by eigenvectors, Linear Algebra Appl., Vol. 430 (2009), pp. 133-144 (Full text, Preprint)
31. T. Sander, On Certain Eigenspaces of Cographs, Electronic J. Combin., Vol. 15 (2008), Research Paper R140, 8 pp. (electronic) (Full text)
32. T. Sander, Singular distance powers of circuits, Tokyo J. Math., Vol. 4, No. 1 (2007), pp. 491-498. (Full Text)
33. W. Klotz, T. Sander, Some properties of unitary Cayley graphs, Electron. J. Combin., Vol. 14 (2007), Research Paper R45, 12 pp. (electronic). (Full text)
34. T. Sander, J. W. Sander, On Simply Structured Kernel Bases of Unicyclic Graphs, AKCE J. Graphs Combin., Vol. 4, No. 1 (2007), pp. 61-82. (Full text)
35. J. W. Sander and T. Sander, On Simply Structured Bases of Tree Kernels, AKCE J. Graphs Combin., Vol. 2, No. 1 (2005), pp. 45-56. (Full text)