2013-03-18 10:00-11:00 FAMNIT-SEMIN Karla Počkaj Construction of G^1 Hermite rational spline motion of degree six Geometric interpolation techniques have many advantages, such as automatically chosen parametrization, lower degree of interpolants […]
2012-10-15 10:00-11:00 FAMNIT-SEMIN Dr. Pim van ‘t Hof (University of Bergen, Norway) Obtaining Planarity by Contracting Few Edges The contraction of an edge uv in a graph G is the […]
2013-03-11 10:00-11:00 FAMNIT-SEMIN Marcin Anholcer On Some Surprising Application of Graphs in Decision Making: Pairwise Comparisons In many multiple criteria decision making problems (in particular in the case of group […]
2013-03-04 10:00-11:00 FAMNIT-SEMIN Ademir Hujdurović Pentavalent arc-transitive bicirculants A bicirculant is a graph admitting an automorphism with two cycles of equal length in its cycle decomposition. A graph is said […]
2013-02-25 10:00-11:00 FAMNIT-SEMIN Janoš Vidali (Univerza v Ljubljani, Fakulteta za računalništvo) Extremal codes in distance-regular graphs with diameter 3 We study $1$-codes in distance-regular graphs of diameter $3$ that achieve […]
2013-02-18 10:00-11:00 FAMNIT-SEMIN Matjaž Konvalinka (UL FMF, Ljubljana) Tutte polytope The Cayley polytope was defined recently as the convex hull of Cayley compositions, introduced by Cayley in 1857. In this […]
2013-02-04 10:00-11:00 FAMNIT-VP Rachelle S. Heller, PhD (Associate Provost, Academic Affairs, George Washington University) Peer-Reviewed Journals: Leading or Following Research Trends? What is the role of a peer- reviewed journal? […]
2013-01-14 10:00-11:00 FAMNIT-SEMIN Polona Pavlič (IMFM Ljubljana) Path algebra and domination problems on graph products Using algebraic approach we show that different domination problems on the class of polygraphs can […]
2013-01-07 10:00-11:00 FAMNIT-SEMIN Dr. Ted Dobson (Mississippi State University, USA) Classification of vertex-transitive graphs of order a product of two distinct primes In the mid 90’s there were two concurrent […]
2012-12-20 14:00-15:00 Famnit-Semin (Seminar room) Prof. Andreas Brandstädt (University of Rostock, Germany) On the complexity of some packing and covering problems in certain graph classes Packing and covering problems […]