\clan {Sergio Cabello Justo}

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

\sprejetoRevija
% 1.01: %list {\bf 4}. CABELLO, Sergio. Hardness of approximation for crossing number. {\it Discrete Comput. Geom.}, 2012, 11 str.
%http://dx.doi.org/10.1007/s00454-012-9440-6, doi: 10.1007/s00454-012-9440-6: http://dx.doi.org/10.1007/s00454-012-9440-6.
%$[$COBISS.SI-ID 16340313$]$\\ 
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 1954/105: Ne najdem podatka {STEVILKA}
   {}
   {Hardness of approximation for crossing number}
   {Discrete Comput.\ Geom.}
   
\sprejetoRevija
% 1.01: %list {\bf 2}. CABELLO, Sergio, D\'{I}AZ-B\'{A}\~{N}EZ, Jos\'{e} Miguel, P\'{E}REZ LANTERO, Pablo. Covering a 
%bichromatic point set with two disjoint monochromatic disks. {\it Comput. Geom.}. $[$Print ed.$]$, 2012, 15 str. 
%http://dx.doi.org/10.1016/j.comgeo.2012.06.002, doi: 10.1016/j.comgeo.2012.06.002: http://dx.doi.org/10.1016/j.comgeo.2012.06.002. 
%$[$COBISS.SI-ID 16326233$]$\\ 
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 1938/161: Ne najdem podatka {STEVILKA}
   {\crta, J.~M.~D\'{i}az-B\'{a}\~{n}ez, P.~P\'{e}rez Lantero}
   {Covering a bichromatic point set with two disjoint monochromatic disks}
   {Comput.\ Geom.}


\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 5}. BENDICH, Paul, CABELLO, Sergio, EDELSBRUNNER, Herbert. A point calculus for interlevel set homology. 
%{\it Pattern Recognition Lett.}. $[$Print ed.$]$, 2012, vol. 33, iss. 11, 1436-1444. http://dx.doi.org/10.1016/j.patrec.2011.10.007. 
%$[$COBISS.SI-ID 16059993$]$\\ 
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 1960/80: Ne najdem podatka {STRANI}
   {P.~Bendich, \crta, H.~Edelsbrunner}
   {A point calculus for interlevel set homology}
   {Pattern Recognition Lett.} {33} {2012} {11} {1436�-14{4}4}

\objavljenoRevija
% 1.01: %list {\bf 3}. BEREG, Sergey, CABELLO, Sergio, D\'{I}AZ-B\'{A}\~{N}EZ, Jos\'{e} Miguel, P\'{E}REZ LANTERO, Pablo, SEARA, Carlos,
%VENTURA, Inma. The class cover problem with boxes. {\it Comput. Geom.}. $[$Print ed.$]$, 2012, vol. 45, iss. 7, str. 294-304.
%http://dx.doi.org/10.1016/j.comgeo.2012.01.014. $[$COBISS.SI-ID 16205657$]$\\ 
   {S.~Bereg, \crta, J.~M.~D\'{i}az-B\'{a}\~{n}ez, P.~P\'{e}rez Lantero, C.~Seara, I.~Ventura}
   {The class cover problem with boxes}
   {Comput.\ Geom.} {45} {2012} {7} {294--304}

\objavljenoRevija
% 1.01: {\bf 1}. CABELLO, Sergio. Many distances in planar graphs. {\it Algorithmica}, 2012, vol. 62, no. 1-2, str. 361-381. 
%http://dx.doi.org/10.1007/s00453-010-9459-0. $[$COBISS.SI-ID 15702873$]$\\ 
   {}
   {Many distances in planar graphs}
   {Algorithmica} {62} {2012} {1-2} {361--381}


\objavljenoRevija
% 1.08: {\bf 9}. CABELLO, Sergio, COLIN DE VERDI\`{E}RE, \'{E}ric, LAZARUS, Francis. Algorithms for the edge-width of an embedded graph. 
%V: 26th Annual Symposium on Computational Geometry, June 13th-16th, 2010, Snowbird, Utah. 
%{\it 26th Annual Symposium on Computation Geometry at Snowbird, Utah, USA : Special issue}, (Computational geometry, Vol. 45, iss. 5-6,
%2012). Amsterdam: Elsevier, 2012, 2012, vol. 45, issue 5-6, str. 215-224. http://dx.doi.org/10.1016/j.comgeo.2011.12.002.
%$[$COBISS.SI-ID 16093017$]$\\ 
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 1991/142: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 1991/143: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 1991/144: Ne najdem podatka {LETO}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 1991/145: Ne najdem podatka {ZBORNIK}
   {\crta, \'{E}.~Colin De Verdi\`{e}re, F.~Lazarus}
   {Algorithms for the edge-width of an embedded graph}
   {Comput.\ Geom.} {45} {2012} {5--6} {215�224}


      
\objavljenoZbornik
% 1.08: %list {\bf 10}. BUSARYEV, Oleksiy, CABELLO, Sergio, CHEN, Chao, DEY, Tamal Krishna, WANG, Yusu. Annotating simplices
%with a homology basis and its applications. V: FOMIN, Fedor V. (ur.), KASKI, Petteri (ur.). 13th Scandinavian Symposium and
%Workshops on Algorithm Theory, Helsinki, Finland, 4-6 July 2012. {\it Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium
%and Workshops, Helsinki, Finland, July 4-6, 2012 : proceedings}, (Lecture notes in computer science, 7357). Heidelberg: Springer,
%cop. 2012, str. 189-200. http://dx.doi.org/10.1007/978-3-642-31155-0\_17. $[$COBISS.SI-ID 16325721$]$\\ 
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 2000/93: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 2000/94: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 2000/95: Ne najdem podatka {ZBORNIK}
   {O.~Busaryev, \crta, C.~Chen, T.~K.~Dey, Y.~Wang}
   {Annotating simplices with a homology basis and its applications}
   {13\uth Scandinavian Symposium and Workshops on Algorithm Theory}
   {Helsinki} {Finland} {julij} {2012}
   {Algorithm Theory -- SWAT 2012 (Lecture notes in computer science, 7357)} {189--20{0}} 


\objavljenoZbornik
% 1.08: %list {\bf 11}. CABELLO, Sergio, CARDINAL, Jean, LANGERMAN, Stefan. The clique problem in ray intersection graphs. V: EPSTEIN,
%Leah (ur.), FERRAGINA, Paolo (ur.). 20th European Symposium on Algorithms - ESA 2012, September 10-12, Ljubljana, Slovenia.
%{\it Algorithms - ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012 : proceedings},
%(Lecture notes in computer science, 7501). Heidelberg: Springer, cop. 2012, str. 241-252. 
%http://dx.doi.org/10.1007/978-3-642-33090-2\_22. $[$COBISS.SI-ID 16378201$]$\\ 
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 2012/124: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 2012/125: Ne najdem podatka {LETO}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 2012/126: Ne najdem podatka {ZBORNIK}
   {\crta, J.~Cardinal, S.~Langerman}
   {The clique problem in ray intersection graphs}
   {20\uth European Symposium on Algorithms}
   {Ljubljana} {} {september} {2012}
   {Algorithms - ESA 2012 : proceedings (Lecture notes in computer science, 7501)} {241--252} 



%\objavljenoRevija
% 1.01: %list {\bf 8}. CABELLO, Sergio. Stackelberg shortest path tree game, revisited. {\it Preprint Series}, 2012, vol. 50, 
%\v{s}t. 1180, str. 1-13. http://www.imfm.si/preprinti/PDF/01180.pdf. $[$COBISS.SI-ID 16333401$]$\\ 
%   {S.~Cabello}
%   {Stackelberg shortest path tree game, revisited}
%   {Preprint Series} {50} {2012} {1180} {1--13}

%\objavljenoRevija
% 1.01: %list {\bf 6}. CABELLO, Sergio, CHAMBERS, Erin W., ERICKSON, Jeff. Multiple-source shortest paths in embedded graphs.
%{\it Preprint Series}, 2012, vol. 50, \v{s}t. 1170, str. 1-24. http://www.imfm.si/preprinti/PDF/01170.pdf. $[$COBISS.SI-ID 16198745$]$\\ 
%   {S.~Cabello, E.~W.~Chambers, J.~Erickson}
%   {Multiple-source shortest paths in embedded graphs}
%   {Preprint Series} {50} {2012} {1170} {1--24}

%\objavljenoRevija
% 1.01: %list {\bf 7}. CABELLO, Sergio, MOHAR, Bojan. Adding one edge to planar graphs makes crossing number and 1-planarity hard. 
%{\it Preprint Series}, 2012, vol. 50, \v{s}t. 1172, str. 1-27. http://www.imfm.si/preprinti/PDF/01172.pdf. $[$COBISS.SI-ID 16243545$]$\\ 
%   {S.~Cabello, B.~Mohar}
%   {Adding one edge to planar graphs makes crossing number and 1-planarity hard}
%   {Preprint Series} {50} {2012} {1172} {1--27}

\end{skupina} 

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

\begin{skupina}{D}

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


\urednikRevija
   {�lan uredni�kega odbora}
   {Journal of Computational Geometry}
   

\end{skupina} 

%    Ni podatkov za to sekcijo

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

\begin{skupina}{E}

\organizacija
   {�lan programskega odbora}
   {MEMICS 2012}
   {Znojmo} {�e�ka} {oktober} {2012} 
   
\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} 


\predavanjeKonferenca
   {Crossings of near-planar graphs}
   {vabljeno predavanje}
   {GraDR 2012 Crossing NumberWorkshop and Minischool}
   {Valtice} {�e�ka} {maj} {2012} 
   
\predavanjeKonferenca
   {Algorithms for embedded graphs.}
   {vabljeno predavanje}
   {GraDR 2012 Crossing NumberWorkshop and Minischool}
   {Valtice} {�e�ka} {maj} {2012} 
   
\predavanjeUstanova
   {Algorithms for graphs via orthogonal range searching}
   {Theory seminar}
   {University of California}
   {Irvine} {ZDA} {november} {2012}


\end{skupina} 

%   Ni podatkov za to sekcijo

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

%\begin{skupina}{G}

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

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

%\begin{skupina}{I}
%POZOR: Bibliografija2012.tex > 2012\mat\clani\cabello.tex 2040/304: Stevilo neopredeljenih zadetkov: 2
%\razno
% Ured: {\bf 12}. {\it Journal of computational geometry}. Cabello, Sergio (\v{c}lan uredni\v{s}kega odbora 2010-). Ottawa: Carleton University, Computational Geometry Lab, 2010-. http://jocg.org. $[$COBISS.SI-ID 15571801$]$\\ 

%\razno
% Ment: {\bf 13}. SU\v{S}ELJ, Gregor{\it . Neu\v{c}inkovitost ravnovesja : magistrsko delo}. Ljubljana: $[$G. Su\v{s}elj$]$, 2012. 61 str. $[$COBISS.SI-ID 16420697$]$\\ 

%\end{skupina} 

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

%\begin{seznam}
%\gost {Panos Giannopoulos} {7 dni} {Freie Universit�t Berlin} {Berlin} {Nem�ija} {marec} {2012} {Sergia Cabella}
%\gost {Maria Saumell} {7 dni} {Universit� Libre de Bruxelles} {Bruselj} {Belgija} {december} {2012} {Sergia Cabella}
%\end{seznam} 


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

%\begin{seznam}
%\gostovanje {Sergio Cabello} {1 teden} {Universitat Polit\`{e}cnica de Catalunya (UPC)} {Barcelona} {�panija} {september} {2012}
%\gostovanje {Sergio Cabello} {1 teden} {University of California} {Irvine} {ZDA} {oktober} {2012}
%\end{seznam} 

