Hartmut Noltemeier

According to our database, Hartmut Noltemeier authored at least 53 papers between 1968 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2009

Graphentheoretische Konzepte und Algorithmen, 2. Auflage.

Sven Oliver Krumke, Hartmut Noltemeier

Leitfäden der Informatik, Teubner, ISBN: 978-3-8348-0629-1, 2009

2008

Two-Swarm PSO for Competitive Location Problems.

Clara M. Campos Rodríguez, José A. Moreno-Pérez, Hartmut Noltemeier, Dolores-Rosa Santos-Peñate

Proceedings of the Nature Inspired Cooperative Strategies for Optimization, 2008

2007

Multiple voting location and single voting location on trees.

Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth

Eur. J. Oper. Res., 2007

2004

Optimizing cost flows by edge cost and capacity upgrade.

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth

J. Discrete Algorithms, 2004

Dynamically Changing Road Networks - Modelling and Visualization in Real Time.

Christian Mark, Armin Kaußner, Martin Grein, Hartmut Noltemeier

Proceedings of the Computational Science and Its Applications, 2004

2003

Upgrading trees under diameter and budget constraints.

Victor Chepoi, Hartmut Noltemeier, Yann Vaxès

Networks, 2003

2002

On the flow cost lowering problem.

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth

Eur. J. Oper. Res., 2002

2001

Upgrading bottleneck constrained forests.

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth

Discret. Appl. Math., 2001

2000

Optimizing Cost Flows by Modifying Arc Costs and Capacities.

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Using Randomized Algorithms for Digital Mock-Up in Automotive Industry.

Benedikt Bietzker, Oliver Karch, Hartmut Noltemeier

Proceedings of the MICAI 2000: Advances in Artificial Intelligence, 2000

1999

Improving Spanning Trees by Upgrading Nodes.

Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth

Theor. Comput. Sci., 1999

Improving Minimum Cost Spanning Trees by Upgrading Nodes.

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth

J. Algorithms, 1999

Preface.

Hartmut Noltemeier, Kokichi Sugihara

Discret. Appl. Math., 1999

Network Design and Improvement.

Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke

ACM Comput. Surv., 1999

Invited Lecture: Silver Graphs: Achievements and New Challenges.

Hartmut Noltemeier

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters.

Dirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier

Proceedings of the Autonome Mobile Systeme 1999, 1999

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

Approximation Algorithms for Certain Network Improvement Problems.

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi

J. Comb. Optim., 1998

Robot Localization Using Polygon Distances.

Oliver Karch, Hartmut Noltemeier, Thomas Wahl

Proceedings of the Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28, 1998

1997

Compact Location Problems.

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz

Theor. Comput. Sci., 1997

Inkrementelle temporale Constraintpropagierung.

Georg Schmitt, Hartmut Noltemeier, Manfred Widera

Künstliche Intell., 1997

Robot localization - theory and practice.

Oliver Karch, Hartmut Noltemeier

Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97, 1997

Network improvement problems.

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi

Proceedings of the Network Design: Connectivity and Facilities Location, 1997

Relokalisation - Ein theoretischer Ansatz in der Praxis.

Oliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl

Proceedings of the Autonome Mobile Systeme 1997, 1997

1996

Modifying Networks to Obtain Low Cost Trees.

Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Zum Lokalisationsproblem für Roboter.

Oliver Karch, Hartmut Noltemeier

Proceedings of the Autonome Mobile Systeme 1996, 1996

1995

Complexity and Approximability of Certain Bicriteria Location Problems.

Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Compact Location Problems with Budget and Communication Constraints.

Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Umweltmodellierung und Bewegungsplanung.

Andreas Beck, Paul Holaj, Hartmut Noltemeier, Knut Verbarg

Informationstechnik Tech. Inform., 1994

Dynamic Environmental Modeling by the C-Tree.

Knut Verbarg, Hartmut Noltemeier

Proceedings of the Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, 1994

1992

A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees.

Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach

Proceedings of the Geometric Modelling, Dagstuhl, 1992

Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach.

Hartmut Noltemeier, Thomas Roos, Christian Zirkelbach

Proceedings of the Information als Produktionsfaktor, 1992

Monotonous Bisector^* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects.

Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

Spatial Database Indices for Large Extended Objects.

Oliver Günther, Hartmut Noltemeier

Proceedings of the Seventh International Conference on Data Engineering, 1991

Dynamic Voronoi Diagrams in Motion Planning.

Thomas Roos, Hartmut Noltemeier

Proceedings of the Computational Geometry, 1991

Layout of Flexible Manufacturing Systems - Selected Problems.

Hartmut Noltemeier

Proceedings of the Computational Geometry, 1991

1989

On Separable Clusterings.

Hugo Heusinger, Hartmut Noltemeier

J. Algorithms, 1989

PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen.

Klaus-Uwe Höffgen, Mark Goerke, Hartmut Noltemeier

Proceedings of the Mustererkennung 1989, 1989

1988

Editor's preface.

Hartmut Noltemeier

ZOR Methods Model. Oper. Res., 1988

On Separable and Rectangular Clusterings.

Hugo Heusinger, Hartmut Noltemeier

Proceedings of the Computational Geometry and its Applications, 1988

1987

Voronoi trees and clustering problems.

Frank K. H. A. Dehne, Hartmut Noltemeier

Inf. Syst., 1987

1986

Clustering methods for geometric objects and applications to design problems.

Frank K. H. A. Dehne, Hartmut Noltemeier

Vis. Comput., 1986

Datenmodellierung für Geo-Datenbanken.

Hartmut Noltemeier, Detlev Ruland

Proceedings of the GI - 16. Jahrestagung I, Berlin, 6.-10. Oktober 1986, Proceedings, 1986

1985

A computational geometry approach to clustering problems.

Frank K. H. A. Dehne, Hartmut Noltemeier

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Buchbesprechungen.

Hartmut Noltemeier

Z. Oper. Research, 1984

1981

Book reviews.

Franz Ferschl, Hartmut Noltemeier, Michael Bastian, Werner Dinkelbach, Paul van Beek, A. Jaeger, K. Braun, G. Sossidis

Z. Oper. Research, 1981

1980

On a Generalization of Heaps.

Hartmut Noltemeier

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

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

Graphentheoretische Modelle und Methoden.

Hartmut Noltemeier

Proceedings of the Formale Modelle für Informationssysteme, 1979

1976

Reduktion von Präzedenzstrukturen.

Hartmut Noltemeier

Math. Methods Oper. Res., 1976

1975

An algorithm for the determination of longest distances in a graph.

Hartmut Noltemeier

Math. Program., 1975

1971

Ein Branch-and-Bound-Verfahren-Generator.

Hartmut Noltemeier

Computing, 1971

1968

Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen.

Hartmut Noltemeier

Unternehmensforschung, 1968