Geometry for modeling biomolecules
H. Edelsbrunner, in:, Robotics: The Algorithmic Perspective, AK Peters, 1998, pp. 265–277.

Hybrids and hybrid zones: Reply from M.G. Ritchie and N.H. Barton
M. Ritchie, N.H. Barton, Trends in Ecology and Evolution 13 (1998) 282–283.

Why sex and recombination?
N.H. Barton, B. Charlesworth, Science 281 (1998) 1986–1990.

Genetics and analysis of quantitative traits
N.H. Barton, Genetical Research 72 (1998) 73–73.

The geometry of adaptation
N.H. Barton, Nature 395 (1998) 751–752.

Axioms for real-time logics
J. Raskin, P. Schobbens, T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 219–236.

An algorithm for the approximative analysis of rectangular automata
J. Preußig, S. Kowalewski, H. Wong Toi, T.A. Henzinger, in:, Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Springer, 1998, pp. 228–240.

Reachability verification for hybrid automata
T.A. Henzinger, V. Rusu, in:, Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control, Springer, 1998, pp. 190–204.

HSCC: Hybrid Systems—Computation and Control
T.A. Henzinger, ed., HSCC: Hybrid Systems—Computation and Control, Springer, 1998.

An assume-guarantee rule for checking simulation
T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Springer, 1998, pp. 421–432.

You assume, we guarantee: Methodology and case studies
T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 440–451.

From pre-historic to post-modern symbolic model checking
T.A. Henzinger, O. Kupferman, S. Qadeer, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 195–206.

The regular real-time languages
T.A. Henzinger, J. Raskin, P. Schobbens, in:, Proceedings of the 25th International Colloqium on Automata, Languages and Programming, Springer, 1998, pp. 580–591.

Algorithmic analysis of nonlinear hybrid systems
T.A. Henzinger, P. Ho, H. Wong Toi, IEEE Transactions on Automatic Control 43 (1998) 540–554.

What's decidable about hybrid automata?
T.A. Henzinger, P. Kopke, A. Puri, P. Varaiya, Journal of Computer and System Sciences 57 (1998) 94–124.

It's about time: Real-time logics reviewed
T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–454.

Alternating refinement relations
R. Alur, T.A. Henzinger, O. Kupferman, M. Vardi, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–178.

Mocha: Modularity in model checking
R. Alur, T.A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 521–525.

Symbolic exploration of transition hierarchies
R. Alur, T.A. Henzinger, S. Rajamani, in:, Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 1998, pp. 330–344.

Concurrent reachability games
L. De Alfaro, T.A. Henzinger, O. Kupferman, in:,  Proceedings 39th Annual Symposium on Foundations of Computer Science, IEEE, 1998, pp. 564–575.