Central limit theorem and the Slepian-Stein method

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…

A new generalization of generalized Petersen graphs

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…

On the End-Vertex Problem

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…

On a Stackelberg Knapsack Game

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…

Matrices with extremal commutants and beyond

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…

Accessibility Toolbar