Wilfried Imrich

Wilfried Imrich (born May 25, 1941) is an Austrian mathematician working mainly in graph theory. He is known for his work on graph products, and authored the books Product Graphs: Structure and Recognition (Wiley, 2000, with Sandi Klavžar),[1] Topics in graph theory: Graphs and their Cartesian Products (AK Peters, 2008, with Klavžar and Douglas F. Rall),[2] and Handbook of Product Graphs (2nd ed., CRC, 2011, with Klavžar and Richard Hammack).[3]

Wilfried Imrich
Born	(1941-05-25)25 May 1941 Vienna, Austria
Nationality	Austrian
Alma mater	University of Vienna
Scientific career
Fields	Mathematics
Institutions	Applied mathematics at Montanuniversität Leoben

== Biography ==

Imrich earned his doctorate from the University of Vienna in 1965, under the joint supervision of Nikolaus Hofreiter and Edmund Hlawka.[4] He has worked as a researcher for IBM in Vienna, as an assistant professor at the Technical University of Vienna and the University at Albany, SUNY, as a postdoctoral researcher at Lomonosov University, and, since 1973, as a full professor at the University of Leoben in Austria.[5] He retired in 2009, becoming a professor emeritus at Leoben.[6] He is on board of advisors of the journal Ars Mathematica Contemporanea. Since 2012 he has been a member of the Academia Europaea.[5]

Structure of finite and infinite graphs, combinatorial group theory, graph automorphisms, and graph algorithms are part of his research interests. Wilfried Imrich is also a member of the Beirat of the Austrian Mathematical Society and was Dean of Graduate Studies from 2001-2003, and at Montanuniversitat Leoben, head of the Computer Center.

== Mathematical Contributions ==

2009

Richard H. Hammack, Wilfried Imrich: On Cartesian skeletons of graphs. Ars Math. Contemp. 2(2): 191-205 (2009)

Kannan Balakrishnan, Bostjan Bresar, Manoj Changat, Wilfried Imrich, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi: On the remoteness function in median graphs. Discret. Appl. Math. 157(18): 3679-3688 (2009)

Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler: Approximate graph products. Eur. J. Comb. 30(5): 1119-1133 (2009)

Wilfried Imrich, Matjaz Kovse: Lattice embeddings of trees. Eur. J. Comb. 30(5): 1142-1148 (2009)

Wilfried Imrich, Sandi Klavzar: Transitive, Locally Finite Median Graphs with Finite Blocks. Graphs Comb. 25(1): 81-90 (2009)

Marc Hellmuth, Wilfried Imrich, Werner Klöckl, Peter F. Stadler: Local Algorithms for the Prime Factorization of Strong Product Graphs. Mathematics in Computer Science 2(4): 653-682 (2009)

2008

Wilfried Imrich, Janja Jerebic, Sandi Klavzar: The distinguishing number of Cartesian products of complete graphs. Eur. J. Comb. 29(4): 922-929 (2008)

Wilfried Imrich, Tomaz Pisanski: Multiple Kronecker covering graphs. Eur. J. Comb. 29(5): 1116-1122 (2008)

2007

Wilfried Imrich, Sandi Klavzar, Vladimir Ivanovich Trofimov: Distinguishing Infinite Graphs. Electr. J. Comb. 14(1) (2007)

Wilfried Imrich, Sandi Klavzar, Douglas F. Rall: Cancellation properties of products of graphs. Discret. Appl. Math. 155(17): 2362-2364 (2007)

Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Petra Zigert: Fast recognition of classes of almost-median graphs. Discret. Math. 307(3-5): 464-471 (2007)

Wilfried Imrich, Iztok Peterin: Recognizing Cartesian products in linear time. Discret. Math. 307(3-5): 472-483 (2007)

Wilfried Imrich, Werner Klöckl: Factoring directed graphs with respect to the cardinal product in polynomial time. Discuss. Math. Graph Theory 27(3): 593-601 (2007)

2006

Wilfried Imrich, Douglas F. Rall: Finite and infinite hypercubes as direct products. Australas. J Comb. 36: 83-90 (2006)

Wilfried Imrich, Peter F. Stadler: A prime factor theorem for a generalized direct product. Discuss. Math. Graph Theory 26(1): 135-140 (2006)

Wilfried Imrich, Sandi Klavzar: Distinguishing Cartesian powers of graphs. Journal of Graph Theory 53(3): 250-260 (2006)

2005

Bostjan Bresar, Wilfried Imrich, Sandi Klavzar: Reconstructing subgraph-counting graph polynomials of increasing families of graphs. Discret. Math. 297(1-3): 159-166 (2005)

Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Blaz Zmazek: Hypercubes As Direct Products. SIAM J. Discret. Math. 18(4): 778-786 (2005)

2003

Bostjan Bresar, Wilfried Imrich, Sandi Klavzar: Fast recognition algorithms for classes of partial cubes. Discret. Appl. Math. 131(1): 51-61 (2003)

Bostjan Bresar, Wilfried Imrich, Sandi Klavzar: Tree-like isometric subgraphs of hypercubes. Discuss. Math. Graph Theory 23(2): 227-240 (2003)

Wilfried Imrich, Blaz Zmazek, Janez Zerovnik: Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23(2): 273-285 (2003)

Wilfried Imrich, Riste Skrekovski: A theorem on integer flows on cartesian products of graphs. Journal of Graph Theory 43(2): 93-98 (2003)

2002

Wilfried Imrich, Peter F. Stadler: Minimum cycle bases of product graphs. Australas. J Comb. 26: 233-244 (2002)

Bostjan Bresar, Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovski: Tiled partial cubes. Journal of Graph Theory 40(2): 91-103 (2002)

2001

Wilfried Imrich, Blaz Zniazek, Janez Zerovnik: Weak k-reconstruction of cartesian product graphs. Electron. Notes Discret. Math. 10: 297-300 (2001)

Ervin Györi, Wilfried Imrich: On the Strong Product of a k-Extendable and an l-Extendable Graph. Graphs Comb. 17(2): 245-253 (2001)

1999

Wilfried Imrich, Sandi Klavzar: Recognizing Graphs of Acyclic Cubical Complexes. Discret. Appl. Math. 95(1-3): 321-330 (1999)

Wilfried Imrich, Sandi Klavzar, Henry Martyn Mulder: Median Graphs and Triangle-Free Graphs. SIAM J. Discret. Math. 12(1): 111-118 (1999)

Johann Hagauer, Wilfried Imrich, Sandi Klavzar: Recognizing Median Graphs in Subquadratic Time. Theor. Comput. Sci. 215(1-2): 123-136 (1999)

1998

Wilfried Imrich, Sandi Klavzar, Aleksander Vesel: A characterization of halved cubes. Ars Comb. 48 (1998)

Wilfried Imrich: Factoring cardinal product graphs in polynomial time. Discret. Math. 192(1-3): 119-144 (1998)

Wilfried Imrich, Sandi Klavzar: A Convexity Lemma and Expansion Procedures for Bipartite Graphs. Eur. J. Comb. 19(6): 677-685 (1998)

1997

Wilfried Imrich, Tomaz Pisanski, Janez Zerovnik: Recognizing Cartesian graph bundles. Discret. Math. 167-168: 393-403 (1997)

Wilfried Imrich, Sandi Klavzar: Recognizing Hamming Graphs in Linear Time and space. Inf. Process. Lett. 63(2): 91-95 (1997)

1996

Wilfried Imrich, Janez Zerovnik: On the weak reconstruction of Cartesian-product graphs. Discret. Math. 150(1-3): 167-178 (1996)

Wilfried Imrich, Sandi Klavzar: On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. Eur. J. Comb. 17(2-3): 209-221 (1996)

C. Paul Bonnington, Wilfried Imrich, Norbert Seifter: Geodesics in Transitive Graphs. J. Comb. Theory, Ser. B 67(1): 12-33 (1996)

1995

C. Paul Bonnington, Wilfried Imrich, Mark E. Watkins: Separating double rays in locally finite planar graphs. Discret. Math. 145(1-3): 61-72 (1995)

Wilfried Imrich, Sandi Klavzar, Aleksander Vesel: Recognizing halved cubes in a constant time per edge. Eur. J. Comb. 16(6): 617-621 (1995)

1992

Franz Aurenhammer, Johann Hagauer, Wilfried Imrich: Cartesian Graph Factorization at Logarithmic Cost per Edge. Comput. Complex. 2: 331-349 (1992)

Wilfried Imrich, Jaroslav Nesetril: Simple tournaments and sharply transitive groups. Discret. Math. 108(1-3): 159-165 (1992)

Wilfried Imrich, Sandi Klavzar: Retracts of strong products of graphs. Discret. Math. 109(1-3): 147-154 (1992)

1991

Wilfried Imrich, Norbert Seifter: A survey on graphs with polynomial growth. Discret. Math. 95(1-3): 101-117 (1991)

1990

Wilfried Imrich, Gert Sabidussi: Focality and graph isomorphism. Discret. Math. 81(3): 237-245 (1990)

Franz Aurenhammer, Johann Hagauer, Wilfried Imrich: Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO 1990: 29-44

1989

Wilfried Imrich, Norbert Seifter: A note on the growth of transitive graphs. Discret. Math. 73(1-2): 111-117 (1989)

Chris D. Godsil, Wilfried Imrich, Norbert Seifter, Mark E. Watkins, Wolfgang Woess: A note on bounded automorphisms of infinite graphs. Graphs Comb. 5(1): 333-338 (1989)

1987

Chris D. Godsil, Wilfried Imrich: Embedding graphs in Cayley graphs. Graphs Comb. 3(1): 39-43 (1987)

1984

Wilfried Imrich: Explicit construction of regular graphs without small cycles. Combinatorica 4(1): 53-59 (1984)

Wilfried Imrich, J. M. S. Simões-Pereira, Christina Zamfirescu: On optimal embeddings of metrics in graphs. J. Comb. Theory, Ser. B 36(1): 1-15 (1984)

1979

Wilfried Imrich: On the connectivity of cayley graphs. J. Comb. Theory, Ser. B 26(3): 323-326 (1979)

1973

László Babai, Wilfried Imrich: On groups of polyhedral graphs. Discret. Math. 5(1): 101-103 (1973)