On the number of small cuts in a graph
M.H. Henzinger, D.P. Williamson, Information Processing Letters 59 (1996) 41–44.
LibreCat: https://research-explorer.ista.ac.at/record/11761
DOI: 10.1016/0020-0190(96)00079-8

Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory, Springer Nature, 1996, pp. 16–27.
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 10.1007/3-540-61422-2_117

Improved sampling with applications to dynamic graph algorithms
M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata, Languages, and Programming, Springer Nature, 1996, pp. 290–299.
LibreCat: https://research-explorer.ista.ac.at/record/11910
DOI: 10.1007/3-540-61440-0_136

Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
M.H. Henzinger, V. King, T. Warnow, in:, 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 1996, pp. 333–340.
LibreCat: https://research-explorer.ista.ac.at/record/11927

Presence of a large protein complex containing the ndhK gene product and possessing NADH-specific dehydrogenase activity in thylakoid membranes of higher plant chloroplasts
L.A. Sazanov, P. Burrows, P.J. Nixon, in:, Kluwer, 1996, pp. 705–708.
LibreCat: https://research-explorer.ista.ac.at/record/1942