ÿþ<HTML> <HEAD> <meta name="description" content="Quantum distinction,E. Grinberg"> <meta name="keywords" content="Quantum distinction,E. Grinberg"> <LINK rel="stylesheet" type="text/css" href="dainize_style.css"> <TITLE><FONT size=3 >Home Page Dainis Zeps</TITLE> </HEAD> <BODY bgColor=lightblue> <div class="virsraksts">Home Page</div> <P> <a href="http://www.ltn.lv/~dainize//"><br> <FONT size=-3 ></font></P> <div class="v1">Dainis Zeps</div> <br> <P> <a href="http://www.lumii.lv/"><IMG alt="" src=dainis.zeps.JPG width=200><br> <FONT size=-3 ></font></P><br><br> <P>Senior researcher at Institute of Mathematics and Computer Science</a>, <a href="http://www.lu.lv/">Latvian University</a> <BR>Lecturer at <a href="http://www.teologija.lv">Faculty of Theology</a>, Latvian University</P> <P><FONT size=3></FONT>&nbsp;</P> <br> <iframe width="425" height="350" frameborder="0" scrolling="no" marginheight="0" marginwidth="0" src="http://maps.google.com/?ie=UTF8&amp;t=h&amp;ll=56.950911,24.14053&amp;spn=0.001384,0.003428&amp;z=18&amp;output=embed"></iframe><br /><small><a href="http://maps.google.com/?ie=UTF8&amp;t=h&amp;ll=56.950911,24.14053&amp;spn=0.001384,0.003428&amp;z=18&amp;source=embed" style="color:#0000FF;text-align:left">Skat+t lielku karti</a></small> <br><br><br> <a href="http://students.mii.lu.lv/DZ/dz_ipubs.html">Latest Publications</a> </P> <P><FONT size=3></FONT>&nbsp;</P> <br> <UL> <LI><A href="#edu">Education</A></LI> <LI><A href="#mat">Mathematical works</A></LI> <LI><A href="#ped">Pedagogical works in philology</A></LI> </UL> <P> </LI> </UL> <BR> <br><br><br><br><br><br><br><br><br><br><br><br> <P></A><B><A name=edu><B></B></A>Education:</B> <BR>&nbsp; </P> <UL type=disc> <LI>M theoretical physics&nbsp; 1972 </li> <br ><I>Thesis:</I> "Elaboration of mathematical model of conductivity in fast neutron irradiated n-type germanium. 1972. 70 pp" <LI>M math. 1994</li><br> <LI >M philology 1995 </LI> <br><I>Thesis:</I> "On a type of exercises in teaching ancient languages, 42pp" &nbsp; <LI >Dr math. 1998 </LI> <br><I> Thesis:</I> "The theory of Combinatorial Maps and its Use in the Graph-topological computations, 63 pp."</ul> <br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <div id="LibraInsideDiv" class="libra">[Loading...]</div><script language="javascript">g_libraBase="http://academic.research.microsoft.com/"; g_authorID=83120; g_showMask=5;g_orderBy=2;g_topN=200;g_showStyle="LibraStyle";g_ws_head="http://academic.research.microsoft.com/";</script> <script language="javascript" id="insideJs" src="http://academic.research.microsoft.com/LibraInside.aspx?js&infos=83120|5|2|200"></script><div class='libra-signature'>This publication list is generated by Microsoft Academic Search®, please visit <a href='http://academic.research.microsoft.com/' target='_blank'>Microsoft Academic Search</a> for more info. Please check <a href='http://academic.research.microsoft.com/About/TermsofUseSpecEN.html' target='_blank'>here</a> for terms of use.</div> <br><br><br><br><br><br><br><br> <b><A name=mat></A>Mathematical Papers:</b> <br><br> <P>1. On the results of testing the algorithm to find the planar part of graph in random graphs, Kaunas, N13, 1981.</P> <P>2. Testing of the algorithm to find a planar part in the graph, Vilnius, 1982, 5pp. </P> <P>3. Exhaustive search algorithm to find Hamiltonian Cycle in Graphs, EIK, 16, 1-3, Berlin, Akademie-Verlag, 1982, 69 - 75.</P> <P>4. Packet of Programs of graph theoretical algorithms: planarity and implementation of the graph, Novosibirsk, 1982, 4pp. </P> <P>5. On the Dynamic Partitioning of the Graph in Three connected Components, Republican Fund of Algorithms and Programs, Inv. N. UA0003Riga, 1984, 16pp. </P> <P>6. (with J. Kratochvil, Prague) On the Minimum Number of Hamiltonian Cycles in Triangulations, KAM MFF UK, N15, Prague, 1986., 8pp. </P> <P>7. (with J. Kratochvil, Prague) On Hamiltonian cycles in Two Triangle graphs, Acta Universitatis Carolinae, Vol.28, Prague, 1987, 73-78.</P> <P>8. (with J. Kratochvil, Prague) On the Number of Hamiltonian cycles in Triangulations, Journ. Graph Theory, Vol.12, No.2, USA, 1988, 191-194. </P> <P>9. The triconnectivity considered dynamically. Prague, KAM MFF UK, N 90-168, Prague, 1990., 6pp. </P> <P>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. </P> <P>11. (with P. Kikusts) Graphs on surfaces, Conf. LMS, Riga, 1994. </P> <P>12. Graphs with rotation in permutation technique, KAM Series, N 94-274, 1994, Prague, Charles University, 8pp. </P> <P>13. Graphs as rotations, KAM Series, 96-327, Prague, 1996, 9pp. </P> <P>14. Graphs with rotations II: partial maps, unpublished, 1996, 11pp </P> <P>15. Graphs with rotations: partial maps, KAM Series, DIMATIA, 97-365, 1996, 12pp. </P> <P>16. The use of the combinatorial map theory in graph topological computations , KAM Series, DIMATIA, 97-364, Prague, 1997, 8pp. </P> <P>17. Free minor closed classes and the Kuratowski theorem, KAM Series DIMATIA, 98-409, Prague, 1998, pp.</P> <P>18. Using Combinatorial Maps in Graph topological Computations , KAM Series, DIMATIA, 99-438, Prague, 1999, 11pp. </P> <P>19. Kuratowski theorem from below, in Acta Societatis Mathematicae Latviensis, No3, 2000, pp. 69-70.</SPAN> </P> <P><SPAN style="FONT-FAMILY: Times">20. Trying to Prove Kuratowski Theorem from Below, KAM Series, DIMATIA, 2000-489, Prague, 2000, 11pp. </P> <P>21. On Free Minor Closed Classes of Graphs Outside Planarity, KAM Series, DIMATIA, 2001-543, Prague, 2001, 11pp.</P> <P>22. Latin Dictionary Tools in Internet, Human Language technologies, the Baltic Perspective, 1st Baltic conference, Riga, April 2004, pp179-182. </P> <P>23. Free Planar Graphs on Torus, in Acta Societatis Mathematicae Latviensis, No6, 2004, pp. ..-...</SPAN> </P> <P>24. Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability, KAM Series, DIMATIA, 2004-699, Prague, 2004, 8pp. </P> <P>25. Classical and quantum self-reference systems in physics and mathematics, KAM Series, DIMATIA, 2007-807, Prague, 2007, 18pp. </P> <P>26. 4-Critical Wheel Graphs Of Higher Order, poster in EuroComb 2007, 6 pp.</P> <br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br> <P><A name=ped></A><b>Pedagogical Works in Philology:</b></P> <P>[New Testament Greek. Texts for work in classroom] Jaunas Deribas sengrieku (koine) valoda. Teksti darbam auditorija,  Svetdienas Rits , Riga, 1991, 45 lpp. </P> <P>[New Testament Greek. Texts for work in classroom] Jaunas Deribas sengrieku (koine) valoda. Teksti darbam auditorija, WORD Doc., Riga, 1991, 160 lpp. </P> <P>[Exercises in NT Greek] Vingrinajumi Jaunas Deribas sengrieku valoda, 1. 2. dala, <BR> Luteriska Mantojuma Fonds , Riga, 1995, 117 lpp. </P> <br><br><br><br><br><br><br><br><br><br><br><br> &nbsp; <br> &nbsp; &nbsp;&nbsp; <br> &nbsp; &nbsp;&nbsp; <br> &nbsp; &nbsp;&nbsp; <br> &nbsp; &nbsp; <br> <!-- Begin Hit Counter --> <!-- URL: http://www.webmasterapps.com/ --> <a href="http://www.webmasterapps.com/" target="_blank" style=" border:none; padding: 0pt; margin:0px;"><img src="http://www.no1freehitcounter.com/hcw3c/?id=ZBP721QWgwvgEKlr3AmeZQ%3D%3D" alt="Free Hit Counters" width="120" height="20" border="0"></a> <!-- End Hit Counter --> &nbsp; <br> &nbsp; &nbsp; <A HREF="http://www.ltn.lv/~dainize/">Home Page</A>, <A HREF="http://students.mii.lu.lv/DZ/">shorter Home Page</A>, <A HREF="http://lingua.id.lv">Language Page</A> &nbsp; <br> © <A href="mailto:dainize@mii.lu.lv">Dainis Zeps</A>, <A HREF="http://www.lu.lv/">University of Latvia</A>, <A HREF="http://www.latnet.lv/lu/mii/">Institute of Mathematics and Computer Science</A> &nbsp; <br>&nbsp; </BODY> </HTML>