5  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. R.C. Bolles, H. Bunke, H. Christensen, H. Noltemeier: "Modeling and Planning for Sensor-Based Intelligent Robot Systems", Dagstuhl-Seminar Report 98391, erscheint 1999.

  3. K. U. Drangmeister, S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi: "Modifying Networks to Obtain Low Cost Trees", Theoretical Computer Science, vol. 203, No. 1, August 1998.

  4. P. Fraternali, U. Geske, C. Ruiz, D. Seipel (Hrsg.): "Deductive Databases and Logic Programming", Proceedings of the 6th Workshop DDLP ‘98, Manchester, England, GMD-Report Nr. 22, 1998.

  5. U. Geske, C. Ruiz, D. Seipel (Hrsg.): "Deductive Databases and Logic Programming", Proceedings of the 5th Workshop DDLP ‘97, Leuven, Belgien, GMD-Studien Nr. 318, 1997.

  6. F. Jarre, R. Lepenis, D. Seipel: "Using Linear and Semi-Definite Programming for Computing Models of Disjunctive Deductive Databases", Proceedings of the 13th Workshop on Logic Programming (WLP ‘98), 1998.

  7. O. Karch, H. Noltemeier: "Robot Localization - Theory and Practice", Proceedings of the 10th IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS’97), p. 850-856, 1997.

  8. O. Karch, Th. Wahl: "Relocalization - Theory and Practice", Discrete Applied Mathematics (Special Issue on Computational Geometry), to appear 1999.

  9. O. Karch, H. Noltemeier, Th. Wahl: "Robot Localization Using Polygon Distances", Submitted to "Modelling and Planning for Sensor Based Intelligent Robot Systems", Lecture Notes in Artifical Intelligence (LNAI), 1999.

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

  11. O. Karch, H. Noltemeier, M. Schwark, Th. Wahl: "Relokalisation: Ein theoretischer Ansatz in der Praxis", Proceedings AMS ‘97 (Autonome Mobile Systeme), p. 119-130, Springer 1997.

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

  13. O. Karch, H. Noltemeier, Th. Wahl: "Using Polygon Distances for Localization", IECON ‘98 - Proceedings of the 24th Annual Conference of the IEEE Industrial Electronics Society, IEEE, August 1998.

  14. A. Kaußner, C. Mauckner, H. Noltemeier: "Polynomial Time Approximation Schemes for the Median Tour Problem and the Newspaper Delivery Problem in the Euclidean plane", Technical Report, Würzburg, December 1998.

  15. 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.

  16. S. O. Krumke, H. Noltemeier, R. Ravi, S. Schwarz, H.-C. Wirth: "Flow Improvement and Flows with Fixed Consts", Proceedings of the International Conference of Operations Research Zürich (OR’98), Operations Research Proceedings, Springer 1999.

  17. S. O. Krumke, H.-C. Wirth: "On the Minimum Label Spanning Tree Problem", Information Processing Letters, vol. 66(2), p. 81-85, 1998.

  18. S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi, H.-C. Wirth: "Upgrading Bottleneck Constrained Forests, Proc. 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’98), Lecture Notes in Computer Science, vol. 1517, p. 215-226, Springer 1998.

  19. 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.

  20. 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, 1999.

  21. 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.

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

  23. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi: "Approximation Algorithms of Certain Network Improvement Problems", Journal of Combinatorial Optimization, vol. 2, No. 3, Kluwer Academic Publishers, 1998.

  24. 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

  25. 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.

  26. 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.

  27. S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth: "Improving Spanning Trees by Upgrading Nodes", Proceedings of the 24th International Colloqium on Automata, Languages Programming (ICALP ‘97), Lecture Notes in Computer Science, vol. 1256, p. 281-291.

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

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

  30. 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.

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

  32. H. Noltemeier, K. Sugihara: "Computational Geometry", Special Issue of the Journal Discrete Applied Mathematics, vol. 93,3, North Holland, 1999.

  33. H. Noltemeier, H.-C. Wirth, S. O. Krumke: "Network Design and Network Improvement", Contributed to the ACM Computing Survey Symposium, Computing Surveys, March 1999.

  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", Information Processing Letters, vol. 66, p. 291-297, Springer 1998

  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, MIT Press, S. 245-259, 1997.

  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, Springer LNAI 1471, S. 66-84, 1998.

  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. D. Seipel: "An Alternating Well-Founded Semantics for Query Answering in Disjunctive Databases", Proceedings of the 3rd International Conference on Flexible Query Answering Systems (FQAS ‘98), Springer LNAI 1495,
    S. 341-353, 1998.

  41. J. Steffan, H.-C. Wirth: "ANDI - Approximation Algorithms for Network Design and Network Improvement Problems", Implementierung unter LEDA, Dokumentation und Sourcecode unter http://www-info1.informatik.uni-wuerzburg.de/projects/DFG2/andi.html, Tech. Rep. 202, Fakultät der Mathematik und Informatik, Universität Würzburg, 1998.

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

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

  44. 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.

  45. R. Wastl: "On the Number of Keys of a Relational Database Schema", Journal of Universal Computer Science, vol. 4 (5), 1998.

  46. R. Wastl: "Tableau Methods for Computing Stable Models and Query Answering in Disjunctive Deductive Databases", Proceedings of the 9th International Conference on Computing and Information (ICCI ‘98), 1998.

  47. R. Wastl: "An Exact Criterion for a Unique Key of a Relation Schema", Proceedings of the 7th International Workshop on Foundations of Models and Languages for Data and Objects (FoMLaDO ‘98), 1998.

  48. R. Wastl: "Tableau Methods for Computing Stable Models and Query Answering in Disjunctive Deductive Databases", Universität Würzburg, Institut für Informatik, Preprint-Reihe Nr. 167, März 1997.

  49. R. Wastl: "Unfolding in Disjunctive Deductive Databases with respect to 3-Valued Stable Models", Universität Würzburg, Institut für Informatik, Preprint-Reihe Nr. 165, Januar 1997.

 

  zurück zum Inhaltsverzeichnis  Herausgebertätigkeit