Category: Seminars
Locally based construction of analysis-suitable $G^1$ multi-patch spline surfaces
2023-04-17 15:00 — 16:00 FAMNIT-MP1 Aljaž Kosmač (UP FAMNIT, Slovenia) Locally based construction of analysis-suitable $G^1$ multi-patch spline surfaces Isogeometric analysis was first introduced as an approach for solving partial […]
Distances in graphs and the application to the problem of locating objects in a graph
2023-04-05 15:00 — 16:00 FAMNIT-MP7 Jelena Sedlar (University of Split, Croatia) Distances in graphs and the application to the problem of locating objects in a graph In a connected graph […]
Similarity of matrix tuples
2023-04-03 15:00 — 16:00 FAMNIT-MP1 Igor Klep (University of Ljubljana, Slovenia) Similarity of matrix tuples Two matrices A,B are called similar if there is an invertible matrix P satisfying AP=PB. […]
How to Get Where You Want to Go (Topological complexity of motion planning)
2023-03-27 15:00 — 16:00 FAMNIT-MP1 Petar Pavešić (University of Ljubljana, Slovenia) How to Get Where You Want to Go (Topological complexity of motion planning) Motion planning is among the core […]
Using association schemes to prove Erdős-Ko-Rado type results
2023-03-20 15:00 — 16:00 FAMNIT-MP1 & Zoom Razafimahatratra Andriaherimanana Sarobidy (UP FAMNIT, Slovenia) Using association schemes to prove Erdős-Ko-Rado type results The Erdős-Ko-Rado (EKR) theorem is a fundamental result in […]
On the Nullity of Altans and Iterated Altans
2023-03-06 15:00 — 16:00 Famnit MP1 & ZOOM Nino Bašić (FAMNIT & IAM, University of Primorska, Koper, Slovenia Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia) On the Nullity of […]
How to Search in the Right Direction
2023-02-27 15:00 — 16:00 FAMNIT-MP1 & Zoom Robert Scheffler (BTU Cottbus-Senftenberg, Germany) How to Search in the Right Direction Graph searches are important concepts of algorithmic graph theory. Besides their […]
Understanding graphs with no long claws
2023-02-20 15:00 — 16:00 FAMNIT-MP1 Paweł Rzążewski (Warsaw University of Technology and University of Warsaw, Poland) Understanding graphs with no long claws A classic result of Alekseev asserts that for […]
Excluding a single-crossing matching minor
2023-01-16 15:00 — 16:00 FAMNIT-MP1 & Zoom Sebastian Wiederrecht (IBS, Daejeon, South Korea) Excluding a single-crossing matching minor By a seminal result of Valiant, computing the permanent of (0,1)-matrices is […]
Allocation of Indivisible Items with given Preference Graphs.
2023-01-09 15:00 — 16:00 Famnit MP1 Peter Muršič (UP FAMNIT, Slovenia) Allocation of Indivisible Items with given Preference Graphs. We study the allocation of indivisible items to agents, when each […]
