Hartmut Noltemeier

Publication Activity (10 Years)

Years Active: 1968-2008
Publications (10 Years): 0

Publications

Clara M. Campos Rodríguez, José A. Moreno-Pérez, Hartmut Noltemeier, Dolores-Rosa Santos-Peñate
Two-Swarm PSO for Competitive Location Problems. NICSO (2008)
Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth
Multiple voting location and single voting location on trees. Eur. J. Oper. Res. 181 (2) (2007)
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
Optimizing cost flows by edge cost and capacity upgrade. J. Discrete Algorithms 2 (4) (2004)
Christian Mark, Armin Kaußner, Martin Grein, Hartmut Noltemeier
Dynamically Changing Road Networks - Modelling and Visualization in Real Time. ICCSA (2) (2004)
Victor Chepoi, Hartmut Noltemeier, Yann Vaxès
Upgrading trees under diameter and budget constraints. Networks 41 (1) (2003)
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
On the flow cost lowering problem. Eur. J. Oper. Res. 137 (2) (2002)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
Upgrading bottleneck constrained forests. Discret. Appl. Math. 108 (1-2) (2001)
Benedikt Bietzker, Oliver Karch, Hartmut Noltemeier
Using Randomized Algorithms for Digital Mock-Up in Automotive Industry. MICAI (2000)
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
Optimizing Cost Flows by Modifying Arc Costs and Capacities. WG (2000)
Hartmut Noltemeier
Invited Lecture: Silver Graphs: Achievements and New Challenges. WG (1999)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Minimum Cost Spanning Trees by Upgrading Nodes. J. Algorithms 33 (1) (1999)
Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
Network Design and Improvement. ACM Comput. Surv. 31 (3es) (1999)
Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Spanning Trees by Upgrading Nodes. Theor. Comput. Sci. 221 (1-2) (1999)
Dirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier
RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters. AMS (1999)
Hartmut Noltemeier, Kokichi Sugihara
Preface. Discret. Appl. Math. 93 (1) (1999)
Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
Modifying Edges of a Network to Obtain Short Subgraphs. Theor. Comput. Sci. 203 (1) (1998)
Oliver Karch, Hartmut Noltemeier, Thomas Wahl
Robot Localization Using Polygon Distances. Sensor Based Intelligent Robots (1998)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
Approximation Algorithms for Certain Network Improvement Problems. J. Comb. Optim. 2 (3) (1998)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
Upgrading Bottleneck Constrained Forests. WG (1998)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
Network improvement problems. Network Design: Connectivity and Facilities Location (1997)
Oliver Karch, Hartmut Noltemeier
Robot localization - theory and practice. IROS (1997)
Oliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl
Relokalisation - Ein theoretischer Ansatz in der Praxis. AMS (1997)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
Improving Spanning Trees by Upgrading Nodes. ICALP (1997)
Georg Schmitt, Hartmut Noltemeier, Manfred Widera
Inkrementelle temporale Constraintpropagierung. Künstliche Intell. 11 (1) (1997)
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
Compact Location Problems. Theor. Comput. Sci. 181 (2) (1997)
Oliver Karch, Hartmut Noltemeier
Zum Lokalisationsproblem für Roboter. AMS (1996)
Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister
Modifying Networks to Obtain Low Cost Trees. WG (1996)
Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
Complexity and Approximability of Certain Bicriteria Location Problems. WG (1995)
Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
Compact Location Problems with Budget and Communication Constraints. COCOON (1995)
Andreas Beck, Paul Holaj, Hartmut Noltemeier, Knut Verbarg
Umweltmodellierung und Bewegungsplanung. Informationstechnik Tech. Inform. 36 (1) (1994)
Knut Verbarg, Hartmut Noltemeier
Dynamic Environmental Modeling by the C-Tree. Modelling and Planning for Sensor Based Intelligent Robot Systems (1994)
Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach
A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees. Geometric Modelling (1992)
Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach
Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects. Data Structures and Efficient Algorithms (1992)
Hartmut Noltemeier, Thomas Roos, Christian Zirkelbach
Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach. GI Jahrestagung (1992)
Oliver Günther, Hartmut Noltemeier
Spatial Database Indices for Large Extended Objects. ICDE (1991)
Thomas Roos, Hartmut Noltemeier
Dynamic Voronoi Diagrams in Motion Planning. Workshop on Computational Geometry (1991)
Hartmut Noltemeier
Layout of Flexible Manufacturing Systems - Selected Problems. Workshop on Computational Geometry (1991)
Hugo Heusinger, Hartmut Noltemeier
On Separable Clusterings. J. Algorithms 10 (2) (1989)
Klaus-Uwe Höffgen, Mark Goerke, Hartmut Noltemeier
PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen. DAGM-Symposium (1989)
Hartmut Noltemeier
Editor's preface. ZOR Methods Model. Oper. Res. 32 (3-4) (1988)
Hugo Heusinger, Hartmut Noltemeier
On Separable and Rectangular Clusterings. Workshop on Computational Geometry (1988)
Frank K. H. A. Dehne, Hartmut Noltemeier
Voronoi trees and clustering problems. Inf. Syst. 12 (2) (1987)
Frank K. H. A. Dehne, Hartmut Noltemeier
Clustering methods for geometric objects and applications to design problems. Vis. Comput. 2 (1) (1986)
Hartmut Noltemeier, Detlev Ruland
Datenmodellierung für Geo-Datenbanken. GI Jahrestagung (1) (1986)
Frank K. H. A. Dehne, Hartmut Noltemeier
A computational geometry approach to clustering problems. SCG (1985)
Hartmut Noltemeier
Buchbesprechungen. Z. Oper. Research 28 (2) (1984)
Franz Ferschl, Hartmut Noltemeier, M. Bastian, Werner Dinkelbach, Paul van Beek, A. Jaeger, K. Braun, G. Sossidis
Book reviews. Z. Oper. Research 25 (3) (1981)
Hartmut Noltemeier
On a Generalization of Heaps. WG (1980)
Hartmut Noltemeier
Graphentheoretische Modelle und Methoden. Formale Modelle für Informationssysteme (1979)
H. Bothe, Ulrich Derigs, Klaus-Peter Kistner, Jochen Schwarze, Hartmut Noltemeier, A. Jaeger, R. Weber, S. Albers, V. Steinecke, W. P. Schmidt
Buchbesprechungen. Z. Oper. Research 23 (6) (1979)
Hartmut Noltemeier
Reduktion von Präzedenzstrukturen. Math. Methods Oper. Res. 20 (5) (1976)
Hartmut Noltemeier
An algorithm for the determination of longest distances in a graph. Math. Program. 9 (1) (1975)
Hartmut Noltemeier
Ein Branch-and-Bound-Verfahren-Generator. Computing 8 (1-2) (1971)
Hartmut Noltemeier
Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen. Unternehmensforschung 12 (1) (1968)