Martin Zachariasen

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Enhancing Availability for Critical Services.

Teresa Gomes, Lúcia Martins, Rita Girão-Silva, David Tipper, Alija Pasic, Balázs Vass, Luis Garrote, Urbano J. Nunes, Martin Zachariasen, Jacek Rak

Proceedings of the Guide to Disaster-Resilient Communication Networks, 2020

2019

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

Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas

Networks, 2019

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem.

Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas

Comput. Geom., 2019

Weighted Euclidean Steiner Trees for Disaster-Aware Network Design.

Luis Garrote, Lúcia Martins, Urbano J. Nunes, Martin Zachariasen

Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019

2018

The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study.

Daniel Juhl, David M. Warme, Pawel Winter, Martin Zachariasen

Math. Program. Comput., 2018

Vulnerable Regions of Networks on Sphere.

Bálazs Vass, László Németh, Martin Zachariasen, Amaro de Sousa, János Tapolcai

Proceedings of the 10th International Workshop on Resilient Networks Design and Modeling, 2018

2014

The Uniform Orientation Steiner Tree Problem is NP-Hard.

Marcus Brazil, Martin Zachariasen

Int. J. Comput. Geom. Appl., 2014

Heuristic methods for single link shared backup path protection.

Jørgen Thorlund Haahr, Thomas R. Stidsen, Martin Zachariasen

J. Heuristics, 2014

Declarative cartography: In-database map generalization of geospatial datasets.

Pimin Konstantin Kefaloukos, Marcos Antonio Vaz Salles, Martin Zachariasen

Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

2012

Heuristic methods for shared backup path protection planning.

Jørgen Thorlund Haahr, Thomas R. Stidsen, Martin Zachariasen

Proceedings of the 4th International Congress on Ultra Modern Telecommunications and Control Systems, 2012

TileHeat: a framework for tile selection.

Pimin Konstantin Kefaloukos, Marcos Antonio Vaz Salles, Martin Zachariasen

Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

2010

Optimal routing with failure-independent path protection.

Thomas R. Stidsen, Bjørn Petersen, Simon Spoorendonk, Martin Zachariasen, Kasper Bonne Rasmussen

Networks, 2010

Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study.

Sebastian Maier, Petur Zachariassen, Martin Zachariasen

Manag. Sci., 2010

Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints.

Hans Skov-Petersen, Martin Zachariasen, Pimin Konstantin Kefaloukos

Int. J. Geogr. Inf. Sci., 2010

2009

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

Marcus Brazil, Doreen A. Thomas, Benny K. Nielsen, Pawel Winter, Christian Wulff-Nilsen, Martin Zachariasen

Networks, 2009

Steiner trees for fixed orientation metrics.

Marcus Brazil, Martin Zachariasen

J. Glob. Optim., 2009

OR for better management of sustainable development.

Ulrike Leopold-Wildburger, Gerhard-Wilhelm Weber, Martin Zachariasen

Eur. J. Oper. Res., 2009

2007

Bounding component sizes of two-connected Steiner networks.

Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen

Inf. Process. Lett., 2007

Editorial.

Stefan Pickl, Gerhard-Wilhelm Weber, Martin Zachariasen

Central Eur. J. Oper. Res., 2007

Matrix scaling by network flow.

Günter Rote, Martin Zachariasen

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Fast and Compact Oracles for Approximate Distances in Planar Graphs.

Laurent Flindt Muller, Martin Zachariasen

Proceedings of the Algorithms, 2007

Some Structural and Geometric Properties of Two-Connected Steiner Networks.

Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen

Proceedings of the Theory of Computing 2007. Proceedings of the Thirteenth Computing: The Australasian Theory Symposium (CATS2007). January 30, 2007

2006

Comment on "Computing the Shortest Network under a Fixed Topology".

Martin Zachariasen

IEEE Trans. Computers, 2006

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

Marcus Brazil, Doreen A. Thomas, Jia F. Weng, Martin Zachariasen

Algorithmica, 2006

2005

Two-connected Steiner networks: structural properties.

Pawel Winter, Martin Zachariasen

Oper. Res. Lett., 2005

Flexibility of Steiner trees in uniform orientation metrics.

Marcus Brazil, Pawel Winter, Martin Zachariasen

Networks, 2005

Rhythm-Based Segmentation of Popular Chinese Music.

Kristoffer Jensen, Jieping Xu, Martin Zachariasen

Proceedings of the ISMIR 2005, 2005

2004

Delay-related secondary objectives for rectilinear Steiner minimum trees.

Sven Peyer, Martin Zachariasen, David Grove Jørgensen

Discret. Appl. Math., 2004

Rotationally optimal spanning and Steiner trees in uniform orientation metrics.

Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Comput. Geom., 2004

A new paradigm for general architecture routing.

Martin Paluszewski, Pawel Winter, Martin Zachariasen

Proceedings of the 14th ACM Great Lakes Symposium on VLSI 2004, 2004

Construction of Minimum-Weight Spanners.

Mikkel Sigurd, Martin Zachariasen

Proceedings of the Algorithms, 2004

2003

Rectilinear group Steiner trees and applications in VLSI design.

Martin Zachariasen, André Rohe

Math. Program., 2003

Guided Local Search for the Three-Dimensional Bin-Packing Problem.

Oluf Faroe, David Pisinger, Martin Zachariasen

INFORMS J. Comput., 2003

Guided Local Search for Final Placement in VLSI Design.

Oluf Faroe, David Pisinger, Martin Zachariasen

J. Heuristics, 2003

2002

On the location of Steiner points in uniformly-oriented Steiner trees.

Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Inf. Process. Lett., 2002

Short trees in polygons.

Pawel Winter, Martin Zachariasen, Jens Nielsen

Discret. Appl. Math., 2002

An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem.

Benny K. Nielsen, Pawel Winter, Martin Zachariasen

Proceedings of the Algorithms, 2002

2001

A catalog of Hanan grid problems.

Martin Zachariasen

Networks, 2001

Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions.

Giri Narasimhan, Martin Zachariasen

ACM J. Exp. Algorithmics, 2001

Local Search for Final Placement in VLSI Design.

Oluf Faroe, David Pisinger, Martin Zachariasen

Proceedings of the 2001 IEEE/ACM International Conference on Computer-Aided Design, 2001

1999

Rectilinear full Steiner tree generation.

Martin Zachariasen

Networks, 1999

Local search for the Steiner tree problem in the Euclidean plane.

Martin Zachariasen

Eur. J. Oper. Res., 1999

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

Martin Zachariasen, Pawel Winter

Algorithmica, 1999

Exact Solutions to Large-scale Plane Steiner Tree Problems.

David M. Warme, Pawel Winter, Martin Zachariasen

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm.

Martin Zachariasen, Pawel Winter

Proceedings of the Algorithm Engineering and Experimentation, 1999

1997

Euclidean Steiner minimum trees: An improved exact algorithm.

Pawel Winter, Martin Zachariasen

Networks, 1997