Martin Zachariasen

Pimin Konstantin Kefaloukos, Marcos Antonio Vaz Salles, Martin Zachariasen: TileHeat: a framework for tile selection. SIGSPATIAL/GIS 2012: 349-358

Jorgen Thorlund Haahr, Thomas Stidsen, Martin Zachariasen: Heuristic methods for shared backup path protection planning. ICUMT 2012: 712-718

Hans Skov-Petersen, Martin Zachariasen, Pimin Konstantin Kefaloukos: Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints. International Journal of Geographical Information Science 24(11): 1745-1758 (2010)

Sebastian Maier, Petur Zachariassen, Martin Zachariasen: Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study. Management Science 56(2): 373-387 (2010)

Thomas Stidsen, Bjørn Petersen, Simon Spoorendonk, Martin Zachariasen, Kasper Bonne Rasmussen: Optimal routing with failure-independent path protection. Networks 55(2): 125-137 (2010)

Ulrike Leopold-Wildburger, Gerhard-Wilhelm Weber, Martin Zachariasen: OR for better management of sustainable development. European Journal of Operational Research 193(3): 647-648 (2009)

Marcus Brazil, Martin Zachariasen: Steiner trees for fixed orientation metrics. J. Global Optimization 43(1): 141-169 (2009)

Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen: A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees. Networks 53(2): 104-111 (2009)

K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachariasen: Bounding component sizes of two-connected Steiner networks. Inf. Process. Lett. 104(5): 159-163 (2007)

K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachariasen: Some Structural and Geometric Properties of Two-Connected Steiner Networks. CATS 2007: 85-90

Laurent Flindt Muller, Martin Zachariasen: Fast and Compact Oracles for Approximate Distances in Planar Graphs. ESA 2007: 657-668

Günter Rote, Martin Zachariasen: Matrix scaling by network flow. SODA 2007: 848-854

Marcus Brazil, Doreen A. Thomas, Jia F. Weng, Martin Zachariasen: Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. Algorithmica 44(4): 281-300 (2006)

Martin Zachariasen: Comment on "Computing the Shortest Network under a Fixed Topology". IEEE Trans. Computers 55(6): 783-784 (2006)

Marcus Brazil, Pawel Winter, Martin Zachariasen: Flexibility of Steiner trees in uniform orientation metrics. Networks 46(3): 142-153 (2005)

Pawel Winter, Martin Zachariasen: Two-connected Steiner networks: structural properties. Oper. Res. Lett. 33(4): 395-402 (2005)

Kristoffer Jensen, Jieping Xu, Martin Zachariasen: Rhythm-Based Segmentation of Popular Chinese Music. ISMIR 2005: 374-380

Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen: Rotationally optimal spanning and Steiner trees in uniform orientation metrics. Comput. Geom. 29(3): 251-263 (2004)

Sven Peyer, Martin Zachariasen, David Grove Jørgensen: Delay-related secondary objectives for rectilinear Steiner minimum trees. Discrete Applied Mathematics 136(2-3): 271-298 (2004)

Mikkel Sigurd, Martin Zachariasen: Construction of Minimum-Weight Spanners. ESA 2004: 797-808

Martin Paluszewski, Pawel Winter, Martin Zachariasen: A new paradigm for general architecture routing. ACM Great Lakes Symposium on VLSI 2004: 202-207

Marcus Brazil, Pawel Winter, Martin Zachariasen: Flexibility of Steiner Trees in Uniform Orientation Metrics. ISAAC 2004: 196-208

Oluf Faroe, David Pisinger, Martin Zachariasen: Guided Local Search for Final Placement in VLSI Design. J. Heuristics 9(3): 269-295 (2003)

Oluf Faroe, David Pisinger, Martin Zachariasen: Guided Local Search for the Three-Dimensional Bin-Packing Problem. INFORMS Journal on Computing 15(3): 267-283 (2003)

Martin Zachariasen, André Rohe: Rectilinear group Steiner trees and applications in VLSI design. Math. Program. 94(2-3): 407-433 (2003)

Pawel Winter, Martin Zachariasen, Jens Nielsen: Short trees in polygons. Discrete Applied Mathematics 118(1-2): 55-72 (2002)

Benny K. Nielsen, Pawel Winter, Martin Zachariasen: On the location of Steiner points in uniformly-oriented Steiner trees. Inf. Process. Lett. 83(5): 237-241 (2002)

Benny K. Nielsen, Pawel Winter, Martin Zachariasen: An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. ESA 2002: 760-771

Giri Narasimhan, Martin Zachariasen: Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. ACM Journal of Experimental Algorithmics 6: 6 (2001)

Martin Zachariasen: A catalog of Hanan grid problems. Networks 38(2): 76-83 (2001)

Oluf Faroe, David Pisinger, Martin Zachariasen: Local Search for Final Placement in VLSI Design. ICCAD 2001: 565-572

Martin Zachariasen, Pawel Winter: Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica 25(4): 418-437 (1999)

Martin Zachariasen: Local search for the Steiner tree problem in the Euclidean plane. European Journal of Operational Research 119(2): 282-300 (1999)

Martin Zachariasen: Rectilinear full Steiner tree generation. Networks 33(2): 125-143 (1999)

Martin Zachariasen, Pawel Winter: Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. ALENEX 1999: 282-295

David M. Warme, Pawel Winter, Martin Zachariasen: Exact Solutions to Large-scale Plane Steiner Tree Problems. SODA 1999: 979-980

Pawel Winter, Martin Zachariasen: Euclidean Steiner minimum trees: An improved exact algorithm. Networks 30(3): 149-166 (1997)