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 differential equations (PDE) that aims towards integration of worlds of…
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 G; a set of vertices S \subseteq V (G) locates…
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. As is well known, complex matrices are up to similarity…
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 problems in robotics, see for example LaValle, Planning Algorithms for…
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 extremal set theory which asserts that if $\mathcal{F}$ is a…
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 Altans and Iterated Altans Altanisation originated in the chemical literature…
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 usage as subroutines, these algorithms have themselves become an object…
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 connected H the Maximum Independent Set (MIS) problem in H-free…
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 #P-hard. In 1913 Polya asked for which (0,1)-matrices A it…
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 agent’s preferences are expressed by means of a directed acyclic…