Hartmut Noltemeier - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 54 from 54

2009

Graphentheoretische Konzepte und Algorithmen, 2. AuflageSven Oliver Krumke, Hartmut Noltemeier. Leitfäden der Informatik, Teubner, 2009.

2008

Two-Swarm PSO for Competitive Location ProblemsClara M. Campos Rodríguez, José A. Moreno-Pérez, Hartmut Noltemeier, Dolores-Rosa Santos-Peñate. nicso 2009: 115-126 [doi]

2007

Multiple voting location and single voting location on treesHartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth. eor, 181(2):654-667, 2007. [doi]

2004

Optimizing cost flows by edge cost and capacity upgradeIngo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth. jda, 2(4):407-423, 2004. [doi]

Dynamically Changing Road Networks - Modelling and Visualization in Real TimeChristian Mark, Armin Kaußner, Martin Grein, Hartmut Noltemeier. iccsa 2004: 843-853 [doi]

2003

Upgrading trees under diameter and budget constraintsVictor Chepoi, Hartmut Noltemeier, Yann Vaxès. networks, 41(1):24-35, 2003. [doi]

2002

On the flow cost lowering problemIngo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth. eor, 137(2):265-271, 2002. [doi]

2001

Upgrading bottleneck constrained forestsSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth. DAM, 108(1-2):129-142, 2001.

2000

Using Randomized Algorithms for Digital Mock-Up in Automotive IndustryBenedikt Bietzker, Oliver Karch, Hartmut Noltemeier. micai 2000: 417-425

Optimizing Cost Flows by Modifying Arc Costs and CapacitiesIngo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth. criwg 2000: 116-126 [doi]

1999

Improving Minimum Cost Spanning Trees by Upgrading NodesSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth. jal, 33(1):92-111, 1999.

Improving Spanning Trees by Upgrading NodesSven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth. TCS, 221(1-2):139-155, 1999. [doi]

PrefaceHartmut Noltemeier, Kokichi Sugihara. DAM, 93(1):1, 1999. [doi]

Invited Lecture: Silver Graphs: Achievements and New ChallengesHartmut Noltemeier. criwg 1999: 1-9 [doi]

Network Design and ImprovementHartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke. ACM Comput. Surv., 31(3es):2, 1999. [doi]

RoLoPro - Simulationssoftware für die Selbstlokalisation eines autonomen mobilen RobotersDirk Schäfer, Martin Buck, Boris Kluge, Hartmut Noltemeier. ams 2000: 118-127

1998

1997

Robot localization - theory and practiceOliver Karch, Hartmut Noltemeier. iros 1997: 850-856 [doi]

Relokalisation - Ein theoretischer Ansatz in der PraxisOliver Karch, Hartmut Noltemeier, Mathias Schwark, Thomas Wahl. ams 1997: 119-130

Network improvement problemsSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi 0001, S. S. Ravi. dimacs 1998: 247-268

Compact Location ProblemsSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz. TCS, 181(2):379-404, 1997. [doi]

Improving Spanning Trees by Upgrading NodesSven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth. icalp 1997: 281-291

Inkrementelle temporale ConstraintpropagierungGeorg Schmitt, Hartmut Noltemeier, Manfred Widera. ki, 11(1):7-13, 1997.

1996

Zum Lokalisationsproblem für RoboterOliver Karch, Hartmut Noltemeier. ams 1996: 128-137

Modifying Networks to Obtain Low Cost TreesSven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, S. S. Ravi, Kay U. Drangmeister. criwg 1997: 293-307

1995

Compact Location Problems with Budget and Communication ConstraintsSven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe. cocoon 1995: 510-519

Complexity and Approximability of Certain Bicriteria Location ProblemsSven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe. criwg 1995: 73-87

1994

Umweltmodellierung und BewegungsplanungAndreas Beck, Paul Holaj, Hartmut Noltemeier, Knut Verbarg. it, 36(1):46-56, 1994. [doi]

Dynamic Environmental Modeling by the C-TreeKnut Verbarg, Hartmut Noltemeier. Dagstuhl 1995: 3-22

1992

Monotonous Bisector:::*::: Trees - A Tool for Efficient Partitioning of Complex Scenes of Geometric ObjectsHartmut Noltemeier, Knut Verbarg, Christian Zirkelbach. dfg 1992: 186-203

A Data Structure for Representing and Efficient Querying Large Scenes of Geometric Objects: MB* TreesHartmut Noltemeier, Knut Verbarg, Christian Zirkelbach. gm 1993: 211-226

Motion Planning in Dynamically Changing Environments: A Robust On-Line ApproachHartmut Noltemeier, Thomas Roos, Christian Zirkelbach. gi 1992: 319-325

1991

Spatial Database Indices for Large Extended ObjectsOliver Günther, Hartmut Noltemeier. icde 1991: 520-526 [doi]

Layout of Flexible Manufacturing Systems - Selected ProblemsHartmut Noltemeier. cga 1991: 217-225

Dynamic Voronoi Diagrams in Motion PlanningThomas Roos, Hartmut Noltemeier. cga 1991: 227-236

1989

On Separable ClusteringsH. Heusinger, Hartmut Noltemeier. jal, 10(2):212-227, 1989.

PICASYS - Ein Bildanalysesystem zur Identifikation von LeiterplatinenKlaus-Uwe Höffgen, M. Goerke, Hartmut Noltemeier. dagm 1989: 391-395

1988

On Separable and Rectangular ClusteringsH. Heusinger, Hartmut Noltemeier. icga 1988: 25-42

Editor's prefaceHartmut Noltemeier. mmor, 32(3-4), 1988. [doi]

1987

Voronoi trees and clustering problemsFrank K. H. A. Dehne, Hartmut Noltemeier. is, 12(2):171-175, 1987.

1986

Clustering methods for geometric objects and applications to design problemsFrank K. H. A. Dehne, Hartmut Noltemeier. vc, 2(1):31-38, 1986.

Datenmodellierung für Geo-DatenbankenHartmut Noltemeier, Detlev Ruland. gi 1986: 470-482

1985

A computational geometry approach to clustering problemsFrank K. H. A. Dehne, Hartmut Noltemeier. compgeom 1985: 245-250 [doi]

1984

BuchbesprechungenHartmut Noltemeier. mmor, 28(2), 1984. [doi]

1981

Book reviewsFranz Ferschl, Hartmut Noltemeier, M. Bastian, Werner Dinkelbach, Paul van Beek, A. Jaeger, K. Braun, G. Sossidis. mmor, 25(3):110-117, 1981. [doi]

1980

On a Generalization of HeapsHartmut Noltemeier. criwg 1981: 127-136

1979

Graphentheoretische Modelle und MethodenHartmut Noltemeier. mmb 1979: 170-180

1976

Reduktion von PräzedenzstrukturenHartmut Noltemeier. mmor, 20(5):151-159, 1976. [doi]

1975

An algorithm for the determination of longest distances in a graphHartmut Noltemeier. mp, 9(1):350-357, 1975. [doi]

1971

Ein Branch-and-Bound-Verfahren-GeneratorHartmut Noltemeier. computing, 8(1-2):99-106, 1971. [doi]

1968

Zur Berechnung der Verteilung graphentheoretischer ZufallsvariablenHartmut Noltemeier. mmor, 12(1):242-257, 1968. [doi]

Sign in or sign up to see more results.

runs on WebDSL