2018-11-19 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Ted Dobson (University of Primorska) On Automorphisms of Haar graphs of Abelian Groups Let G be a group and S\subseteq G. A Haar graph of G with connection set S has vertex set \Z_2\times G…
2018-11-12 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Martin Raič (UL FMF and UP FAMNIT) Central limit theorem and the Slepian-Stein method Roughly speaking, the celebrated central limit theorem says that a sum of many small independent random variables with sufficiently nice distributions…
2018-11-05 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Tomaž Pisanski (University of Primorska) A new generalization of generalized Petersen graphs We discuss a new family of cubic graphs, which we call $SGP$-graphs, that bears a close resemblance to the family of generalized Petersen…
2018-10-29 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Nevena Pivač (UP IAM) On the End-Vertex Problem For a given graph search algorithm and a graph G, a vertex v is said to be an end-vertex if there exists a corresponding search ordering of…
2018-10-23 16:00–17:00 FAMNIT-MP1 Ulrich Pferschy (University of Graz, Austria) On a Stackelberg Knapsack Game We consider a bi-level knapsack problem, where two players, the leader and the follower, are each associated with a subset of the items. The leader may…
2018-10-15 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Bojan Kuzma (University of Primorska) Matrices with extremal commutants and beyond Matrices whose commutant is either maximal or minimal with respect to set-inclusion were classified in 2005 by Dolinar and Šemrl in their pursuit towards…
2018-10-08 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Štefko Miklavič (University of Primorska) Efficient dominating sets in Cayley graphs on abelian groups An independent set D of vertices in a graph is an efficient dominating set when each vertex not in D is…
2018-10-04 11:00-12:00 FAMNIT-MP7 (former FAMNIT-POŠTA) Bojan Mohar (Simon Fraser University and IMFM) Approximating the genus of dense graphs Determining the genus of graphs is one of the fundamental NP-complete problems. Thus it makes sense to ask whether the genus can…
2018-07-04 9:30-12:00 FAMNIT-VP N. Mitrovic, M. Safe, M. Milanic, N. Chiarelli The First Koper – Bahia Blanca Workshop on Structural and Algorithmic Graph Theory The First Koper – Bahia Blanca Workshop on Structural and Algorithmic Graph TheoryUP FAMNIT, Glagoljaska 8,…