DOI,IST REx ID,Research Group,Title of publication
10.1145/3717823.3718154,20008,UlWa,Hardness of 4-colouring G-colourable graphs
10.15479/AT-ISTA-20339,20339,"GradSch,UlWa",Topological methods in discrete geometry and theoretical computer science : Measure partitioning and constraint satisfaction problems
10.1007/s00454-025-00739-0,19860,UlWa,"Eight-partitioning points in 3D, and efficiently too"
10.4230/LIPIcs.SoCG.2024.8,18917,"UlWa,GradSch","Eight-partitioning points in 3D, and efficiently too"
10.4230/LIPIcs.STACS.2024.34,15168,UlWa,Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs