Erich Prisner

Erich Prisner

Professor, Mathematics and Computing

Habilitation, Universität Hamburg, Germany
Ph.D. Universität Hamburg, Germany
Diploma (M.A.) Universität Hamburg, Germany

Office: Lowerre Academic Center, North Campus, Office 11
Phone: +41 91 986 36 55
eprisner@fus.edu

View Profile Page

Profile:

The teaching and research experience of Professor Prisner includes the University of Louisville, the University of Maryland University College (Schwäbisch Gmünd), the Technical University of Cottbus (Germany), the Technical University of Berlin, and Franklin University Switzerland. Dr. Prisner has published extensively on intersection graphs and graph-theoretic operators, to include a book on graph dynamics. A recipient of numerous research awards and grants, he also has been particularly active in integrating information technology in his teaching.

2019-2020 Courses:

MAT 103College AlgebraFALL 2019
MAT 115TMeasuring the AlpsFALL 2019
MAT 200CalculusFALL 2019
MAT 109Introduction to Game TheorySPRING 2020
MAT 200CalculusSPRING 2020
MAT 307Multivariable Calculus and Linear AlgebraSPRING 2020
CPT 150Intro Computer ProgrammingSUMMER 2020

Publications:

“Best Response Digraphs for Two Location Games on Graphs”, in: Contributions to Game Theory and Management. Vol. IV (Petrosyan, Leon A. et al. ed.), Collected  papers of the 4th international conference game theory and management (GTM 2010), June 28-30, 2010, St. Petersburg, Russia, 378-388 (2011).

Radius versus diameter in co comparability and intersection graphs, Discrete Mathematics 163 (1997) 109-117.

Intersection multigraphs of uniform hypergraphs, Graphs and Comb. 14 (1998) 363-376.

Recognizing clique graphs of directed and rooted path graphs, (joint work with Jayme L. Szwarcfiter), Discrete Applied Mathematics 94 (1999) 321-328.

Generalized octahedra and cliques in intersection graphs of uniform hypergraphs, Discrete Mathematics 206 (1999) 187-195.

Recognizing k-path graphs, Discrete Appl. Mathematics 99 (2000) 169-182.

Bicliques in graphs I: Bounds on their number, Combinatorica 20 (2000) 109-117.

Source reversal and chip firing on graphs (joint work with E. Goles), Theoret. Comput. Sci. 233 (2000) 287-295.

A note on k-rotation graphs, Ars Combinatoria 55 (2000), 289-292.

Eccentricity-approximating trees in chordal graphs, Discrete Mathematics 220 (2000) 263-269.

Recognizing random intersection graphs, Discrete Math. 223 (2000) 263-274.

Eulerian iterated line graphs and digraphs, Discrete Math. 236 (2001) 315-323.

Additive tree spanners, (joint work with Dieter Kratsch, Hoàng-Oanh Le, Haiko Müller, Dorothea Wagner), SIAM J. Discrete Math. Fall 2003

The recognition problem for line bigraphs, Discrete Math. 268, No.1-3, 243-256 (2003).

Additive tree spanners, (joint work with D. Kratsch, Hoang-Oanh Le, H. Mueller, D. Wagner), SIAM J. Discrete Math. 17 (2003) 332-340;

Selected papers from the 1st international workshop on algorithms, combinatorics, and optimization in interconnnection networks (IWACOIN'99), co-guest editor (together with Roger Labahn and Art Liestman) of a special issue of Discrete Appl. Math. 137, (2004) 125-236;

k-Pseudosnakes in n-dimensional Hypercubes, Discrete Math. 17C (2004) 237-240.

AT-free graphs: Linear bounds for the oriented diameter, (joint work with Fedor Fomin, Martin Matamala, Ivan Rapaport), Discrete Appl. Math. 141 (2004) 135-148.