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


\begin{skupina}{B}

\sprejetoRevija
  {B.~M.~\'Abrego, O.~Aichholzer, S.~Fern\'andez-Merchant, D.~McQuillan, \crta, P.~Mutzel, P.~Ramos, R.~ B.~Richter, B.~Vogtenhuber}
  {Bishellable drawings of $K_n$}
  {SIAM J. Discrete Math.}

\sprejetoRevija
  {F.~Knox, \crta}
  {Maximum number of colourings: 4-chromatic graphs}
  {J. Combin.\ Theory Ser.\ B}

\sprejetoRevija
  {A.~Bonato, \crta}
  {Topological directions in Cops and Robbers}
  {J. Comb.}

\sprejetoRevija
  {F.~Knox, \crta, D.~Wood}
  {Exponential golden ratio inequality for vertex degrees of graphs}
  {Amer.\ Math.\ Monthly}

\sprejetoZbornik
  {D.~Bokal, Z.~Dvorak, P.~Hlineny, J.~Leanos, \crta, T.~Wiedera}
  {Bounded maximum degree conjecture holds precisely for $c$-crossing-critical graphs with $c \le 12$}
  {35\uth International Symposium on Computational Geometry (SoCG 2019)}
  {Portland, OR} {ZDA} {junij} {2019}

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



\objavljenoRevija
   {D.~Gajser, \crta}
   {Minimal normal graph covers}
   {Combinatorica} {38} {2018} {} {1415--1436}

\objavljenoRevija
% 1. S.~A.~Hosseini, \crta. Game of cops and robbers in oriented quotients of the integer grid. Discrete Math.. [Print ed.]. 2018, vol. 341, iss. 2, str. 439-450. ISSN 0012-365X. https://doi.org/10.1016/j.disc.2017.09.011, DOI: 10.1016/j.disc.2017.09.011. [COBISS.SI-ID 18210649] 
   {S.~A.~Hosseini, \crta}
   {Game of cops and robbers in oriented quotients of the integer grid}
   {Discrete Math.} {341} {2018} {} {439--450}

\objavljenoRevija
% 2. M.~Kotrb��k, N.~Matsumoto, \crta, A.~Nakamoto, K.~Noguchi, K.~Ozeki, A.~Vodopivec. Gr�nbaum colorings of even triangulations on surfaces. J. Graph Theory. April 2018, vol. 87, iss. 4, str. 475-491. ISSN 0364-9024. https://doi.org/10.1002/jgt.22169, DOI: 10.1002/jgt.22169. [COBISS.SI-ID 18466393] 
   { M.~Kotrb��k, N.~Matsumoto, \crta, A.~Nakamoto, K.~Noguchi, K.~Ozeki, A.~Vodopivec}
   {Gr�nbaum colorings of even triangulations on surfaces}
   {J. Graph Theory} {87} {2018} {} {475--491}

\objavljenoRevija
% 3. F.~Havet, A.~K.~Maia, \crta. Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory. April 2018, vol. 87, iss. 4, str. 536-560. ISSN 0364-9024. https://doi.org/10.1002/jgt.22174, DOI: 10.1002/jgt.22174. [COBISS.SI-ID 18466137] 
   {F.~Havet, A.~K.~Maia, \crta}
   {Finding a subdivision of a prescribed digraph of order 4}
   {J. Graph Theory} {87} {2018} {} {536--560}

\objavljenoRevija
% 4. B.~Afshari, S.~Akbari, M.~J.~Moghaddamzadeh, \crta. The algebraic connectivity of a graph and its complement. Linear Algebra Appl.[Print ed.]. Oct. 2018, vol. 555, str. 157-162. ISSN 0024-3795. https://doi.org/10.1016/j.laa.2018.06.015, DOI: 10.1016/j.laa.2018.06.015. [COBISS.SI-ID 18453849] 
   {B.~Afshari, S.~Akbari, M.~J.~Moghaddamzadeh, \crta}
   {The algebraic connectivity of a graph and its complement}
   {Linear Algebra Appl.} {5{5}5} {2018} {} {157--162}

\objavljenoRevija
% 5. \crta. The structure of ABC-minimal trees with given number of leaves. MATCH Commun.\ Math.\ Comput.\ Chem. 2018, vol. 79, no. 2, str. 415-430. ISSN 0340-6253. http://match.pmf.kg.ac.rs/electronic_versions/Match79/n2/match79n2_415-430.pdf. [COBISS.SI-ID 18272089] 
   {}
   {The structure of ABC-minimal trees with given number of leaves}
   {\break MATCH Commun.\ Math.\ Comput.\ Chem.} {79} {2018} {} {415--430}

\objavljenoRevija
% 6. C.~A.~Alfaro, A.~Arroyo, M.~Der��r, \crta. The crossing number of the cone of a graph. SIAM J. Discrete Math.. vol. 32, no. 3, str. 2080-2093. ISSN 0895-4801. https://doi.org/10.1137/17M1115320, DOI: 10.1137/17M1115320. [COBISS.SI-ID 18465881] 
   {C.~A.~Alfaro, A.~Arroyo, M.~Der��r, \crta}
   {The crossing number of the cone of a graph}
   {SIAM J. Discrete Math.} {32} {2018} {} {2080-2093}

\objavljenoZbornik
% 7. E.~Colin de Verdiere, T.~Magnard, \crta. Embedding graphs into two-dimensional simplicial complexes. V: B.~Speckmann (ur.), C.~D.~T�th. (ur.). 34th International Symposium on Comput.\ Geom. : SoCG 2018, June 11-14, 2018, Budapest, Hungary. Saarbr�cken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum f�r Informatik GmbH, Dagstuhl Publishing, June 2018. 14 str. Leibniz international proceedings in informatics, 99. ISBN 978-3-95977-066-8. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2018/8740/pdf/LIPIcs-SoCG-2018-27.pdf, DOI: 10.4230/LIPIcs.SoCG.2018.27. [COBISS.SI-ID 18467929]  
   { E.~Colin de Verdiere, T.~Magnard, \crta}
   {Embedding graphs into two-dimensional simplicial complexes}
   {34\uth International Symposium on Computational Geometry}
   {Budimpe�ta} {Mad�arska} {junij} {2018} 
   {Conference Proceedings} {14 str} 

\objavljenoZbornik
%  8. Z.~Dvo��k, P.~Hlin�n�, \crta. Structure and generation of crossing-critical graphs. V: B.~Speckmann (ur.), C.~D.~T�th. (ur.). 34th International Symposium on Comput.\ Geom. : SoCG 2018, June 11-14, 2018, Budapest, Hungary. Saarbr�cken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum f�r Informatik GmbH, Dagstuhl Publishing, June 2018. 14 str. Leibniz international proceedings in informatics, 99. ISBN 978-3-95977-066-8. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2018/8746/pdf/LIPIcs-SoCG-2018-33.pdf, DOI: 10.4230/LIPIcs.SoCG.2018.33. [COBISS.SI-ID 18467673] 
   {Z.~Dvo��k, P.~Hlin�n�, \crta}
   {Structure and generation of crossing-critical graphs}
   {34\uth International Symposium on Computational Geometry}
   {Budimpe�ta} {Mad�arska} {junij} {2018} 
   {Conference Proceedings} {14 str} 

\objavljenoZbornik
%  9. R.~Churchley, \crta. A submodular measure and approximate Gomory-Hu theorem for packing odd trails. V: A.~Czumaj (ur.). Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: SIAM, cop. 2108. Str. 210-218. SIAM-AMS proceedings. ISBN 978-1-61197-503-1. ISSN 0080-5084. https://doi.org/10.1137/1.9781611975031.15, DOI: /10.1137/1.9781611975031.15. [COBISS.SI-ID 18467417] 
   {R.~Churchley, \crta}
   {A submodular measure and approximate Gomory-Hu theorem for packing odd trails}
   {29\uth Annual ACM-SIAM Symposium on Discrete Algorithms}
   {Philadelphia} {ZDA} {januar} {2018} 
   {Proceedings} {210--218} 

\objavljenoZbornik
  {Y.~Jing, \crta}
  {Efficient polynomial-time approximation scheme for the genus of dense graphs}
  {59\uth Annual IEEE Symposium on Foundations of Computer Science}
  {Pariz} {Francija} {oktober} {2018}
  {FOCS 2018} {719--730}

\end{skupina} 

%   Ni podatkov za to sekcijo

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

%\begin{skupina}{D}

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

%\end{skupina} 


\begin{skupina}{D}

\urednikRevija
   {Glavni urednik}
   {Electronic Journal of Combinatorics}

\urednikRevija
   {{Glavni urednik}}
   {Journal of Combinatorial Theory. Series B}

\urednikRevija
   {�lan uredni�kega odbora}
   {Journal of Graph Theory}

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

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

\urednikRevija
   {�lan uredni�kega odbora}
   {Discrete and Computational Geometry}

\urednikRevija
   {�lan uredni�kega odbora}
   {Tbilisi Mathematical Journal}

\end{skupina}


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

%\begin{skupina}{E}

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

%\end{skupina} 

\begin{skupina}{E}

\organizacija
   {�lan programskega odbora}
   {4\uth Annual Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2018)}
   {Guwahati} {Indija} {februar} {2018}
\organizacija
   {�lan programskega odbora}
   {ACM-SIAM Symposium on Discrete Algorithms (SODA'19)}
   {San Diego, CA} {ZDA} {januar} {2019}

\organizacija
   {�lan organizacijskega odbora}
   {Crossing numbers}
   {Banff} {Kanada} {oktober} {2018}

\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
  {Excluded structure results: Graph minors and graph immersions}
  {plenarno predavanje}
  {Indo-Canadian School on Algorithms and Combinatorics}
  {Indian Institute of Technology Guwahati} {Indija} {februar} {2018}

\predavanjeKonferenca
  {Totally odd immersions of graphs}
  {vabljeno predavanje}
  {1136\uth Meeting of the AMS}
  {Columbus, OH}{ZDA}{marec}{2018}

\predavanjeKonferenca
  {Graphs on Surfaces, 10 hours Graduate Course}
  {plenarno predavanje}
  {Challenges in Combinatorial and Discrete Geometry}
  {Barcelona}{�panija}{maj}{2018}

\predavanjeKonferenca
  {On the genus of dense graphs}
  {plenarno predavanje}
  {8\uth LAWCG, VIII Latin American Workshop on Cliques in Graphs}
  {Rio de Janeiro}{Brazilija}{avgust}{2018}

\predavanjeKonferenca
  {Fifty years of the Ringel and Youngs Theorem}
  {plenarno predavanje}
  {Southwestern German Workshop on Graph Theory}
  {Thomashof}{Nem�ija}{avgust}{2018}

\predavanjeKonferenca
  {Fifty years of the Ringel and Youngs Map Colour Theorem}
  {plenarno predavanje}
  {27\uth Workshop ``Cycles and Colourings''}
  {Nov� Smokovec}{Slova�ka}{september}{2018}

\predavanjeKonferenca
  {Beauty and challenges of crossing numbers}
  {plenarno predavanje}
  {26\uth In\-ter\-na\-ti\-o\-nal Symposium on Graph Drawing and Network Visualization, GD 2018}
  {Barcelona}{�panija}{september}{2018}

\predavanjeKonferenca
  {Fifty years of the Ringel and Youngs Map Colour Theorem}
  {vabljeno predavanje}
  {International Workshop on Combinatorial and Computational Aspects of Optimization, Topology and Algebra, ACCOTA 2018}
  {Merida}{Mehika}{december}{2018}

\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
% 7. E.~Colin de Verdiere, T.~Magnard, \crta. Embedding graphs into two-dimensional simplicial complexes. V: B.~Speckmann (ur.), C.~D.~T�th. (ur.). 34th International Symposium on Comput.\ Geom. : SoCG 2018, June 11-14, 2018, Budapest, Hungary. Saarbr�cken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum f�r Informatik GmbH, Dagstuhl Publishing, June 2018. 14 str. Leibniz international proceedings in informatics, 99. ISBN 978-3-95977-066-8. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2018/8740/pdf/LIPIcs-SoCG-2018-27.pdf, DOI: 10.4230/LIPIcs.SoCG.2018.27. [COBISS.SI-ID 18467929]  
   {Embedding graphs into two-dimensional simplicial complexes}
   {34\uth In\-ter\-na\-ti\-o\-nal Symposium on Computational Geometry}
   {Budimpe�ta} {Mad\-�ar\-ska} {junij} {2018} 

\konferenca
%  8. Z.~Dvo��k, P.~Hlin�n�, \crta. Structure and generation of crossing-critical graphs. V: B.~Speckmann (ur.), C.~D.~T�th. (ur.). 34th International Symposium on Comput.\ Geom. : SoCG 2018, June 11-14, 2018, Budapest, Hungary. Saarbr�cken/Wadern: Schloss Dagstuhl - Leibniz-Zentrum f�r Informatik GmbH, Dagstuhl Publishing, June 2018. 14 str. Leibniz international proceedings in informatics, 99. ISBN 978-3-95977-066-8. ISSN 1868-8969. http://drops.dagstuhl.de/opus/volltexte/2018/8746/pdf/LIPIcs-SoCG-2018-33.pdf, DOI: 10.4230/LIPIcs.SoCG.2018.33. [COBISS.SI-ID 18467673] 
   {Structure and generation of crossing-critical graphs}
   {34\uth International Symposium on Computational Geometry}
   {Bu\-dim\-pe�\-ta} {Mad�arska} {junij} {2018} 

\konferenca
%  9. R.~Churchley, \crta. A submodular measure and approximate Gomory-Hu theorem for packing odd trails. V: A.~Czumaj (ur.). Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: SIAM, cop. 2108. Str. 210-218. SIAM-AMS proceedings. ISBN 978-1-61197-503-1. ISSN 0080-5084. https://doi.org/10.1137/1.9781611975031.15, DOI: /10.1137/1.9781611975031.15. [COBISS.SI-ID 18467417] 
   {A submodular measure and approximate Gomory-Hu theorem for packing odd trails}
   {29\uth Annual ACM-SIAM Symposium on Discrete Algorithms}
   {Philadelphia} {ZDA} {januar} {2018} 
 
\konferenca
  {The genus of a random bipartite graph}
  {28\uth Coast Combinatorics Conference}
  {Victoria, BC}{Kanada}{marec}{2018}

\konferenca
  {On the genus of the complete 3-uniform hypergraph}
  {SIAM Conference on Discrete Mathematics (DM 18)}
  {Denver}{ZDA}{junij}{2018}

\konferenca
  {Efficient polynomial-time approximation scheme for the genus of dense graphs}
  {59\uth Annual IEEE Symposium on Foundations of Computer Science}
  {Pariz}{Francija}{oktober}{2018}

\konferenca
  {50 years of the Ringel and Youngs Map Colour Theorem}
  {CMS Winter Meeting}
  {Vancouver}{Kanada}{december}{2018}

\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
%   {OPIS} 

%\end{skupina} 

%   Ni podatkov za to sekcijo

%1.22 Intervju
%10. B.~Mohar (intervjuvanec). Znanost in vsakdanje �ivljenje sta zelo prepletena : matematik Bojan Mohar; z rezultati na podro�ju teolo�ke teorije grafov si je prislu�il priznanje Kanadskega kraljevega zdru�enja. Delo. [Tiskana izd.]. 15. nov. 2018, leto 60, �t. 263, str. 18, portret. ISSN 0350-7521. https://www.delo.si/novice/znanoteh/znanost-in-vsakdanje-zivljenje-sta-zelo-prepletena-112671.html. [COBISS.SI-ID 18494809] 
%11. B.~Mohar (intervjuvanec). Prof. dr. Bojan Mohar : slovenski matematik je prejel presti�no nagrado Kanadskega kraljevega zdru�enja. MMC RTV SLO : prvi multimedijski portal. 3. oktober 2018. ISSN 

%--------------------------------------------------------
%  tuji gosti
%--------------------------------------------------------

%\begin{seznam}
%\gost {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO} {POVABILO}
%\end{seznam} 

%--------------------------------------------------------
%  gostovanja
%--------------------------------------------------------

%\begin{seznam}
%\gostovanje {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO}
%\end{seznam} 

