Bachmair, L.; Ganzinger, H.: Ordered Chaining Calculi for First-Order Theories of Transitive Relations. Journal of the ACM 45 (6), pp. 1007 - 1049 (1998)

Barnes, G.; Edmonds, J. A.: Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM Journal on Computing 27 (4), pp. 1190 - 1202 (1998)

Barth, P.; Bockmayr, A.: Modelling Discrete Optimisation Problems in Constraint Logic Programming. Annals of Operations Research 81, pp. 467 - 496 (1998)

Basin, D. A.; Klarlund, N.: Automata Based Symbolic Reasoning in Hardware Verification. Formal Methods in Systems Design 13 (3), pp. 255 - 288 (1998)

Basin, D. A.; Matthews, S.; Viganò, L.: Labelled Modal Logics: quantifiers. Journal of Logic, Language and Information 7 (3), pp. 237 - 263 (1998)

Basin, D. A.; Matthews, S.; Viganò, L.: Natural Deduction for Non-Classical Logics. Studia Logica 60 (1), pp. 119 - 160 (1998)

Blackburn, P.; Tzakova, M.: Hybrid Completeness. Logic Journal of the IGPL 6 (4), pp. 625 - 650 (1998)

Blackburn, P.; Tzakova, M.: Hybridizing Concept Languages. Annals of Mathematics and Artificial Intelligence 24 (1/4), pp. 23 - 49 (1998)

Bockmayr, A.; Kasper, T.: Branch-and-Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming. INFORMS Journal on Computing 10 (3), pp. 287 - 300 (1998)

Bodlaender, H. L.; Deogun, J. S.; Jansen, K.; Kloks, T.; Kratsch, D.; Müller, H.; Tuza, Z.: Ranking of Graphs. SIAM Journal on Discrete Mathematics 11 (1), pp. 168 - 181 (1998)

Bodlaender, H. L.; Hagerup, T.: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM Journal on Computing 27 (6), pp. 1725 - 1746 (1998)

Bradford, P. G.; Rawlins, G. J.E.; Shannon, G. E.: Efficient Matrix Chain Ordering in Polylog Time. SIAM Journal on Computing 27 (2), pp. 466 - 490 (1998)

Brodal, G. S.; Träff, J. L.; Zaroliagis, C.: A Parallel Priority Queue with Constant Time Operations. Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures 49 (1), pp. 4 - 21 (1998)

Cáceres, R.; Douglis, F.; Feldmann, A.; Glass, G.; Rabinovich, M.: Web Proxy Caching: The Devil is in the Details. ACM SIGMETRICS Performance Evaluation Review 26 (3), pp. 11 - 15 (1998)

Calinescu, G.; Fernandes, C. G.; Finkler, U.; Karloff, H.: A Better Approximation Algorithm for Finding Planar Subgraphs. Journal of Algorithms 27 (2), pp. 269 - 302 (1998)

Campagna, S.; Kobbelt, L.; Seidel, H.-P.: Directed Edges - A Scalable Reprensentation for Triangle Meshes. Journal of Graphics Tools 3 (4), pp. 1 - 11 (1998)

Campagna, S.; Kobbelt, L.; Seidel, H.-P.: Enhancing Digital Documents by Including 3D-models. Computers and Graphics 22 (6), pp. 655 - 666 (1998)

Charatonik, W.: An Undecidable Fragment of the Theory of Set Constraints. Information Processing Letters 68, pp. 147 - 151 (1998)

Charatonik, W.: Set Constraints in Some Equational Theories. Information and Computation 142, pp. 40 - 75 (1998)

Chaudhuri, S.; Garg, N.; Ravi, R.: The $p$-neighbor $k$-center problem. Information Processing Letters 65, pp. 131 - 134 (1998)