Hartmut Noltemeier

65 papers A* 7A 1B 7Misc 1Journal 25Unranked 16
YearRankTypeTitle / Venue / Authors
2009 — book
Graphentheoretische Konzepte und Algorithmen, 2. Auflage.
Sven Oliver Krumke, Hartmut Noltemeier
2008 — conf
Two-Swarm PSO for Competitive Location Problems.
NICSO
Clara M. Campos Rodríguez, José A. Moreno-Pérez, Hartmut Noltemeier, Dolores-Rosa Santos-Peñate
2007 J jnl
Multiple voting location and single voting location on trees.
Eur. J. Oper. Res.
Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth
2004 — conf
Dynamically Changing Road Networks - Modelling and Visualization in Real Time.
ICCSA (2)
Christian Mark, Armin Kaußner, Martin Grein, Hartmut Noltemeier
2004 J jnl
Optimizing cost flows by edge cost and capacity upgrade.
J. Discrete Algorithms
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
2003 J jnl
Upgrading trees under diameter and budget constraints.
Networks
Victor Chepoi, Hartmut Noltemeier, Yann Vaxès
2002 J jnl
On the flow cost lowering problem.
Eur. J. Oper. Res.
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
2001 J jnl
Upgrading bottleneck constrained forests.
Discret. Appl. Math.
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
2000 B conf
Optimizing Cost Flows by Modifying Arc Costs and Capacities.
WG
Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
2000 — conf
Using Randomized Algorithms for Digital Mock-Up in Automotive Industry.
MICAI
Benedikt Bietzker, Oliver Karch, Hartmut Noltemeier
1999 J jnl
Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1999 J jnl
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci.
Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1999 B conf
Invited Lecture: Silver Graphs: Achievements and New Challenges.
WG
Hartmut Noltemeier
1999 J jnl
Network Design and Improvement.
ACM Comput. Surv.
Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
1999 J jnl
Preface.
Discret. Appl. Math.
Hartmut Noltemeier, Kokichi Sugihara
1999 — conf
RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters.
AMS
Dirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier
1999 — ed.
Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28 - October 2, 1998, Selected Papers
Sensor Based Intelligent Robots
Henrik I. Christensen, Horst Bunke, Hartmut Noltemeier
1998 J jnl
Approximation Algorithms for Certain Network Improvement Problems.
J. Comb. Optim.
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
1998 J jnl
Modifying Edges of a Network to Obtain Short Subgraphs.
Theor. Comput. Sci.
Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
1998 — conf
Robot Localization Using Polygon Distances.
Sensor Based Intelligent Robots
Oliver Karch, Hartmut Noltemeier, Thomas Wahl
1998 B conf
Upgrading Bottleneck Constrained Forests.
WG
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
1997 J jnl
Compact Location Problems.
Theor. Comput. Sci.
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
1997 A* conf
Improving Spanning Trees by Upgrading Nodes.
ICALP
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1997 J jnl
Inkrementelle temporale Constraintpropagierung.
Künstliche Intell.
Georg Schmitt, Hartmut Noltemeier, Manfred Widera
1997 — ed.
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]
Intelligent Robots
Robert C. Bolles, Horst Bunke, Hartmut Noltemeier
1997 — conf
Network improvement problems.
Network Design: Connectivity and Facilities Location
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
1997 — conf
Relokalisation - Ein theoretischer Ansatz in der Praxis.
AMS
Oliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl
1997 A conf
Robot localization - theory and practice.
IROS
Oliver Karch, Hartmut Noltemeier
1996 B conf
Modifying Networks to Obtain Low Cost Trees.
WG
Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister
1996 — conf
Zum Lokalisationsproblem für Roboter.
AMS
Oliver Karch, Hartmut Noltemeier
1995 Misc conf
Compact Location Problems with Budget and Communication Constraints.
COCOON
Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
1995 B conf
Complexity and Approximability of Certain Bicriteria Location Problems.
WG
Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
1995 — ed.
Geometric Modelling, Dagstuhl, Germany, 1993
Geometric Modelling
Hans Hagen, Gerald E. Farin, Hartmut Noltemeier, Rudolf F. Albrecht
1995 — ed.
Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, October 24-28, 1994]
Modelling and Planning for Sensor Based Intelligent Robot Systems
Horst Bunke, Takeo Kanade, Hartmut Noltemeier
1994 — conf
Dynamic Environmental Modeling by the C-Tree.
Modelling and Planning for Sensor Based Intelligent Robot Systems
Knut Verbarg, Hartmut Noltemeier
1994 J jnl
Umweltmodellierung und Bewegungsplanung.
Informationstechnik Tech. Inform.
Andreas Beck, Paul Holaj, Hartmut Noltemeier, Knut Verbarg
1993 — ed.
Geometric Modelling, Dagstuhl, Germany, 1992
Geometric Modelling
Gerald E. Farin, Hans Hagen, Hartmut Noltemeier, Walter Knödel
1992 — conf
A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees.
Geometric Modelling
Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach
1992 — conf
Monotonous Bisector
Data Structures and Efficient Algorithms
Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach
1992 — conf
Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach.
GI Jahrestagung
Hartmut Noltemeier, Thomas Roos, Christian Zirkelbach
1991 A* ed.
Computational Geometry - Methods, Algorithms and Applications, International Workshop on Computational Geometry CG'91, Bern, Switzerland, March 21-22, 1991
Workshop on Computational Geometry
Hanspeter Bieri, Hartmut Noltemeier
1991 A* conf
Dynamic Voronoi Diagrams in Motion Planning.
Workshop on Computational Geometry
Thomas Roos, Hartmut Noltemeier
1991 A* conf
Layout of Flexible Manufacturing Systems - Selected Problems.
Workshop on Computational Geometry
Hartmut Noltemeier
1991 A* conf
Spatial Database Indices for Large Extended Objects.
ICDE
Oliver Günther, Hartmut Noltemeier
1989 J jnl
On Separable Clusterings.
J. Algorithms
Hugo Heusinger, Hartmut Noltemeier
1989 — conf
PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen.
DAGM-Symposium
Klaus-Uwe Höffgen, Mark Goerke, Hartmut Noltemeier
1988 A* ed.
Computational Geometry and its Applications, CG'88, International Workshop on Computational Geometry, Würzburg, Germany, March 24-25, 1988
Workshop on Computational Geometry
Hartmut Noltemeier
1988 J jnl
Editor's preface.
ZOR Methods Model. Oper. Res.
Hartmut Noltemeier
1988 A* conf
On Separable and Rectangular Clusterings.
Workshop on Computational Geometry
Hugo Heusinger, Hartmut Noltemeier
1987 J jnl
Voronoi trees and clustering problems.
Inf. Syst.
Frank K. H. A. Dehne, Hartmut Noltemeier
1986 J jnl
Clustering methods for geometric objects and applications to design problems.
Vis. Comput.
Frank K. H. A. Dehne, Hartmut Noltemeier
1986 — conf
Datenmodellierung für Geo-Datenbanken.
GI Jahrestagung (1)
Hartmut Noltemeier, Detlev Ruland
1986 — ed.
Graphtheoretic Concepts in Computer Science, Proceedings WG '85, Castle Schwanberg (near Würzburg), Germany
WG
Hartmut Noltemeier
1985 — conf
A computational geometry approach to clustering problems.
SCG
Frank K. H. A. Dehne, Hartmut Noltemeier
1984 J jnl
Buchbesprechungen.
Z. Oper. Research
Hartmut Noltemeier
1981 J jnl
Book reviews.
Z. Oper. Research
Franz Ferschl, Hartmut Noltemeier, Michael Bastian, Werner Dinkelbach, Paul van Beek, A. Jaeger, K. Braun, G. Sossidis
1981 B ed.
Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980
WG
Hartmut Noltemeier
1980 B conf
On a Generalization of Heaps.
WG
Hartmut Noltemeier
1979 J jnl
Buchbesprechungen.
Z. Oper. Research
H. Bothe, Ulrich Derigs, Klaus-Peter Kistner, Jochen Schwarze, Hartmut Noltemeier, A. Jaeger, R. Weber, S. Albers, V. Steinecke, W. P. Schmidt
1979 — conf
Graphentheoretische Modelle und Methoden.
Formale Modelle für Informationssysteme
Hartmut Noltemeier
1977 — ed.
Graphen, Algorithmen, Datenstrukturen, Proceedings WG '76, Graphtheoretic Concepts in Computer Science, Göttingen, Germany.
WG
Hartmut Noltemeier
1976 J jnl
Reduktion von Präzedenzstrukturen.
Math. Methods Oper. Res.
Hartmut Noltemeier
1975 J jnl
An algorithm for the determination of longest distances in a graph.
Math. Program.
Hartmut Noltemeier
1971 J jnl
Ein Branch-and-Bound-Verfahren-Generator.
Computing
Hartmut Noltemeier
1968 J jnl
Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen.
Unternehmensforschung
Hartmut Noltemeier