DOI,IST REx ID,Title of publication
10.1007/3-540-61422-2_117,11804,Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
10.1007/3-540-61440-0_136,11910,Improved sampling with applications to dynamic graph algorithms
10.1007/3-540-60313-1_142,11805,Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
10.1007/3-540-60084-1_81,11806,Approximating minimum cuts under insertions