default search action
Martin Zachariasen
Person information
- affiliation: University of Copenhagen, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [p1]Teresa Gomes
, Lúcia Martins
Enhancing Availability for Critical Services. Guide to Disaster-Resilient Communication Networks 2020: 557-581
2010 – 2019
- 2019
- [j30]Marcus Brazil, Marcus Volz, Martin Zachariasen
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. Comput. Geom. 78: 37-49 (2019) - [j29]Marcus Brazil
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. Networks 73(1): 89-103 (2019) - [c16]Luis Garrote
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
Vulnerable Regions of Networks on Sphere. RNDM 2018: 1-8 - 2014
- [j27]Jørgen Thorlund Haahr, Thomas R. Stidsen
Heuristic methods for single link shared backup path protection. J. Heuristics 20(5): 539-560 (2014) - [j26]Marcus Brazil
The Uniform Orientation Steiner Tree Problem is NP-Hard. Int. J. Comput. Geom. Appl. 24(2): 87-106 (2014) - [c14]Pimin Konstantin Kefaloukos, Marcos Antonio Vaz Salles, Martin Zachariasen
Declarative cartography: In-database map generalization of geospatial datasets. ICDE 2014: 1024-1035 - 2012
- [c13]Pimin Konstantin Kefaloukos, Marcos Antonio Vaz Salles, Martin Zachariasen
TileHeat: a framework for tile selection. SIGSPATIAL/GIS 2012: 349-358 - [c12]Jørgen Thorlund Haahr, Thomas R. Stidsen
Heuristic methods for shared backup path protection planning. ICUMT 2012: 712-718 - 2010
- [j25]Hans Skov-Petersen
Have a nice trip: an algorithm for identifying excess routes under satisfaction constraints. Int. J. Geogr. Inf. Sci. 24(11): 1745-1758 (2010) - [j24]Sebastian Maier, Petur Zachariassen, Martin Zachariasen
Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study. Manag. Sci. 56(2): 373-387 (2010) - [j23]Thomas R. Stidsen
Optimal routing with failure-independent path protection. Networks 55(2): 125-137 (2010)
2000 – 2009
- 2009
- [j22]Ulrike Leopold-Wildburger, Gerhard-Wilhelm Weber
OR for better management of sustainable development. Eur. J. Oper. Res. 193(3): 647-648 (2009) - [j21]Marcus Brazil
Steiner trees for fixed orientation metrics. J. Glob. Optim. 43(1): 141-169 (2009) - [j20]Marcus Brazil
A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees. Networks 53(2): 104-111 (2009) - 2007
- [j19]Stefan Pickl, Gerhard-Wilhelm Weber
Editorial. Central Eur. J. Oper. Res. 15(3): 221-222 (2007) - [j18]Kenneth Hvam, Line Blander Reinhardt
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 - [c9]Günter Rote, Martin Zachariasen:
Matrix scaling by network flow. SODA 2007: 848-854 - 2006
- [j17]Marcus Brazil
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. Algorithmica 44(4): 281-300 (2006) - [j16]Martin Zachariasen
Comment on "Computing the Shortest Network under a Fixed Topology". IEEE Trans. Computers 55(6): 783-784 (2006) - 2005
- [j15]Marcus Brazil
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) - [c8]Kristoffer Jensen, Jieping Xu, Martin Zachariasen:
Rhythm-Based Segmentation of Popular Chinese Music. ISMIR 2005: 374-380 - 2004
- [j13]Marcus Brazil
Rotationally optimal spanning and Steiner trees in uniform orientation metrics. Comput. Geom. 29(3): 251-263 (2004) - [j12]Sven Peyer, Martin Zachariasen
Delay-related secondary objectives for rectilinear Steiner minimum trees. Discret. Appl. Math. 136(2-3): 271-298 (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
Guided Local Search for Final Placement in VLSI Design. J. Heuristics 9(3): 269-295 (2003) - [j10]Oluf Faroe, David Pisinger
Guided Local Search for the Three-Dimensional Bin-Packing Problem. INFORMS J. Comput. 15(3): 267-283 (2003) - [j9]Martin Zachariasen
Rectilinear group Steiner trees and applications in VLSI design. Math. Program. 94(2-3): 407-433 (2003) - 2002
- [j8]Pawel Winter, Martin Zachariasen
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
- [j6]Giri Narasimhan
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. ACM J. Exp. Algorithmics 6: 6 (2001) - [j5]Martin Zachariasen
A catalog of Hanan grid problems. Networks 38(2): 76-83 (2001) - [c3]Oluf Faroe, David Pisinger
Local Search for Final Placement in VLSI Design. ICCAD 2001: 565-572
1990 – 1999
- 1999
- [j4]Martin Zachariasen
Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. Algorithmica 25(4): 418-437 (1999) - [j3]Martin Zachariasen
Local search for the Steiner tree problem in the Euclidean plane. Eur. J. Oper. Res. 119(2): 282-300 (1999) - [j2]Martin Zachariasen:
Rectilinear full Steiner tree generation. Networks 33(2): 125-143 (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)
Coauthor Index
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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: