default search action
Martin Zachariasen
- > Home > Persons > Martin Zachariasen
Publications
- 2020
- [p1]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:
Enhancing Availability for Critical Services. Guide to Disaster-Resilient Communication Networks 2020: 557-581 - 2019
- [j30]Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas:
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. Comput. Geom. 78: 37-49 (2019) - [j29]Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas:
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. Networks 73(1): 89-103 (2019) - [c16]Luis Garrote, Lúcia Martins, Urbano J. Nunes, Martin Zachariasen:
Weighted Euclidean Steiner Trees for Disaster-Aware Network Design. DRCN 2019: 138-145 - 2018
- [j28]Daniel Juhl, David M. Warme, Pawel Winter, Martin Zachariasen:
The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study. Math. Program. Comput. 10(4): 487-532 (2018) - [c15]Bálazs Vass, László Németh, Martin Zachariasen, Amaro de Sousa, János Tapolcai:
Vulnerable Regions of Networks on Sphere. RNDM 2018: 1-8 - 2014
- [j27]Jørgen Thorlund Haahr, Thomas R. Stidsen, Martin Zachariasen:
Heuristic methods for single link shared backup path protection. J. Heuristics 20(5): 539-560 (2014) - [j26]Marcus Brazil, Martin Zachariasen:
The Uniform Orientation Steiner Tree Problem is NP-Hard. Int. J. Comput. Geom. Appl. 24(2): 87-106 (2014) - 2012
- [c12]Jørgen Thorlund Haahr, Thomas R. Stidsen, Martin Zachariasen:
Heuristic methods for shared backup path protection planning. ICUMT 2012: 712-718 - 2010
- [j23]Thomas R. Stidsen, Bjørn Petersen, Simon Spoorendonk, Martin Zachariasen, Kasper Bonne Rasmussen:
Optimal routing with failure-independent path protection. Networks 55(2): 125-137 (2010) - 2009
- [j21]Marcus Brazil, Martin Zachariasen:
Steiner trees for fixed orientation metrics. J. Glob. Optim. 43(1): 141-169 (2009) - [j20]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) - 2007
- [j18]Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen:
Bounding component sizes of two-connected Steiner networks. Inf. Process. Lett. 104(5): 159-163 (2007) - [c11]Kenneth Hvam, Line Blander Reinhardt, Pawel Winter, Martin Zachariasen:
Some Structural and Geometric Properties of Two-Connected Steiner Networks. CATS 2007: 85-90 - [c10]Laurent Flindt Muller, Martin Zachariasen:
Fast and Compact Oracles for Approximate Distances in Planar Graphs. ESA 2007: 657-668 - 2006
- [j17]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) - 2005
- [j15]Marcus Brazil, Pawel Winter, Martin Zachariasen:
Flexibility of Steiner trees in uniform orientation metrics. Networks 46(3): 142-153 (2005) - [j14]Pawel Winter, Martin Zachariasen:
Two-connected Steiner networks: structural properties. Oper. Res. Lett. 33(4): 395-402 (2005) - 2004
- [j13]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) - [c7]Mikkel Sigurd, Martin Zachariasen:
Construction of Minimum-Weight Spanners. ESA 2004: 797-808 - [c6]Martin Paluszewski, Pawel Winter, Martin Zachariasen:
A new paradigm for general architecture routing. ACM Great Lakes Symposium on VLSI 2004: 202-207 - [c5]Marcus Brazil, Pawel Winter, Martin Zachariasen:
Flexibility of Steiner Trees in Uniform Orientation Metrics. ISAAC 2004: 196-208 - 2003
- [j11]Oluf Faroe, David Pisinger, Martin Zachariasen:
Guided Local Search for Final Placement in VLSI Design. J. Heuristics 9(3): 269-295 (2003) - [j10]Oluf Faroe, David Pisinger, Martin Zachariasen:
Guided Local Search for the Three-Dimensional Bin-Packing Problem. INFORMS J. Comput. 15(3): 267-283 (2003) - 2002
- [j8]Pawel Winter, Martin Zachariasen, Jens Nielsen:
Short trees in polygons. Discret. Appl. Math. 118(1-2): 55-72 (2002) - [j7]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) - [c4]Benny K. Nielsen, Pawel Winter, Martin Zachariasen:
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. ESA 2002: 760-771 - 2001
- [c3]Oluf Faroe, David Pisinger, Martin Zachariasen:
Local Search for Final Placement in VLSI Design. ICCAD 2001: 565-572 - 1999
- [j4]Martin Zachariasen, Pawel Winter:
Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica 25(4): 418-437 (1999) - [c2]Martin Zachariasen, Pawel Winter:
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. ALENEX 1999: 282-295 - [c1]David M. Warme, Pawel Winter, Martin Zachariasen:
Exact Solutions to Large-scale Plane Steiner Tree Problems. SODA 1999: 979-980 - 1997
- [j1]Pawel Winter, Martin Zachariasen:
Euclidean Steiner minimum trees: An improved exact algorithm. Networks 30(3): 149-166 (1997)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint