Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen. - Hartmut Noltemeier (Unternehmensforschung, 1968)

Ein Branch-and-Bound-Verfahren-Generator. - Hartmut Noltemeier (Computing, 1971)

An algorithm for the determination of longest distances in a graph. - Hartmut Noltemeier (Math. Program., 1975)

Reduktion von Präzedenzstrukturen. - Hartmut Noltemeier (Math. Methods Oper. Res., 1976)

Graphentheoretische Modelle und Methoden. - Hartmut Noltemeier (Formale Modelle für Informationssysteme, 1979)

Buchbesprechungen. - H. Bothe; Ulrich Derigs; Klaus-Peter Kistner; Jochen Schwarze; Hartmut Noltemeier; A. Jaeger; R. Weber; S. Albers; V. Steinecke; W. P. Schmidt (Z. Oper. Research, 1979)

On a Generalization of Heaps. - Hartmut Noltemeier (WG, 1980)

Book reviews. - Franz Ferschl; Hartmut Noltemeier; Michael Bastian; Werner Dinkelbach; Paul van Beek; A. Jaeger; K. Braun; G. Sossidis (Z. Oper. Research, 1981)

Buchbesprechungen. - Hartmut Noltemeier (Z. Oper. Research, 1984)

A computational geometry approach to clustering problems. - Frank K. H. A. Dehne; Hartmut Noltemeier (SCG, 1985)

Datenmodellierung für Geo-Datenbanken. - Hartmut Noltemeier; Detlev Ruland (GI Jahrestagung (1), 1986)

Clustering methods for geometric objects and applications to design problems. - Frank K. H. A. Dehne; Hartmut Noltemeier (Vis. Comput., 1986)

Voronoi trees and clustering problems. - Frank K. H. A. Dehne; Hartmut Noltemeier (Inf. Syst., 1987)

On Separable and Rectangular Clusterings. - Hugo Heusinger; Hartmut Noltemeier (Workshop on Computational Geometry, 1988)

Editor's preface. - Hartmut Noltemeier (ZOR Methods Model. Oper. Res., 1988)

PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen. - Klaus-Uwe Höffgen; Mark Goerke; Hartmut Noltemeier (DAGM-Symposium, 1989)

On Separable Clusterings. - Hugo Heusinger; Hartmut Noltemeier (J. Algorithms, 1989)

Layout of Flexible Manufacturing Systems - Selected Problems. - Hartmut Noltemeier (Workshop on Computational Geometry, 1991)

Dynamic Voronoi Diagrams in Motion Planning. - Thomas Roos; Hartmut Noltemeier (Workshop on Computational Geometry, 1991)

Spatial Database Indices for Large Extended Objects. - Oliver Günther 001; Hartmut Noltemeier (ICDE, 1991)

Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects. - Hartmut Noltemeier; Knut Verbarg; Christian Zirkelbach 001 (Data Structures and Efficient Algorithms, 1992)

Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach. - Hartmut Noltemeier; Thomas Roos; Christian Zirkelbach 001 (GI Jahrestagung, 1992)

A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees. - Hartmut Noltemeier; Knut Verbarg; Christian Zirkelbach 001 (Geometric Modelling, 1992)

Dynamic Environmental Modeling by the C-Tree. - Knut Verbarg; Hartmut Noltemeier (Modelling and Planning for Sensor Based Intelligent Robot Systems, 1994)

Umweltmodellierung und Bewegungsplanung. - Andreas Beck; Paul Holaj; Hartmut Noltemeier; Knut Verbarg (Informationstechnik Tech. Inform., 1994)

Compact Location Problems with Budget and Communication Constraints. - Sven Oliver Krumke; Hartmut Noltemeier; S. S. Ravi; Madhav V. Marathe (COCOON, 1995)

Complexity and Approximability of Certain Bicriteria Location Problems. - Sven Oliver Krumke; Hartmut Noltemeier; S. S. Ravi; Madhav V. Marathe (WG, 1995)

Zum Lokalisationsproblem für Roboter. - Oliver Karch; Hartmut Noltemeier (AMS, 1996)

Modifying Networks to Obtain Low Cost Trees. - Sven Oliver Krumke; Hartmut Noltemeier; Madhav V. Marathe; S. S. Ravi; Kay U. Drangmeister (WG, 1996)

Relokalisation - Ein theoretischer Ansatz in der Praxis. - Oliver Karch; Hartmut Noltemeier; Mathias Schwark; Thomas Wahl (AMS, 1997)

Network improvement problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; R. Ravi 001; S. S. Ravi (Network Design: Connectivity and Facilities Location, 1997)

Robot localization - theory and practice. - Oliver Karch; Hartmut Noltemeier (IROS, 1997)

Inkrementelle temporale Constraintpropagierung. - Georg Schmitt; Hartmut Noltemeier; Manfred Widera (Künstliche Intell., 1997)

Compact Location Problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; Venkatesh Radhakrishnan; S. S. Ravi; Daniel J. Rosenkrantz (Theor. Comput. Sci., 1997)

Robot Localization Using Polygon Distances. - Oliver Karch; Hartmut Noltemeier; Thomas Wahl (Sensor Based Intelligent Robots, 1998)

Approximation Algorithms for Certain Network Improvement Problems. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; R. Ravi 001; S. S. Ravi (J. Comb. Optim., 1998)

Modifying Edges of a Network to Obtain Short Subgraphs. - Kay U. Drangmeister; Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; S. S. Ravi (Theor. Comput. Sci., 1998)

RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters. - Dirk Schäfer 003; Martin Buck; Boris Kluge; Hartmut Noltemeier (AMS, 1999)

Invited Lecture: Silver Graphs: Achievements and New Challenges. - Hartmut Noltemeier (WG, 1999)

Network Design and Improvement. - Hartmut Noltemeier; Hans-Christoph Wirth; Sven Oliver Krumke (ACM Comput. Surv., 1999)

Preface. - Hartmut Noltemeier; Kokichi Sugihara (Discret. Appl. Math., 1999)

Improving Minimum Cost Spanning Trees by Upgrading Nodes. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; R. Ravi 001; S. S. Ravi; Ravi Sundaram; Hans-Christoph Wirth (J. Algorithms, 1999)

Improving Spanning Trees by Upgrading Nodes. - Sven Oliver Krumke; Hartmut Noltemeier; Madhav V. Marathe; R. Ravi 001; S. S. Ravi; Ravi Sundaram; Hans-Christoph Wirth (Theor. Comput. Sci., 1999)

Using Randomized Algorithms for Digital Mock-Up in Automotive Industry. - Benedikt Bietzker; Oliver Karch; Hartmut Noltemeier (MICAI, 2000)

Optimizing Cost Flows by Modifying Arc Costs and Capacities. - Ingo Demgensky; Hartmut Noltemeier; Hans-Christoph Wirth (WG, 2000)

Upgrading bottleneck constrained forests. - Sven Oliver Krumke; Madhav V. Marathe; Hartmut Noltemeier; S. S. Ravi; Hans-Christoph Wirth (Discret. Appl. Math., 2001)

On the flow cost lowering problem. - Ingo Demgensky; Hartmut Noltemeier; Hans-Christoph Wirth (Eur. J. Oper. Res., 2002)

Upgrading trees under diameter and budget constraints. - Victor Chepoi; Hartmut Noltemeier; Yann Vaxès (Networks, 2003)

Dynamically Changing Road Networks - Modelling and Visualization in Real Time. - Christian Mark; Armin Kaußner; Martin Grein; Hartmut Noltemeier (ICCSA (2), 2004)

Optimizing cost flows by edge cost and capacity upgrade. - Ingo Demgensky; Hartmut Noltemeier; Hans-Christoph Wirth (J. Discrete Algorithms, 2004)

Multiple voting location and single voting location on trees. - Hartmut Noltemeier; Joachim Spoerhase; Hans-Christoph Wirth (Eur. J. Oper. Res., 2007)

Two-Swarm PSO for Competitive Location Problems. - Clara M. Campos Rodríguez; José A. Moreno-Pérez; Hartmut Noltemeier; Dolores-Rosa Santos-Peñate (NICSO, 2008)

Graphentheoretische Konzepte und Algorithmen, 2. Auflage. - Sven Oliver Krumke; Hartmut Noltemeier (Teubner, 2009)