\clan {Aleksander Vesel}

%--------------------------------------------------------
%  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 3}. KOR\v{Z}E, Danilo, VESEL, Aleksander. (d,n)-packing colorings of infinite lattices. {\it Discrete Appl.\ Math.},  [v tisku] 2017, str. 1-12. $[$COBISS.SI-ID 21067542$]$\\ 
%POZOR: Bibliografija2017.tex > 2017\mat\clani\vesel.tex 11543/80: Ne najdem podatka {STEVILKA}
   {D.~Kor\v{z}e, \crta}
   {$(d,n)$-packing colorings of infinite lattices}
   {Discrete Appl.\ Math.}

\end{skupina} 


%   Ni podatkov za to sekcijo

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

\objavljenoZbornik
% 1.08: {\bf 5}. VESEL, Aleksander. Dynamic algorithm for distance constrained labelings of graphs. V: ZADNIK STIRN, Lidija (ur.), et al. {\it SOR '17 proceedings}}. Ljubljana: Slovenian Society Informatika, Section for Operational Research, 2017, str. 448-452.  $[$COBISS.SI-ID 18147161$]$\\ 
   {}
   {Dynamic algorithm for distance constrained labelings of graphs}
   {14\uth In\-ter\-na\-ti\-o\-nal Symposium on Operational Research in Slovenia}
   {Bled} {} {september} {2017}
   {SOR '17 proceedings} {4{4}8--452} 

\objavljenoRevija
% 1.01: %list {\bf 2}. SHAO, Zehui, DENG, Fei, LI, Zepeng, VESEL, Aleksander. Graceful labelings of the generalized Petersen graphs.  {\it Commun.\ Comb.\ Optim.},  2017, vol. 2, no. 2, str. 149-159. $[$COBISS.SI-ID 23565320$]$\\ 
   {Z.~Shao, F.~Deng, Z.~Li, \crta}
   {Graceful labelings of the generalized Petersen graphs}
   {Commun.\ Comb.\ Optim.} {2} {2017} {} {149--159}

\objavljenoRevija
% 1.01: {\bf 1}. SHAO, Zehui, VESEL, Aleksander, XU, Jin. Frequency assignment problem in networks with limited spectrum.  {\it CEJOR Cent.\ Eur.\ J. Oper.\ Res.},  2017, vol. 25, iss. 3, str. 699-723. $[$COBISS.SI-ID 22869512$]$\\ 
   {Z.~Shao, \crta, J.~Xu}
   {Frequency assignment problem in networks with limited spectrum}
   {CEJOR Cent.\ Eur.\ J.\ Oper.\ Res.} {25} {2017} {} {69{9}--723}

\objavljenoRevija
% 1.01: %list {\bf 4}. VESEL, Aleksander. Regular coronoids and 4-tilings.  {\it Discrete Appl.\ Math.}, 2017, vol. 231, str. 217-227. $[$COBISS.SI-ID 22600712$]$\\ 
   {}
   {Regular coronoids and 4-tilings}
   {Discrete Appl.\ Math.} {231} {2017} {} {217--2{2}7}

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

%\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: {\bf 5}. VESEL, Aleksander. Dynamic algorithm for distance constrained labelings of graphs. V: ZADNIK STIRN, Lidija (ur.), et al. {\it SOR '17 proceedings}}. Ljubljana: Slovenian Society Informatika, Section for Operational Research, 2017, str. 448-452.  $[$COBISS.SI-ID 18147161$]$\\ 
   {Dynamic algorithm for distance constrained labelings of graphs}
   {14\uth In\-ter\-na\-ti\-o\-nal Symposium on Operational Research in Slovenia}
   {Bled} {} {september} {2017} 


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

\razno
   {6 recenzij za MathSciNet.} 
\razno
   {2 recenziji za Zentralblatt MATH} 

\end{skupina} 



%\begin{skupina}{I}
%POZOR: Bibliografija2017.tex > 2017\mat\clani\vesel.tex 11657/235: Stevilo neopredeljenih zadetkov: 11
%\razno
% 1.19: {\bf 6}. VESEL, Aleksander. Crespelle, Christophe (F-LYON-LIP); Le, Tien-Nam (F-ENSLY-NDM); Perrot, Kevin (RCH-UCS-EM); Phan, Thi Ha Duong (VN-VAST-IM): Linearity is strictly more powerful than contiguity for encoding graphs. (English summary). - Discrete Math. 339 (2016), no. 8, 2168-2177. {\it MathSciNet}, ISSN 2167-5163, 2017, mR3500147. $[$COBISS.SI-ID 17928281$]$\\ 

%\razno
% 1.19: %list {\bf 7}. VESEL, Aleksander. Goel, Ashish (1-STF-MGE); Kapralov, Michael (1-STF-CPE); Khanna, Sanjeev (1-PA-C): Perfect matchings in O(nlogn) time in regular bipartite graphs. (English summary) SIAM J. Comput. 42 (2013), no. 3, 1392-1404. {\it MathSciNet}, ISSN 2167-5163, 2017, mR3504633. $[$COBISS.SI-ID 23566344$]$\\ 

%\razno
% 1.19: %list {\bf 8}. VESEL, Aleksander. Grubman, Tony (5-MNSH5-ECS); {\S.}ekercio\v{g}lu, Y. Ahmet (5-MNSH5-ECS); Wood, David R. (5-MNSH5-SM): Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking. (English summary) Discrete Appl. Math. 213 (2016), 101-113. {\it MathSciNet}, ISSN 2167-5163, 2017, mR3544572. $[$COBISS.SI-ID 23566088$]$\\ 

%\razno
% 1.19: %list {\bf 9}. VESEL, Aleksander. Brandst\"{a}dt, Andreas (D-ROST-IF); Mosca, Raffaele (I-DAN2-EC): Weighted efficient domination for P5-free and P6-free graphs. (English summary) SIAM J. Discrete Math. 30 (2016), no. 4, 2288-2303. {\it MathSciNet}, ISSN 2167-5163, 2017, mR3585025. $[$COBISS.SI-ID 23565832$]$\\ 

%\razno
% 1.19: %list {\bf 10}. VESEL, Aleksander. Micek, Piotr (PL-JAGLMC-TC); Wiechert, Veit (D-TUB-IM): An on-line competitive algorithm for coloring bipartite graphs without long induced paths. (English summary). Algorithmica 77 (2017), no. 4, 1060-1070. {\it MathSciNet}, ISSN 2167-5163, 2017, mR3612212. $[$COBISS.SI-ID 23565576$]$\\ 

%\razno
% 1.19: %list {\bf 11}. VESEL, Aleksander. Dragan, Feodor F. (1-KNTS-C); Leitert, Arne (1-KNTS-C): On the minimum eccentricity shortest path problem. (English summary) Theoret. Comput. Sci. 694 (2017), 66-78. {\it MathSciNet}, ISSN 2167-5163, 2017, mR3693905. $[$COBISS.SI-ID 23567624$]$\\ 

%\razno
% 1.19: %list {\bf 12}. VESEL, Aleksander. El-Shanawany, R. A.; Higazy, M.; Shabana, H.; El-Mesady, A.: Cartesian product of two symmetric starter vectors of orthogonal double covers. (English) AKCE Int. J. Graphs Comb. 12, No. 1, 59-63 (2015). {\it Zentralblatt MATH database}, ISSN 1436-3429. $[$Online ed.$]$, 2017, zbl 1365.05250. $[$COBISS.SI-ID 23566856$]$\\ 

%\razno
% 1.19: %list {\bf 13}. VESEL, Aleksander. Jayasekaran, C.; Sumathy, G.: Characterization of disconnected two-cyclic graphs with a self vertex switching. (English) J. Comb. Inf. Syst. Sci. 41, No. 1-3, 123-140 (2016). {\it Zentralblatt MATH database}, ISSN 1436-3429. $[$Online ed.$]$, 2017, zbl 1375.05258. $[$COBISS.SI-ID 23566600$]$\\ 

%\razno
% Rece: {\bf 14}. {\it Ars combinatoria}. Vesel, Aleksander (recenzent 2017). Waterloo, Ont.: Dept. of Combinatorics and Optimization, University of Waterloo, 1976-. ISSN 0381-7032.  $[$COBISS.SI-ID 25016320$]$\\ 

%\razno
% Rece: %list {\bf 15}. {\it Discrete Appl.\ Math.}. Vesel, Aleksander (recenzent 2014, 2017). $[$Print ed.$]$. Amsterdam: Elsevier, 1979-. ISSN 0166-218X. $[$COBISS.SI-ID 25342464$]$\\ 

%\razno
% Rece: %list {\bf 16}. BRE\v{S}AR, Bo\v{s}tjan (urednik), GOLOGRANC, Tanja (urednik), JAKOVAC, Marko (urednik){\it . Book of abstracts}. 1st ed. Maribor: University of Maribor Press, 2017. ISBN 978-961-286-113-1. $[$COBISS.SI-ID 93440513$]$\\ 

%\end{skupina} 

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

