2007 | ||
---|---|---|
48 | EE | 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) |
2004 | ||
47 | EE | Christian Mark, Armin Kaußner, Martin Grein, Hartmut Noltemeier: Dynamically Changing Road Networks - Modelling and Visualization in Real Time. ICCSA (2) 2004: 843-853 |
46 | EE | Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth: Optimizing cost flows by edge cost and capacity upgrade. J. Discrete Algorithms 2(4): 407-423 (2004) |
2003 | ||
45 | EE | Victor Chepoi, Hartmut Noltemeier, Yann Vaxès: Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003) |
2001 | ||
44 | 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) | |
2000 | ||
43 | Benedikt Bietzker, Oliver Karch, Hartmut Noltemeier: Using Randomized Algorithms for Digital Mock-Up in Automotive Industry. MICAI 2000: 417-425 | |
42 | EE | Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth: Optimizing Cost Flows by Modifying Arc Costs and Capacities. WG 2000: 116-126 |
1999 | ||
41 | Henrik I. Christensen, Horst Bunke, Hartmut Noltemeier: Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, September 28 - October 2, 1998, Selected Papers Springer 1999 | |
40 | Dirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier: RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters. AMS 1999: 118-127 | |
39 | EE | Hartmut Noltemeier: Invited Lecture: Silver Graphs: Achievements and New Challenges. WG 1999: 1-9 |
38 | EE | Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke: Network Design and Improvement. ACM Comput. Surv. 31(3es): 2 (1999) |
37 | EE | Hartmut Noltemeier, Kokichi Sugihara: Preface. Discrete Applied Mathematics 93(1): 1 (1999) |
36 | 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) | |
35 | EE | 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) |
1998 | ||
34 | Oliver Karch, Hartmut Noltemeier, Thomas Wahl: Robot Localization Using Polygon Distances. Sensor Based Intelligent Robots 1998: 200-219 | |
33 | Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth: Upgrading Bottleneck Constrained Forests. WG 1998: 215-226 | |
32 | 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) | |
31 | EE | 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) |
1997 | ||
30 | Robert C. Bolles, Horst Bunke, Hartmut Noltemeier: Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996] World Scientific 1997 | |
29 | Oliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl: Relokalisation - Ein theoretischer Ansatz in der Praxis. AMS 1997: 119-130 | |
28 | 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 | |
27 | Georg Schmitt, Hartmut Noltemeier, Manfred Widera: Inkrementelle temporale Constraintpropagierung. KI 11(1): 7-13 (1997) | |
26 | EE | 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) |
1996 | ||
25 | Oliver Karch, Hartmut Noltemeier: Zum Lokalisationsproblem für Roboter. AMS 1996: 128-137 | |
24 | 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 | |
1995 | ||
23 | Hans Hagen, Gerald E. Farin, Hartmut Noltemeier, Rudolf F. Albrecht: Geometric Modelling, Dagstuhl, Germany, 1993 Springer 1995 | |
22 | Horst Bunke, Takeo Kanade, Hartmut Noltemeier: Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, October 24-28, 1994] World Scientific 1995 | |
21 | Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe: Compact Location Problems with Budget and Communication Constraints. COCOON 1995: 510-519 | |
20 | Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe: Complexity and Approximability of Certain Bicriteria Location Problems. WG 1995: 73-87 | |
1994 | ||
19 | Knut Verbarg, Hartmut Noltemeier: Dynamic Environmental Modeling by the C-Tree. Modelling and Planning for Sensor Based Intelligent Robot Systems 1994: 3-22 | |
1993 | ||
18 | Gerald E. Farin, Hans Hagen, Hartmut Noltemeier, Walter Knödel: Geometric Modelling, Dagstuhl, Germany, 1992 Springer 1993 | |
1992 | ||
17 | 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 | |
16 | Hartmut Noltemeier, Thomas Roos, Christian Zirkelbach: Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach. GI Jahrestagung 1992: 319-325 | |
15 | 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 | |
1991 | ||
14 | Hanspeter Bieri, Hartmut Noltemeier: Computational Geometry - Methods, Algorithms and Applications, International Workshop on Computational Geometry CG'91, Bern, Switzerland, March 21-22, 1991 Springer 1991 | |
13 | EE | Oliver Günther, Hartmut Noltemeier: Spatial Database Indices for Large Extended Objects. ICDE 1991: 520-526 |
12 | Hartmut Noltemeier: Layout of Flexible Manufacturing Systems - Selected Problems. Workshop on Computational Geometry 1991: 217-225 | |
11 | Thomas Roos, Hartmut Noltemeier: Dynamic Voronoi Diagrams in Motion Planning. Workshop on Computational Geometry 1991: 227-236 | |
1989 | ||
10 | Klaus-Uwe Höffgen, M. Goerke, Hartmut Noltemeier: PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen. DAGM-Symposium 1989: 391-395 | |
9 | H. Heusinger, Hartmut Noltemeier: On Separable Clusterings. J. Algorithms 10(2): 212-227 (1989) | |
1988 | ||
8 | Hartmut Noltemeier: Computational Geometry and its Applications, CG'88, International Workshop on Computational Geometry, Würzburg, Germany, March 24-25, 1988 Springer 1988 | |
7 | H. Heusinger, Hartmut Noltemeier: On Separable and Rectangular Clusterings. Workshop on Computational Geometry 1988: 25-42 | |
1987 | ||
6 | Frank K. H. A. Dehne, Hartmut Noltemeier: Voronoi trees and clustering problems. Inf. Syst. 12(2): 171-175 (1987) | |
1986 | ||
5 | Hartmut Noltemeier, Detlev Ruland: Datenmodellierung für Geo-Datenbanken. GI Jahrestagung (1) 1986: 470-482 | |
4 | 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) | |
1981 | ||
3 | Hartmut Noltemeier: Graphtheoretic Concepts in Computer Science, Proceedings of the International Workshop WG '80, Bad Honnef, Germany, June 15-18, 1980 Springer 1981 | |
1980 | ||
2 | Hartmut Noltemeier: On a Generalization of Heaps. WG 1980: 127-136 | |
1979 | ||
1 | Hartmut Noltemeier: Graphentheoretische Modelle und Methoden. Formale Modelle für Informationssysteme 1979: 170-180 |