DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPIcs.OPODIS.2023.11,15006,KrCh,On the convergence time in graphical games: A locality-sensitive approach
10.4230/LIPIcs.ICALP.2023.74,14086,MoHe,Faster submodular maximization for several classes of matroids
10.4230/LIPIcs.CONCUR.2023.21,14405,ToHe,Hypernode automata
10.4230/LIPIcs.SoCG.2021.16,9604,HeEd,"Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory"
10.4230/LIPIcs.SoCG.2021.27,9605,HeEd,Computing the multicover bifiltration
10.4230/LIPIcs.MFCS.2020.22,8533,KrCh,Simplified game of life: Algorithms and complexity
10.4230/LIPIcs.MFCS.2020.51,8534,KrCh,Unary prime languages
10.4230/LIPIcs.CONCUR.2020.2,8599,ToHe,A survey of bidding games on graphs
10.4230/LIPIcs.CONCUR.2020.23,8600,"KrCh,ToHe",Multi-dimensional long-run average problems for vector addition systems with states
10.4230/LIPIcs.ESA.2020.75,8703,HeEd,Generalizing CGAL periodic Delaunay triangulations
10.4230/LIPIcs.OPODIS.2019.15,7605,DaAl,In search of the fastest concurrent union-find algorithm
10.4230/LIPIcs.SoCG.2020.61,7989,UlWa,Bounding radon number via Betti numbers
10.4230/LIPIcs.SoCG.2020.67,7990,UlWa,Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)
10.4230/LIPIcs.SoCG.2020.12,7991,UlWa,Homotopic curve shortening and the affine curve-shortening flow
10.4230/LIPIcs.SoCG.2020.62,7992,UlWa,Barycentric cuts through a convex body
10.4230/LIPIcs.SoCG.2020.9,7994,UlWa,Extending drawings of graphs to arrangements of pseudolines
10.4230/LIPIcs.CONCUR.2018.21,133,ToHe,Synchronizing the asynchronous
10.4230/LIPIcs.SoCG.2018.46,285,UlWa,On the treewidth of triangulated 3-manifolds
10.4230/LIPIcs.ICALP.2017.39,697,KrPi,Non uniform attacks against pseudoentropy
10.4230/LIPIcs.APPROX-RANDOM.2017.20,710,KrPi,Renyi entropy estimation revisited