\begin{thebibliography}{99}
\addcontentsline{toc}{chapter}{\numberline{}\bibname}
%!
%!
\bibitem{tam1}
R. Tamassia (1997): \emph{Graph Drawing} v J. E. Goodman, J. O'Rourke
eds.: \emph{CRC Handbook of Discrete and Computational Geometry}, CRC
Press\\
\texttt{http://www.cs.brown.edu/cgc/papers/t-gd-97.ps.gz}
%!!!!!!t-gd-97.ps
%!
%!
\bibitem{tam2}
Roberto Tamassia : \emph{Advances in the Theory and Practice of
Graph Drawing}, Theoretical Computer Science, Volume 217, Issue 2, 6 April 1999, Pages 235-254
%\texttt{http://citeseer.ist.psu.edu/compress/0/papers/cs/2051/\\
%ftp:zSzzSzftp.cs.brown.eduzSzpubzSzpaperszSzcompgeozSzordal96.ps.gz/tamassia96advances.ps}    %! -> TREBA ZMENIT 
%!!!!!tamassia96advances.ps
%!
%!
\bibitem{dies}
Reinhard Diestel : \emph{Graph theory}, Electronic edition 2000,
Springer-Verlag 2000\\ 
\texttt{ftp://ftp.math.uni-hamburg.de/pub/unihh/math/books/diestel/\\GraphTheoryII.pdf}
%!!!!!!!GraphTheoryII.pdf
%!
%!
\bibitem{tam3}
Ashim Garg a Roberto Tamassia : \emph{Upward planarity testing},
Order (12), pp.
109-133, 1995\\
\texttt{http://www.cs.brown.edu/cgc/papers/gt-upt-95.ps.gz}
%!!!!!!!!!!gt-upt-95.ps
%!
%!
\bibitem{liu}
Peiran LIU : \emph{Design and Analysis of Algorithms},
Seminar Report, University of Ottawa - S.I.T.E.
November 10, 2002
%!!!!!!draw.doc   -> NENASIEL SOM LINK
%!
%!
\bibitem{sim}
Susan Sim : \emph{Automatic Graph Drawing Algorithm}, 1996\\
\texttt{http://www.ics.uci.edu/\~{}ses/papers/grafdraw.pdf}
%!!!!!!!graphdraw.pdf
%!
\bibitem{bran}
Prof. Dr. Franz J. Brandenburg : \emph{Graph Drawing: past -
present - future}, 2002\\
\texttt{http://www.csse.monash.edu.au/\~{}gfarr/research/\\GraphDrawing02-Mel.ppt}
%!!!!!GraphDrawing02-Mel.ppt
%!
%!
\bibitem{mutzel}
Petra Mutzel : \emph{Optimization in graph drawing},
P. Pardalos and M. Resende, editors:
\emph{Handbook of Applied Optimization}, pages 967-977, Oxforf University
Press, New York, 2002
%!!!!!!!handbookTR.ps   -> NENASIEL SOM LINK
%!
%!
\bibitem{liter}
Giuseppe Di Battista, Peter Eades, Roberto Tamassia a Ioannis G.
Tollis~: \emph{Algorithms for Drawing Graph: an Annotated
Bibliography}, 1994\\
\texttt{http://www.cs.brown.edu/people/rt/papers/gdbiblio.pdf}
%!!!!!gdbiblio.pdf   
%!
%!
\bibitem{plan}
Ren\'e Weiskircher: \emph{Drawing Planar Graphs} v Michael
Kaufmann a Dorothea Wagner (Eds.): \emph{Drawing Graphs Methods
and Models}, Computer Science Volume 2025 / 2001
%!!!!!weiskircher01.pdf        -> NENASIEL SOM LINK
%!
%!
\bibitem{tam4}
Isabel F. Cruz a Roberto Tamassia : \emph{Graph Drawing
Tutorial}\\
\texttt{http://www.cs.brown.edu/people/rt/papers/gd-tutorial/\\gd-constraints.pdf}
%!!!!!gd\_tutorial.pdf         -> TREBA VYSKUSAT STIAHNUT
%!
%!
\bibitem{mutzel2}
Carsten Gutwenger, Petra Mutzel a Ren\'e Weiskircher : \emph{Inserting an Edge Into a Planar Graph},
Proceedings of the Twelfth ACM-SIAM Symposium on Discrete Algorithms, (SODA '2001), Washington, DC, ACM Press, 2001, 246--255
%!!!!!! insert.pdf          -> NENASIEL SOM LINK
%!
%!
\bibitem{lila}
Lila Behzady : \emph{An improved Spring-based Graph Embedding
Algorithm and LayoutShow: a Java Environment for Graph Drawing},
1999, York University, North York, Onratio
%\texttt{http://citeseer.ist.psu.edu/compress/0/papers/cs/20281/http:zSzzSzwww.atkinson.yorku.cazSz~lbehzadizSzmyThesis.ps.gz/behzadi99improved.ps}
%!!!!!!!behzady99improved.ps     -> TREBA VYSKUSAT STIAHNUT
%!
%!
\bibitem{genetic}
J\"urgen Branke, Frank Bucher a Hartmut Schmeck : \emph{Using
Genetic Algorithms for Drawing Undirected Graphs}, 1996, University of Karlsruhe
%\texttt{http://citeseer.ist.psu.edu/compress/0/papers/cs/7407/ftp:zSzzSzftp.aifb.uni-karlsruhe.dezSzpubzSzjbrzSzgagd.ps.gz/branke96using.ps}
%!!!!!!branke96using.ps             -> TREBA ZMENIT LINK
%!
%!
\bibitem{planarizing}
Annegret Liebers : \emph{Planarizing Graphs - A Survey and
Annotated Bibliography},
Journal of Graph Algorithms and Applications 5(1):1-74, 2001\\
\texttt{http://www.cs.brown.edu/publications/jgaa/accepted/01/\\Liebers01.5.1.pdf}
%!!!!!!!!liebers01.5.1.pdf
%!
%!
\bibitem{mutzel3}
Michael J\"unger a Petra Mutzel : \emph{Maximum Planar Subgraphs
and Nice Embeddings: Practical Layout Tools}, Algorithmica 16, No. 1, 1996, 33--59\\
\texttt{ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr93-145.ps.gz}
%!!!!!!!maximum-planar-subgraphs.ps    -> TREBA VYSKUSAT STIAHNUT
%!
%!
\bibitem{kuratow}
Kazimierz Kuratowski : \emph{Sur le probl\`eme des courbes gauches en
topologie}, Fund. Math., 15:271-283, 1930
%!
%!
\bibitem{yury}
Yury Makarychev : \emph{A Short Proof of Kuratowski's Graph
Planarity Criterion}, Department of differential geometry, Faculty
of mechanics and mathematics, Moscow, State university\\
\texttt{http://www.cs.princeton.edu/~ymakaryc/papers/kuratowski.pdf}
%!
%!
\bibitem{hop_tar}
John Hopcroft a Robert Tarjan : \emph{Efficient Planarity Testing},
Journal of the ACM (JACM), Volume 21 , Issue 4 (October 1974), Pages: 549 - 568
%!
%!
\bibitem{kniha_tex}
Tobias Oetiker, Hubert Partl, Irene Hyna a Elisabeth Schlegl :  \emph{Nie pr\'ili\v s stru\v cn\'y \'uvod do syst\'emu \LaTeXe}, verzia 3.13, 23. febru\'ar 2000, preklad J\'an Bu\v sa ml. a J\'an Bu\v sa st., 17.marec 2002
%!
\bibitem{leda}
Algoritmic Solutions : \emph{LEDA 5.0, The LEDA User Manual}
%!!!!LEDA_manual.pdf
%!
%!
\bibitem{graphML}
http://graphml.graphdrawing.org
%!
%!
\bibitem{link1}
http://graphdrawing.org
%!
%!
\bibitem{planet}
http://planetmath.org
%!
%!
\bibitem{link2}
http://maven.smith.edu/\~{}orourke/TOPP/Welcome.html
%!
%!
\end{thebibliography}
