Michael Kaufmann

1. KAUFMANN, Michael (editor), WAGNER, Dorothea (editor). Drawing graphs : methods and models. Berlin [etc.]: Springer, cop. 2001. XIV, 312 str., ilustr. Lecture notes in computer science, 2025. ISBN 3-540-42062-2. ISSN 0302-9743. [COBISS.SI-ID 19520295]

2. KEAVENEY, Paula (editor), KAUFMANN, Michael (editor). Marketing for the voluntary sector : a guide to measuring marketing performance. London; Dover (N.H.): Kogan Page, 2001. XII, 180 str., ilustr. Marketing in action series. ISBN 0-7494-3250-0, ISBN 978-0-7494-3250-8. https://books.google.si/books?id=QqbiHjhrgzMC&printsec=frontcover&dq=9780749432508+KOGAN+PAGE&hl=sl&sa=X&ved=0ahUKEwiPxtbFseLJAhVG1xoKHRkECU4Q6AEIGTAA#v=onepage&q=9780749432508%20KOGAN%20PAGE&f=false. [COBISS.SI-ID 22898918]

3. ALAM, Muhammad Jawaherul, CHAPLICK, Steven, FIJAVŽ, Gašper, KAUFMANN, Michael, KOBOUROV, Stephen G., PUPYREV, Sergey. Threshold-coloring and unit-cube contact representation of graphs. In: BRANDSTÄDT, Andreas (ed.), JANSEN, Klaus (ed.), REISCHUK, Rüdiger (ed.). Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013 : revised papers. WG 2013, 39th International Workshop on Graph-Theoretic Concepts in Computer Science, June 19 - 21, 2013, Lübeck, Germany. Heidelberg [etc.]: Springer, cop. 2013. Str. 26-37. Lecture notes in computer science, 8165. ISBN 978-3-642-45042-6, ISBN 978-3-642-45043-3. ISSN 0302-9743. http://dx.doi.org/10.1007/978-3-642-45043-3_4. [COBISS.SI-ID 16893785]

4. ALAM, Muhammad Jawaherul, CHAPLICK, Steven, FIJAVŽ, Gašper, KAUFMANN, Michael, KOBOUROV, Stephen G., PUPYREV, Sergey, TOENISKOETTER, Jackson. Threshold-coloring and unit-cube contact representation of planar graphs. Discrete applied mathematics. [Print ed.]. 2017, vol. 216, str. 2-14. ISSN 0166-218X. https://doi.org/10.1016/j.dam.2015.09.003, DOI: 10.1016/j.dam.2015.09.003. [COBISS.SI-ID 18346329]

5. AGRAWAL, Akanksha, CABELLO, Sergio, KAUFMANN, Michael, SAURABH, Saket, SHARMA, Roohani, UNO, Yushi, WOLFF, Alexander. Eliminating crossings in ordered graphs. In: BODLAENDER, Hans L. (ed.). 19th Scandinavian Symposium and Workshops on Algorithm Theory : SWAT 2024, June 12-14, 2024, Helsinki, Finland. Saarbrücken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik: Dagstuhl Publishing, 2024. 1:1-1:19 str., ilustr. LIPIcs - Leibniz International Proceedings in Informatics, vol. 294. ISBN 978-3-95977-318-8. ISSN 1868-8969. https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2024.1, Repository of the University of Ljubljana – RUL , DiRROS - Digital repository of Slovenian research organizations, DOI: 10.4230/LIPIcs.SWAT.2024.1. [COBISS.SI-ID 218342147]