معرفی
Martin Milanič is Professor at the University of Primorska’s Faculty of Mathematics, Natural Sciences and Information Technologies. His research focuses on structural and algorithmic graph theory, including treewidth, domination, and clique studies. He chairs the WG 2024 conference and leads projects on graph modification and induced minors.
Recent work establishes NP-completeness of treewidth on cubic graphs and characterizes minimally tough graphs. He supervises doctoral students in graph decomposition and independence problems.
۰مقاله منتشرشده
