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

%\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 5}. ANHOLCER, Marcin, CICHACZ, Sylwia, MILANI\v{C}, Martin. Group irregularity strength of connected graphs. {\it Journal of combinatorial optimization}, 2013, str. 1-17. $[$COBISS.SI-ID 1024511060$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7747/80: Ne najdem podatka {STEVILKA}
   {M.~Anholcer, S.~Cichacz, \crta}
   {Group irregularity strength of connected graphs}
   {Journal of combinatorial optimization} {LETNIK} {2013} {STEVILKA} {1--17}

\objavljenoZbornik
% 1.08: %list {\bf 15}. BOROS, Endre, HEGGERNES, Pinar, VAN 'T HOF, Pim, MILANI\v{C}, Martin. Vector connectivity in graphs. V: 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. CHAN, Hubert T. H. (ur.), LAU, Lap Chi (ur.), TREVISAN, Luca (ur.). {\it Theory and applications of models of computation : 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013 : proceedings}, (Lecture notes in computer science, ISSN 0302-9743, 7876). Heidelberg $[$etc.$]$: Springer, cop. 2013, str. 331-342. $[$COBISS.SI-ID 1024502100$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7851/87: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7851/88: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7851/89: Ne najdem podatka {ZBORNIK}
   {E.~Boros, P.~Heggernes, P.~Van 'T Hof, \crta}
   {Vector connectivity in graphs}
   {10th International Conference}
   {Heidelberg} {DRZAVA} {maj} {LETO}
   {ZBORNIK} {3{3}1--342} 


\objavljenoZbornik
% 1.08: %list {\bf 11}. BRANDST\"{A}DT, Andreas, MILANI\v{C}, Martin, NEVRIES, Ragnar. New polynomial cases of the weighted efficient domination problem. V: CHATTERJEE, Krishnendu (ur.), SGALL, Ji\v{r}\'{\i} (ur.). {\it Mathematical foundations of computer science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013 : proceedings}, (Lecture notes in computer science, ISSN 0302-9743, 8087). Berlin: Springer, 2013, str. 195-206. $[$COBISS.SI-ID 1024532564$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7808/99: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7808/100: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7808/101: Ne najdem podatka {ZBORNIK}
   {a.~Brandst\"{a}dt, \crta, R.~Nevries}
   {New polynomial cases of the weighted efficient domination problem}
   {Mathematical foundations of computer science 2013}
   {Berlin} {DRZAVA} {august} {LETO}
   {ZBORNIK} {195--206} 


\objavljenoZbornik
% 1.08: %list {\bf 10}. CHIARELLI, Nina, MILANI\v{C}, Martin. Linear separation of total dominating sets in graphs. V: 39th International Workshop, WG 2013, L\"{u}beck, Germany, June 19-21, 2013. BRANDST\"{A}DT, Andreas (ur.), JANSEN, Klaus (ur.), REISCHUK, R\"{u}diger (ur.). {\it Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, L\"{u}beck, Germany, June 19-21, 2013}, (Lecture notes in computer science, ISSN 0302-9743, 8165). Heidelberg $[$etc.$]$: Springer, cop. 2013, str. 165-176. $[$COBISS.SI-ID 1536085700$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7796/111: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7796/112: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7796/113: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7796/114: Ne najdem podatka {ZBORNIK}
   {N.~Chiarelli, \crta}
   {Linear separation of total dominating sets in graphs}
   {39th International Workshop}
   {Heidelberg} {DRZAVA} {MESEC} {LETO}
   {ZBORNIK} {165--176} 


\objavljenoZbornik
% 1.08: %list {\bf 12}. CICALESE, Ferdinando, CORDASCO, Gennaro, GARGANO, Luisa, MILANI\v{C}, Martin, VACCARO, Ugo. Latency-bounded target set selection in social networks. V: e9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. BONIZZONI, Paola (ur.), BRATTKA, Vasco (ur.), L\"{O}WE, Benedikt (ur.). {\it The nature of computation : logic, algorithms, applications : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013 : proceedings}, (Lecture notes in computer science, ISSN 0302-9743, 7921). Heidelberg $[$etc.$]$: Springer, cop. 2013, str. 65-77. $[$COBISS.SI-ID 1024516948$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7819/124: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7819/125: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7819/126: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7819/127: Ne najdem podatka {ZBORNIK}
   {F.~Cicalese, G.~Cordasco, L.~Gargano, \crta, U.~Vaccaro}
   {Latency-bounded target set selection in social networks}
   {e9th Conference on Computability in Europe}
   {Heidelberg} {DRZAVA} {MESEC} {LETO}
   {ZBORNIK} {65--7{7}} 


\objavljenoRevija
% 1.01: %list {\bf 2}. CICALESE, Ferdinando, MILANI\v{C}, Martin, VACCARO, Ugo. On the approximability and exact algorithms for vector domination and related problems in graphs. {\it Discrete Applied Mathematics}, 2013, vol. 161, iss. 6, str. 750-767. $[$COBISS.SI-ID 1024470868$]$\\ 
   {F.~Cicalese, \crta, U.~Vaccaro}
   {On the approximability and exact algorithms for vector domination and related problems in graphs}
   {Discrete Applied Mathematics} {161} {2013} {6} {750--767}

\objavljenoZbornik
% 1.08: %list {\bf 13}. FRITZILAS, Epameinondas, MILANI\v{C}, Martin, MONNOT, J\'{e}r\^{o}me, RIOS-SOLIS, Yasmin A. Resilience and optimization of identifiable bipartite graphs. V: DEMANGE, Marc (ur.), et al. {\it Seventh International Conference on Graphs and Optimization}, (Discrete applied mathematics, ISSN 0166-218X, Vol. 161, iss. 4/5). Amsterdam: Elsevier, 2013, str. 593-603. $[$COBISS.SI-ID 1024406100$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7832/143: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7832/144: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7832/145: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7832/146: Ne najdem podatka {ZBORNIK}
   {E.~Fritzilas, \crta, J\'{e}r\^{o}.~Monnot, Y.~A.~Rios-Solis}
   {Resilience and optimization of identifiable bipartite graphs}
   {Seventh International Conference on Graphs and Optimization}
   {Amsterdam} {DRZAVA} {MESEC} {LETO}
   {ZBORNIK} {593--603} 


\objavljenoZbornik
% 1.08: %list {\bf 9}. HEGGERNES, Pinar, VAN 'T HOF, Pim, MILANI\v{C}, Martin. Induced subtrees in interval graphs. V: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. LECROQ, Thierry (ur.), MOUCHARD, Laurent (ur.). {\it Combinatorial algorithms : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013 : revised selected papers}, (Lecture notes in computer science, ISSN 0302-9743, 8288). Berlin: Springer, 2013, str. 230-243. $[$COBISS.SI-ID 1536086724$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7785/156: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7785/157: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7785/158: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7785/159: Ne najdem podatka {ZBORNIK}
   {P.~Heggernes, P.~Van 'T Hof, \crta}
   {Induced subtrees in interval graphs}
   {24th International Workshop}
   {Berlin} {DRZAVA} {MESEC} {LETO}
   {ZBORNIK} {230--243} 


\objavljenoRevija
% 1.01: {\bf 1}. LEVIT, Vadim E., MILANI\v{C}, Martin. Equistable simplicial, very well covered, and line graphs. {\it Discrete Applied Mathematics}, 2013, str. 1-8. $[$COBISS.SI-ID 1024490836$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7722/169: Ne najdem podatka {STEVILKA}
   {V.~E.~Levit, \crta}
   {Equistable simplicial, very well covered, and line graphs}
   {Discrete Applied Mathematics} {LETNIK} {2013} {STEVILKA} {1--8}

\objavljenoRevija
% 1.01: %list {\bf 4}. LOZIN, Vadim V., MILANI\v{C}, Martin. Critical properties of graphs of bounded clique-width. {\it Discrete Mathematics}, 2013, vol. 313, issue 9, str. 1035-1044. $[$COBISS.SI-ID 1024490324$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7741/176: Ne najdem podatka {STEVILKA}
   {V.~V.~Lozin, \crta}
   {Critical properties of graphs of bounded clique-width}
   {Discrete Mathematics} {313} {2013} {STEVILKA} {1035--104{4}}

\objavljenoZbornik
% 1.08: {\bf 8}. MILANI\v{C}, Martin. A note on domination and independence-domination numbers of graphs. V: Bled'11 - 7th Slovenian International Conference on Graph Theory, 19-25 June 2011, Bled, Slovenia. {\it Ars mathematica contemporanea : special issue Bled'11}, (Ars mathematica contemporanea, ISSN 1855-3966, Vol. 6, no. 1, 2013). Ljubljana: DMFA Slovenije, 2013, str. 89-97. $[$COBISS.SI-ID 1024423764$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7776/183: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7776/184: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7776/185: Ne najdem podatka {ZBORNIK}
   {}
   {A note on domination and independence-domination numbers of graphs}
   {Bled'11 - 7th Slovenian International Conference on Graph Theory}
   {Ljubljana} {} {MESEC} {LETO}
   {ZBORNIK} {89--97} 


\objavljenoRevija
% 1.01: %list {\bf 6}. MILANI\v{C}, Martin, PISANSKI, Toma\v{z}, \v{Z}ITNIK, Arjana. Dilation coefficient, plane-width, and resolution coefficient of graphs. {\it Monatshefte f\"{u}r Mathematik}, 2013, vol. 170, no. 2, str. 179-193. $[$COBISS.SI-ID 1024499540$]$\\ 
   {\crta, T.~Pisanski, A.~\v{Z}itnik}
   {Dilation coefficient, plane-width, and resolution coefficient of graphs}
   {Monatshefte f\"{u}r Mathematik} {170} {2013} {2} {179--193}

\objavljenoRevija
% 1.01: %list {\bf 3}. MILANI\v{C}, Martin, SCHAUDT, Oliver. Computing square roots of trivially perfect and threshold graphs. {\it Discrete Applied Mathematics}, 2013, vol. 161, no. 10/11, str. 1538-1545. $[$COBISS.SI-ID 1024486996$]$\\ 
   {\crta, O.~Schaudt}
   {Computing square roots of trivially perfect and threshold graphs}
   {Discrete Applied Mathematics} {161} {2013} {10/11} {1538--1545}

\objavljenoZbornik
% 1.08: %list {\bf 14}. MILANI\v{C}, Martin, TOMESCU, Alexandru I. Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. V: DEMANGE, Marc (ur.), et al. {\it Seventh International Conference on Graphs and Optimization}, (Discrete applied mathematics, ISSN 0166-218X, Vol. 161, iss. 4/5). Amsterdam: Elsevier, 2013, str. 677-690. $[$COBISS.SI-ID 1024382548$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7842/207: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7842/208: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7842/209: Ne najdem podatka {LETO}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7842/210: Ne najdem podatka {ZBORNIK}
   {\crta, A.~.~.~.~Tomescu}
   {Hereditarily finite sets and extensional acyclic orientations}
   {Seventh International Conference on Graphs and Optimization}
   {Amsterdam} {DRZAVA} {MESEC} {LETO}
   {ZBORNIK} {67{7}--690} 


\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 . Induced subtrees in interval graphs : Seminar za teorijo grafov in algoritme, Univerza v Ljubljani, Fakulteta za matematiko in fiziko, 7. 11. 2013}. 2013. $[$COBISS.SI-ID 1536087236$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7926/257: Ne najdem podatka {OPIS}
   {OPIS}
   {Induced subtrees in interval graphs}
   {KRAJ} {DRZAVA} {MESEC} {LETO} 

\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: %list {\bf 22}. MILANI\v{C}, Martin{\it . On the identifiable subgraph problem : RUTCOR Colloquium, Rutgers University, New Brunswick, January 31, 2013}. 2013. $[$COBISS.SI-ID 1024490068$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7916/288: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7916/289: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7916/290: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7916/291: Ne najdem podatka {LETO}
   {On the identifiable subgraph problem}
   {RUTCOR Colloquium, Rutgers University, New Brunswick, January 31, 2013}
   {KONFERENCA}
   {KRAJ} {DRZAVA} {januar} {LETO} 


\predavanjeUstanova
% 3.14: {\bf 19}. MILANI\v{C}, Martin{\it . Algorithmic graph theory : Doctoral Course on Algorithmic Graph Theory, Department of Computer Science, Universita' degli Studi di Verona, 19 - 21 March 2013}. 2013. $[$COBISS.SI-ID 1024506452$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7896/300: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7896/301: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7896/302: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7896/303: Ne najdem podatka {LETO}
   {Algorithmic graph theory}
   {Doctoral Course on Algorithmic Graph Theory, Department of Computer Science, Universita' degli Studi di Verona, 19 - 21 March 2013}
   {KONFERENCA}
   {KRAJ} {DRZAVA} {oktober} {LETO} 


\predavanjeUstanova
% 3.14: %list {\bf 20}. MILANI\v{C}, Martin{\it . Algorithmic graph theory : Doctoral Course on Algorithmic Graph Theory, Department of Computer Science, Universita' degli Studi di Verona, 5 - 9 March 2013}. 2013. $[$COBISS.SI-ID 1024501076$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7902/312: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7902/313: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7902/314: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7902/315: Ne najdem podatka {LETO}
   {Algorithmic graph theory}
   {Doctoral Course on Algorithmic Graph Theory, Department of Computer Science, Universita' degli Studi di Verona, 5 - 9 March 2013}
   {KONFERENCA}
   {KRAJ} {DRZAVA} {oktober} {LETO} 


\predavanjeUstanova
% 3.14: %list {\bf 21}. MILANI\v{C}, Martin{\it . Graph classes: interrelations, structure, and algorithmic issues : Lectio Magistralis, Department of Computer Science, Universita' degli Studi di Verona, 21 March 2013}. 2013. $[$COBISS.SI-ID 1024501332$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7909/324: Ne najdem podatka {KONFERENCA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7909/325: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7909/326: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7909/327: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7909/328: Ne najdem podatka {LETO}
   {Graph classe}
   {interrelations, structure, and algorithmic issues : Lectio Magistralis, Department of Computer Science, Universita' degli Studi di Verona, 21 March 2013}
   {KONFERENCA}
   {KRAJ} {DRZAVA} {MESEC} {LETO} 


\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}. BOROS, Endre, HEGGERNES, Pinar, VAN 'T HOF, Pim, MILANI\v{C}, Martin. Vector connectivity in graphs. V: 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. CHAN, Hubert T. H. (ur.), LAU, Lap Chi (ur.), TREVISAN, Luca (ur.). {\it Theory and applications of models of computation : 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013 : proceedings}, (Lecture notes in computer science, ISSN 0302-9743, 7876). Heidelberg $[$etc.$]$: Springer, cop. 2013, str. 331-342. $[$COBISS.SI-ID 1024502100$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7851/355: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7851/356: Ne najdem podatka {LETO}
   {Vector connectivity in graphs}
   {10th International Conference}
   {Heidelberg} {DRZAVA} {maj} {LETO} 


\konferenca
% 1.08: %list {\bf 11}. BRANDST\"{A}DT, Andreas, MILANI\v{C}, Martin, NEVRIES, Ragnar. New polynomial cases of the weighted efficient domination problem. V: CHATTERJEE, Krishnendu (ur.), SGALL, Ji\v{r}\'{\i} (ur.). {\it Mathematical foundations of computer science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013 : proceedings}, (Lecture notes in computer science, ISSN 0302-9743, 8087). Berlin: Springer, 2013, str. 195-206. $[$COBISS.SI-ID 1024532564$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7808/364: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7808/365: Ne najdem podatka {LETO}
   {New polynomial cases of the weighted efficient domination problem}
   {Mathematical foundations of computer science 2013}
   {Berlin} {DRZAVA} {august} {LETO} 


\konferenca
% 1.12: {\bf 16}. MILANI\v{C}, Martin, BONOMO, Flavia, GRIPPO, Luciano, SAFE, Martin Dario. Graphs of power-bounded clique- width. V: {\it 6th workshop on Graph Classes, Optimization, and Width Parameters, Santorini Island, October 09-11, 2013}. $[$S. l.: s. n., 2013$]$, str. 13. $[$COBISS.SI-ID 1536125380$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7867/373: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7867/374: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7867/375: Ne najdem podatka {LETO}
   {Graphs of power-bounded clique- width}
   {6th workshop on Graph Classes}
   {KRAJ} {DRZAVA} {oktober} {LETO} 


\konferenca
% 1.08: {\bf 8}. MILANI\v{C}, Martin. A note on domination and independence-domination numbers of graphs. V: Bled'11 - 7th Slovenian International Conference on Graph Theory, 19-25 June 2011, Bled, Slovenia. {\it Ars mathematica contemporanea : special issue Bled'11}, (Ars mathematica contemporanea, ISSN 1855-3966, Vol. 6, no. 1, 2013). Ljubljana: DMFA Slovenije, 2013, str. 89-97. $[$COBISS.SI-ID 1024423764$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7776/383: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7776/384: Ne najdem podatka {LETO}
   {A note on domination and independence-domination numbers of graphs}
   {Bled'11 - 7th Slovenian International Conference on Graph Theory}
   {Ljubljana} {} {MESEC} {LETO} 


\konferenca
% 1.12: %list {\bf 18}. MILANI\v{C}, Martin, LEVIT, Vadim E., MIKLAVI\v{C}, \v{S}tefko, ORLIN, James B., RUDOLF, G\'{a}bor, TANKUS, D. Equistable graphs: conjectures, results, and connections with Boolean functions. V: {\it Boolean Seminar}. $[$S.l.: s.n.$]$, 2013, str. 1-99. $[$COBISS.SI-ID 1024506196$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7881/392: Ne najdem podatka {KRAJ}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7881/393: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7881/394: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7881/395: Ne najdem podatka {LETO}
   {Equistable graphs: conjectures, results, and connections with Boolean functions}
   {Boolean Seminar}
   {KRAJ} {DRZAVA} {MESEC} {LETO} 


\konferenca
% 1.08: %list {\bf 14}. MILANI\v{C}, Martin, TOMESCU, Alexandru I. Set graphs. I. Hereditarily finite sets and extensional acyclic orientations. V: DEMANGE, Marc (ur.), et al. {\it Seventh International Conference on Graphs and Optimization}, (Discrete applied mathematics, ISSN 0166-218X, Vol. 161, iss. 4/5). Amsterdam: Elsevier, 2013, str. 677-690. $[$COBISS.SI-ID 1024382548$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7842/403: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7842/404: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7842/405: Ne najdem podatka {LETO}
   {Hereditarily finite sets and extensional acyclic orientations}
   {Seventh International Conference on Graphs and Optimization}
   {Amsterdam} {DRZAVA} {MESEC} {LETO} 


\konferenca
% 1.08: %list {\bf 9}. HEGGERNES, Pinar, VAN 'T HOF, Pim, MILANI\v{C}, Martin. Induced subtrees in interval graphs. V: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. LECROQ, Thierry (ur.), MOUCHARD, Laurent (ur.). {\it Combinatorial algorithms : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013 : revised selected papers}, (Lecture notes in computer science, ISSN 0302-9743, 8288). Berlin: Springer, 2013, str. 230-243. $[$COBISS.SI-ID 1536086724$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7785/413: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7785/414: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7785/415: Ne najdem podatka {LETO}
   {Induced subtrees in interval graphs}
   {24th International Workshop}
   {Berlin} {DRZAVA} {MESEC} {LETO} 


\konferenca
% 1.08: %list {\bf 12}. CICALESE, Ferdinando, CORDASCO, Gennaro, GARGANO, Luisa, MILANI\v{C}, Martin, VACCARO, Ugo. Latency-bounded target set selection in social networks. V: e9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. BONIZZONI, Paola (ur.), BRATTKA, Vasco (ur.), L\"{O}WE, Benedikt (ur.). {\it The nature of computation : logic, algorithms, applications : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013 : proceedings}, (Lecture notes in computer science, ISSN 0302-9743, 7921). Heidelberg $[$etc.$]$: Springer, cop. 2013, str. 65-77. $[$COBISS.SI-ID 1024516948$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7819/423: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7819/424: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7819/425: Ne najdem podatka {LETO}
   {Latency-bounded target set selection in social networks}
   {e9th Conference on Computability in Europe}
   {Heidelberg} {DRZAVA} {MESEC} {LETO} 


\konferenca
% 1.08: %list {\bf 10}. CHIARELLI, Nina, MILANI\v{C}, Martin. Linear separation of total dominating sets in graphs. V: 39th International Workshop, WG 2013, L\"{u}beck, Germany, June 19-21, 2013. BRANDST\"{A}DT, Andreas (ur.), JANSEN, Klaus (ur.), REISCHUK, R\"{u}diger (ur.). {\it Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, L\"{u}beck, Germany, June 19-21, 2013}, (Lecture notes in computer science, ISSN 0302-9743, 8165). Heidelberg $[$etc.$]$: Springer, cop. 2013, str. 165-176. $[$COBISS.SI-ID 1536085700$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7796/433: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7796/434: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7796/435: Ne najdem podatka {LETO}
   {Linear separation of total dominating sets in graphs}
   {39th International Workshop}
   {Heidelberg} {DRZAVA} {MESEC} {LETO} 


\konferenca
% 1.12: %list {\bf 17}. MILANI\v{C}, Martin, BOROS, Endre, GURVICH, Vladimir. On CIS circulants. V: HUJDUROVI\'{C}, Ademir (ur.), et al. {\it Abstracts of the CSASC 2013}. Koper: University of Primorska Press, 2013, str. 45-46. $[$COBISS.SI-ID 1536086212$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7874/443: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7874/444: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7874/445: Ne najdem podatka {LETO}
   {On CIS circulants}
   {Abstracts of the CSASC 2013}
   {Koper} {DRZAVA} {MESEC} {LETO} 


\konferenca
% 1.08: %list {\bf 13}. FRITZILAS, Epameinondas, MILANI\v{C}, Martin, MONNOT, J\'{e}r\^{o}me, RIOS-SOLIS, Yasmin A. Resilience and optimization of identifiable bipartite graphs. V: DEMANGE, Marc (ur.), et al. {\it Seventh International Conference on Graphs and Optimization}, (Discrete applied mathematics, ISSN 0166-218X, Vol. 161, iss. 4/5). Amsterdam: Elsevier, 2013, str. 593-603. $[$COBISS.SI-ID 1024406100$]$\\ 
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7832/453: Ne najdem podatka {DRZAVA}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7832/454: Ne najdem podatka {MESEC}
%POZOR: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7832/455: Ne najdem podatka {LETO}
   {Resilience and optimization of identifiable bipartite graphs}
   {Seventh International Conference on Graphs and Optimization}
   {Amsterdam} {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: Bibliografija2013.tex > 2013\mat\clani\milanic.tex 7938/496: Stevilo neopredeljenih zadetkov: 2
%\razno
% 1.05: {\bf 7}. MILANI\v{C}, Martin. Matemati\v{c}ne aktivnosti na UP FAMNIT za u\v{c}ence, dijake in u\v{c}itelje. {\it Matematika v \v{s}oli},   2013, letn. 19, \v{s}t. 1/2, str. 88-92. $[$COBISS.SI-ID 1536091076$]$\\ 

%\razno
% Ment: {\bf 24}. FRANGE\v{Z}, Maja{\it . Liho dominantne mno\v{z}ice v grafih : zaklju\v{c}na naloga}. Koper: $[$M. Frange\v{z}$]$, 2013. VII, 30 f., ilustr. $[$COBISS.SI-ID 1536026308$]$\\ 

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

