2021-01-11 10:00 — 11:00 ZOOM (See link below) Petr Golovach (Bergen University, Norway) Paths and Cycles Above Combinatorial Bounds An undirected graph G d-degenerate if every subgraph of G has a vertex of degree at most d, and the degeneracy…
Department of Information Sciences and Technologies at UP FAMNIT is inviting you to the Monday Seminar on Computer Science entitled » Daring creativity: about the new project LOOSE CELLS – Innovating at the Crossfield of Art and Science and how…
This year, the roles of the highest scientific officers as the Program Chairs at the ACM UMAP 2021(29th Conference on User Modeling, Adaptation and Personalization) are going to be shared by Nava Tintarev from the University of Maastricht and Marko…
2021-01-04 10:00 — 11:00 ZOOM (See link below) Ted Dobson (UP FAMNIT, Slovenia) Recognizing vertex-transitive digraphs which are wreath products, double coset digraphs, and generalized wreath products It is known that a Cayley digraph $\Cay(A,S)$ of an abelian group $A$…
Yesterday, 28 December 2020, we welcomed another doctor of science at UP FAMNIT. Jamolbek Mattiev, a student of Computer Science doctorate study programe at UP FAMNIT has succesfully defended his doctorate disertation entitled Clustering Class Association Rules to form a…
The Government of the Republic of Slovenia prolonged the Decree on temporary prohibition of gathering of people in the field of education. Simultaneously, the Ministry of Education, Science and Sport sent a note to universities in which they informed us…
On Tuesday, 22 December 20202 Micael Alexi Toledo Roy, a student of Mathematical Sciences doctorate programme at UP Famnit, successfully completed his doctoral studies. Under the mentorship of Prof. Primož Potočnik, PhD, and co-mentorship of Assoc. Prof. Ademir Hujdurović, PhD,…
Jamolbek Mattiev, student of the doctoral study programe Computer Science at UP FAMNIT will defend his doctoral thesis Clustering Class Association Rules to form a Meaningful and Accurate Classifier (Uporaba razvrščanja v skupine na klasifikacijskih asociacijskih pravilih za tvorbo smiselnih…
Click: Happy Holidays and Healty New Year 2021! Univerza na Primorskem / University of Primorska
2020-12-21 10:00 — 11:00 ZOOM (See link below) Daniel Paulusma (Durham University, UK) Contracting to a Longest Path in H-Free Graphs We consider the problem of determining if a graph can be modified to a path by a small number…