2020-03-02 10:00 — 11:00 FAMNIT-MP1 Nejc Šarabon (Faculty of Health Sciences, UP ) MULTI-LAYER INSIGHT INTO BODY ASYMMETRIES IN THE CONTEXT OF SPORTS INJURIES PREVENTION AND CARE The BOSY project […]
2020-02-24 10:00 — 11:00 FAMNIT-MP1 Russ Woodroofe (UP FAMNIT) A New Characterization of Supersolvable Lattices Stanley introduced _supersolvable lattices_ in the 1970s to describe properties that certain lattices have in […]
2020-02-15 10:00 — 12:00 FAMNIT-MP1 Stevan Pilipović & Gradimir V. Milovanović Mathematical Research Seminar sponsored by SASA at UP FAMNIT 10:00 – 10:45: FAMNIT-MP1 Lecturer: Stevan PilipovićTitle: Pseudo-differential operators-some new […]
2020-02-10 10:00 — 11:00 FAMNIT-MP1 Gábor Korchmáros (Universitá degli Studi della Basilicata, Potenza, Italy) Problems in Euclidean Distance Geometry Euclidean distance geometry, that is the study of Euclidean geometry based […]
2020-01-27 10:00 — 11:00 FAMNIT-MP1 Meike Hatzel (TU Berlin, Germany) Avoidable paths in graphs We prove a recent conjecture of Beisegel et al.~that for every positive integer $k$, every […]
2020-01-13 10:00 — 11:00 FAMNIT-MP1 Gyula Y. Katona (Budapest University of Technology and Economics, Hungary) Minimally t-Tough Graphs A graph G is minimally t-tough if the toughness of G is […]
2020-01-06 10:00 — 11:00 FAMNIT-MP1 Nino Bašić (UP FAMNIT) Point-ellipse and some other exotic configurations In this talk, we introduce point-ellipse configurations and point-conic configurations. We present some of their […]
2019-12-23 10:00 — 11:00 FAMNIT – MP1 Tomaž Pisanski (UP FAMNIT and UL FMF) Dürer’s antilattice and other magic antilattices. In this talk, we will revisit the variety of antilattices […]
2019-12-16 10:00 — 11:00 FAMNIT-MP1 Miklós Krész (INNORENEW COE and UP IAM) Maximally-Matchable Edges, Decomposition Theory and Parameterized Complexity In matching theory it is a basic problem to determine all […]
2019-12-09 10:00 — 11:00 FAMNIT-MP1 Clément Dallard (UP FAMNIT) Proportionally Dense Subgraphs of Maximum Size. The notion of density of a subgraph is usually defined as the number of edges […]