\clan {Bojan Mohar}

%--------------------------------------------------------
%  A. objavljene znanstvene monografije
%--------------------------------------------------------

%\begin{skupina}{A}

%\disertacija
%   {NASLOV}
%   {UNIVERZA}
%   {FAKULTETA}
%   {ODDELEK}
%   {KRAJ} {DRZAVA} {LETO} 

%\magisterij
%   {NASLOV}
%   {UNIVERZA}
%   {FAKULTETA}
%   {ODDELEK}
%   {KRAJ} {DRZAVA} {LETO} 

%\monografija
%   {AVTORJI}
%   {NASLOV}
%   {ZALOZBA}
%   {KRAJ} {DRZAVA} {LETO} 

%\end{skupina} 

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  B. raziskovalni clanki sprejeti v objavo v znanstvenih
%     revijah in v zbornikih konferenc
%--------------------------------------------------------

%\begin{skupina}{B}

%\sprejetoRevija
%   {AVTORJI}
%   {NASLOV}
%   {REVIJA}
%\sprejetoZbornik
%   {AVTORJI}
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 


%--------------------------------------------------------
%  C. raziskovalni clanki objavljeni v znanstvenih revijah
%     in v zbornikih konferenc
%--------------------------------------------------------

%\begin{skupina}{C}

%\objavljenoRevija
%   {AVTORJI}
%   {NASLOV}
%   {REVIJA} {LETNIK} {LETO} {STEVILKA} {STRANI}
%\objavljenoZbornik
%   {AVTORJI}
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 
%   {ZBORNIK} {STRANI} 

%\end{skupina} 

\begin{skupina}{C}

\objavljenoRevija
% 1.01: %list {\bf 4}. ALE\v{S}, Janez, MOHAR, Bojan, PISANSKI, Toma\v{z}. Heuristic search for Hamilton cycles in cubic graphs. {\it Discrete math.}. $[$Print ed.$]$, 2007, vol. 307, iss. 3-5, str. 303-309. http://dx.doi.org/10.1016/j.disc.2005.09.052. $[$COBISS.SI-ID 14178393$]$\\ 
   {J.~Ale\v{s}, \crta, T.~Pisanski}
   {Heuristic search for Hamilton cycles in cubic graphs}
   {Discrete Math.} {307} {2007} {3-5} {303--309}

\objavljenoRevija
% 1.08: {\bf 9}. BELLA, Peter, KR\'{A}L', Daniel, MOHAR, Bojan, QUITTNEROV\'{A}, Katar\'{\i}na. Labeling planar graphs with a condition at distance two. V: FELSNER, Stefan (ur.). {\it EuroComb `05 : combinatorics, graph theory and applications : Berlin, Germany, 05-09 September 2005}, (European journal of combinatorics, Vol. 28, Issue 8, 2007). London: Academic Press, 2007, 2007, vol. 28, iss. 8, str. 2201-2239. http://dx.doi.org/10.1016/j.ejc.2007.04.019. $[$COBISS.SI-ID 14419545$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 770/86: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 770/87: Ne najdem podatka {ZBORNIK}
   {P.~Bella, D.~Kr\'{a}l', \crta, K.~Quittnerov\'{a}}
   {Labeling planar graphs with a condition at distance two}
   {European J. Combin.} {28} {2007} {} {2{2}01--2{2}39} 

\objavljenoRevija
% 1.01: %list {\bf 3}. CABELLO, Sergio, MOHAR, Bojan. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. {\it Discrete comput. geom.}, 2007, vol. 37, no. 2, str. 213-235. http://dx.doi.org/10.1007/s00454-006-1292-5. $[$COBISS.SI-ID 14223449$]$\\ 
   {S.~Cabello, \crta}
   {Finding shortest non-separating and non-contractible cycles for topologically embedded graphs}
   {Discrete Comput.\ Geom.} {37} {2007} {2} {213--235}

\objavljenoZbornik
% 1.08: %list {\bf 11}. DEMAINE, Erik D., HAJIAGHAYI, MohammadTaghi, MOHAR, Bojan. Approximation algorithms via contraction decomposition. V: {\it Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, (Proceedings in Applied Mathematics, 125). New York: ACM; Philadelphia: SIAM, 2007, str. 278-287. $[$COBISS.SI-ID 14378073$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 787/103: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 787/104: Ne najdem podatka {ZBORNIK}
   {E.~D.~Demaine, M.~Hajiaghayi, \crta}
   {Approximation algorithms via contraction decomposition}
   {18th Annual ACM-SIAM Symposium on Discrete Algorithms}
   {New York} {ZDA} {januar} {2007}
   {Proceedings} {278--287} 

\objavljenoRevija
% 1.01: {\bf 1}. DEVOS, Matt, GODDYN, Luis, MOHAR, Bojan, \v{S}\'{A}MAL, Robert. A quadratic lower bound for subset sums. {\it Acta Arith.}, 2007, vol. 129, no. 2, str. 187-195. http://journals.impan.gov.pl/aa/. $[$COBISS.SI-ID 14453081$]$\\ 
   {M.~Devos, L.~Goddyn, \crta, R.~\v{S}\'{a}mal}
   {A quadratic lower bound for subset sums}
   {Acta Arith.} {129} {2007} {2} {187--195}

\objavljenoRevija
% 1.01: %list {\bf 8}. DEVOS, Matt, MOHAR, Bojan. An analogue of the Descartes-Euler formula for infinite graphs and Higuchi's conjecture. {\it Trans. Am. Math. Soc.}, 2007, vol. 359, no. 7, str. 3287-3300. http://www.ams.org/tran/2007-359-07/S0002-9947-07-04125-6/home.html. $[$COBISS.SI-ID 14334809$]$\\ 
   {M.~Devos, \crta}
   {An analogue of the Descartes-Euler formula for infinite graphs and Higuchi's conjecture}
   {Trans.\ Amer.\ Math.\ Soc.} {359} {2007} {7} {3287--3300}

\objavljenoRevija
% 1.01: %list {\bf 2}. JUVAN, Martin, MARIN\v{C}EK, Jo\v{z}e, MOHAR, Bojan. Obstructions for simple embeddings,. {\it Australasian journal of combinatorics}, 2007, vol. 38, str. 3-25. $[$COBISS.SI-ID 14378329$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 717/126: Ne najdem podatka {STEVILKA}
   {M.~Juvan, J.~Marin\v{c}ek, \crta}
   {Obstructions for simple embeddings}
   {Australas. J. Combin.} {38} {2007} {} {3--25}

\objavljenoRevija
% 1.01: %list {\bf 6}. KAWARABAYASHI, Ken-ichi, MOHAR, Bojan. A relaxed Hadwiger's Conjecture for list coloring. {\it J. comb. theory, Ser. B}, 2007, vol. 97, iss. 4, str. 647-651. http://dx.doi.org/10.1016/j.jctb.2006.11.002. $[$COBISS.SI-ID 14377817$]$\\ 
   {K.~Kawarabayashi, \crta}
   {A relaxed Hadwiger's Conjecture for list coloring}
   {J. Combin.\ Theory Ser.\ B} {97} {2007} {4} {647--651}

\objavljenoRevija
% 1.01: %list {\bf 5}. KAWARABAYASHI, Ken-ichi, MOHAR, Bojan. Some recent progress and applications in graph minor theory. {\it Graphs comb.}, 2007, vol. 23, no. 1, str. 1-46. http://dx.doi.org/10.1007/s00373-006-0684-x. $[$COBISS.SI-ID 14377561$]$\\ 
   {K.~Kawarabayashi, \crta}
   {Some recent progress and applications in graph minor theory}
   {Graphs Combin.} {23} {2007} {1} {1--46}

\objavljenoRevija
% 1.01: %list {\bf 7}. MOHAR, Bojan. On the Laplacian coefficients of acyclic graphs. {\it Linear algebra appl.}. $[$Print ed.$]$, 2007, vol. 422, iss. 2+3, str. 736-741. http://dx.doi.org/doi:10.1016/j.laa.2006.12.005. $[$COBISS.SI-ID 14260569$]$\\ 
   {}
   {On the Laplacian coefficients of acyclic graphs}
   {Linear Algebra Appl.} {422} {2007} {2+3} {736--741}

\objavljenoRevija
{M. Devos, J. Ebrahimi, M. Ghebleh, L. Goddyn, \crta, R. Naserasr}
{Circular coloring the plane}
{SIAM J. Discrete Math.} {21} {2007} {} {461--465}

\end{skupina} 


%--------------------------------------------------------
%  D. urednistvo v znanstvenih revijah in zbornikih
%     znanstvenih konferenc
%--------------------------------------------------------

\begin{skupina}{D}

\urednikRevija
   {�lan uredni�kega odbora}
   {Linear and Multilinear Algebra}

\urednikRevija
   {Urednik}
   {Journal of Graph Theory}

\urednikRevija
   {�lan uredni�kega odbora}
   {Journal of Combinatorial Theory, Series B}

\urednikRevija
   {�lan uredni�kega odbora}
   {{\sc Match}.\ Communications in Mathematical and in Computer Chemistry}

\urednikRevija
   {Podro�ni urednik}
   {Discrete Mathematics}

\end{skupina}


%--------------------------------------------------------
%  E. organizacija mednarodnih in domacih znanstvenih 
%     srecanj
%--------------------------------------------------------

\begin{skupina}{E}

%\organizacija
%   {OPIS}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

\organizacija
{Predsednik programskega odbora}
{CanaDAM'07, 1st Canadian Discrete and Algorithmic Mathematics Conference}
{Banff} {Kanada} {maj} {2007} 

\organizacija
{Soorganizator}
{6th Slovenian International Conference on Graph Theory}
{Bled} {Slovenija} {junij} {2007} 

\organizacija
{Soorganizator}
{Workshop on the Cycle Double Cover Conjecture}
{PIMS UBC\&SFU} {Kanada} {avgust} {2007} 

\organizacija
{Soorganizator}
{Infinite Graphs}
{Banff} {Kanada} {oktober} {2007} 

\end{skupina} 

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  F. vabljena predavanja na tujih ustanovah in 
%     mednarodnih konferencah
%--------------------------------------------------------

\begin{skupina}{F}

%\predavanjeUstanova
%   {NASLOV}
%   {OPIS}
%   {USTANOVA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO}
%\predavanjeKonferenca
%   {NASLOV}
%   {OPIS}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

\predavanjeKonferenca
   {1-embedded minors of 1-embedded graphs}
   {vabljeno predavanje}
   {Joint Mathematics Meetings, SIAM Minisymposium on Structure and Topology in Graph Theory}
   {New Orleans} {ZDA} {januar} {2007}

\predavanjeKonferenca
   {Small separations in symmetric graphs}
   {vabljeno predavanje}
   {Graph Theory}
   {Oberwolfach} {Nem\v cija} {marec} {2007}

\predavanjeKonferenca
   {How Large Must the Set of Subset Sums be?}
   {vabljeno plenarno predavanje}
   {Algebraic Graph Theory}
   {Teheran} {Iran} {april} {2007}

\predavanjeKonferenca
   {Small separations in symmetric graphs}
   {vabljeno plenarno predavanje}
   {Algebraic Graph Theory}
   {Teheran} {Iran} {april} {2007}

\predavanjeKonferenca
   {Chromatic number and immersions of complete graphs}
   {vabljeno predavanje}
   {CanaDAM'07, Special Session on Graph Minors}
   {Banff} {Kanada} {maj} {2007}

\predavanjeKonferenca
   {Polyhedral surfaces and combinatorial curvature}
   {vabljeno plenarno predavanje}
   {Combinatorics and Optimization \@ 40}
   {Waterloo} {Kanada} {junij} {2007}

\predavanjeKonferenca
   {Algorithms and obstructions for some minor-closed families of graphs}
   {vabljeno plenarno predavanje}
   {Algorithmic Graph Structure Theory}
   {Blankensee} {Nem\v cija} {oktober} {2007}

\predavanjeKonferenca
   {Euler's formula for infinite graphs}
   {vabljeno predavanje}
   {Infinite graphs}
   {Banff} {Kanada} {oktober} {2007}

\predavanjeKonferenca
   {Algorithms on graphs embedded on surfaces}
   {vabljeno plenarno predavanje}
   {Workshop on Algorithms, Combinatorics, and Geometry}
   {Denton, Texas} {ZDA} {november} {2007}

\end{skupina} 


%--------------------------------------------------------
%  G. aktivne udelezbe na mednarodnih in domacih
%     konferencah
%--------------------------------------------------------

%\begin{skupina}{G}

%\konferenca
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 

\begin{skupina}{G}

\konferenca
% 1.08: %list {\bf 11}. DEMAINE, Erik D., HAJIAGHAYI, MohammadTaghi, MOHAR, Bojan. Approximation algorithms via contraction decomposition. V: {\it Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, (Proceedings in Applied Mathematics, 125). New York: ACM; Philadelphia: SIAM, 2007, str. 278-287. $[$COBISS.SI-ID 14378073$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 787/237: Ne najdem podatka {DRZAVA}
   {Approximation algorithms via contraction decomposition}
   {18th Annual ACM-SIAM Symposium on Discrete Algorithms SODA'07}
   {New Orleans} {ZDA} {januar} {2007} 

\konferenca
% 1.12: %list {\bf 17}. DEVOS, Matt, KAWARABAYASHI, Ken-ichi, MOHAR, Bojan, OKAMURA, Haruko. Chromatic number and immersions of complete graphs. V: 1st Canadian Discrete and Algorithmic Mathematics Conference, May 28-31, 2007, Banff, Alberta, Canada. {\it CanaDAM 2007 : programme and abstracts}. Banff: $[$s.n.$]$, 2007, str. 44. $[$COBISS.SI-ID 14403417$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 840/253: Ne najdem podatka {DRZAVA}
   {Eigenvalues of (3,6)-polyhedra}
   {1st Canadian Discrete and Algorithmic Mathematics Conference}
   {Banff} {Kanada} {maj} {2007} 

\konferenca
% 1.12: %list {\bf 18}. GODDYN, Luis, DEVOS, Matt, MOHAR, Bojan, KAWARABAYASHI, Ken-ichi. Light circuits in heavy graphs. V: 1st Canadian Discrete and Algorithmic Mathematics Conference, May 28-31, 2007, Banff, Alberta, Canada. {\it CanaDAM 2007 : programme and abstracts}. Banff: $[$s.n.$]$, 2007, str. 45. $[$COBISS.SI-ID 14403673$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 848/269: Ne najdem podatka {DRZAVA}
   {Light circuits in heavy graphs}
   {1st Canadian Discrete and Algorithmic Mathematics Conference}
   {Banff} {Kanada} {maj} {2007} 

\konferenca
% 1.12: %list {\bf 14}. MOHAR, Bojan, SIMONYI, G\'{a}bor, TARDOS, G\'{a}bor. Local chromatic number of odd quadrangulations. V: 1st Canadian Discrete and Algorithmic Mathematics Conference, May 28-31, 2007, Banff, Alberta, Canada. {\it CanaDAM 2007 : programme and abstracts}. Banff: $[$s.n.$]$, 2007, str. 31. $[$COBISS.SI-ID 14402649$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 816/277: Ne najdem podatka {DRZAVA}
   {Local chromatic number of odd quadrangulations}
   {1st Canadian Discrete and Algorithmic Mathematics Conference}
   {Banff} {Kanada} {maj} {2007} 

\konferenca
% 1.12: %list {\bf 16}. DEVOS, Matt, MOHAR, Bojan, \v{S}\'{A}MAL, Robert. Trading handles for crossings. V: 1st Canadian Discrete and Algorithmic Mathematics Conference, May 28-31, 2007, Banff, Alberta, Canada. {\it CanaDAM 2007 : programme and abstracts}. Banff: $[$s.n.$]$, 2007, str. 39. $[$COBISS.SI-ID 14403161$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 832/285: Ne najdem podatka {DRZAVA}
   {Trading handles for crossings}
   {1st Canadian Discrete and Algorithmic Mathematics Conference}
   {Banff} {Kanada} {maj} {2007} 

\konferenca
% 1.12: {\bf 12}. MOHAR, Bojan, DEVOS, Matt, GODDYN, Luis, \v{S}\'{A}MAL, Robert. Eigenvalues of (3, 6)-polyhedra. V: PISANSKI, Toma\v{z} (ur.), BOBEN, Marko (ur.), HORVAT, Boris (ur.), LUK\v{S}I\v{C}, Primo\v{z} (ur.), ORBANI\'{C}, Alen (ur.). {\it Abstracts of the 6th Slovenian International Conference on Graph Theory, Bled'07, Bled, Slovenia, 24-30 June 2007}. Ljubljana: DMFA - zalo\v{z}ni\v{s}tvo, 2007, str. 35. $[$COBISS.SI-ID 14384473$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 799/301: Ne najdem podatka {MESEC}
   {Eigenvalues of (3,6)-polyhedra}
   {6th Slovenian International Conference on Graph Theory}
   {Bled} {Slovenija} {junij} {2007} 

\konferenca
% 1.12: %list {\bf 13}. MOHAR, Bojan, DEVOS, Matt, \v{S}\'{A}MAL, Robert. Trading handles for crossings. V: PISANSKI, Toma\v{z} (ur.), BOBEN, Marko (ur.), HORVAT, Boris (ur.), LUK\v{S}I\v{C}, Primo\v{z} (ur.), ORBANI\'{C}, Alen (ur.). {\it Abstracts of the 6th Slovenian International Conference on Graph Theory, Bled'07, Bled, Slovenia, 24-30 June 2007}. Ljubljana: DMFA - zalo\v{z}ni\v{s}tvo, 2007, str. 58. $[$COBISS.SI-ID 14390873$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\mohar.tex 807/309: Ne najdem podatka {MESEC}
   {Trading handles for crossings}
   {6th Slovenian International Conference on Graph Theory}
   {Bled} {Slovenija} {junij} {2007} 

\end{skupina} 

%--------------------------------------------------------
%  H. strokovni clanki
%--------------------------------------------------------

%\begin{skupina}{H}

%\clanekRevija
%   {AVTORJI}
%   {NASLOV}
%   {REVIJA} {LETNIK} {LETO} {STEVILKA} {STRANI}
%\clanekZbornik
%   {AVTORJI}
%   {NASLOV}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO}
%   {ZBORNIK} {STRANI} 

%\end{skupina} 

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  I. razno
%--------------------------------------------------------

\begin{skupina}{I}
\razno
   {Mentor pri eni doktorski disertaciji}
\end{skupina} 

