\clan {Bojan Mohar}

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

\begin{skupina}{A}

\monografija
   {}
   {The Four-Color Theorem, poglavje v ``The Princeton Companion 
   to Mathematics'', Chapter V.12, (ur.)~T.~Gowers, 696--698}
   {Princeton University Press}
   {Princeton}{ZDA}{2008}

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

\end{skupina} 

%--------------------------------------------------------
%  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} 

\sprejetoRevija
   {}
   {On the sum of $k$ largest eigenvalues of graphs and symmetric matrices}
   {J. Combin.\ Theory Ser.\ B}

\sprejetoRevija
   {M. DeVos, L. Goddyn, \crta}
   {A generalization of Kneser's Addition Theorem}
   {Adv.\ Math.}

\sprejetoRevija
   {T.~B\"ohme, K.-I.~Kawarabayashi, J.~Maharry, \crta}
   {Linear connectivity forces large complete bipartite minors}
   {J. Combin.\ Theory Ser.\ B}

\sprejetoRevija
   {}
   {2-cell embeddings with prescribed face lengths and genus}
   {Ann.\ Comb.}

\sprejetoRevija
   {M. DeVos, L. Goddyn, \crta, R. \v{S}amal}
   {Cayley sum graphs and eigenvalues of (3,6)-fullerenes}
   {J. Combin.\ Theory Ser.\ B}

\sprejetoRevija
   {S. Cabello, M. DeVos, J. Erickson, \crta}
   {Finding one tight cycle}
   {ACM Trans.\ Algorithms}

\sprejetoRevija
   {\crta, J. Salas}
   {A new Kempe invariant and the (non)-ergodicity of 
   the Wang--Swendsen--Koteck\'y algorithm}
   {J. Phys.\ A}

\sprejetoZbornik
   {S. Cabello, \crta}
   {Crossing and weighted crossing number of near-planar graphs}
   {Graph Drawing 2008}
   {Heraklion, Kreta}{Gr�ija} {september} {2008}   

\sprejetoZbornik
   {V. P. Korzhik, \crta}
   {Minimal obstructions for 1-immersions and hardness of 1-planarity testing}
   {Graph Drawing 2008}
   {Heraklion, Kreta}{Gr�ija} {september} {2008}   

\end{skupina} 


%   Ni podatkov za to sekcijo

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

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

\begin{skupina}{C}

\objavljenoRevija
   {M. DeVos, K.-I.~Kawarabayashi, \crta}
   {Locally planar graphs are 5-choosable}
   {J. Combin.\ Theory Ser.\ B}{98}{2008}{}{1215--1232}

\objavljenoRevija
   {J. Ebrahimi B., \crta, V. Nikiforov, A. Sheikh Ahmady}
   {On the sum of two largest eigenvalues of a symmetric non-negative matrix}
   {Linear Algebra Appl.}{429}{2008}{}{2781--2787}

\objavljenoRevija
   {\crta, E. Steffen, A. Vodopivec}
   {Relating embedding and coloring properties of snarks}
   {Ars Math.\ Contemp.}{1}{2008}{}{169--184}

\objavljenoZbornik
   {S.~Cabello, M.~Devos, J.~Erickson, \crta}
   {Finding one tight cycle}
   {19$^{\rm th}$ ACM-SIAM Symposium on Discrete Algorithms (SODA'08)}
   {San Francisco} {ZDA} {januar} {2008}
   {Proc.\ 19$^{\rm th}$ annual ACM-SIAM symposium on Discrete algorithms 2008} {527--531} 

\objavljenoZbornik
   {K. Kawarabayashi, \crta}
   {Graph and map isomorphism and all polyhedral embeddings in linear time}
   {40$^{\rm th}$ annual ACM symposium on Theory of computing (STOC'08)} 
   {Victoria}{Kanada}{maj}{2008}
   {Proc.\ 40$^{\rm th}$ annual ACM symposium on theory of computing, Victoria, B.C., Canada} {471--480}

\objavljenoRevija
   {M.~DeVos, \crta, R.~\v{S}\'{a}mal}
   {Unexpected behaviour of crossing sequences}
   %{The International Conference on Topological and Geometric Graph Theory}
   %{Paris} {Francija} {maj} {2008}
   {Electr.\ Notes in Discrete Math.} {31} {2008} {} {259--264} 

\objavljenoRevija
   {\crta, S.~\v{S}pacapan}
   {Coloring parameters for graphs on surfaces}
   %{The International Conference on Topological and Geometric Graph Theory}
   %{Paris} {Francija} {maj} {2008}
   {Electr.\ Notes in Discrete Math.} {31} {2008} {} {281--286} 

\objavljenoZbornik
   {V. Dujmovi\'c, K. Kawarabayashi, \crta, D. R. Wood}
   {Improved upper bounds on the crossing number}
   {SCG'08}
   {College Park, MD}{ZDA}{junij}{2008}
   {SCG'08: Proc.\ 24$^{\rm th}$ Annual Symposium on Computational Geometry}{375--384}

\objavljenoZbornik
   {K. Kawarabayashi, \crta, B. Reed}
   {A simpler linear time algorithm for embedding graphs into an arbitrary surface 
   and the genus of graphs of bounded tree-width}
   {49$^{\rm th}$ Ann.\ Symp.\ on Foundations of Computer Science (FOCS'08)}
   {Philadelphia}{ZDA}{oktober}{2008}
   {Proc.\ 49$^{\rm th}$ Ann.\ Symp.\ on Foundations of Computer Science (FOCS'08), IEEE}{7{7}1--780}

\objavljenoZbornik
   {G. Fijav\v z, \crta}
   {Rigidity and separation indices of embedded graphs}
   {20$^{\rm th}$ Workshop on Topological Graph Theory in Yokohama}
   {Yokohama} {Japonska} {november} {2008}
   {The 20$^{\rm th}$ Workshop on Topological Graph Theory in Yokohama, 
    Nov.~25 to 28, 2008, Yokohama Publishers, Yokohama, Japan}{18--19}

\objavljenoZbornik
   {\crta, S.~Cabello, M.~DeVos, R.~\v{S}\'{a}mal}
   {Crossing numbers of graphs on the plane and on other surfaces}
   {20$^{\rm th}$ Workshop on Topological Graph Theory in Yokohama}
   {Yokohama} {Japonska} {november} {2008}
   {The 20$^{\rm th}$ Workshop on Topological Graph Theory in Yokohama, 
    Nov.~25 to 28, 2008, Yokohama Publishers, Yokohama, Japan}{60--6{6}} 

\end{skupina} 

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

\begin{skupina}{D}

\urednikRevija
   {\v Clan uredni�kega odbora}
   {Linear and Multilinear Algebra}
\urednikRevija
   {Glavni urednik}
   {Journal of Graph Theory}
\urednikRevija
   {\v Clan uredni�kega odbora}
   {Journal of Combinatorial Theory, Series B}
\urednikRevija
   {\v Clan uredni�kega odbora}
   {{\sc Match}.\ Communications in Mathematical and in Computer Chemistry}
\urednikRevija
   {Podro\v cni urednik}
   {Discrete Mathematics}
\urednikRevija
   {\v Clan uredni�kega odbora}
   {Ars Mathematica Contemporanea}
\urednikRevija
   {Gostujo\v ci urednik}
   {Linear algebra and its applications, Vol. 429, iss. 11+12}

\end{skupina}

%\urednikRevija
%   {OPIS}
%   {REVIJA}
%\urednikZbornik
%   {OPIS}
%   {KONFERENCA}
%   {KRAJ} {DRZAVA} {MESEC} {LETO} 

%\end{skupina} 

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

\begin{skupina}{E}

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

\organizacija
   {\v Clan programskega odbora}
   {The International Conference on Topological and Geometric Graph Theory}
   {Pariz}{Francija}{maj}{2008}

\organizacija
   {\v Clan programskega odbora}
   {Groups and Infinite Graphs}
   {Dunaj}{Avstrija}{avgust}{2008}

\organizacija
   {Organizacija konference (soorganizatorji K. Kawarabayashi, B. Reed, P. Seymour)}
   {Graph Minors}
   {BIRS, Banff, Alberta} {Kanada} {oktober} {2008} 

\organizacija
   {\v Clan programskega odbora}
   {Workshop on Spectral Graph Theory}
   {Rio de Janeiro}{Brazilija}{december}{2008}

\end{skupina} 


%--------------------------------------------------------
%  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} 

%\end{skupina} 

\begin{skupina}{F}

\predavanjeKonferenca 
   {Degenerate colorings of graphs}
   {vabljeno plenarno predavanje}
   {10$^{\rm th}$ Coast Combinatorics Conference}
   {Victoria, B.C.} {Kanada} {april} {2008}

\predavanjeKonferenca 
   {Coloring parameters for graphs on surfaces}
   {vabljeno plenarno predavanje}
   {The International Conference on Topological and Geometric Graph Theory}
   {Pariz} {Francija} {maj} {2008}

\predavanjeKonferenca 
   {The sum of largest eigenvalues of graphs and matrices}
   {Vabljeno predavanje}
   {5$^{\rm th}$ Linear Algebra Workshop, Law'08}
   {Kranjska Gora} {} {maj} {2008}

\predavanjeKonferenca 
   {Polyhedral Surfaces and Combinatorial Curvature}
   {vabljeno plenarno predavanje}
   {SIAM Conference on Discrete Mathematics (SIAM DM'08)}
   {Burlington, VT} {ZDA} {junij} {2008}

\predavanjeKonferenca 
   {Coloring parameters and genus}
   {vabljeno plenarno predavanje}
   {Graph Theory 2008 at Sandbjerg Manor}
   {S{\o}nderborg} {Danska} {avgust} {2008}

\predavanjeKonferenca 
   {Crossing numbers of graphs on the plane and on other surfaces}
   {vabljeno plenarno predavanje}
   {The 20$^{\rm th}$ Workshop on Topological Graph Theory in Yokohama}
   {Yokohama} {Japonska} {november} {2008}

\predavanjeKonferenca 
   {The sum of largest eigenvalues of graphs and matrices}
   {vabljeno plenarno predavanje}
   {SGT in Rio - Workshop on Spectral Graph Theory with Applications on
   Computer Science, Combinatorial Optimization and Chemistry}
   {Rio de Janeiro} {Brazilija} {december} {2008}

\predavanjeKonferenca 
   {Linkless and knotless embeddings of graphs}
   {vabljeno plenarno predavanje}
   {Accota 2008 (Combinatorial and Computational Aspects of Optimization,
   Topology and Algebra)}
   {Oaxaca} {Mexico} {december} {2008}

\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
   {Finding one tight cycle}
   {19$^{\rm th}$ ACM-SIAM Symposium on Discrete Algorithms (SODA'08)}
   {San Francisco} {ZDA} {januar} {2008}

\konferenca
   {Unexpected behaviour of crossing sequences}
   {The International Conference on Topological and Geometric Graph Theory}
   {Pariz} {Francija} {maj} {2008} 

\konferenca
   {Graph and map isomorphism and all polyhedral embeddings in linear time}
   {40$^{\rm th}$ annual ACM symposium on Theory of computing (STOC'08)} 
   {Victoria}{Canada}{maj}{2008}

\konferenca
   {Improved upper bounds on the crossing number}
   {SCG'08}
   {College Park, MD}{ZDA}{junij}{2008}

\konferenca
   {Crossing and weighted crossing number of near-planar graphs}
   {GD'08}
   {Kreta}{Gr\v cija}{september}{2008}

\konferenca
   {Minimal obstructions for 1-immersions and hardness of 1-planarity testing}
   {GD 2008}
   {Kreta}{Gr\v cija}{september}{2008}

\konferenca
   {A simpler linear time algorithm for embedding graphs into an arbitrary surface 
   and the genus of graphs of bounded tree-width}
   {49$^{\rm th}$ Ann.\ Symp.\ on Foundations of Computer Science (FOCS'08)}
   {Philadelphia}{ZDA}{oktober}{2008}

\end{skupina} 

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

\begin{skupina}{I}

\razno
   {Vice Chair of the SIAM Activity Group on 
   Discrete Mathematics (SI\-AG/\-DM), 2008--09}

\end{skupina} 

