\clan {Sergio Cabello Justo}


\begin{skupina}{B}


\sprejetoRevija
   {}
   {Approximation Algorithms for Spreading Points}
   {J. Algorithms}

\sprejetoRevija
   {}
   {Planar embeddability of the vertices of a graph using a fixed point set is {NP}-hard}
   {J. Graph Algorithms Appl.}

\sprejetoRevija
   {\crta, B.~Mohar}
   {Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs}
   {Discrete Comput.\ Geom.}
   
\sprejetoRevija
	{\crta, P.~Giannopoulos, C.~Knauer, and G.~Rote }
	{Matching Point Sets with respect to the Earth Mover's Distance}
	{Comput.\ Geom.}
	

\sprejetoZbornik
   {\crta, E.~W.~Chambers}
   {Multiple Source Shortest Paths in a Genus $g$ Graph}
   {Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007)}
   {New Orleans} {ZDA} {januar} {2007} 

\sprejetoZbornik
   {\crta, G. Rote}
   {Obnoxious centers in graphs}
   {Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007)}
   {New Orleans} {ZDA} {januar} {2007} 


\end{skupina} 


%   Ni podatkov za to sekcijo

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


\begin{skupina}{C}

\objavljenoZbornik
% 1.08: %list {\bf 5}. AGARWAL, Pankaj K., CABELLO, Sergio, SELLAR\`{E}S, J. Antoni, SHARIR, Micha. Computing a center-transversal line. V: {\it FSTTCS 2006: foundations of software technology and theoretical computer science : 26th International Conference, Kolkata, India, December 13-15, 2006 : proceedings}, (Lecture notes in computer science, 4337). Berlin; New York: Springer, 2006, str. 93-104. $[$COBISS.SI-ID 14225753$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10783/80: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10783/81: Ne najdem podatka {ZBORNIK}
   {P.~K.~Agarwal, S.~Cabello, J.~A.~sellar\`{e}s, M.~sharir}
   {Computing a center-transversal line}
   {FSTTCS 200}
   {Kolkata} {Indija} {decembra} {2006}
   {Lecture Notes in Comput.\ Sci. {\bf 4337}} {93--104} 


\objavljenoZbornik
% 1.08: %list {\bf 4}. BERG, Mark de, CABELLO, Sergio, HAR-PELED, Sariel. Covering many or few points with unit disks. V: {\it Approximation and online algorithms : 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers}, (Lecture notes in computer science, 4368). Berlin; New York: Springer, 2006, str. 55-68. http://dx.doi.org/10.1007/11970125\_5. $[$COBISS.SI-ID 14224473$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10774/91: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10774/92: Ne najdem podatka {ZBORNIK}
   {M.~Berg, S.~Cabello, S.~Har-Peled}
   {Covering many or few points with unit disks}
   {Approximation and online algorithms}
   {Z\"{u}rich} {\v{S}vica} {septembra} {2006}
   {Lecture Notes in Comput.\ Sci. {\bf 4368}} {{5}5--68} 


\objavljenoRevija
% 1.01: %list {\bf 2}. BOSE, Prosenjit, CABELLO, Sergio, CHEONG, Otfried, GUDMUNDSSON, Joachim, KREVELD, Marc van, SPECKMANN, Bettina. Area-preserving approximations of polygonal paths. {\it Journal of discrete algorithms}, 2006, vol. 4, iss. 4, str. 554-556. http://dx.doi.org/10.1016/j.jda.2005.06.008. $[$COBISS.SI-ID 14143833$]$\\ 
   {P.~Bose, S.~Cabello, O.~Cheong, J.~Gudmundsson, M.~Kreveld, B.~Speckmann}
   {Area-preserving approximations of polygonal paths}
   {J. Discrete Algorithms} {4} {2006} {4} {5{5}4--556}

\objavljenoZbornik
% 1.08: %list {\bf 7}. CABELLO, Sergio. Many distances in planar graphs. V: {\it Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms}, (Proceedings in Applied Mathematics, 122). New York: ACM; Philadelphia: SIAM, 2006, str. 1213-1220. http://doi.acm.org/10.1145/1109557.1109691. $[$COBISS.SI-ID 14090329$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10801/108: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10801/109: Ne najdem podatka {MESEC}
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10801/110: Ne najdem podatka {ZBORNIK}
   {S.~Cabello}
   {Many distances in planar graphs}
   {17th Annual ACM-SIAM Symposium on Discrete Algorithms}
   {Miami} {ZDA} {januar} {2006}
   {Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms} {1213--1220} 


\objavljenoRevija
% 1.01: {\bf 1}. CABELLO, Sergio, DEVOS, Matt, MOHAR, Bojan. Expected case for projecting points. {\it Informatica (Ljublj.)}, 2006, vol. 30, no. 3, str. 289-293. http://ai.ijs.si/informatica/. $[$COBISS.SI-ID 20378919$]$\\ 
   {S.~Cabello, M.~Devos, B.~Mohar}
   {Expected case for projecting points}
   {Informatica (Ljublj.)} {30} {2006} {3} {289--293}

\objavljenoZbornik
% 1.08: %list {\bf 6}. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian. On the parameterized complexity of $d$-dimensional point set pattern matching. V: {\it Parametrized and exact computation : Second International Workshop, IWPEC 2006, Z\"{u}rich, Switzerland, September 13-15, 2006 : proceedings}, (Lecture notes in computer science, 4169). Berlin; Heidelberg; New York: Springer, 2006, str. 175-183. $[$COBISS.SI-ID 14091609$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10792/126: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10792/127: Ne najdem podatka {ZBORNIK}
   {S.~Cabello, P.~Giannopoulos, C.~Knauer}
   {On the parameterized complexity of $d$-dimensional point set pattern matching}
   {Parametrized and exact computation}
   {Z\"{u}rich} {\v{S}vica} {septembra} {2006}
   {Lecture Notes in Comput.\ Sci. {\bf 4169}} {175--183} 


\objavljenoZbornik
% 1.08: {\bf 3}. CABELLO, Sergio, HAVERKORT, Herman Johannes, KREVELD, Marc van, SPECKMANN, Bettina. Algorithmic aspects of proportional symbol maps. V: {\it Algorithms - Esa 2006 : 14th Annual European Symposium, Z\"{u}rich, Switzerland, September 11-13, 2006, : proceedings}, (Lecture notes in computer science, 4168). Berlin; Heidelberg; New York: Springer, 2006, str. 720-731. $[$COBISS.SI-ID 14090841$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10766/137: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10766/138: Ne najdem podatka {ZBORNIK}
   {S.~Cabello, H.~J.~Haverkort, M.~Kreveld, B.~Speckmann}
   {Algorithmic aspects of proportional symbol maps}
   {Algorithms - Esa 2006}
   {Z\"{u}rich} {\v{S}vica} {septembra} {2006}
   {Lecture Notes in Comput.\ Sci. {\bf 4168}} {720--731} 


\end{skupina} 

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

%\begin{skupina}{D}

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

%\end{skupina} 

%    Ni podatkov za to sekcijo

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

%\begin{skupina}{E}

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

%\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
   {Distances from a face in a genus g graph.}
   {vabljeno predavanje}
   {Geometric Networks and Metric Space Embeddings}
   {Dagstuhl} {Nem\v{c}ija} {novembra} {2006} 

\predavanjeUstanova
   {Shortest non-trivial cycles for topologically embedded graphs}
   {vabljeno predavanje}
   {Universitat Polit\`ecnica de Catalunya}
   {Barcelona} {\v{S}panija} {aprila} {2006}

\predavanjeUstanova
   {Many distances in planar graphs}
   {vabljeno predavanje}
   {University of Illinois at Urbana-Champaign}
   {Urbana-Champaign} {ZDA} {januar} {2006}
   
   
\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} 

\begin{skupina}{G}


\konferenca
% 1.08: %list {\bf 4}. BERG, Mark de, CABELLO, Sergio, HAR-PELED, Sariel. Covering many or few points with unit disks. V: {\it Approximation and online algorithms : 4th international workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006 : revised papers}, (Lecture notes in computer science, 4368). Berlin; New York: Springer, 2006, str. 55-68. http://dx.doi.org/10.1007/11970125\_5. $[$COBISS.SI-ID 14224473$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10774/231: Ne najdem podatka {DRZAVA}
   {Covering many or few points with unit disks}
   {Approximation and online algorithms -- WAOA 2006}
   {Z\"{u}rich} {\v{S}vica} {september} {2006} 


\konferenca
% 1.08: %list {\bf 7}. CABELLO, Sergio. Many distances in planar graphs. V: {\it Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms}, (Proceedings in Applied Mathematics, 122). New York: ACM; Philadelphia: SIAM, 2006, str. 1213-1220. http://doi.acm.org/10.1145/1109557.1109691. $[$COBISS.SI-ID 14090329$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10801/255: Ne najdem podatka {DRZAVA}
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10801/256: Ne najdem podatka {MESEC}
   {Many distances in planar graphs}
   {Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms -- SODA 2006}
   {Miami} {ZDA} {januar} {2006} 


\konferenca
% 1.12: {\bf 8}. CABELLO, Sergio, GIANNOPOULOS, Panos, KNAUER, Christian, ROTE, G\"{u}nter. Matching point sets with respect to the Earth Mover's Distance. V: AN\v{Z}I\v{C}, Tina (ur.), GROBELNIK, Marko (ur.), HORVAT, Boris (ur.), MLADENI\'{C}, Dunja (ur.), PISANSKI, Toma\v{z} (ur.), SHAWE-TAYLOR, John (ur.), \v{S}KVAR\v{C}, Smiljana (ur.), \v{Z}EROVNIK, Janez (ur.). {\it Complex objects visualization - COV 2005 : proceedings}. Ljubljana: Jo\v{z}ef Stefan Institute: IMFM - Institute of Mathematics, Physics and Mechanics; Koper: UP - PINT, 2006, 8 str. $[$COBISS.SI-ID 14188633$]$\\ 
%POZOR: bibliografije.tex > 2006\mat\clani\cabello.tex 10813/264: Ne najdem podatka {MESEC}
   {Matching point sets with respect to the Earth Mover's Distance}
   {Complex objects visualization -- COV 2005}
   {Ljubljana} {} {novembra} {2005} 


\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

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

%\begin{seznam}
%\gost {G\"unter Rote} {6 dni} {FU Berlin} {Berlin} {Nem\v{c}ija} {februar} {2006} {Sergia Cabella}
%\gost {J.~Antoni Sellar\`es} {5 dni} {University of Girona} {Girona} {\v{S}panija} {februar} {2006} {Sergia Cabella}
%\gost {Christian Knauer} {5 dni} {FU Berlin} {Berlin} {Nem\v{c}ija} {marec} {2006} {Sergia Cabella}
%\gost {Panos Giannopoulos} {6 dni} {HU Berlin} {Berlin} {Nem\v{c}ija} {februar} {2006} {Sergia Cabella}
%\end{seznam} 

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

%\begin{seznam}
%\gostovanje {Sergio Cabello} {3 dni} {University of Illinois at Urbana-Champaign} {Urbana-Champaign} {ZDA} {januar} {2006}
%\gostovanje {Sergio Cabello} {3 dni} {Universitat Polit\`ecnica de Catalunya} {Barcelona} {\v{S}panija} {april} {2006}
%\gostovanje {Sergio Cabello} {1 teden} {TU Eindhoven} {Eindhoven} {Nizozemska} {april} {2006}
%\gostovanje {Sergio Cabello} {3 dni} {University of Illinois at Urbana-Champaign} {Urbana-Champaign} {ZDA} {januar} {2006}
%\end{seznam} 
