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

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

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

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

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

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

Chaudhuri, S.; Zaroliagis, C.: Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms. Theoretical Computer Science 203 (2), S. 205 - 223 (1998)

Chong, K. W.; Lam, T. W.: Approximating Biconnectivity in Parallel. Algorithmica 21, S. 395 - 410 (1998)

Crochemore, M.; Gasieniec, L.; Hariharan, R.; Muthukrishnan, S.; Rytter, W.: A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. SIAM Journal on Computing 27 (3), S. 668 - 681 (1998)

Crowley, J. L.; Wallner, F.; Schiele, B.: Global Mobile Robot Localization Using Principal Components of Laser Range Data. Robotics and Autonomous Systems 23 (4), S. 267 - 276 (1998)

de Berg, M.; van Kreveld, M.; Schirra, S.: Topologically correct subdivision simplification using the bandwidth criterion. Cartography and Geographic Information Systems 25 (4), S. 243 - 257 (1998)

Diks, K.; Hagerup, T.: More general parallel tree contraction: Register allocation and broadcasting in a tree. Theoretical Computer Science 203 (1), S. 3 - 29 (1998)

Dubhashi, D.; Ranjan, D.: Balls and Bins: A Study in Negative Dependence. Random Structures & Algorithms 13 (5), S. 99 - 124 (1998)

Feldmann, A.; Gilbert, A. C.; Willinger, W.; Kurtz, T. G.: The Changing Nature of Network Traffic: Scaling Phenomena. Computer Communication Review 28 (2), S. 5 - 29 (1998)

Feldmann, A.; Kao, M.-Y.; Sgall, J.; Teng, S.-H.: Optimal On-Line Scheduling of Parallel Jobs with Dependencies. Journal of Combinatorial Optimization 1 (4), S. 393 - 411 (1998)

Feldmann, A.; Rexford, J.; Cáceres, R.: Efficient Policies for Carrying Web Traffic over Flow-switched Networks. IEEE/ACM Transactions on Networking 6 (6), S. 673 - 685 (1998)

Feldmann, A.; Whitt, W.: Fitting Mixtures of Exponentials to Long-Tail Distributions to Analyze Network. Performance Evaluation 31 (3-4), S. 245 - 279 (1998)

Ferragina, P.; Gross, R.: Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM Journal on Computing 27 (3), S. 713 - 736 (1998)

Frank, I.; Basin, D. A.: Search in Games with Incomplete Information: A Case Study Using Bridge Card Play. Artificial Intelligence 100 (1/2), S. 87 - 123 (1998)

Frederickson, G. N.; Solis-Oba, R.: Algorithms for Measuring Perturbability in Matroid Optimization. Combinatorica 18 (4), S. 503 - 518 (1998)