DOI,IST REx ID,Research Group,Title of publication
10.4230/LIPICS.SOCG.2019.39,7401,UlWa,Z_2-Genus of graphs and minimum rank of partial symmetric matrices
10.4230/LIPICS.ITCS.2019.60,6528,KrPi,Simple verifiable delay functions
10.4230/LIPIcs.SoCG.2019.44,6556,UlWa,3-manifold triangulations with small treewidth
10.4230/LIPICS.SOCG.2019.38,6647,UlWa,The crossing Tverberg theorem
10.4230/LIPICS.ICALP.2019.77,6725,VlKo,Testing the complexity of a valued CSP language
10.4230/LIPICS.ICALP.2019.13,11826,,Algorithms and hardness for diameter in dynamic graphs
10.4230/LIPICS.ITCS.2019.59,7407,KrPi,Proofs of catalytic space
10.4230/LIPICS.MFCS.2018.23,6005,ToHe,Timed network games with clocks
10.4230/LIPICS.ESA.2018.39,11827,,A tree structure for dynamic facility location
10.4230/LIPICS.ESA.2018.40,11828,,Dynamic effective resistances and approximate schur complement on separable graphs
10.4230/LIPICS.SEA.2018.3,11911,,Memetic graph clustering
10.4230/LIPIcs.CONCUR.2017.21,950,"ToHe,KrCh",Infinite-duration bidding games
10.4230/LIPICS.ITCS.2017.26,11829,,Conditional hardness for sensitivity problems
10.4230/LIPICS.ESA.2017.44,11831,,Improved guarantees for vertex sparsification in planar graphs
10.4230/LIPICS.ESA.2017.48,11832,,Dynamic clustering to minimize the sum of radii
10.4230/LIPICS.ESA.2017.45,11833,,The power of vertex sparsifiers in dynamic graph algorithms
10.4230/LIPICS.ESA.2016.46,11834,,Incremental exact min-cut in poly-logarithmic amortized update time
10.4230/LIPICS.ESA.2016.48,11835,,Incremental and fully dynamic subgraph connectivity for emergency planning
10.4230/LIPICS.ICALP.2016.131,11836,,Graph minors for preserving terminal distances approximately - lower and upper bounds
10.4230/LIPICS.STACS.2015.90,11837,,Welfare maximization with friends-of-friends network externalities