Henzinger, M. H., &; Telle, J. A. (1996). Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In 5th Scandinavian Workshop on Algorithm Theory (Vol. 1097, pp. 16–27). Reykjavik, Iceland: Springer Nature.https://doi.org/10.1007/3-540-61422-2_117 

Henzinger, M. H., &; Thorup, M. (1996). Improved sampling with applications to dynamic graph algorithms. In 23rd International Colloquium on Automata, Languages, and Programming (Vol. 1099, pp. 290–299). Paderborn, Germany: Springer Nature.https://doi.org/10.1007/3-540-61440-0_136 

Alur, R., Henzinger, T. A., &; Sontag, E. D. (Eds.). (1996). Hybrid Systems III: Verification and Control (Vol. 1066). Berlinf; Heidelberg: Springer.https://doi.org/10.1007/BFb0020931 

Henzinger, M. H. (1995). Approximating minimum cuts under insertions. In 22nd International Colloquium on Automata, Languages and Programming (Vol. 944, pp. 280–291). Szeged, Hungary: Springer Nature.https://doi.org/10.1007/3-540-60084-1_81 

Henzinger, M. H., &; Poutré, H. (1995). Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In 3rd Annual European Symposium on Algorithms (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature.https://doi.org/10.1007/3-540-60313-1_142