default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHartmut Noltemeier
Person information
- affiliation: University of Würzburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[b1]Sven Oliver Krumke, Hartmut Noltemeier:
Graphentheoretische Konzepte und Algorithmen, 2. Auflage. Leitfäden der Informatik, Teubner 2009, ISBN 978-3-8348-0629-1, pp. I-X, 1-408- 2008
- [c29]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 - 2007
- [j25]Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth:
Multiple voting location and single voting location on trees. Eur. J. Oper. Res. 181(2): 654-667 (2007) - 2004
- [j24]Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
Optimizing cost flows by edge cost and capacity upgrade. J. Discrete Algorithms 2(4): 407-423 (2004) - [c28]Christian Mark, Armin Kaußner, Martin Grein, Hartmut Noltemeier:
Dynamically Changing Road Networks - Modelling and Visualization in Real Time. ICCSA (2) 2004: 843-853 - 2003
- [j23]Victor Chepoi, Hartmut Noltemeier, Yann Vaxès:
Upgrading trees under diameter and budget constraints. Networks 41(1): 24-35 (2003) - 2002
- [j22]Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
On the flow cost lowering problem. Eur. J. Oper. Res. 137(2): 265-271 (2002) - 2001
- [j21]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading bottleneck constrained forests. Discret. Appl. Math. 108(1-2): 129-142 (2001) - 2000
- [c27]Benedikt Bietzker, Oliver Karch, Hartmut Noltemeier:
Using Randomized Algorithms for Digital Mock-Up in Automotive Industry. MICAI 2000: 417-425 - [c26]Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
Optimizing Cost Flows by Modifying Arc Costs and Capacities. WG 2000: 116-126
1990 – 1999
- 1999
- [j20]Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke:
Network Design and Improvement. ACM Comput. Surv. 31(3es): 2 (1999) - [j19]Hartmut Noltemeier, Kokichi Sugihara:
Preface. Discret. Appl. Math. 93(1): 1 (1999) - [j18]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) - [j17]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) - [c25]Dirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier:
RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen Roboters. AMS 1999: 118-127 - [c24]Hartmut Noltemeier:
Invited Lecture: Silver Graphs: Achievements and New Challenges. WG 1999: 1-9 - [e10]Henrik I. Christensen, Horst Bunke, Hartmut Noltemeier:
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 [contents] - 1998
- [j16]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) - [j15]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) - [c23]Oliver Karch, Hartmut Noltemeier, Thomas Wahl:
Robot Localization Using Polygon Distances. Sensor Based Intelligent Robots 1998: 200-219 - [c22]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading Bottleneck Constrained Forests. WG 1998: 215-226 - 1997
- [j14]Georg Schmitt, Hartmut Noltemeier, Manfred Widera:
Inkrementelle temporale Constraintpropagierung. Künstliche Intell. 11(1): 7-13 (1997) - [j13]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) - [c21]Oliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl:
Relokalisation - Ein theoretischer Ansatz in der Praxis. AMS 1997: 119-130 - [c20]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Network improvement problems. Network Design: Connectivity and Facilities Location 1997: 247-268 - [c19]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 - [c18]Oliver Karch, Hartmut Noltemeier:
Robot localization - theory and practice. IROS 1997: 850-856 - [e9]Robert C. Bolles, Horst Bunke, Hartmut Noltemeier:
Intelligent Robots: Sensing, Modeling and Planning [Dagstuhl Workshop, September 1-6, 1996]. Series in Machine Perception and Artificial Intelligence 27, World Scientific 1997, ISBN 978-981-02-3185-9 [contents] - 1996
- [c17]Oliver Karch, Hartmut Noltemeier:
Zum Lokalisationsproblem für Roboter. AMS 1996: 128-137 - [c16]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
- [c15]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe:
Compact Location Problems with Budget and Communication Constraints. COCOON 1995: 510-519 - [c14]Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe:
Complexity and Approximability of Certain Bicriteria Location Problems. WG 1995: 73-87 - [e8]Horst Bunke, Takeo Kanade, Hartmut Noltemeier:
Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, October 24-28, 1994]. World Scientific 1995 [contents] - [e7]Hans Hagen, Gerald E. Farin, Hartmut Noltemeier, Rudolf F. Albrecht:
Geometric Modelling, Dagstuhl, Germany, 1993. Computing Supplementa 10, Springer 1995, ISBN 3-211-82666-1 [contents] - 1994
- [j12]Andreas Beck, Paul Holaj, Hartmut Noltemeier, Knut Verbarg:
Umweltmodellierung und Bewegungsplanung. Informationstechnik Tech. Inform. 36(1): 46-56 (1994) - [c13]Knut Verbarg, Hartmut Noltemeier:
Dynamic Environmental Modeling by the C-Tree. Modelling and Planning for Sensor Based Intelligent Robot Systems 1994: 3-22 - 1993
- [e6]Gerald E. Farin, Hans Hagen, Hartmut Noltemeier, Walter Knödel:
Geometric Modelling, Dagstuhl, Germany, 1992. Computing Supplementa 8, Springer 1993, ISBN 3-211-82399-9 [contents] - 1992
- [c12]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 - [c11]Hartmut Noltemeier, Thomas Roos, Christian Zirkelbach:
Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach. GI Jahrestagung 1992: 319-325 - [c10]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
- [c9]Hartmut Noltemeier:
Layout of Flexible Manufacturing Systems - Selected Problems. Workshop on Computational Geometry 1991: 217-225 - [c8]Thomas Roos, Hartmut Noltemeier:
Dynamic Voronoi Diagrams in Motion Planning. Workshop on Computational Geometry 1991: 227-236 - [c7]Oliver Günther, Hartmut Noltemeier:
Spatial Database Indices for Large Extended Objects. ICDE 1991: 520-526 - [e5]Hanspeter Bieri, Hartmut Noltemeier:
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 [contents]
1980 – 1989
- 1989
- [j11]Hugo Heusinger, Hartmut Noltemeier:
On Separable Clusterings. J. Algorithms 10(2): 212-227 (1989) - [c6]Klaus-Uwe Höffgen, Mark Goerke, Hartmut Noltemeier:
PICASYS - Ein Bildanalysesystem zur Identifikation von Leiterplatinen. DAGM-Symposium 1989: 391-395 - 1988
- [j10]Hartmut Noltemeier:
Editor's preface. ZOR Methods Model. Oper. Res. 32(3-4) (1988) - [c5]Hugo Heusinger, Hartmut Noltemeier:
On Separable and Rectangular Clusterings. Workshop on Computational Geometry 1988: 25-42 - [e4]Hartmut Noltemeier:
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 [contents] - 1987
- [j9]Frank K. H. A. Dehne, Hartmut Noltemeier:
Voronoi trees and clustering problems. Inf. Syst. 12(2): 171-175 (1987) - 1986
- [j8]Frank K. H. A. Dehne, Hartmut Noltemeier:
Clustering methods for geometric objects and applications to design problems. Vis. Comput. 2(1): 31-38 (1986) - [c4]Hartmut Noltemeier, Detlev Ruland:
Datenmodellierung für Geo-Datenbanken. GI Jahrestagung (1) 1986: 470-482 - [e3]Hartmut Noltemeier:
Graphtheoretic Concepts in Computer Science, Proceedings WG '85, Castle Schwanberg (near Würzburg), Germany. Trauner, Linz 1986, ISBN 3-853-20357-4 - 1985
- [c3]Frank K. H. A. Dehne, Hartmut Noltemeier:
A computational geometry approach to clustering problems. SCG 1985: 245-250 - 1984
- [j7]Hartmut Noltemeier:
Buchbesprechungen. Z. Oper. Research 28(2) (1984) - 1981
- [j6]Franz Ferschl, Hartmut Noltemeier, Michael Bastian, Werner Dinkelbach, Paul van Beek, A. Jaeger, K. Braun, G. Sossidis:
Book reviews. Z. Oper. Research 25(3): 110-117 (1981) - [e2]Hartmut Noltemeier:
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 [contents] - 1980
- [c2]Hartmut Noltemeier:
On a Generalization of Heaps. WG 1980: 127-136
1970 – 1979
- 1979
- [j5]H. Bothe, Ulrich Derigs, Klaus-Peter Kistner, Jochen Schwarze, Hartmut Noltemeier, A. Jaeger, R. Weber, S. Albers, V. Steinecke, W. P. Schmidt:
Buchbesprechungen. Z. Oper. Research 23(6): B183-B190 (1979) - [c1]Hartmut Noltemeier:
Graphentheoretische Modelle und Methoden. Formale Modelle für Informationssysteme 1979: 170-180 - 1977
- [e1]Hartmut Noltemeier:
Graphen, Algorithmen, Datenstrukturen, Proceedings WG '76, Graphtheoretic Concepts in Computer Science, Göttingen, Germany. Hanser, Munich 1977, ISBN 3-446-12330-X, pp. 336 - 1976
- [j4]Hartmut Noltemeier:
Reduktion von Präzedenzstrukturen. Math. Methods Oper. Res. 20(5): 151-159 (1976) - 1975
- [j3]Hartmut Noltemeier:
An algorithm for the determination of longest distances in a graph. Math. Program. 9(1): 350-357 (1975) - 1971
- [j2]Hartmut Noltemeier:
Ein Branch-and-Bound-Verfahren-Generator. Computing 8(1-2): 99-106 (1971)
1960 – 1969
- 1968
- [j1]Hartmut Noltemeier:
Zur Berechnung der Verteilung graphentheoretischer Zufallsvariablen. Unternehmensforschung 12(1): 242-257 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
