The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hartmut Noltemeier: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Oliver Günther, Hartmut Noltemeier
    Spatial Database Indices for Large Extended Objects. [Citation Graph (4, 18)][DBLP]
    ICDE, 1991, pp:520-526 [Conf]
  2. Oliver Karch, Hartmut Noltemeier
    Zum Lokalisationsproblem für Roboter. [Citation Graph (0, 0)][DBLP]
    AMS, 1996, pp:128-137 [Conf]
  3. Oliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl
    Relokalisation - Ein theoretischer Ansatz in der Praxis. [Citation Graph (0, 0)][DBLP]
    AMS, 1997, pp:119-130 [Conf]
  4. Dirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier
    RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters. [Citation Graph (0, 0)][DBLP]
    AMS, 1999, pp:118-127 [Conf]
  5. H. Heusinger, Hartmut Noltemeier
    On Separable and Rectangular Clusterings. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1988, pp:25-42 [Conf]
  6. Hartmut Noltemeier
    Layout of Flexible Manufacturing Systems - Selected Problems. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1991, pp:217-225 [Conf]
  7. Thomas Roos, Hartmut Noltemeier
    Dynamic Voronoi Diagrams in Motion Planning. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1991, pp:227-236 [Conf]
  8. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Compact Location Problems with Budget and Communication Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:510-519 [Conf]
  9. Klaus-Uwe Höffgen, M. Goerke, Hartmut Noltemeier
    PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen. [Citation Graph (0, 0)][DBLP]
    DAGM-Symposium, 1989, pp:391-395 [Conf]
  10. Oliver Karch, Hartmut Noltemeier, Thomas Wahl
    Robot Localization Using Polygon Distances. [Citation Graph (0, 0)][DBLP]
    Sensor Based Intelligent Robots, 1998, pp:200-219 [Conf]
  11. Knut Verbarg, Hartmut Noltemeier
    Dynamic Environmental Modeling by the C-Tree. [Citation Graph (0, 0)][DBLP]
    Modelling and Planning for Sensor Based Intelligent Robot Systems, 1994, pp:3-22 [Conf]
  12. Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach
    Monotonous Bisector* Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:186-203 [Conf]
  13. Hartmut Noltemeier, Detlev Ruland
    Datenmodellierung für Geo-Datenbanken. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 1986, pp:470-482 [Conf]
  14. Hartmut Noltemeier, Thomas Roos, Christian Zirkelbach
    Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1992, pp:319-325 [Conf]
  15. Hartmut Noltemeier, Knut Verbarg, Christian Zirkelbach
    A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* Trees. [Citation Graph (0, 0)][DBLP]
    Geometric Modelling, 1992, pp:211-226 [Conf]
  16. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:281-291 [Conf]
  17. Christian Mark, Armin Kaußner, Martin Grein, Hartmut Noltemeier
    Dynamically Changing Road Networks - Modelling and Visualization in Real Time. [Citation Graph (0, 0)][DBLP]
    ICCSA (2), 2004, pp:843-853 [Conf]
  18. Benedikt Bietzker, Oliver Karch, Hartmut Noltemeier
    Using Randomized Algorithms for Digital Mock-Up in Automotive Industry. [Citation Graph (0, 0)][DBLP]
    MICAI, 2000, pp:417-425 [Conf]
  19. Hartmut Noltemeier
    Graphentheoretische Modelle und Methoden. [Citation Graph (0, 0)][DBLP]
    Formale Modelle für Informationssysteme, 1979, pp:170-180 [Conf]
  20. Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
    Optimizing Cost Flows by Modifying Arc Costs and Capacities. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:116-126 [Conf]
  21. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading Bottleneck Constrained Forests. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:215-226 [Conf]
  22. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister
    Modifying Networks to Obtain Low Cost Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1996, pp:293-307 [Conf]
  23. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Complexity and Approximability of Certain Bicriteria Location Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:73-87 [Conf]
  24. Hartmut Noltemeier
    On a Generalization of Heaps. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:127-136 [Conf]
  25. Hartmut Noltemeier
    Invited Lecture: Silver Graphs: Achievements and New Challenges. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:1-9 [Conf]
  26. Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
    Network Design and Improvement. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1999, v:31, n:3es, pp:2- [Journal]
  27. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth
    Upgrading bottleneck constrained forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:129-142 [Journal]
  28. Hartmut Noltemeier, Kokichi Sugihara
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:1, pp:1- [Journal]
  29. Frank K. H. A. Dehne, Hartmut Noltemeier
    Voronoi trees and clustering problems. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1987, v:12, n:2, pp:171-175 [Journal]
  30. H. Heusinger, Hartmut Noltemeier
    On Separable Clusterings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:212-227 [Journal]
  31. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:33, n:1, pp:92-111 [Journal]
  32. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
    Approximation Algorithms for Certain Network Improvement Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:2, n:3, pp:257-288 [Journal]
  33. Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
    Optimizing cost flows by edge cost and capacity upgrade. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:4, pp:407-423 [Journal]
  34. Georg Schmitt, Hartmut Noltemeier, Manfred Widera
    Inkrementelle temporale Constraintpropagierung. [Citation Graph (0, 0)][DBLP]
    KI, 1997, v:11, n:1, pp:7-13 [Journal]
  35. Victor Chepoi, Hartmut Noltemeier, Yann Vaxès
    Upgrading trees under diameter and budget constraints. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:41, n:1, pp:24-35 [Journal]
  36. Kay U. Drangmeister, Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi
    Modifying Edges of a Network to Obtain Short Subgraphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:1, pp:91-121 [Journal]
  37. Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz
    Compact Location Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:2, pp:379-404 [Journal]
  38. Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
    Improving Spanning Trees by Upgrading Nodes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:139-155 [Journal]
  39. Frank K. H. A. Dehne, Hartmut Noltemeier
    Clustering methods for geometric objects and applications to design problems. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1986, v:2, n:1, pp:31-38 [Journal]
  40. Hartmut Noltemeier, J. Spoerhase, Hans-Christoph Wirth
    Multiple voting location and single voting location on trees. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:181, n:2, pp:654-667 [Journal]

  41. A computational geometry approach to clustering problems. [Citation Graph (, )][DBLP]


  42. Two-Swarm PSO for Competitive Location Problems. [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002