Curriculum vitae of RNDr. Pavel Klavík, Ph.D.

Software engineer at Google Zurich: Search and Knowledge Graphs.

Download link: PDF, also an experimental Structural Diagram for CV giving overview of my research and other academic activities.

E-mail: klavik [at] kam [dot] mff [dot] cuni [dot] cz

Born: 23/02/1988, Hořice, Czech Republic

Research Statement

Relation between geometric representations and structural properties of graphs. Given a geometrically represented graph, what structural knowledge can be derived from it? For instance, we show that symmetries of planar graphs can be understood.
Energy-aware computing and numerical linear algebra. One of important problem for supercomputing is to make computations as efficient with respect to energy consumption as possible. Our study compared different methods for solving linear systems Ax=b from the point of energy consumption.
Scientific education and understanding of human mind. We build a mathematical theory and computer tools to write down, understand and share structures in our mind. We are testing this approach in education of linear algebra at Charles University.

Teaching assistent at Charles University since 2008 (programming, discrete math, combinatorics and graph theory, linear algebra, analysis).
Courses in Advance Linear Algebra (Fall 2013 and Fall 2016).
Course in Complex Analysis via Visual method (Spring 2016).
List of books, lecture notes, and structural diagrams:

Povídání o Lineární algebře (in Czech, in preparation): introductory linear algebra book, covers introduction to linear systems, vector spaces, matrices and linear mappings.
Lineární algebra III (in Czech): lecture notes for Advance Linear Algebra class.
Pokročilé cvičení Lineární algebra II (in Czech): lecture notes for special recitations for second semester of Linear Algebra, covers orthogonality, determinants, eigenvalues and positive definite matrices.
Strukturální mapa Lineární algebry (in Czech, in preparation): for my classes in 2015/2016, most important topics and their connections. How to use, supported browsers are Firefox and Google Chrome.

Bachelor's thesis "Automorphism Groups of Geometrically Represented Graphs" (defended 2014),
Master thesis "Algebraic, Structural, and Complexity Aspects of Geometrically Represented Graphs" (defended 2016).

Programming experience since youth.
Good knowledge of C++, Java, Metapost.
Basic knowledge of Perl, Clojure(Script).
Head programmer and system analytic of a Java client-server application in TTC Marconi (from 2008 to 2009).
Currently working on a new version of mind-modelling tool Orgpad.
From February 2018, working as software engineer at Google Zurich on Search and Knowledge Graphs.

Participant of math research programs REU (Research Experiences for Undergraduate Students) 2009 and 2010 at Rutgers University, New Jersey.
Participant of Great Minds student internship 2012 at IBM Research in Zurich.
Young Research Participant of 4th Heidelberg Laureate Forum.
Visitor of Japanese Advance Institute of Science and Technology in 2013 (one month) and 2014 (one month).
Visitor of Kyoto University in 2013 (two weeks), 2014 (two weeks), 2015 (two weeks).

A bronze medal winner of IOI 2007 (International Olympiad in Informatics).
A participant of Central-European round of ACM ICPC (International Collegiate Programming Contest) in 2008, 2009 and 2010. The first place in the regional round CTUOpen 2009, third place in the regional round CTUOpen 2010.
The third place in a competition of student papers SVOČ 2008, with the paper
Jozef Jirásek, Pavel Klavík - Recoloring k-trees.
The first place in a competition of student papers SVOČ 2009, with the thesis
Jozef Jirásek, Pavel Klavík – Lines in Graphs.
The first place in a competition of student papers SVOČ 2012, with the thesis
Pavel Klavík – Extending Partial Representations of Interval Graphs.
Laureate of Jiří Matoušek Prize 2017 of Charles University together with Peter Zeman for the paper "Automorphism Groups of Geometrically Represented Graphs".