Hartmut Noltemeier

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: 115-126

Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth: Multiple voting location and single voting location on trees. European Journal of Operational Research 181(2): 654-667 (2007)

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

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

Victor Chepoi, Hartmut Noltemeier, Yann Vaxès: Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003)

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth: On the flow cost lowering problem. European Journal of Operational Research 137(2): 265-271 (2002)

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth: Upgrading bottleneck constrained forests. Discrete Applied Mathematics 108(1-2): 129-142 (2001)

Benedikt Bietzker, Oliver Karch, Hartmut Noltemeier: Using Randomized Algorithms for Digital Mock-Up in Automotive Industry. MICAI 2000: 417-425

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth: Optimizing Cost Flows by Modifying Arc Costs and Capacities. WG 2000: 116-126

Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke: Network Design and Improvement. ACM Comput. Surv. 31(3es): 2 (1999)

Hartmut Noltemeier, Kokichi Sugihara: Preface. Discrete Applied Mathematics 93(1): 1 (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): 92-111 (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): 139-155 (1999)

Dirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier: RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters. AMS 1999: 118-127

Hartmut Noltemeier: Invited Lecture: Silver Graphs: Achievements and New Challenges. WG 1999: 1-9

Henrik I. Christensen, Horst Bunke, Hartmut Noltemeier (Eds.): Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28 - October 2, 1998, Selected Papers. Lecture Notes in Computer Science 1724, Springer 1999, isbn 3-540-66933-7

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): 257-288 (1998)

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): 91-121 (1998)

Oliver Karch, Hartmut Noltemeier, Thomas Wahl: Robot Localization Using Polygon Distances. Sensor Based Intelligent Robots 1998: 200-219

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth: Upgrading Bottleneck Constrained Forests. WG 1998: 215-226

Georg Schmitt, Hartmut Noltemeier, Manfred Widera: Inkrementelle temporale Constraintpropagierung. KI 11(1): 7-13 (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): 379-404 (1997)

Oliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl: Relokalisation - Ein theoretischer Ansatz in der Praxis. AMS 1997: 119-130

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: 281-291

Robert C. Bolles, Horst Bunke, Hartmut Noltemeier (Eds.): Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]. World Scientific 1997, isbn 9810231857

Oliver Karch, Hartmut Noltemeier: Zum Lokalisationsproblem für Roboter. AMS 1996: 128-137

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

Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe: Compact Location Problems with Budget and Communication Constraints. COCOON 1995: 510-519

Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe: Complexity and Approximability of Certain Bicriteria Location Problems. WG 1995: 73-87

Horst Bunke, Takeo Kanade, Hartmut Noltemeier (Eds.): Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, October 24-28, 1994]. World Scientific 1995

Hans Hagen, Gerald E. Farin, Hartmut Noltemeier, Rudolf F. Albrecht (Eds.): Geometric Modelling, Dagstuhl, Germany, 1993. Computing Supplement 10, Springer 1995, isbn 3-211-82666-1

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

Gerald E. Farin, Hans Hagen, Hartmut Noltemeier, Walter Knödel (Eds.): Geometric Modelling, Dagstuhl, Germany, 1992. Computing Supplement 8, Springer 1993, isbn 3-211-82399-9

Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach: Monotonous Bisector^* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects. Data Structures and Efficient Algorithms 1992: 186-203

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

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

Hartmut Noltemeier: Layout of Flexible Manufacturing Systems - Selected Problems. Workshop on Computational Geometry 1991: 217-225

Thomas Roos, Hartmut Noltemeier: Dynamic Voronoi Diagrams in Motion Planning. Workshop on Computational Geometry 1991: 227-236

Oliver Günther, Hartmut Noltemeier: Spatial Database Indices for Large Extended Objects. ICDE 1991: 520-526

Hanspeter Bieri, Hartmut Noltemeier (Eds.): Computational Geometry - Methods, Algorithms and Applications, International Workshop on Computational Geometry CG'91, Bern, Switzerland, March 21-22, 1991. Lecture Notes in Computer Science 553, Springer 1991, isbn 3-540-54891-2

Hugo Heusinger, Hartmut Noltemeier: On Separable Clusterings. J. Algorithms 10(2): 212-227 (1989)

Klaus-Uwe Höffgen, M. Goerke, Hartmut Noltemeier: PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen. DAGM-Symposium 1989: 391-395

Hugo Heusinger, Hartmut Noltemeier: On Separable and Rectangular Clusterings. Workshop on Computational Geometry 1988: 25-42

Hartmut Noltemeier (Ed.): Computational Geometry and its Applications, CG'88, International Workshop on Computational Geometry, Würzburg, Germany, March 24-25, 1988. Lecture Notes in Computer Science 333, Springer 1988, isbn 3-540-50335-8

Frank K. H. A. Dehne, Hartmut Noltemeier: Voronoi trees and clustering problems. Inf. Syst. 12(2): 171-175 (1987)

Frank K. H. A. Dehne, Hartmut Noltemeier: Clustering methods for geometric objects and applications to design problems. The Visual Computer 2(1): 31-38 (1986)

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

Hartmut Noltemeier (Ed.): Graphtheoretic Concepts in Computer Science, Proceedings WG '85, Castle Schwanberg (near Würzburg), Germany. Trauner, Linz 1986, isbn 3-853-20357-4

Frank K. H. A. Dehne, Hartmut Noltemeier: A computational geometry approach to clustering problems. Symposium on Computational Geometry 1985: 245-250

Hartmut Noltemeier (Ed.): Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980. Lecture Notes in Computer Science 100, Springer 1981, isbn 3-540-10291-4

Hartmut Noltemeier: On a Generalization of Heaps. WG 1980: 127-136

Hartmut Noltemeier: Graphentheoretische Modelle und Methoden. Formale Modelle für Informationssysteme 1979: 170-180