\clan {Sandi Klav�ar}

%--------------------------------------------------------
%  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 14}. BRE\v{S}AR, Bo\v{s}tjan, DORBEC, Paul, KLAV\v{Z}AR, Sandi, MOLLARD, Michel. Hamming polynomials and their partial derivatives. {\it Eur. j. comb.}, 2007, vol. 28, no. 4, str. 1156-1162. http://dx.doi.org/10.1016/j.ejc.2006.03.001. $[$COBISS.SI-ID 14252633$]$\\ 
   {B.~Bre\v{s}ar, P.~Dorbec, \crta, M.~Mollard}
   {Hamming polynomials and their partial derivatives}
   {European J.\ Combin.} {28} {2007} {4} {1{1}56--1{1}62}

\objavljenoRevija
% 1.01: %list {\bf 6}. BRE\v{S}AR, Bo\v{s}tjan, GRYTCZUK, J., KLAV\v{Z}AR, Sandi, NIWCZYK, S., PETERIN, Iztok. Nonrepetitive colorings of trees. {\it Discrete math.}. $[$Print ed.$]$, 2007, vol. 307, iss. 2, str. 163-172. http://dx.doi.org/10.1016/j.disc.2006.06.017. $[$COBISS.SI-ID 14231385$]$\\ 
   {B.~Bre\v{s}ar, J.~Grytczuk, \crta, S.~Niwczyk, I.~Peterin}
   {Nonrepetitive colorings of trees}
   {Discrete Math.} {307} {2007} {2} {163--172}

\objavljenoRevija
% 1.01: %list {\bf 17}. BRE\v{S}AR, Bo\v{s}tjan, KLAV\v{Z}AR, Sandi. Crossing graphs as joins of graphs and cartesian products of median graphs. {\it SIAM j. discrete math.}, 2007, vol. 21, no. 1, str. 26-32. http://dx.doi.org/10.1137/050622997. $[$COBISS.SI-ID 14194777$]$\\ 
   {B.~Bre\v{s}ar, \crta}
   {Crossing graphs as joins of graphs and cartesian products of median graphs}
   {SIAM J. Discrete Math.} {21} {2007} {1} {26--32}

\objavljenoRevija
% 1.01: %list {\bf 8}. BRE\v{S}AR, Bo\v{s}tjan, KLAV\v{Z}AR, Sandi. Maximal proper subgraphs of median graphs. {\it Discrete math.}. $[$Print ed.$]$, 2007, vol. 307, iss. 11-12, str. 1389-1394. http://dx.doi.org/10.1016/j.disc.2005.11.076. $[$COBISS.SI-ID 14257497$]$\\ 
   {B.~Bre\v{s}ar, \crta}
   {Maximal proper subgraphs of median graphs}
   {Discrete Math.} {307} {2007} {11-12} {1389--1394}

\objavljenoRevija
% 1.01: %list {\bf 9}. BRE\v{S}AR, Bo\v{s}tjan, KLAV\v{Z}AR, Sandi, RALL, Douglas F. Dominating direct products of graphs. {\it Discrete math.}. $[$Print ed.$]$, 2007, vol. 307, iss. 13, str. 1636-1642. http://dx.doi.org/10.1016/j.disc.2006.09.013. $[$COBISS.SI-ID 14286937$]$\\ 
   {B.~Bre\v{s}ar, \crta, D.~F.~Rall}
   {Dominating direct products of graphs}
   {Discrete Math.} {307} {2007} {13} {1636--1642}

\objavljenoRevija
% 1.01: %list {\bf 4}. BRE\v{S}AR, Bo\v{s}tjan, KLAV\v{Z}AR, Sandi, RALL, Douglas F. On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. {\it Discrete appl. math.}. $[$Print ed.$]$, 2007, vol. 155, iss. 17, str. 2003-2311. http://dx.doi.org/10.1016/j.dam.2007.06.008. $[$COBISS.SI-ID 14418009$]$\\ 
   {B.~Bre\v{s}ar, \crta, D.~F.~Rall}
   {On the packing chromatic number of Cartesian products, hexagonal lattice, and trees}
   {Discrete Appl.\ Math.} {155} {2007} {17} {20{0}3--231{1}}

\objavljenoRevija
% 1.01: %list {\bf 7}. BRE\v{S}AR, Bo\v{s}tjan, KLAV\v{Z}AR, Sandi, \v{S}KREKOVSKI, Riste. On cube-free median graphs. {\it Discrete math.}. $[$Print ed.$]$, 2007, vol. 307, iss. 3-5, str. 345-351. http://dx.doi.org/10.1016/j.disc.2004.09.018. $[$COBISS.SI-ID 14179417$]$\\ 
   {B.~Bre\v{s}ar, \crta, R.~\v{S}krekovski}
   {On cube-free median graphs}
   {Discrete Math.} {307} {2007} {3-5} {345--351}

\objavljenoRevija
% 1.01: %list {\bf 3}. FRON\v{C}EK, Dalibor, JEREBIC, Janja, KLAV\v{Z}AR, Sandi, KOV\'{A}\v{R}, Petr. Strong isometric dimension, biclique coverings, and Sperner's theorem. {\it Comb. probab. comput.}, 2007, vol. 16, iss. 2, str. 271-275. http://dx.doi.org/10.1017/S0963548306007711. $[$COBISS.SI-ID 14286425$]$\\ 
   {D.~Fron\v{c}ek, J.~Jerebic, \crta, P.~Kov\'{a}\v{r}}
   {Strong isometric dimension, biclique coverings, and Sperner's theorem}
   {Comb.\ Probab.\ Comput.} {16} {2007} {2} {271--275}

\objavljenoRevija
% 1.01: %list {\bf 11}. IMRICH, Wilfried, KLAV\v{Z}AR, Sandi, TROFIMOV, Vladimir Ivanovi\v{c}. Distinguishing 
%infite graphs. {\it Electron. j. comb. (On line)}. $[$Online ed.$]$, 2007, vol. 14, no. 1, r36 (12 str.). http://www.combinatorics.org/Volume\_14/PDF/v14i1r36.pdf. $[$COBISS.SI-ID 14287193$]$\\ 
   {W.~Imrich, \crta, V.~I.~Trofimov}
   {Distinguishing infite graphs}
   {Electron.\ J.\ Combin.} {14} {2007} {1} {12 str.}

\objavljenoRevija
% 1.01: %list {\bf 15}. KLAV\v{Z}AR, Sandi. On the PI index: PI-partitions and Cartesian product graphs. {\it MATCH Commun. Math. Comput. Chem. (Krag.)}, 2007, vol. 57, no. 3, str. 573-586. $[$COBISS.SI-ID 14301529$]$\\ 
   {}
   {On the PI index: PI-partitions and Cartesian product graphs}
   {MATCH Commun.\ Math.\ Comput.\ Chem.} {57} {2007} {3} {573--586}

\objavljenoRevija
% 1.01: %list {\bf 10}. KLAV\v{Z}AR, Sandi, KOV\v{S}E, Matja\v{z}. On $\Theta$-graphs of partial cubes. {\it Discuss. Math., Graph Theory}, 2007, vol. 27, no. 2, str.313-321. $[$COBISS.SI-ID 14336089$]$\\ 
   {\crta, M.~Kov\v{s}e}
   {On $\Theta$-graphs of partial cubes}
   {Discuss.\ Math.\ Graph Theory} {27} {2007} {2} {13--321}

\objavljenoRevija
% 1.01: %list {\bf 13}. KLAV\v{Z}AR, Sandi, KOV\v{S}E, Matja\v{z}. Partial cubes and their $\tau$-graphs. {\it Eur. j. comb.}, 2007, vol. 28, no. 4, str. 1037-1042. http://dx.doi.org/10.1016/j.ejc.2006.04.006. $[$COBISS.SI-ID 14252377$]$\\ 
   {\crta, M.~Kov\v{s}e}
   {Partial cubes and their $\tau$-graphs}
   {European J.\ Combin.} {28} {2007} {4} {1037--1042}

\objavljenoRevija
% 1.01: {\bf 1}. KLAV\v{Z}AR, Sandi, MILUTINOVI\'{C}, Uro\v{s}, PETR, Ciril. Stern polynomials. {\it Adv. appl. math.}, 2007, vol. 39, iss. 1, str. 86-95. http://dx.doi.org/10.1016/j.aam.2006.01.003. $[$COBISS.SI-ID 14276441$]$\\ 
   {\crta, U.~Milutinovi\'{c}, C.~Petr}
   {Stern polynomials}
   {Adv.\ in Appl.\ Math.} {39} {2007} {1} {86--95}

\objavljenoRevija
% 1.01: %list {\bf 16}. KLAV\v{Z}AR, Sandi, PETERIN, Iztok. Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle. {\it Publ. math. (Debr.)}, 2007, t. 71, fasc. 3-4, str. 267-278. http://www.math.klte.hu/publi/contents.php?szam=71. $[$COBISS.SI-ID 14419801$]$\\ 
   {\crta, I.~Peterin}
   {Edge-counting vectors, Fibonacci cubes, and Fibonacci triangle}
   {Publ.\ Math.\ Debrecen} {71} {2007} {3-4} {267--278}

\objavljenoRevija
% 1.01: %list {\bf 5}. KLAV\v{Z}AR, Sandi, SHPECTOROV, Sergey. Tribes of cubic partial cubes. 
%{\it Discret. math. theor. comput. sci. (Online)}, 2007, vol. 9, no. 1, 273-292. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/734. $[$COBISS.SI-ID 14452569$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\klavzar.tex 3626/168: Ne najdem podatka {STRANI}
   {\crta, S.~Shpectorov}
   {Tribes of cubic partial cubes}
   {Discrete Math.\ Theor.\ Comput.\ Sci.} {9} {2007} {1} {273--292}

\objavljenoRevija
% 1.01: %list {\bf 12}. KLAV\v{Z}AR, Sandi, ZHU, Xuding. Cartesian powers of graphs can be distinguished by two labels. {\it Eur. j. comb.}, 2007, vol. 28, no. 1, str. 303-310. http://dx.doi.org/10.1016/j.ejc.2005.07.001. $[$COBISS.SI-ID 14130009$]$\\ 
   {\crta, X.~Zhu}
   {Cartesian powers of graphs can be distinguished by two labels}
   {European J. Combin.} {28} {2007} {1} {303--310}

\objavljenoRevija
% 1.01: %list {\bf 2}. SALEM, Khaled, KLAV\v{Z}AR, Sandi. On plane bipartite graphs without fixed edges. {\it Appl. math. lett.}. $[$Print ed.$]$, 2007, vol. 20, no. 7, str. 813-816. http://dx.doi.org/10.1016/j.aml.2006.08.014. $[$COBISS.SI-ID 14257753$]$\\ 
   {K.~Salem, \crta}
   {On plane bipartite graphs without fixed edges}
   {Appl.\ Math.\ Lett.} {20} {2007} {7} {813--816}

\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
% 4.01: {\bf 18}. {\it Match}. Klav\v{z}ar, Sandi (\v{c}lan uredni\v{s}kega odbora 2004-). Kragujevac: University of Kragujevac: Faculty of Science Kragujevac, 1975-. ISSN 0340-6253. http://www.pmf.kg.ac.yu/match. $[$COBISS.SI-ID 2624551$]$\\ 
   {�lan uredni\v{s}kega odbora}
   {MATCH Communications in Mathematical and in Computer Chemistry}

\urednikRevija
   {�lan uredni\v{s}kega odbora}
   {Discussiones Mathematicae Graph Theory}

\urednikRevija
   {Gostujo\v{c}i sourednik tematske \v{s}tevilke Algebraic and Topological Methods in Graph Theory}
   {Discrete Mathematics 307(3-5) 2007 29{9}--658}


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

\predavanjeUstanova
   {Distinguishing number of graphs}
   {vabljeno predavanje}
   {1st Korea-Slo\-ve\-nia International Conference on Combinatorial and Computational Mathematics}
   {Koper} {} {junij} {2007} 


\predavanjeUstanova
   {Power domination in product graphs}
   {vabljeno predavanje v okviru mi\-ni\-sim\-po\-zi\-ja Product Graphs}
   {6th Slovenian International Conference on Graph Theory}
   {Bled} {} {junij} {2007} 

\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.12: %list {\bf 25}. KLAV\v{Z}AR, Sandi. Algorithmic aspects of the packing chromatic number. V: FIALA, Ji\v{r}\'{\i} (ur.). {\it Workshop on Frequency Assignment Problems : S\'{a}dek (T\v{r}eb\'{\i}\v{c}), September 23-27, 2007}, (KAM-DIMATIA Series, 2007-837). Praha: Charles University, 2007, str. 14. $[$COBISS.SI-ID 14518873$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\klavzar.tex 3786/262: Ne najdem podatka {DRZAVA}
   {Algorithmic aspects of the packing chromatic number}
   {Workshop on Frequency Assignment Problems}
   {S\'adek (T�eb�\v{c})} {\v{C}e\v{s}ka} {september} {2007} 


\konferenca
% 1.12: %list {\bf 26}. FIALA, Ji\v{r}\'{\i}, KLAV\v{Z}AR, Sandi, LIDICK\'{Y}, Bernard. Reports on the progress in solving some of the problems during the workshop : the packing chromatic number of some infinite product graphs. V: FIALA, Ji\v{r}\'{\i} (ur.). {\it Workshop on Frequency Assignment Problems : S\'{a}dek (T\v{r}eb\'{\i}\v{c}), September 23-27, 2007}, (KAM-DIMATIA Series, 2007-837). Praha: Charles University, 2007, str. 20-21. $[$COBISS.SI-ID 14400089$]$\\ 
%POZOR: Bibliografija2007.tex > 2007\mat\clani\klavzar.tex 3794/278: Ne najdem podatka {DRZAVA}
   {Reports on the progress in solving some of the problems during the workshop: the packing chromatic number of some infinite product graphs}
   {Workshop on Frequency Assignment Problems}
   {S\'adek (T�eb�\v{c})} {\v{C}e\v{s}ka} {september} {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} 

\begin{skupina}{H}

\clanekRevija
% 1.04: {\bf 19}. KLAV\v{Z}AR, Sandi. Po\v{z}re\v{s}no zaporedje brez ponavljanj ali problem Hanojskega stolpa. {\it Obz. mat. fiz.}, 2007, letn. 54, \v{s}t. 5, str. 145-150. $[$COBISS.SI-ID 14460249$]$\\ 
   {}
   {Po\v{z}re\v{s}no zaporedje brez ponavljanj in problem Hanojskega stolpa}
   {Obz.\ Mat.\ Fiz.} {54} {2007} {5} {145--150}

\end{skupina} 

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

\begin{skupina}{I}

\razno
   {Mentor pri 1 magistrskem delu in 1 doktorski disertaciji} 

\end{skupina} 

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

%\begin{seznam}
%\gost {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO} {POVABILO}
%\gost {Wilfried Imrich} {cca. 15 obiskov od 1 do 3 dni} {Montanuniversit\"{a}t} {Leoben} {Avstrija} {skozi celo leto} {2007} {Sandija Klav\v{z}arja}
%\gost {Manoj Changat} {25 dni} {University of Kerala} {Trivandrum} {Indija} {maj} {2007} {Sandija Klav\v{z}arja}
%\gost {Kannan Balakrishnan} {25 dni} {Cochin University of Science and Technology} {Cochin} {Indija} {maj} {2007} {Sandija Klav\v{z}arja}
%\gost {Michel Deza} {7 dni} {Ecole Normale Superieure} {Paris} {Francija} {junij} {2007} {Sandija Klav\v{z}arja}
%\gost {Douglas F. Rall} {14 dni} {Furman University} {Greenville, SC} {ZDA} {junij-julij} {2007} {Sandija Klav\v{z}arja}
%\gost {Yefim Dinitz} {3 dni} {Ben-Gurion University of the Negev} {Negav} {Izrael} {avgust} {2007} {Sandija Klav\v{z}arja}
%\end{seznam} 

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

%\begin{seznam}
%\gostovanje {IME} {TRAJANJE} {USTANOVA} {KRAJ} {DRZAVA} {MESEC} {LETO}
%\gostovanje {Sandi Klav�ar} {skupaj cca. 10 dni} {Montanuniversit\"at} {Leoben} {Avtrija} {skozi celo leto} {2007}
%\gostovanje {Sandi Klav�ar} {10 dni} {Furman University} {Greenville, SC} {ZDA} {september} {2007}
%\gostovanje {Sandi Klav�ar} {10 dni} {University of Kerala} {Trivandrum} {Indija} {november} {2007} 
%\end{seznam} 

