Phone: +371 7213716
Fax: +371 7820153
E-mail: dainize@cclu.lv

Date and place of birth: 1948, Latvia

Education:

1966-1972 Undergraduate studies, Latvia State University, Faculty of Physics and Mathematics, Physics

Scientific degrees:

Master of Science (Mathematics) - in 1994 from the Institute of Mathematics and Computer Science, University of Latvia.

Master of Humanities (Philology) - in 1995 from the Faculty of Philology, University of Latvia:
Thesis: "On a type of exercises in teaching ancient languages, 42pp"

Doctor of Science (Mathematics) - in 1998 from the Institute of Mathematics and Computer Science, University of Latvia:
Thesis: "The theory of Combinatorial Maps and its Use in the Graph topological computations, 63 pp."

Divine service:

Deacon of Lutheran Church - in 1989 from Lutheran Church of Latvia

Since 1989 Pastor in Lutheran Church of Latvia (Misiones (Riga, 1989-1997), Jaunas Gertrudes (Riga, 1993-1995), Lielvardes (1996))

Employment:

1972-1977 Engineer, Designer Bureau of Vacuum Perfusion, Riga, Latvia

1977-1990 Junior Scientific Associate, Computer Center, Latvia State University

Since 1990 Lecturer (Biblical languages) in Faculty of Theology, University of Latvia

1990-1998 Assistant, the Institute of Mathematics and Informatics, University of Latvia

Since 1998 Researcher, Institute of Mathematics and Computer Science, University of Latvia

1996-2002 Translator and a member of the Text Committee (New Bible translation in Latvian project), the Bible Society of Latvia

Research and Development:

In the past, programmer, developer of algorithms in graph theory, researcher in graph theory

Currently, researcher in graph theory and combinatorics

Current scientific interests:

- graph topology
- combinatorial maps
- development of educational (ancient languages) programs and web sites

Courses Taught:

1976 Complex variable functions and field theory, Polytechnic Institution

1981 - 1982 Structural Programming, Programming Courses at the University of Latvia

1987 Functional Programming for Colleagues of Graph Theory

1990 -1993 Biblical Hebrew, Theological Faculty of the University of Latvia

1993 Synonyms in Biblical Greek, Theological Faculty of the University of Latvia

Since 1990 Biblical Greek, Theological Faculty of the University of Latvia

Since 1992 Medieval Latin, Theological Faculty of the University of Latvia

2000, 2002 Biblical Aramaic, Theological Faculty of the University of Latvia

List of Main Publications:

Books and web sites:

1. Jaunas Derbas grieku (koine) valoda, Teksti darbam auditorija, 1992, 160 p.
2. Vingrinajumi Jaunas Deribas grieku valoda, 1993, 120p.
3. Reading Exercises in Latin, Fables of Phaedrus, http://www.iclub.lv/dainis or http://ablemedia.com/ctcweb/showcase/zepsphaedrus.html
4. Combinatorial Maps (in Latvian): http://www.ltn.lv/~dainize/tutorial/Combinatorial%20Mps.Tutorial.htm

Papers:

1. On the results of testing the algorithm to find the planar part of graph in random graphs, Kaunas, N13, 1981.

2. Testing of the algorithm to find a planar part in the graph, Vilnius, 1982, 5pp.

3. Exhaustive search algorithm to find Hamiltonian Cycle in Graphs, EIK, 16, 1-3, Berlin, Akademie-Verlag, 1982, 69 - 75.

4. Packet of Programs of graph theoretical algorithms: planarity and implementation of the graph, Novosibirsk, 1982, 4pp.

5. On the Dynamic Partitioning of the Graph in Three connected Components, Republican Fund of Algorithms and Programs, Inv. N. UA0003Riga, 1984, = 16pp.

6. (with J. Kratochvil, Prague) On the Minimum Number of Hamiltonian Cycles in Triangulations, KAM MFF UK, N15, Prague, 1987., 8pp.

7. (with J. Kratochvil, Prague) On Hamiltonian cycles in Two Triangle graphs, Acta Universitatis Carolinae, Vol.28, Prague, 1987, 73-78.

8. (with J. Kratochvil, Prague) On the Number of Hamiltonian cycles in Triangulations, Journ. Graph Theory, Vol.12, No.2, USA, 1988, 191-194.

9. Another Theory of Triconnectivity. Prague, KAM MFF UK, N 90-168, Prague, 1992., 6pp.

10. (with J. Dambitis) An Overview of Three Works of E. Grinbergs in Graph theory and Combinatorics, Acta Universitatis Latviensis, 588, Mathematics, 1993, 7-14.

11. (with P. Kikusts) Graphs on surfaces, Conf. LMS, Riga, 1994.

12. Graphs with rotation in permutation technique, KAM Series, N = 94-274, 1994, Prague, Charles University, 8pp.

13. Graphs as rotations, KAM Series, 96-327, Prague, 1996, 9pp.

14. Graphs with rotations II: partial maps, unpublished, 1996, 11pp.

15. Graphs with rotations: partial maps, KAM Series, DIMATIA, 97-365, 1996, 12pp.

16. The use of the combinatorial map theory in graph topological computations , KAM Series, DIMATIA, 97-364, Prague, 1997, 8pp.

17. Free minor closed classes and the Kuratowski theorem, KAM Series DIMATIA, 98-409, Prague, 1998, pp.

18. Using Combinatorial Maps in Graph topological Computations , KAM Series, DIMATIA, 99-438, Prague, 1999, 11pp.

19. Kuratowski theorem from below, in Acta Societatis Mathematicae Latviensis, No3, 2000, pp. 69-70.

20. Trying to Prove Kuratowski Theorem from Below, KAM Series, DIMATIA, 2000-489, Prague, 2000, 11pp.

21. On Free Minor Closed Classes of Graphs Outside Planarity, KAM Series, DIMATIA, 2001-543, Prague, 2001, 11pp.

| home | structure | computer science | mathematics | data networking |
teaching | researchers | contact us |