_id,doi,title
15006,10.4230/LIPIcs.OPODIS.2023.11,On the convergence time in graphical games: A locality-sensitive approach
14405,10.4230/LIPIcs.CONCUR.2023.21,Hypernode automata
14086,10.4230/LIPIcs.ICALP.2023.74,Faster submodular maximization for several classes of matroids
9604,10.4230/LIPIcs.SoCG.2021.16,"Counting cells of order-k voronoi tessellations in ℝ<sup>3</sup> with morse theory"
9605,10.4230/LIPIcs.SoCG.2021.27,Computing the multicover bifiltration
7989,10.4230/LIPIcs.SoCG.2020.61,Bounding radon number via Betti numbers
7990,10.4230/LIPIcs.SoCG.2020.67,Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)
7991,10.4230/LIPIcs.SoCG.2020.12,Homotopic curve shortening and the affine curve-shortening flow
7992,10.4230/LIPIcs.SoCG.2020.62,Barycentric cuts through a convex body
7994,10.4230/LIPIcs.SoCG.2020.9,Extending drawings of graphs to arrangements of pseudolines
8533,10.4230/LIPIcs.MFCS.2020.22,Simplified game of life: Algorithms and complexity
8534,10.4230/LIPIcs.MFCS.2020.51,Unary prime languages
8599,10.4230/LIPIcs.CONCUR.2020.2,A survey of bidding games on graphs
8600,10.4230/LIPIcs.CONCUR.2020.23,Multi-dimensional long-run average problems for vector addition systems with states
8703,10.4230/LIPIcs.ESA.2020.75,Generalizing CGAL periodic Delaunay triangulations
7605,10.4230/LIPIcs.OPODIS.2019.15,In search of the fastest concurrent union-find algorithm
285,10.4230/LIPIcs.SoCG.2018.46,On the treewidth of triangulated 3-manifolds
133,10.4230/LIPIcs.CONCUR.2018.21,Synchronizing the asynchronous
1174,10.4230/LIPIcs.STACS.2017.57,Lower bounds on key derivation for square-friendly applications
1175,10.4230/LIPIcs.ITCS.2017.38,Cumulative space in black-white pebbling and resolution