Name and surname: Paulis
Íikusts
Place and date of birth: Vītiņu pagasts, Auces novads, Latvija, 11 March 1948
Place of work: University
of Latvia, Institute of Mathematics and Computer Science,
Raiňa bulv. 29, Rîga, LV-1459,
Latvia
Telephone: 7213716
E-mail: Paulis.Kikusts@mii.lu.lv
Main research
interests:
Graph
theory, Machine vision
Education:
1966
– 1971 Latvia
State University, Faculty of Physics and Mathematics,
Department of Mathematics, major course – Mathematics
Scientific degrees:
1992 Doctor
of Mathematics
1977
Candidate
of science
1971
University
graduation diploma in mathematics
Employment:
since 2001 Associated
professor, University of Latvia, Faculty of Physics and Mathematics
since 1995 Assistant
professor, University of Latvia, Faculty of Physics and
Mathematics
since 1986 Leading
researcher, University
of Latvia, Institute of Mathematics and Computer Science
since 1980 Lecturer,
University of Latvia,
Faculty of Physics and Mathematics
1981–1985 Leader
of laboratory, University
of Latvia, Institute of Mathematics and Computer Science
1974–1980 Researcher,
University of Latvia,
Institute of Mathematics and Computer Science
1971–1973 Programmer,
Latvian Academy of Science, Institute of Electronics and Computer Science
Main
projects:
since
2000 Graph
Layout and Diagramming, Tom Sawyer Software Corporation (California, USA)
since
2001 Mathematical
methods and algorithms of processing graph-like and geometric structures of
visual information, Latvian Council of Science, grant No. 01.0041, leader
since
1997 Car
rain sensor, "Just It", Riga
since
1991 Graphical
business modeling tool GRADE, University of Latvia, Institute of Mathematics and Computer Science
1997 – 2000 Efficient
mathematical methods and algorithms of analysis and synthesis of
geometric-combinatorial information structures, Latvian Council of Science, grant No. 96.0247, leader
1994
– 1996 Efficient
mathematical methods and algorithms of signals, Latvian Council of Science, grant No. 93.601, leader
1986 – 1990 VLSI
and printed wiring board CAD and quality control program systems, University of Latvia, Institute of
Mathematics and Computer Science
1981 – 1985 The
Fund of Algorithms and Programs, University of Latvia, Institute of Mathematics
and Computer Science
1974 – 1980 VLSI
CAD, University
of Latvia, Institute of Mathematics and Computer Science
1971 –
1973 Minsk-32
computer system programs,
Latvian Academy of Science, Institute of Electronics and Computer Science
Main research
publications:
1. P.Kikusts, On existence of Hamiltonian
cycle in regular graph of degree 5. Latvian
Yearbook of Mathematics 16, "Zinâtne", Riga, 1975,
pp.33–38. (in Russian).
2. P.Kikusts, Algorithm detecting graph
isomorphism and its applying to identification of logical networks. Automatic and Computer Technique, No. 4,
1979, pp.21–27. (in Russian).
3. P.Kikusts, Another algorithm determining
the independence number of a graph. EIK,
22, 1986, p.157–166.
4. P.Kikusts, Recognition of planar
hierarchical patterns using plane transformations. Theoretical questions of programming, Latvia State
University, 1988, pp.108–119. (in Russian).
5. I.Etmane, P.Íikusts, P.Ručevskis. Basic
principles and layout algorithms of GRADE Windows graphic editors. Proc. of Int. Workshop on Constraints for Graphics
and Visualization, Marseille, France, September 18, 1995.
6. P.Íikusts, P.Ručevskis. Layout algorithms
of graph–like diagrams for GRADE Windows graphic editors. Proc. of Symposium
Graph Drawing '95, Lecture Notes in Computer
Science, vol. 1027, 1996, pp.361–364.
7. P.Íikusts. Graphs and images: an
admirable symbiosis. Acta. Soc. Math.
Latviensis, No. 97.02, Rîga, 1997, pp.42–43 (in Latvian).
8.
P.Íikusts. Mathematical principles of graph-like diagram drawing tool. Acta Societatis Mathematicae Latviensis,
No 3, 2000, 47–48.
9.
K.Freivalds, P.Íikusts. Optimum layout adjustment supporting ordering constraints
in graph-like diagram drawing. Proc. of the
Latvian Academy of Sciences, Section B, Vol. 55, No 1, 2001, pp. 43-51.
10.
K.Freivalds, U.Dogrusoz, P.Íikusts.
Disconnected graph layout and the
polyomino packing approach. Proc. of Symposium Graph Drawing 2001,
Lecture
Notes in Computer Science,
vol. 2265, 2002, pp. 378-391.
11.
K.Freivalds, P.Kikusts. Robust image topological feature extraction.
Proc. of 5th international scientific conference Applied Information and Communication Technologies (AICT2012)
, Jelgava, Latvia, 2012, pp. 82-91.
Patent
1.
V.Nikulenkovs, P.Íikusts, K.Freivalds. A Method and Equipment for Automatic
Optical Detection and Classification of a Type of Contamination on a Vehicle
Window Surface. AP/Ap-P561/01,
Latvia, 2001.
Prizes:
1995. Symposium Graph Drawing '95, Passau
(Germany), Graph-Drawing Contest – the first and the third prizes in
international scientific graph drawing contest.
1999. Symposium Graph Drawing '99, Prague
(Czech Republic), Graph-Drawing Contest – the first and the third prizes in
international scientific graph drawing contest.
1999. “The Starry Sky” (Riga, Latvia) and
Latvian Astronomical Society – the second place in Solar Eclipse observation
contest “An Interesting Photo”.
Courses taught:
University of Latvia, Faculty of Physics and
Mathematics
bachelor program of computer science
"Computer Graphics" 2 cr.
"Computational Geometry" 2 cr.
"Graph Theory" 2 cr.
Special laboratory: "Image synthesis and
analysis".
University of Latvia, Faculty of Physics and
Mathematics
master program of computer science
"Computer Graphics" 4 cr.
"Graph Theory" 4 cr.
Teaching aids:
P.Íikusts. Computational Geometry: Abstracts of
Lectures – www.ltn.lv/~paulis, 1999.
P.Íikusts. Computer Graphics: Abstracts of Lectures – www.ltn.lv/~paulis, 2000.