Publications by

• Classified by Publication Type • Sorted by Year • Classified by Author •

Classified by Author

• Nielsen, B. K. • Paluszewski, M. • Petersen, B. • Pisinger, D. • Spoorendonk, S. • Winter, P. • Zachariasen, M. •

Nielsen, B. K.

• M. Brazil, D. A. Thomas, B. K. Nielsen, C. Wulff-Nilsen, and M. Zachariasen. A Novel Approach to Phylogenetic Trees: d-dimensional Geometric Steiner Trees. Networks, 53:101–111, 2009.   [BibTeX]   [Google]   [doi] 
• B. K. Nielsen, S. Lindgreen, P. Winter, and M. Zachariasen. Deferred Path Heuristic for Phylogenetic Trees Revisited. In CompBioNets 2005: Algorithmics and Computational Methods for Biochemical and Evolutionary Networks, pp. 75–92, College Publications, King's College London, Strand, London, 2005.   [BibTeX]   [Google]   [pdf] 
• M. Brazil, B. K. Nielsen, P. Winter, and M. Zachariasen. Rotationally Optimal Spanning and Steiner Trees in Uniform Orientation Metrics. Computational Geometry: Theory and Applications, 29:251–263, 2004.   [BibTeX]   [Google]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237–241, 2002.   [BibTeX]   [Google]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. Rectilinear Trees under Rotation and Related Problems. In Proceedings of the 18th European Workshop on Computational Geometry, pp. 18–22, 2002.   [BibTeX]   [Google]   [ps] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. In Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, pp. 760–772, Springer, 2002.   [BibTeX]   [Google]   [html] 

Paluszewski, M.

• M. Paluszewski, P. Winter, and M. Zachariasen. A New Paradigm for General Architecture Routing. In Proceedings of the 14th ACM Great Lakes symposium on VLSI (GLSVLSI), pp. 202–207, 2004.   [BibTeX]   [Google]   [doi] 

Petersen, B.

• T. Stidsen, B. Petersen, K. Rasmussen, S. Spoorendonk, and M. Zachariasen. Optimal Routing with Failure Independent Path Protection. Networks, 55:125–137, 2009.   [BibTeX]   [Google]   [doi] 
• T. Stidsen, B. Petersen, K. B. Rasmussen, S. Spoorendonk, M. Zachariasen, F. Rambach, and M. Kiese. Optimal Routing with Single Backup Path Protection. In Proceedings of the International Network Optimization Conference (INOC), pp. 1–6, 2007.   [BibTeX]   [Google]   [pdf] 

Pisinger, D.

• O. Faroe, D. Pisinger, and M. Zachariasen. Guided Local Search for the Three-Dimensional Bin Packing Problem. INFORMS Journal on Computing, 15:267–283, 2003.   [BibTeX]   [Google]   [pdf] 
• O. Faroe, D. Pisinger, and M. Zachariasen. Guided Local Search for Final Placement in VLSI Design. Journal of Heuristics, 9:269–295, 2003.   [BibTeX]   [Google]   [doi] 
• O. Faroe, D. Pisinger, and M. Zachariasen. Local Search for Final Placement in VLSI Design. In Proceedings of the 2001 IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 565–572, 2001.   [BibTeX]   [Google]   [pdf] 

Spoorendonk, S.

• T. Stidsen, B. Petersen, K. Rasmussen, S. Spoorendonk, and M. Zachariasen. Optimal Routing with Failure Independent Path Protection. Networks, 55:125–137, 2009.   [BibTeX]   [Google]   [doi] 
• T. Stidsen, B. Petersen, K. B. Rasmussen, S. Spoorendonk, M. Zachariasen, F. Rambach, and M. Kiese. Optimal Routing with Single Backup Path Protection. In Proceedings of the International Network Optimization Conference (INOC), pp. 1–6, 2007.   [BibTeX]   [Google]   [pdf] 

Winter, P.

• K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen. Bounding Component Sizes of Two-Connected Steiner Networks. Information Processing Letters, 104:159–163, 2007.   [BibTeX]   [Google]   [doi] 
• K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen. Some Structural and Geometric Properties of Two-Connected Steiner Networks. In Computing: The Australasian Theory Symposium (CATS2007), pp. 85–90, 2007.   [BibTeX]   [Google]   
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Networks, 46:142–153, 2005.   [BibTeX]   [Google]   [doi] 
• B. K. Nielsen, S. Lindgreen, P. Winter, and M. Zachariasen. Deferred Path Heuristic for Phylogenetic Trees Revisited. In CompBioNets 2005: Algorithmics and Computational Methods for Biochemical and Evolutionary Networks, pp. 75–92, College Publications, King's College London, Strand, London, 2005.   [BibTeX]   [Google]   [pdf] 
• P. Winter and M. Zachariasen. Two-Connected Steiner Networks: Structural Properties. Operations Research Letters, 33:395–402, 2005.   [BibTeX]   [Google]   [doi] 
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Technical Report 04-09, DIKU, Department of Computer Science, University of Copenhagen, 2004.   [BibTeX]   [Google]   [pdf] 
• M. Brazil, B. K. Nielsen, P. Winter, and M. Zachariasen. Rotationally Optimal Spanning and Steiner Trees in Uniform Orientation Metrics. Computational Geometry: Theory and Applications, 29:251–263, 2004.   [BibTeX]   [Google]   [doi] 
• M. Brazil, D. A. Thomas, J. F. Weng, P. Winter, and M. Zachariasen. The Structure and Flexibility of Steiner Trees in Uniform Orientation Metrics. In Proceedings of 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, 2004.   [BibTeX]   [Google]   
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. In Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 3341, pp. 196–208, 2004.   [BibTeX]   [Google]   [doi] 
• M. Paluszewski, P. Winter, and M. Zachariasen. A New Paradigm for General Architecture Routing. In Proceedings of the 14th ACM Great Lakes symposium on VLSI (GLSVLSI), pp. 202–207, 2004.   [BibTeX]   [Google]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237–241, 2002.   [BibTeX]   [Google]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. Rectilinear Trees under Rotation and Related Problems. In Proceedings of the 18th European Workshop on Computational Geometry, pp. 18–22, 2002.   [BibTeX]   [Google]   [ps] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. In Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, pp. 760–772, Springer, 2002.   [BibTeX]   [Google]   [html] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Discrete Applied Mathematics, 118:55–72, 2002.   [BibTeX]   [Google]   [doi] 
• P. Winter and M. Zachariasen. Geometric Steiner Tree Problems. In Proceedings of 4th ALIO/EURO Workshop on Applied Combinatorial Optimization, pp. 137–140, 2002.   [BibTeX]   [Google]   
• D. M. Warme, P. Winter, and M. Zachariasen. GeoSteiner 3.1. Department of Computer Science, University of Copenhagen (DIKU), http://www.diku.dk/geosteiner/, 2001.   [BibTeX]   [Google]   [html] 
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study. In D.-Z. Du, J. M. Smith, and J. H. Rubinstein, editors, Advances in Steiner Trees, pp. 81–116, Kluwer Academic Publishers, Boston, 2000.   [BibTeX]   [Google]   [ps] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Technical Report 2000/02, DIKU, Department of Computer Science, University of Copenhagen, 2000.   [BibTeX]   [Google]   [ps] 
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Solutions to Large-Scale Plane Steiner Tree Problems. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 979–980, 1999.   [BibTeX]   [Google]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica, 25:418–437, 1999.   [BibTeX]   [Google]   [doi] 
• M. Zachariasen and P. Winter. Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. In Workshop on Algorithm Engineering and Experimentation (ALENEX), Lecture Notes in Computer Science 1619, pp. 282–295, Springer, 1999.   [BibTeX]   [Google]   [ps] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem: Extended Abstract. In Proceedings of Algorithms and Experiments (ALEX98), pp. 144–153, 1998.   [BibTeX]   [Google]   [ps] 
• P. Winter and M. Zachariasen. Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. Networks, 30:149–166, 1997.   [BibTeX]   [Google]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Technical Report 97/20, DIKU, Department of Computer Science, University of Copenhagen, 1997.   [BibTeX]   [Google]   [ps] 
• P. Winter and M. Zachariasen. Large Euclidean Steiner Minimum Trees in an Hour. Technical Report 96/34, DIKU, Department of Computer Science, University of Copenhagen, 1996.   [BibTeX]   [Google]   [ps] 

Zachariasen, M.

• T. Andersen, J. Bansler, H. Clausen, I. H. Jensen, and M. Zachariasen, editors. Den digitale revolution --- fortællinger fra datalogiens verden: DIKU 1970-2010, Datalogisk Institut, Københavns Universitet, 2010.   [BibTeX]   [Google]   [html] 
• S. Maier, P. Zachariassen, and M. Zachariasen. Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study. Management Science, 56:373–387, 2010.   [BibTeX]   [Google]   [doi] 
• H. Skov-Petersen, M. Zachariasen, and P. K. Kefaloukos. Have a Nice Trip: An Algorithm for Identifying Excess Routes under Satisfaction Constraints. International Journal of Geographical Information Science, 24:1745–1758, 2010.   [BibTeX]   [Google]   [doi] 
• M. Brazil and M. Zachariasen. Steiner Trees for Fixed Orientation Metrics. Journal of Global Optimization, 43:141–169, 2009.   [BibTeX]   [Google]   [doi] 
• M. Brazil, D. A. Thomas, B. K. Nielsen, C. Wulff-Nilsen, and M. Zachariasen. A Novel Approach to Phylogenetic Trees: d-dimensional Geometric Steiner Trees. Networks, 53:101–111, 2009.   [BibTeX]   [Google]   [doi] 
• U. Leopold-Wildburger, G.-W. Weber, and M. Zachariasen. Editorial: OR for Better Management of Sustainable Development. European Journal of Operations Research, 193:647–648, 2009.   [BibTeX]   [Google]   [doi] 
• T. Stidsen, B. Petersen, K. Rasmussen, S. Spoorendonk, and M. Zachariasen. Optimal Routing with Failure Independent Path Protection. Networks, 55:125–137, 2009.   [BibTeX]   [Google]   [doi] 
• M. Zachariasen. Fixed Orientation Interconnection Problems: Theory, Algorithms and Applications. Doctoral Dissertation, Department of Computer Science, University of Copenhagen, 2009.   [BibTeX]   [Google]   [html] 
• K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen. Bounding Component Sizes of Two-Connected Steiner Networks. Information Processing Letters, 104:159–163, 2007.   [BibTeX]   [Google]   [doi] 
• K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen. Some Structural and Geometric Properties of Two-Connected Steiner Networks. In Computing: The Australasian Theory Symposium (CATS2007), pp. 85–90, 2007.   [BibTeX]   [Google]   
• S. Maier, P. Zachariassen, and M. Zachariasen. Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study. Technical Report 039/2007, University of Augsburg, 2007.   [BibTeX]   [Google]   [pdf] 
• L. F. Muller and M. Zachariasen. Fast and Compact Oracles for Approximate Distances in Planar Graphs. In Proceedings of the 15th European Symposium on Algorithms, Lecture Notes in Computer Science 4698, pp. 657–668, 2007.   [BibTeX]   [Google]   [doi] 
• S. Pickl, G.-W. Weber, and M. Zachariasen. Editorial: Special Issue on OR for Better Management of Sustainable Development. Central European Journal of Operations Research, 15:221–222, 2007.   [BibTeX]   [Google]   [doi] 
• G. Rote and M. Zachariasen. Matrix Scaling by Network Flow. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 848–854, 2007.   [BibTeX]   [Google]   [html] 
• T. Stidsen, B. Petersen, K. B. Rasmussen, S. Spoorendonk, M. Zachariasen, F. Rambach, and M. Kiese. Optimal Routing with Single Backup Path Protection. In Proceedings of the International Network Optimization Conference (INOC), pp. 1–6, 2007.   [BibTeX]   [Google]   [pdf] 
• M. Brazil, D. A. Thomas, J. F. Weng, and M. Zachariasen. Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. Algorithmica, 44:281–300, 2006.   [BibTeX]   [Google]   [doi] 
• M. Brazil and M. Zachariasen. Steiner Trees for Fixed Orientation Metrics. Technical Report 06-11, DIKU, Department of Computer Science, University of Copenhagen, 2006.   [BibTeX]   [Google]   [pdf] 
• M. Zachariasen. Comment on ``Computing the Shortest Network under a Fixed Topology''. IEEE Transactions on Computers, 55:783–784, 2006.   [BibTeX]   [Google]   [doi] 
• M. Zachariasen. Algorithmic Aspects of Divisor-Based Biproportional Rounding. Technical Report 06-05, DIKU, Department of Computer Science, University of Copenhagen, 2006.   [BibTeX]   [Google]   [pdf] 
• P. Zachariassen and M. Zachariasen. A Comparison of Electoral Formulae for the Faroese Parliament (The Løgting). In Mathematics and Democracy. Recent Advances in Voting Systems and Collective Choice, pp. 235–251, Springer, New York, 2006.   [BibTeX]   [Google]   
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Networks, 46:142–153, 2005.   [BibTeX]   [Google]   [doi] 
• K. Jensen, J. Xu, and M. Zachariasen. Rhythm-Based Segmentation of Popular Chinese Music. In Proceedings of the 6th International Conference on Music Information Retrieval (ISMIR 2005), pp. 374–380, 2005.   [BibTeX]   [Google]   [pdf] 
• M. B. Jensen, M. Kaufmann, and M. Zachariasen. Movie Shoot Scheduling. In Proceedings of the 6th Metaheuristics International Conference (MIC2005), pp. 551–556, 2005.   [BibTeX]   [Google]   [pdf] 
• B. K. Nielsen, S. Lindgreen, P. Winter, and M. Zachariasen. Deferred Path Heuristic for Phylogenetic Trees Revisited. In CompBioNets 2005: Algorithmics and Computational Methods for Biochemical and Evolutionary Networks, pp. 75–92, College Publications, King's College London, Strand, London, 2005.   [BibTeX]   [Google]   [pdf] 
• P. Winter and M. Zachariasen. Two-Connected Steiner Networks: Structural Properties. Operations Research Letters, 33:395–402, 2005.   [BibTeX]   [Google]   [doi] 
• P. Zachariassen and M. Zachariasen. A Comparison of Electoral Formulae for the Faroese Parliament (The Løgting) [in Faroese]. Technical Report 2005:1, Fróðskaparsetur Føroya, 2005.   [BibTeX]   [Google]   [pdf] 
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. Technical Report 04-09, DIKU, Department of Computer Science, University of Copenhagen, 2004.   [BibTeX]   [Google]   [pdf] 
• M. Brazil, B. K. Nielsen, P. Winter, and M. Zachariasen. Rotationally Optimal Spanning and Steiner Trees in Uniform Orientation Metrics. Computational Geometry: Theory and Applications, 29:251–263, 2004.   [BibTeX]   [Google]   [doi] 
• M. Brazil, D. A. Thomas, J. F. Weng, P. Winter, and M. Zachariasen. The Structure and Flexibility of Steiner Trees in Uniform Orientation Metrics. In Proceedings of 6th International Conference on Optimization: Techniques and Applications, Ballarat, Australia, 2004.   [BibTeX]   [Google]   
• M. Brazil, P. Winter, and M. Zachariasen. Flexibility of Steiner Trees in Uniform Orientation Metrics. In Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 3341, pp. 196–208, 2004.   [BibTeX]   [Google]   [doi] 
• M. Paluszewski, P. Winter, and M. Zachariasen. A New Paradigm for General Architecture Routing. In Proceedings of the 14th ACM Great Lakes symposium on VLSI (GLSVLSI), pp. 202–207, 2004.   [BibTeX]   [Google]   [doi] 
• S. Peyer, M. Zachariasen, and D. G. Jørgensen. Delay-related Secondary Objectives for Rectilinear Steiner Minimum Trees. Discrete Applied Mathematics, 136:271–298, 2004.   [BibTeX]   [Google]   [doi] 
• M. Sigurd and M. Zachariasen. Construction of Minimum-Weight Spanners. In Proceedings of the 12th European Symposium on Algorithms, Lecture Notes in Computer Science 3221, pp. 797–808, 2004.   [BibTeX]   [Google]   [doi] 
• O. Faroe, D. Pisinger, and M. Zachariasen. Guided Local Search for the Three-Dimensional Bin Packing Problem. INFORMS Journal on Computing, 15:267–283, 2003.   [BibTeX]   [Google]   [pdf] 
• O. Faroe, D. Pisinger, and M. Zachariasen. Guided Local Search for Final Placement in VLSI Design. Journal of Heuristics, 9:269–295, 2003.   [BibTeX]   [Google]   [doi] 
• M. Zachariasen and A. Rohe. Rectilinear Group Steiner Trees and Applications in VLSI Design. Mathematical Programming, 94:407–433, 2003.   [BibTeX]   [Google]   [doi] 
• M. Brazil, D. A. Thomas, J. F. Weng, and M. Zachariasen. Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. Technical Report 02/22, DIKU, Department of Computer Science, University of Copenhagen, 2002.   [BibTeX]   [Google]   [pdf] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. On the Location of Steiner Points in Uniformly-Oriented Steiner Trees. Information Processing Letters, 83:237–241, 2002.   [BibTeX]   [Google]   [doi] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. Rectilinear Trees under Rotation and Related Problems. In Proceedings of the 18th European Workshop on Computational Geometry, pp. 18–22, 2002.   [BibTeX]   [Google]   [ps] 
• B. K. Nielsen, P. Winter, and M. Zachariasen. An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. In Proceedings of the 10th European Symposium on Algorithms, Lecture Notes in Computer Science, pp. 760–772, Springer, 2002.   [BibTeX]   [Google]   [html] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Discrete Applied Mathematics, 118:55–72, 2002.   [BibTeX]   [Google]   [doi] 
• P. Winter and M. Zachariasen. Geometric Steiner Tree Problems. In Proceedings of 4th ALIO/EURO Workshop on Applied Combinatorial Optimization, pp. 137–140, 2002.   [BibTeX]   [Google]   
• O. Faroe, D. Pisinger, and M. Zachariasen. Local Search for Final Placement in VLSI Design. In Proceedings of the 2001 IEEE/ACM International Conference on Computer Aided Design (ICCAD), pp. 565–572, 2001.   [BibTeX]   [Google]   [pdf] 
• G. Narasimhan and M. Zachariasen. Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. ACM Journal of Experimental Algorithmics, 6, 2001.   [BibTeX]   [Google]   [doi] 
• D. M. Warme, P. Winter, and M. Zachariasen. GeoSteiner 3.1. Department of Computer Science, University of Copenhagen (DIKU), http://www.diku.dk/geosteiner/, 2001.   [BibTeX]   [Google]   [html] 
• M. Zachariasen. A Catalog of Hanan Grid Problems. Networks, 38:76–83, 2001.   [BibTeX]   [Google]   [doi] 
• M. Zachariasen. The Rectilinear Steiner Tree Problem: A Tutorial. In D.-Z. Du and X. Cheng, editors, Steiner Trees in Industries, pp. 467–507, Kluwer Academic Publishers, Boston, 2001.   [BibTeX]   [Google]   [pdf] 
• G. Narasimhan, M. Zachariasen, and J. Zhu. Experiments with Computing Geometric Minimum Spanning Trees. In Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments, pp. 183–196, 2000.   [BibTeX]   [Google]   [html] 
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Algorithms for Plane Steiner Tree Problems: A Computational Study. In D.-Z. Du, J. M. Smith, and J. H. Rubinstein, editors, Advances in Steiner Trees, pp. 81–116, Kluwer Academic Publishers, Boston, 2000.   [BibTeX]   [Google]   [ps] 
• P. Winter, M. Zachariasen, and J. Nielsen. Short Trees in Polygons. Technical Report 2000/02, DIKU, Department of Computer Science, University of Copenhagen, 2000.   [BibTeX]   [Google]   [ps] 
• M. Zachariasen and A. Rohe. Rectilinear Group Steiner Trees and Applications in VLSI Design. Technical Report 00906, Institute for Discrete Mathematics, University of Bonn, 2000.   [BibTeX]   [Google]   [ps] 
• M. Zachariasen. A Catalog of Hanan Grid Problems. Technical Report 00892, Institute for Discrete Mathematics, University of Bonn, 2000.   [BibTeX]   [Google]   [ps] 
• D. M. Warme, P. Winter, and M. Zachariasen. Exact Solutions to Large-Scale Plane Steiner Tree Problems. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 979–980, 1999.   [BibTeX]   [Google]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica, 25:418–437, 1999.   [BibTeX]   [Google]   [doi] 
• M. Zachariasen. Rectilinear Full Steiner Tree Generation. Networks, 33:125–143, 1999.   [BibTeX]   [Google]   [html] 
• M. Zachariasen and P. Winter. Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. In Workshop on Algorithm Engineering and Experimentation (ALENEX), Lecture Notes in Computer Science 1619, pp. 282–295, Springer, 1999.   [BibTeX]   [Google]   [ps] 
• M. Zachariasen. Local Search for the Steiner Tree Problem in the Euclidean Plane. European Journal of Operational Research, 119:282–300, 1999.   [BibTeX]   [Google]   [doi] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem: Extended Abstract. In Proceedings of Algorithms and Experiments (ALEX98), pp. 144–153, 1998.   [BibTeX]   [Google]   [ps] 
• P. Winter and M. Zachariasen. Euclidean Steiner Minimum Trees: An Improved Exact Algorithm. Networks, 30:149–166, 1997.   [BibTeX]   [Google]   [html] 
• M. Zachariasen and P. Winter. Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Technical Report 97/20, DIKU, Department of Computer Science, University of Copenhagen, 1997.   [BibTeX]   [Google]   [ps] 
• M. Zachariasen. Local Search for the Steiner Tree Problem in the Euclidean Plane. Technical Report 97/21, DIKU, Department of Computer Science, University of Copenhagen, 1997.   [BibTeX]   [Google]   [ps] 
• M. Zachariasen. Rectilinear Full Steiner Tree Generation. Technical Report 97/29, DIKU, Department of Computer Science, University of Copenhagen, 1997.   [BibTeX]   [Google]   [ps] 
• D. Bloch, G. Desportes, M. Zachariasen, and I. Christensen. The Northern Bottlenose Whale in the Faroe Islands, 1584--1993. Journal of Zoology, 239:123–140, 1996.   [BibTeX]   [Google]   
• P. Winter and M. Zachariasen. Large Euclidean Steiner Minimum Trees in an Hour. Technical Report 96/34, DIKU, Department of Computer Science, University of Copenhagen, 1996.   [BibTeX]   [Google]   [ps] 
• M. Zachariasen and M. Dam. Tabu Search on the Geometric Traveling Salesman Problem. In Metaheuristics: theory and applications (Proceedings from Metaheuristics International Conference, Colorado), pp. 571–587, 1996.   [BibTeX]   [Google]   [ps] 
• M. Dam and M. Zachariasen. Tabu Search on the Geometric Traveling Salesman Problem. Master's Thesis, DIKU, Department of Computer Science, University of Copenhagen,1994.   [BibTeX]   [Google]   [ps] 
• D. Bloch, C. Lockyer, and M. Zachariasen. Age and Growth Parameters of the Long-finned Pilot Whale off the Faroe Islands. In Rep. Int. Whal. Commn (Special Issue 14), pp. 163–208, 1993.   [BibTeX]   [Google]   
• D. Bloch, M. Zachariasen, and P. Zachariassen. Some External Characters of the Long-finned Pilot Whale off the Faroe Islands and a Comparison with the Short-finned Pilot Whale. In Rep. Int. Whal. Commn (Special Issue 14), pp. 117–135, 1993.   [BibTeX]   [Google]   
• D. Bloch and M. Zachariasen. The ``Skinn'' Values of Pilot Whales in the Faroe Islands. An Evaluation and a Corrective Proposal. North Atlantic Studies, 1:39–56, 1989.   [BibTeX]   [Google]   

Generated by bib2html.pl (written by Patrick Riley ) on Wed Feb 23, 2011 09:06:40