Martin Zachariasen

According to our database1, Martin Zachariasen authored at least 46 papers between 1997 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Enhancing Availability for Critical Services.
Proceedings of the Guide to Disaster-Resilient Communication Networks, 2020

Computing minimum 2-edge-connected Steiner networks in the Euclidean plane.
Networks, 2019

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem.
Comput. Geom., 2019

Weighted Euclidean Steiner Trees for Disaster-Aware Network Design.
Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019

The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study.
Math. Program. Comput., 2018

Vulnerable Regions of Networks on Sphere.
Proceedings of the 10th International Workshop on Resilient Networks Design and Modeling, 2018

The Uniform Orientation Steiner Tree Problem is NP-Hard.
Int. J. Comput. Geom. Appl., 2014

Heuristic methods for single link shared backup path protection.
J. Heuristics, 2014

Declarative cartography: In-database map generalization of geospatial datasets.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

Heuristic methods for shared backup path protection planning.
Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

TileHeat: a framework for tile selection.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Optimal routing with failure-independent path protection.
Networks, 2010

Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study.
Manag. Sci., 2010

Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints.
Int. J. Geogr. Inf. Sci., 2010

A novel approach to phylogenetic trees: <i>d</i>-Dimensional geometric Steiner trees.
Networks, 2009

Steiner trees for fixed orientation metrics.
J. Glob. Optim., 2009

OR for better management of sustainable development.
Eur. J. Oper. Res., 2009

Bounding component sizes of two-connected Steiner networks.
Inf. Process. Lett., 2007

Central Eur. J. Oper. Res., 2007

Matrix scaling by network flow.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Fast and Compact Oracles for Approximate Distances in Planar Graphs.
Proceedings of the Algorithms, 2007

Some Structural and Geometric Properties of Two-Connected Steiner Networks.
Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

Comment on "Computing the Shortest Network under a Fixed Topology".
IEEE Trans. Computers, 2006

Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics.
Algorithmica, 2006

Two-connected Steiner networks: structural properties.
Oper. Res. Lett., 2005

Flexibility of Steiner trees in uniform orientation metrics.
Networks, 2005

Rhythm-Based Segmentation of Popular Chinese Music.
Proceedings of the ISMIR 2005, 2005

Delay-related secondary objectives for rectilinear Steiner minimum trees.
Discret. Appl. Math., 2004

Rotationally optimal spanning and Steiner trees in uniform orientation metrics.
Comput. Geom., 2004

A new paradigm for general architecture routing.
Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, 2004

Construction of Minimum-Weight Spanners.
Proceedings of the Algorithms, 2004

Rectilinear group Steiner trees and applications in VLSI design.
Math. Program., 2003

Guided Local Search for the Three-Dimensional Bin-Packing Problem.
INFORMS J. Comput., 2003

Guided Local Search for Final Placement in VLSI Design.
J. Heuristics, 2003

On the location of Steiner points in uniformly-oriented Steiner trees.
Inf. Process. Lett., 2002

Short trees in polygons.
Discret. Appl. Math., 2002

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem.
Proceedings of the Algorithms, 2002

A catalog of Hanan grid problems.
Networks, 2001

Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions.
ACM J. Exp. Algorithmics, 2001

Local Search for Final Placement in VLSI Design.
Proceedings of the 2001 IEEE/ACM International Conference on Computer-Aided Design, 2001

Rectilinear full Steiner tree generation.
Networks, 1999

Local search for the Steiner tree problem in the Euclidean plane.
Eur. J. Oper. Res., 1999

Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem.
Algorithmica, 1999

Exact Solutions to Large-scale Plane Steiner Tree Problems.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm.
Proceedings of the Algorithm Engineering and Experimentation, 1999

Euclidean Steiner minimum trees: An improved exact algorithm.
Networks, 1997