Algorithmik

//-->
English
                                        

Publikationen

ALGO - Algorithmik > Publikationen

Publications

2007

  • M. Müller-Hannemann and A. Schulze
    Hardness and Approximation of Octilinear Steiner Trees
    International Journal of Computational Geometry and Applications (IJCGA), vol. 17 (2007), pp. 231-260.
  • M. Müller-Hannemann and S. Tazari
    A Near Linear Time Approximation Scheme for Steiner Tree among Obstacles in the Plane
    WADS 2007, 10th Workshop on Algorithms and Data Structures, Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science 4619, pp. 151-162, Springer.
  • M. Müller-Hannemann, F. Schulz, D. Wagner and C. Zaroliagis
    Timetable Information: Models and Algorithms
    ATMOS 2004, Lecture Notes in Computer Science, vol. 4359, pp. 67-89, Springer, 2007.
  • M. Müller-Hannemann and M. Schnee
    Finding All Attractive Train Connections by Multi-Criteria Pareto Search
    Proceedings of the 4th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2004), Bergen, Norway, Lecture Notes in Computer Science, vol. 4359, pp. 246-263, Springer, 2007.
  • M. Müller-Hannemann and A. Sonnikow
    Non-Approximability of Just-in-Time Scheduling
    extended abstract in MAPSP 2007, Istanbul, to appear.
  • A. Eriksson, K. Marti, M. Müller-Hannemann, B.H.V. Topping, and C.A. Mota-Soares (eds.)
    Engineering Computational Technology, special issue of Advances in Engineering Software, 2007, in press.
  • J. M. Hochstein and K. Weihe
    Maximum s-t-flow with k Crossings in O(k^3 n log n) time
    SODA 2007, 18th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, USA, pages 843-847

2006

  • R. Jacob and M. Müller-Hannemann (eds.)
    ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways
    Dagstuhl Seminar Proceedings 06002, ISSN 1862-4405
    Preface and abstract collection
  • M. Müller-Hannemann and A. Schulze
    Approximation of Octilinear Steiner Trees Constrained by Hard and Soft Obstacles
    SWAT 2006, 10th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 4059, pp. 242-254, Springer.
  • S. Tazari, M. Müller-Hannemann and K. Weihe
    Workload Balancing in Multi-Stage Production Processes
    WEA 2006, 5th Int. Workshop on Experimental Algorithms, Lecture Notes in Computer Science 4007, pp. 49-60, Springer.
  • M. Müller-Hannemann and K. Weihe
    Moving Policies in Cyclic Assembly-Line Scheduling
    Theoretical Computer Science, vol. 351, pp. 425-436
    Extended abstract appeared in Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC 2004), Bergen, Norway, Lecture Notes in Computer Science, vol. 3162, pp. 149-161, Springer.
  • M. Müller-Hannemann and Karsten Weihe
    On the Cardinality of the Pareto Set in Bicriteria Shortest Path Problems
    Annals of Operations Research, vol. 147, pp. 269-286.

2005

2004

  • J.M. Hochstein and K. Weihe:
    Edge-disjoint routing in plane switch graphs in linear time
    Journal of the ACM, vol. 51, pages 636 - 670
  • M. Müller-Hannemann
    Recent Advances in Hexahedral Mesh Generation
    invited survey (24 pages), in Progress in Engineering Computational Technology (Eds. B.H.V. Topping and C.A. Mota Soares), Saxe-Coburg Publications, pp. 19-42.
  • M. Müller-Hannemann and K. Weihe
    Moving Policies in Cyclic Assembly-Line Scheduling
    Proceedings of the International Workshop on Parameterized and Exact Computation (IWPEC 2004), Bergen, Norway, Lecture Notes in Computer Science, vol. 3162, pp. 149-161, Springer.
  • R. Martin
    Exploiting Symmetries via Permutations for PC Board Manufacturing,
    In Proceedings of 10th International Conference on Principles and Practice of Constraint Programming - CP 2004, Toronto, Canada.
  • R. Martin and K. Weihe
    Weak Symmetries,
    Fourth International Workshop on Symmetry and Constraint Satisfaction Problems, Toronto, Canada.

2003

  • M. Müller-Hannemann and U. Zimmermann
    Slack Optimization of Timing-Critical Nets,
    11th Annual European Symposium on Algorithms (ESA 2003) , Lecture Notes in Computer Science, vol. 2832, pp. 727-739, 2003.
  • M. Müller-Hannemann and S. Peyer
    Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles,
    8th Workshop on Algorithms and Data Structures (WADS 2003), Carleton Univ., Ottawa, Canada, Lecture Notes in Computer Science, vol. 2748, pp. 207-218, 2003
  • S. Tazari
    Solving a core scheduling problem in modern assembly-line balancing
    Technical Report, TU Darmstadt, Germany.
  • Jan M. Hochstein and Karsten Weihe
    Max-Flow in nearly planar graphs - A computational study
    Technical Report, TU Darmstadt, Germany.
  • R. Shimizu and K. Weihe
    Efficiently computing all inclusion-maximal cliques in a graph
    Technical Report, TU Darmstadt, Germany.
  • W. A. Eiden
    Flexibles Scheduling auf Basis von Fuzzy-Technologien.
    In: J. Geldermann; H. Rommelfanger (eds.): Einsatz von Fuzzy-Sets, Neuronalen Netzen und Künstlicher Intelligenz in industrieller Produktion und Umweltforschung. VDI, 2003, pp. 70 -- 84.
  • W. A. Eiden
    Prioritätengesteuertes Scheduling auf Basis eines multikriteriellen Fuzzy-Bewertungsverfahrens
    Technical Report, TU Darmstadt, Germany.
  • M. Müller-Hannemann, W. Stille and K. Weihe
    Patterns of Usage for Global Constraints: A Case Study Based on the Bin-Packing Constraint
    Technical Report, TU Darmstadt, Germany.

2002

  • K. Weihe
    Towards improved static type safety: expressing meaning by type
    C/C++ Users Journal 20 (9), pp. 32-40, 2002.
  • M. Müller-Hannemann, M. Schnee, and K. Weihe
    Getting Train Timetables into the Main Storage
    Electronic Notes in Theoretical Computer Science 66.6, Proceedings of Algorithmic MeThods and Models for Optimization of RailwayS (ATMOS 2002).
  • M. Müller-Hannemann
    Single Row Legalization with Minimum Movement is Hard,
    Technical Report, Forschungsinstitut für Diskrete Mathematik, Bonn, Germany.
  • M. Müller-Hannemann and K. Weihe
    A Fixed-Parameter Analysis of a Production Planning Problem --- part I: solving the core problem,
    Technical Report, TU Darmstadt, Germany
    Extended abstract in Proceedings of Sixth Workshop on: Models and Algorithms for Planning and Scheduling Problems, Aussois, France, 2003.
  • W. A. Eiden
    Präzise Unschärfe -- Informationsmodellierung durch Fuzzy-Mengen.
    ibidem, 2002.
  • W. A. Eiden
    Similarities in fuzzy modeling.
    In: Mathematics Preprint Archive, Volume 2002, Issue 10, October 2002, pp. 40 -- 53.

2001

  • M. Müller-Hannemann and K. Weihe
    Pareto Shortest Paths is Often Feasible in Practice,
    Proceedings of the 5th International Workshop on Algorithm Engineering (WAE 2001), Arhus, Denmark, Lecture Notes in Computer Science, vol. 2141, pp. 185-197, 2001.
  • M. Müller-Hannemann, C. Kober, R. Sader, and H.-F. Zeilhofer
    Anisotropic Validation of Hexahedral Meshes for Composite Materials in Biomechanics,
    Proceedings of the 10th International Meshing Roundtable, Newport Beach, CA, pp. 249-260, 2001.
  • C. Kober and M. Müller-Hannemann
    A Case Study in Hexahedral Mesh Generation: Simulation of the Human Mandible,
    Engineering with Computers, vol. 17, pp. 249-260, 2001.