\clan {Matja� Krnc}

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

%\poglavje   
% 
%   {AVTORJI}
%   {NASLOV}
%   {MONOGRAFIJA} {STRANI}
%   {ZALO�BA} {KRAJ} {DRZAVA} {2021} 

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

\begin{skupina}{B}

\sprejetoRevija
% 1. V.~Gurvich, \crta, M.~Milani�, M.~N.~Vyalyi. Shifting paths to avoidable ones. J. Graph Theory. [v tisku] 2021, vol. , iss. , 15 str. ISSN 0364-9024. https://onlinelibrary.wiley.com/doi/full/10.1002/jgt.22766
   {V.~Gurvich, \crta, M.~Milani�, M.~N.~Vyalyi}
   {Shifting paths to avoidable ones}
   {J. Graph Theory}

\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
% 2. I.~Savnik, M.~Akulich, \crta, R.~�krekovski. Data structure set-trie for storing and querying sets: Theoretical and empirical analysis. PLOS ONE . Feb. 2021, vol. 16, iss. 2, art. 0245122 (38 str.), ilustr. ISSN 1932-6203. https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0245122&type=printable, DOI: 10.1371/journal.pone.0245122. [COBISS.SI-ID 52168451]
   {I.~Savnik, M.~Akulich, \crta, R.~�krekovski}
   {Data structure set-trie for storing and querying sets: theoretical and empirical analysis}
   {PLOS ONE} {16} {2021} {} {art. 0245122 (38 str.)}

\objavljenoRevija
% 3. J.~Beisegel, C.~Denkert, E.~K�hler, \crta, N.~Piva�, R.~Scheffler, M.~Strehler. The recognition problem of graph search trees read more. SIAM J. Discrete Math. 2021, vol. 35, no. 2, str. 1418-1446, ilustr. ISSN 0895-4801. https://epubs.siam.org/doi/10.1137/20M1313301, DOI: 10.1137/20M1313301. [COBISS.SI-ID 80433667]
   {J.~Beisegel, C.~Denkert, E.~K�hler, \crta, N.~Piva�, R.~Scheffler, M.~Strehler}
   {The recognition problem of graph search trees}
   {SIAM J. Discrete Math.} {35} {2021} {} {1418--14{4}6}

\objavljenoZbornik
% 8. C.~J.~Dallard, R.~Ganian, M.~Hatzel, \crta, M.~Milani�. Graphs with two moplexes. V: FERREIRA, Carlos Eduardo (ur.). Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. Amsterdam: Elsevier, 2021. Str. 248-256. Procedia computer science, Vol. 195. ISSN 1877-0509. https://www.sciencedirect.com/science/article/pii/S1877050921021700, DOI: 10.1016/j.procs.2021.11.031. [COBISS.SI-ID 93541123]
   {C.~J.~Dallard, R.~Ganian, M.~Hatzel, \crta, M.~Milani�}
   {Graphs with two moplexes}
   {XI Latin and American Algorithms, Graphs and Optimization Symposium}
   {online (S\~{a}o Paulo)} {Brazilija} {maj} {2021} 
   {Proceedings} {248--256} 

\objavljenoZbornik
% 5. \crta, N.~Piva�. Graphs where search methods are indistinguishable. V: NE�ET�IL, Jaroslav (ur.). Extended Abstracts EuroComb 2021. Cham: Springer Nature, cop. 2021. Str. 351-358, ilustr. Trends in Mathematics, Vol. 14. ISBN 978-3-030-83822-5, ISBN 978-3-030-83823-2. ISSN 2297-0215. https://link.springer.com/chapter/10.1007%2F978-3-030-83823-2_55, DOI: 10.1007/978-3-030-83823-2_55. [COBISS.SI-ID 80112131]
   {\crta, N.~Piva�}
   {Graphs where search methods are indistinguishable}
   {European Conference on Combinatorics, Graph Theory and Applications}
   {online (Barcelona)} {�panija} {september} {2021} 
   {Extended Abstracts EuroComb 2021} {351--358} 

\objavljenoZbornik
% 6. \crta, N.~Piva�. Graphs where search methods are indistinguishable. V: FISTER, Iztok (ur.), et al. Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC). 1st ed. Maribor: University of Maribor, University Press: Faculty of Electrical Engineering and Computer Science; Ljubljana: Faculty of Computer and Information Science; Koper: Faculty of Mathematics, Natural Sciences and Information Technologies, 2021. Str. 11-13, ilustr. ISBN 978-961-286-516-0. https://press.um.si/index.php/ump/catalog/book/611, DOI: 10.18690/978-961-286-516-0. [COBISS.SI-ID 80443907]
   {\crta, N.~Piva�}
   {Graphs where search methods are indistinguishable}
   {7\uth Stu\-dent Computer Science Research Conference (StuCoSReC)}
   {Maribor} {} {september} {2021} 
   {Proceedings} {1{1}--13} 

\objavljenoZbornik
% 7. N.~Klobas, \crta. Fast recognition of some parametric graph families. V: FISTER, Iztok (ur.), et al. Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC). 1st ed. Maribor: University of Maribor, University Press: Faculty of Electrical Engineering and Computer Science; Ljubljana: Faculty of Computer and Information Science; Koper: Faculty of Mathematics, Natural Sciences and Information Technologies, 2021. Str. 31-34, ilustr. ISBN 978-961-286-516-0. https://press.um.si/index.php/ump/catalog/book/611, DOI: 10.18690/978-961-286-516-0. [COBISS.SI-ID 80131587]
   {N.~Klobas, \crta}
   {Fast recognition of some parametric graph families}
   {7\uth Student Computer Science Research Conference (StuCoSReC)}
   {Maribor} {} {september} {2021} 
   {Proceedings} {31--34} 

\objavljenoZbornik
% 4. \crta, N.~Klobas. Distinguishing graphs via cycles. V: Computing and Combinatorics : 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021 : proceedings. 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021 (Online). Cham: Springer, cop. 2021. Str. 387-398. Lecture notes in computer science, 13025. ISBN 978-3-030-89542-6, ISBN 978-3-030-89543-3. ISSN 0302-9743. https://link.springer.com/chapter/10.1007/978-3-030-89543-3_33, DOI: 10.1007/978-3-030-89543-3_33. [COBISS.SI-ID 84803075]
   {\crta, N.~Klobas}
   {Distinguishing graphs via cycles}
   {27\uth International Computing and Combinatorics Conference, COCOON 2021}
   {Tainan} {Taiwan} {oktober} {2021} 
   {Proceedings (Lecture notes in computer science, 13025)} {387--398} 

\end{skupina} 

%   Ni podatkov za to sekcijo

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

%\begin{skupina}{D}

%\urednikRevija
%   {OPIS}
%   {REVIJA}

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

%\end{skupina} 

\begin{skupina}{D}


\urednikZbornik
% 15. FISTER, Iztok (urednik), A.~Brodnik (urednik), BREST, Janez (urednik), FISTER, Iztok (urednik), M.~Krnc (urednik), ZIMIC, Nikolaj (urednik). Proceedings of the 2021 7th Student Computer Science Research Conference (StuCoSReC). 1st ed. Maribor: University of Maribor, University Press: Faculty of Electrical Engineering and Computer Science; Ljubljana: Faculty of Computer and Information Science; Koper: Faculty of Mathematics, Natural Sciences and Information Technologies, 2021. 1 spletni vir (1 datoteka PDF (80 str.)), ilustr. ISBN 978-961-286-516-0. https://press.um.si/index.php/ump/catalog/book/611, DOI: 10.18690/978-961-286-516-0. [COBISS.SI-ID 76158723]
   {Sourednik}
   {7\uth Student Computer Science Research Conference (StuCoSReC)}
   {Maribor} {} {september} {2021} 


\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
% 9. M.~Hatzel, R.~Ganian, M.~Krnc, C.~J.~Dallard, M.~Milani�. Graphs with two moplexes are more than perfect. V: N.~Ba�i� (ur.), et al. 8th European Congress of Mathematics : 20-26 June 2021, Portoro�, Slovenia : book of abstracts. Koper: University of Primorska Press, 2021. Str. 240-241. ISBN 978-961-293-085-1. https://www.hippocampus.si/ISBN/978-961-293-083-7.pdf. [COBISS.SI-ID 89604355
   {Graphs with two moplexes are more than perfect}
   {8\uth European Congress of Mathematics}
   {Portoro�} {} {junij} {2021} 

\konferenca
% 10. M.~Krnc, V.~Gurvich, M.~N.~Vyalyi., M.~Milani�. Shifting any path to an avoidable one. V: N.~Ba�i� (ur.), et al. 8th European Congress of Mathematics : 20-26 June 2021, Portoro�, Slovenia : book of abstracts. Koper: University of Primorska Press, 2021. Str. 242. ISBN 978-961-293-085-1. https://www.hippocampus.si/ISBN/978-961-293-083-7.pdf. [COBISS.SI-ID 88040707]
   {Shifting any path to an avoidable one}
   {8\uth European Congress of Mathematics}
   {Portoro�} {} {junij} {2021} 

\konferenca
% 11. M.~Krnc, C.~J.~Dallard, R.~Ganian, M.~Hatzel, M.~Milani�. Graphs with two moplexes are more than perfect. V: Book of Abstracts. BCC 2021, 28th British Combinatorial Conference 5th-9th July 2021, Delivered Online from Durham University. Durham: Durham University, 2021. Str. 145. http://bcc2021.webspace.durham.ac.uk/wp-content/uploads/sites/84/2021/07/dayroomtime-2.pdf. [COBISS.SI-ID 80528387]
   {Graphs with two moplexes are more than perfect}
   {28\uth British Combinatorial Conference}
   {online (Durham University)} {Velika Britanija} {julij} {2021} 

\konferenca
% 12. HANCOCK, Robert, KR�L', Daniel, M.~Krnc, VOLEC, Jan. Towards characterising locally common graphs. V: Book of Abstracts. BCC 2021, 28th British Combinatorial Conference 5th-9th July 2021, Delivered Online from Durham University. Durham: Durham University, 2021. Str. 99. http://bcc2021.webspace.durham.ac.uk/wp-content/uploads/sites/84/2021/07/dayroomtime-2.pdf. [COBISS.SI-ID 80516611]
   {Towards characterising locally common graphs}
   {28\uth British Combinatorial Conference}
   {online (Durham University)} {Velika Britanija} {julij} {2021} 

\konferenca
% 13. V.~Gurvich, M.~Krnc, M.~Milani�, M.~N.~Vyalyi. Shifting paths to avoidable ones. V: Workshop on Combinatorial Reconfiguration : affiliated with The 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) : [book of abstracts]. Sendai: Tohoku University; Kyoto: Kyoto University, 2021. Str. 7. [COBISS.SI-ID 81487363]
   {Shifting paths to avoidable ones}
   {Workshop on Combinatorial Reconfiguration : affiliated with The 48\uth International Colloquium on Automata, Languages, and Programming (ICALP 2021)}
   {online (Glasgow)} {Velika Britanija} {julij} {2021} 

\end{skupina} 

%   Ni podatkov za to sekcijo

%--------------------------------------------------------
%  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
% 1.19 Recenzija, prikaz knjige, kritika
% 14. M.~Krnc. Parczyk, Olaf: 2-universality in randomly perturbed graphs. (English summary).- European J. Combin. 87 (2020), 103118, 1-11. MathSciNet : Mathematical Reviews on the Web. [Spletna izd.]. 2021, mr4081482. ISSN 2167-5163. http://www.ams.org/mathscinet. [COBISS.SI-ID 84405763]
   {Ena recenzija za MathSciNet} 

\end{skupina} 

%   Ni podatkov za to sekcijo

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

