\clan {Martin Milani�}

%--------------------------------------------------------
%  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: {\bf 1}. KAMI\'{N}SKI, Marcin, MILANI\v{C}, Martin. On the complexity of the identifiable subgraph problem. 
%{\it Discrete applied mathematics},  2014, str. 1-9. $[$COBISS.SI-ID 1537012676$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6566/147: Ne najdem podatka {STEVILKA}
   {M.~Kami\'{n}ski, \crta}
   {On the complexity of the identifiable subgraph problem}
   {Discrete Appl.\ Math.}

\sprejetoRevija
% 1.01: %list {\bf 2}. CHIARELLI, Nina, MILANI\v{C}, Martin. On a class of graphs between threshold and total domishold graphs. 
%{\it Discrete applied mathematics}, 2014, str. 1-16. $[$COBISS.SI-ID 1536327620$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6572/113: Ne najdem podatka {STEVILKA}
   {N.~Chiarelli, \crta}
   {On a class of graphs between threshold and total domishold graphs}
   {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}

\objavljenoRevija
% 1.01: %list {\bf 6}. BOROS, Endre, GURVICH, Vladimir, MILANI\v{C}, Martin. On CIS circulants. {\it Discrete Mathematics},  
%2014, vol. 318, str. 78-95. $[$COBISS.SI-ID 1536117444$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6601/80: Ne najdem podatka {STEVILKA}
   {E.~Boros, V.~Gurvich, \crta}
   {On CIS circulants}
   {Discrete Math.} {318} {2014} {} {78--95}

\objavljenoRevija
% 1.01: %list {\bf 10}. BOROS, Endre, HEGGERNES, Pinar, VAN 'T HOF, Pim, MILANI\v{C}, Martin. Vector connectivity in graphs. 
%{\it Networks}, ISSN 1097-0037, 2014, vol. 63, issue 4, str. 277-285. $[$COBISS.SI-ID 1536327876$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6632/87: Ne najdem podatka {}
   {E.~Boros, P.~Heggernes, P.~Van 't Hof, \crta}
   {Vector connectivity in graphs}
   {Networks} {63} {2014} {} {27{7}--285}

\objavljenoRevija
% 1.01: %list {\bf 8}. BRE\v{S}AR, Bo\v{s}tjan, GOLOGRANC, Tanja, MILANI\v{C}, Martin, RALL, Douglas F., RIZZI, Romeo. 
%Dominating sequences in graphs. {\it Discrete Mathematics}, 2014, vol. 336, str. 22-36. $[$COBISS.SI-ID 17114457$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6616/94: Ne najdem podatka {STEVILKA}
   {B.~Bre\v{s}ar, T.~Gologranc, \crta, D.~F.~Rall, R.~Rizzi}
   {Dominating sequences in graphs}
   {Discrete Math.} {336} {2014} {} {22--36}

\objavljenoRevija
% 1.01: %list {\bf 5}. CHIARELLI, Nina, MILANI\v{C}, Martin. Total domishold graphs: a generalization of threshold graphs, 
%with connections to threshold hypergraphs. {\it Discrete applied mathematics},  2014, vol. 179, str. 1-12. 
%$[$COBISS.SI-ID 1537025220$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6593/120: Ne najdem podatka {STEVILKA}
   {N.~Chiarelli, \crta}
   {Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs}
   {Discrete Appl.\ Math.} {179} {2014} {} {1--12}

\objavljenoRevija
% 1.01: %list {\bf 11}. CICALESE, Ferdinando, CORDASCO, Gennaro, GARGANO, Luisa, MILANI\v{C}, Martin, VACCARO, Ugo. 
%Latency-bounded target set selection in social networks. {\it Theoretical computer science}, 2014, vol. 535, str. 1-15. 
%$[$COBISS.SI-ID 1537144004$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6639/140: Ne najdem podatka {STEVILKA}
   {F.~Cicalese, G.~Cordasco, L.~Gargano, \crta, U.~Vaccaro}
   {Latency-bounded target set selection in social networks}
   {Theoret.\ Comput.\ Sci.} {535} {2014} {} {1--15}

\objavljenoRevija
% 1.08: {\bf 13}. LEVIT, Vadim E., MILANI\v{C}, Martin. Equistable simplicial, very well covered, and line graphs. 
%V: FAIGLE, Ulrich (ur.), NICOSIA, Gaia (ur.), PACIFICI, Andrea (ur.). {\it 10th Cologne/Twente Workshop on Graphs and 
%Combinatorial Optimization (CTW 2011)}, (Discrete applied mathematics, ISSN 0166-218X, Vol. 165). Amsterdam: Elsevier, 
%2014, str. 205-212. $[$COBISS.SI-ID 1024490836$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6658/154: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6658/155: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6658/156: Ne najdem podatka {LETO}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6658/157: Ne najdem podatka {ZBORNIK}
   {V.~E.~Levit, \crta}
   {Equistable simplicial, very well covered, and line graphs}
   {Discrete Appl.\ Math.} {165} {2014} {} {205--212}

\objavljenoRevija
% 1.01: %list {\bf 9}. LOZIN, Vadim V., MILANI\v{C}, Martin, PURCELL, Christopher. Graphs without large apples and the 
%maximum weight independent set problem. {\it Graphs and combinatorics}, 2014, vol. 30, issue 2, str. 395-410. 
%$[$COBISS.SI-ID 1024475988$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6624/167: Ne najdem podatka {STEVILKA}
   {V.~V.~Lozin, \crta, C.~Purcell}
   {Graphs without large apples and the maximum weight independent set problem}
   {Graphs Combin.} {30} {2014} {} {395--410}

\objavljenoRevija
% 1.01: %list {\bf 3}. MILANI\v{C}, Martin, OVERSBERG, Andrea, SCHAUDT, Oliver. A characterization of line graphs that 
%are squares of graphs. {\it Discrete applied mathematics}, 2014, vol. 173, str. 83-91. $[$COBISS.SI-ID 17054297$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6579/174: Ne najdem podatka {STEVILKA}
   {\crta, A.~Oversberg, O.~Schaudt}
   {A characterization of line graphs that are squares of graphs}
   {Discrete Appl.\ Math.} {173} {2014} {} {83--91}

\objavljenoRevija
% 1.01: %list {\bf 7}. MILANI\v{C}, Martin, PEDERSEN, Anders Sune, PELLICER, Daniel, VERRET, Gabriel. Graphs whose complement
%and square are isomorphic. {\it Discrete Mathematics}, 2014, vol. 327, str. 62-75. $[$COBISS.SI-ID 1536616388$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6608/181: Ne najdem podatka {STEVILKA}
   {\crta, A.~S.~Pedersen, D.~Pellicer, G.~Verret}
   {Graphs whose complement and square are isomorphic}
   {Discrete Math.} {327} {2014} {} {62--75}

\objavljenoRevija
% 1.01: %list {\bf 12}. MILANI\v{C}, Martin, RIZZI, Romeo, TOMESCU, Alexandru I. Set graphs. II. Complexity of set graph 
%recognition and similar problems. {\it Theoretical computer science}, 2014, vol. 547, str. 70-81. $[$COBISS.SI-ID 1537143492$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6647/188: Ne najdem podatka {STEVILKA}
   {\crta, R.~Rizzi, A.~I.~Tomescu}
   {Set graphs. II. Complexity of set graph recognition and similar problems}
   {Theoret.\ Comput.\ Sci.} {547} {2014} {} {70--81}

\objavljenoRevija
% 1.01: %list {\bf 4}. MILANI\v{C}, Martin, TOMESCU, Alexandru I. Set graphs. IV, Further connections with claw-freeness. 
%{\it Discrete applied mathematics}, 2014, vol. 174, str. 113-121. $[$COBISS.SI-ID 17070169$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6586/195: Ne najdem podatka {STEVILKA}
   {\crta, A.~I.~Tomescu}
   {Set graphs. IV, Further connections with claw-freeness}
   {Discrete Appl.\ Math.} {174} {2014} {} {113--121}

\objavljenoZbornik
% 1.08: %list {\bf 14}. CICALESE, Ferdinando, CORDASCO, Gennaro, GARGANO, Luisa, MILANI\v{C}, Martin, PETERS, Joseph, VACCARO, 
%Ugo. How to go viral : cheaply and quickly. V: FERRO, Alfredo (ur.), LUCCIO, Fabrizio (ur.), WIDMAYER, Peter (ur.). 
%{\it Fun with algorithms : 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014 : proceedings},
%(Lecture Notes in Computer Science, ISSN 0302-9743, 8496), (LNCS sublibrary. SL 1, Theoretical computer science and general issues).
%Cham: Springer, 2014, str. 100-112. $[$COBISS.SI-ID 1537152708$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6666/127: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6666/128: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6666/129: Ne najdem podatka {LETO}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6666/130: Ne najdem podatka {ZBORNIK}
   {F.~Cicalese, G.~Cordasco, L.~Gargano, \crta, J.~Peters, U.~Vaccaro}
   {How to go viral : cheaply and quickly}
   {7\uth International conference on Fun with Algorithms}
   {Lipari} {Italija} {julij} {2014}
   {Fun with algorithms : proceedings (Lecture Notes in Comput.\ Sci.) {\bf 8496}} {1{0}0--112}

\objavljenoZbornik
% 1.08: %list {\bf 15}. CHIARELLI, Nina, MILANI\v{C}, Martin. Linear separation of connected dominating sets in graphs : 
%(extended abstract). V: {\it International Symposium on Artificial Intelligence and Mathematics : 6-8 January 2014, 
%Fort Lauderdale, FL}. Fort Lauderdale: $[$s. n.$]$, 2014, 8 str. $[$COBISS.SI-ID 1537154756$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6677/101: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6677/102: Ne najdem podatka {LETO}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6677/103: Ne najdem podatka {ZBORNIK}
   {N.~Chiarelli, \crta}
   {Linear separation of connected dominating sets in graphs}
   {International Symposium on Artificial Intelligence and Mathematics}
   {Fort Lauderdale, FL} {ZDA} {januar} {2014}
   {e-Proceedings: \url{http://www.cs.uic.edu/bin/view/Isaim2014/AcceptedPapers}} {8 str}

   

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

\begin{skupina}{E}

%\organizacija
%% 3.25: {\bf 23}. MILANI\v{C}, Martin{\it . Counterexamples to Orlin's conjecture on equistable graphs : Raziskovalni 
%matemati\v{c}ni seminar, Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije, 
%Koper, 24. 3. 2014}. 2014. $[$COBISS.SI-ID 1537143748$]$\\
%%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6768/239: Ne najdem podatka {OPIS}
%   {Raziskovalni matemati\v{c}ni seminar, Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in 
%   informacijske tehnologije}
%   {Counterexamples to Orlin's conjecture on equistable graphs}
%   {Koper} {Slovenija} {marec} {2014}

\organizacija
   {�lan organizacijskega odbora}
   {28th Ljubljana -- Leoben Graph Theory Seminar}
   {Koper} {} {september} {2014}

%\organizacija
% 3.25: %list {\bf 25}. MILANI\v{C}, Martin{\it . Vector connectivity in graphs : Raziskovalni matemati\v{c}ni seminar, 22. 12. 2014, Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije, Koper}. 2014. $[$COBISS.SI-ID 1537122756$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6783/253: Ne najdem podatka {OPIS}
%   {Raziskovalni matemati\v{c}ni seminar, Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije}
%   {Vector connectivity in graphs}
%   {Koper} {Slovenija} {december} {2014}

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

\predavanjeUstanova
% 3.14: {\bf 20}. MILANI\v{C}, Martin{\it . Dually Sperner hypergraphs and linear separation of variants of dominating sets 
%in graphs : S\'{e}minaire Graphes et structures discr\`{e}tes, ENS de Lyon, 28. 1. 2014}. 2014. $[$COBISS.SI-ID 1537156292$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6740/307: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6740/308: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6740/309: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6740/310: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6740/311: Ne najdem podatka {LETO}
   {Dually Sperner hypergraphs and linear separation of variants of dominating sets in graphs}
   {seminarsko predavanje}
   {�cole normale sup�rieure de Lyon}
   {} {Francija} {januar} {2014}

\predavanjeKonferenca
% 3.16: {\bf 22}. MILANI\v{C}, Martin{\it . Vector connectivity in graphs : $[$predavanje na$]$ R\'{e}union Groupe 
%de travail Graphes et Optimisation (GT-GO), 13 juin 2014, Universit\'{e} Paris-Dauphine}. Pariz, 13. jun. 2014. 
%$[$COBISS.SI-ID 1537144260$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6757/284: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6757/285: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6757/286: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6757/287: Ne najdem podatka {LETO}
   {Vector connectivity in graphs}
   {vabljeno predavanje}
   {R\'{e}union Groupe de travail Graphes et Optimisation (GT-GO)}
   {Universit\'{e} Paris-Dauphine} {Francija} {junij} {2014}

\predavanjeUstanova
% 3.14: %list {\bf 21}. MILANI\v{C}, Martin{\it . Graphs of power-bounded clique-width : colloquium at University of Oregon, 
%Department of Computer and Information Science, August 12th, 2014}. Eugene, Oregon, 2014. $[$COBISS.SI-ID 1537150660$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6746/296: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6746/297: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6746/298: Ne najdem podatka {LETO}
   {Graphs of power-bounded clique-width}
   {seminarsko predavanje}
   {University of Oregon}
   {Eugene} {ZDA} {avgust} {2014}

\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
% 1.08: %list {\bf 15}. CHIARELLI, Nina, MILANI\v{C}, Martin. Linear separation of connected dominating sets in graphs : 
%(extended abstract). V: {\it International Symposium on Artificial Intelligence and Mathematics : 6-8 January 2014, 
%Fort Lauderdale, FL}. Fort Lauderdale: $[$s. n.$]$, 2014, 8 str. $[$COBISS.SI-ID 1537154756$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6677/338: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6677/339: Ne najdem podatka {LETO}
%   {Linear separation of connected dominating sets in graphs : (extended abstract)}
%   {International Symposium on Artificial Intelligence and Mathematics}
%   {Fort Lauderdale} {DRZAVA} {januar} {LETO}


\konferenca
% 1.12: {\bf 18}. MILANI\v{C}, Martin, THOMASS\'{E}, St\'{e}phan, TROTIGNON, Nicolas. Counterexamples to three conjectures 
%on equistable graphs. V: Ninth International Colloquium on Graphs and Optimization, Sirmione, Italy, July 6-10, 20124. 
%{\it Ninth International Colloquium on Graphs and Optimization : abstract booklet : Sirmione, Italy, July 6-10, 2014}. 
%$[$S. l.: s. n., 2014$]$, str. 38. $[$COBISS.SI-ID 1537013188$]$\\
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6710/347: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6710/348: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6710/349: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6710/350: Ne najdem podatka {LETO}
   {Counterexamples to three conjectures on equistable graphs}
   {9\uth In\-ter\-na\-ti\-o\-nal Colloquium on Graphs and Optimization}
   {Sirmione} {Italija} {julij} {2014}


%\konferenca
%% 1.08: {\bf 13}. LEVIT, Vadim E., MILANI\v{C}, Martin. Equistable simplicial, very well covered, and line graphs. 
%V: FAIGLE, Ulrich (ur.), NICOSIA, Gaia (ur.), PACIFICI, Andrea (ur.). {\it 10th Cologne/Twente Workshop on Graphs 
%and Combinatorial Optimization (CTW 2011)}, (Discrete applied mathematics, ISSN 0166-218X, Vol. 165). 
%Amsterdam: Elsevier, 2014, str. 205-212. $[$COBISS.SI-ID 1024490836$]$\\
%%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6658/358: Ne najdem podatka {DRZAVA}
%%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6658/359: Ne najdem podatka {MESEC}
%%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6658/360: Ne najdem podatka {LETO}
%   {Equistable simplicial, very well covered, and line graphs}
%   {10th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2011)}
%   {Amsterdam} {DRZAVA} {MESEC} {LETO}

%
%\konferenca
%% 1.08: %list {\bf 14}. CICALESE, Ferdinando, CORDASCO, Gennaro, GARGANO, Luisa, MILANI\v{C}, Martin, PETERS, Joseph, 
%VACCARO, Ugo. How to go viral : cheaply and quickly. V: FERRO, Alfredo (ur.), LUCCIO, Fabrizio (ur.), WIDMAYER, Peter (ur.).
%{\it Fun with algorithms : 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014 : proceedings},
%(Lecture Notes in Computer Science, ISSN 0302-9743, 8496), (LNCS sublibrary. SL 1, Theoretical computer science and general issues). Cham: Springer, 2014, str. 100-112. $[$COBISS.SI-ID 1537152708$]$\\
%%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6666/368: Ne najdem podatka {DRZAVA}
%%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6666/369: Ne najdem podatka {MESEC}
%%POZOR: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6666/370: Ne najdem podatka {LETO}
%   {How to go viral : cheaply and quickly}
%   {Fun with algorithms}
%   {Cham} {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: Bibliografija2014A.tex > 2014\mat\clani\milanic.tex 6797/411: Stevilo neopredeljenih zadetkov: 4
%\razno
% 1.10: {\bf 16}. Dagstuhl Seminar 14071 "Graph Modification Problems", Feb. 9 - 14, 2014, MILANI\v{C}, Martin, BOROS, Endre, CICALESE, Ferdinando, HEGGERNES, Pinar, VAN 'T HOF, Pim, RIZZI, Romeo. Vector connectivity in graphs. {\it Dagstuhl reports}, ISSN 2192-5283, 2014, vol. 4, iss. 2, str. 48-49. $[$COBISS.SI-ID 1537132484$]$\\

%\razno
% 1.10: %list {\bf 17}. MILANI\v{C}, Martin. Vector connectivity in graphs. V: {\it Workshop on Tractable special cases of hard combinatorial optimization problems : Graz, Austria, 15. - 16. December 2014}. Graz: University of Technology, 2014. $[$COBISS.SI-ID 1537122500$]$\\

%\razno
% 2.23: {\bf 19}. LEGARRETA SOLAGUREN, Leire, MART\'{I}NEZ FERNANDEZ, Luis, MART\'{I}NEZ DE LA FUENTE MART\'{I}NEZ, Idelfonso, MILANI\v{C}, Martin{\it . Procedimento para dise\~{n}ar una vacuna : P201331759 : fecha de recepci\'{o}n 02 diciembre 2013}. Madrid: Oficina Espa\~{n}ola de Patentes y Marcas, 2014. 15 str. $[$COBISS.SI-ID 1536336324$]$\\

%\razno
% Ured: {\bf 26}. CHIARELLI, Nina (urednik), MILANI\v{C}, Martin (urednik){\it . 28th Ljubljana - Leoben Graph Theory Seminar : Koper, Slovenia, September 3-5, 2014}. Koper: UP FAMNIT: UP IAM, 2014. 20 str., ilustr. $[$COBISS.SI-ID 1536918468$]$\\

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

