7  Veröffentlichungen

 

  1. R.C. Bolles, H. Bunke, H. Noltemeier: "Intelligent Robots - Sensing, Modeling and Planning", Series in Machine Perception and Artifical Intelligence, vol. 27, World Scientific Publ., Singapore 1997.

  2. F. Bry, D. Seipel: "Deduktive Datenbanken, Informatik-Spektrum", vol. 19, Springer, August 1996.

  3. C. Burch, S. O. Krumke, M. V. Marathe, C. Phillips, E. Sundberg: "Multicriteria Approximation through Decomposition", Technical Report, November 1997, Submitted for publication.

  4. K. U. Drangmeister, S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi: "Modifying Networks to Obtain Low Cost Trees", Theoretical Computer Science, 1998.

  5. O. Karch, K. Verbarg: "Exact Robot Localisation with Realistic (Uncer-tain) Sensors", Technical Report, Würzburg, January 1997.

  6. O. Karch, H. Noltemeier, Th. Wahl: "Robot Localization - Theory and Practice", Proceedings IROS `97, Grenoble, September 1997.

  7. O. Karch, H. Noltemeier, M. Schwark, Th. Wahl: "Relokalisation: Ein theoretischer Ansatz in der Praxis", Proceedings AMS `97 (Autonome Mobile Systeme), Springer 1997.

  8. O. Karch, Th. Wahl: "Relocalization - Theory and Pratice", Technical Report, Würzburg, November 1997, Submitted for Publication.

  9. O. Karch, H. Noltemeier, K. Verbarg (ed.): CG `97 - 13. European Workshop on Computational Geometry: Abstracts; Report, Würzburg, March 1997.

  10. O. Karch, H. Noltemeier, Th. Wahl: "Using Polygon Distances for Localization", Technical Report, Würzburg, March 1998, Submitted for Publication.

  11. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H.-C. Wirth: "Improving Spanning Trees by Upgrading Nodes", ICALP `97, vol. 1256, Lecture Notes in Computer Science, S. 281-291, 1997.

  12. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H.-C. Wirth: "Improving Spanning Trees by Upgrading Nodes", Journal of Algorithms, 1998.

  13. S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz: "Compact Location Problems", Theoretical Computer Science, vol. 181, no. 2, S. 379-404, July 1997.

  14. S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe: "Bicriteria Compact Location Problems", Studies in Locational Analysis, Issue 10, 1997.

  15. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi: "Approximation Algorithms of Certain Network Improvement Problems", Journal of Combinatorial Optimization, 1998.

  16. S. O. Krumke, H. Noltemeier, M. V. Marathe, S. S. Ravi, K. U. Drangmeister: "Modifying Networks to Obtain Low Cost Trees", WG `96, (22. Int. Workshop on Graph-Theoretic Concepts in Computer Science), Cadenabbia June 1996, Lecture Notes in Computer Science, vol. 1197, Springer, 1997.

  17. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi: "Network Improvement Problems", AMS-DIMACS Volume Series on Discrete Mathematics and Theoretical Computer Science: Workshop on Network Design and Location Theory, Princeton, vol. 40, 1998.

  18. S. O. Krumke, H. Noltemeier, S. Schwarz, H.-C. Wirth: "Flow Improvement and Flows with Fixed Costs", Technical Report, January 1998, Submitted for publication.

  19. S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi, H.-C. Wirth: "Upgrading Bottleneck Constrained Forests", Technical Report, February 1998, Submitted for publication.

  20. S. O. Krumke, H.-C. Wirth: "On the Minimum Label Spanning Tree Problem", Information Processing Letters, 1998.

  21. S. O. Krumke, H. Noltemeier, M. V. Marathe, S. S. Ravi, K. U. Drangmeister: "Modifying Networks to Obtain Low Cost Subgraphs", Theoretical Computer Science, 1998.

  22. S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz: "Compact Location Problems", Theoretical Computer Science, 1997, 181(2), p. 379-404.

  23. S. O. Krumke: "On the Approximability of Location and Network Design Problems", Dissertation, University of Würzburg, Shaker, Aachen 1997.

  24. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi: "Approximation Algorithms of Certain Network Improvement Problems", November 1997, Submitted for publication.

  25. S. O. Krumke, H. Noltemeier, M. V. Marathe, R. Ravi, S. S. Ravi: "Improving Steiner Trees of a Network under Miltiple Constraints", Technical Report LA-UR96-1467, Los Alamos National Laboratory, NM, December 1996.

  26. C. Mauckner, H. Noltemeier, S. Krumke: "Finding Placement Sequences and Bin Locations for Pick- and Place-Robots", Studies in Locational Analysis, Issue 10, 1997.

  27. C. Mauckner, H. Noltemeier, H. Krog, L. Billiet, U. König: "An Extension to the Capacitated Plant Location Problem: An Incremental Greedy-Solution Approach", Technical Report, Würzburg, September 1997.

  28. B. Milcke, M. Eineder, M. Hubig: "Unwrapping Large Interferograms Using the Minimum Cost Flow Algorithm", Technical Report, March 1998, Submitted for Publication.

  29. S. Näher, H. Noltemeier, J. Munro: "Data Structures", IBFI-Dagstuhl-Seminar, Report no. 136, October 1996.

  30. H. Noltemeier, K. Sugihara: "Computational Geometry", Special Issue of the Journal Discrete Applied Mathematics, North Holland, 1998;
    in preparation.

  31. H. Noltemeier, H.-C. Wirth, S. O. Krumke: "Network Design and Network Improvement", Contributed to the ACM Computing Survey Symposium, Submitted for Computing Surveys, Würzburg, February 1998.

  32. H. Noltemeier, S. O. Krumke: "Komplexitätstheorie, Datenstrukturen und effiziente Algorithmen", Technical Report, no. 152, Würzburg, October 1996.

  33. H. Noltemeier, G. Schmitt: "Incremental Temporal Constraints Propagation", Proceedings 9th AI Conference FLAIRS `96, Key West (FL), May 1996.

  34. G. Schmitt, H. Noltemeier, M. Widera: "Inkrementelle temporale Constraintspropagierung", KI (Künstliche Intelligenz), Special Issue Constraints, KI 1, März 1997.

  35. S. Schwarz, S. O. Krumke: "On Budget Constrained Flow Improvement", Technical Report, Würzburg, September 1997, Submitted for publication.

  36. D. Seipel, J. Minker, C. Ruiz: "A Characterization Of The Partial Stable Models For Disjunctive Deductive Databases", Proc. International Symposium on Logic Programming 1997 (ILPS `97, MIT Press, 1997, Preliminary Report.

  37. D. Seipel: "Partial Evidential Stable Models For Disjunctive Deductive Databases", Proc. Workshop on Logic Programming and Knowlege Representation (LPKR `97) at the International Symposium on Logic Programming 1997 (ILPS `97), 1997.

  38. D. Seipel, J. Minker, C. Ruiz: "Model Generation and State Generation for Disjunctive Logic Programs", Technical Report, University of Mary-land, 1995, and: Jounal of Logic Programming, vol. 32(1). North Holland, 1997, pp. 48-69.

  39. D. Seipel: "DisLog - A Disjunctive Deductive Database Prototype". Proc. 12th Workshop on Logic Programming 1997 (WLP `97), Preliminary Version

  40. K. Verbarg: "Spatial Data Structures and Motion Planning in Sparse Geometric Scenes", Dissertation, Universität Würzburg, Shaker-Verlag, 1997 .

  41. K. Verbarg: "Approximate center points in dense point sets", Information Processing Letters 61, Elsevier 1997.

  42. K. Verbarg: "Planning of fast and secure paths in complex configuration spaces using simple primitives", in: R. C. Bolles, H. Bunke, H. Noltemeier (ed.): "Intelligent Robots - Sensing, Modelling and Planning", World Scientific Singapore, 1997.

 

  zurück zum Inhaltsverzeichnis  Herausgebertätigkeit