Born: 1957, Humpolec, Czech Republic; Citizenship: Slovak Republic
Comenius University, MSc., RNDr. (1981), PhD. in Mathematics (1989), habilitation (1991), full professor inauguration (2005).
Professor of Computer Science (2003-); Professor of Mathematics (2006-), Vice-head of Department of Computer Science (1991-), Head of the Informatics Section at the Faculty of Mathematics, Physics and Informatics (2002-2006).
topological and algebraic graph theory, symmetries of graphs and maps, embeddings of graphs, graph colourings, flows on graphs
advanced graph theory, discrete mathematics basic and advanced, combinatorial theory, set theory, topological graph theory, combinatorial designs
over 70 published research papers mostly in leading mathematical journals (Proc. London Math. Soc., J. London Math. Soc., J. Combinatorial Theory, Combinatorica, Europ. J. Combinatorics, J. Graph Theory, Graphs and Comb., Discrete Math., etc.
more than 333 citations in approx. 150 sources (mostly SCI), avg citations: 7,57, h-index 11 (WoS March 2010)
University of Ljubljana, Slovenia (1992); National Chiao Tung University, Taiwan (1994), LaBRI, University of Bordeaux I (2008), National Sun-Yat Sen University, Kaohsiung, Taiwan (2008), University of Auckland (2010).
Organisation of conferences
Graph Embeddings and Maps on Surfaces (GEMS) co-founder with Roman Nedela (1994, 1997, 2001, 2005, 2009), yearly Czech and Slovak Graph Theory Conference (2005), International Symposium on Combinatorics, Graph Theory and Algorithms, Prague (2002, 2006), Symmetries in Graphs, Maps and Complexes (SIGMAC), Aveiro (2006).
(as principal investigator) Individual mobility grant of London Math. Society (2003), bilateral Slovak-French grant (Programme Štefánik): Graph colouring problems – a new trends for applications, Proj no. 26/ 08089UB (with Univ. of Bordeaux, prof. Raspaud), bilateral Slovak-Slovenian grant Algebraic and topological methods in combinatorial structures, SK-SI-01706 (with Univ. of Ljubljana, prof. Malnič), APVV-grant Colouring problems in graph theory 51-027604, APVV-grant 0111-07 Algebraic, combinatorial and topological structures in graphs (running), VEGA grant Chromatic structures in graphs (running); (as researcher) bilateral Slovak-Chinese grant Group actions on graphs and surfaces (principal investigator Roman Nedela)
Various professionalo activities
Head of Research Seminar in Graph Theory and Combinatorics founded by A. Kotzig (since 1996); Editor for combinatorics and graph theory of the journal Mathematica Slovaca (1991-2007); Editor in Chief of Acta, Mathematica Univ. Comen (2007-); Editor of the journal Ars Mathematica Contemporanea (2006), member of National Board for Discrete Mathematics and of National Board for Theoretical Computer Science (since 1996); secretary of the Union of Slovak Mathematicians and Physicists (1988-1992); representative of the Union in the European Mathematical Society (1990-1997); referee for leading journals in combinatorics and graph theory (e.g., J. Combin. Theory, J. Graph Theory, Discrete Math., Europ. J. Combinatorics), referee of grants for domestic and foreign scientific grant agencies (NSF (USA), NSA-Research Program (USA), NSERC (Canada), Czech Research Foundation, Austrian Research Foundation).
- Breda D'Azevedo, Antonio; Jones, Gareth; Nedela, Roman; Škoviera, Martin: Chirality groups of maps and hypermaps.J. Algebr. Comb. 29, No. 3, 337-355 (2009).
- Král', Daniel; Máčajová, Edita; Pangrác, Ondřej; Raspaud, André; Sereni, Jean-Sébastien; Škoviera, Martin: Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30, No. 1, 53-69 (2009).
- Jones, Gareth; Nedela, Roman; Škoviera, Martin: Complete bipartite graphs with a unique regular embedding. J. Comb. Theory, Ser. B 98, No. 2, 241-248 (2008).
- Máčajová, Edita; Škoviera, Martin: Fano colourings of cubic graphs and the Fulkerson conjecture. Theor. Comput. Sci. 349, No. 1, 112-120 (2005).
- Malnič, Aleksander; Nedela, Roman; Škoviera, Martin: Lifting graph automorphisms by voltage assignments. Eur. J. Comb. 21, No. 7, 927-947 (2000).