Search the dblp DataBase
Martin Zachariasen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Martin Zachariasen , Pawel Winter Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm. [Citation Graph (0, 0)][DBLP ] ALENEX, 1999, pp:282-295 [Conf ] Benny K. Nielsen , Pawel Winter , Martin Zachariasen An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] ESA, 2002, pp:760-771 [Conf ] Mikkel Sigurd , Martin Zachariasen Construction of Minimum-Weight Spanners. [Citation Graph (0, 0)][DBLP ] ESA, 2004, pp:797-808 [Conf ] Martin Paluszewski , Pawel Winter , Martin Zachariasen A new paradigm for general architecture routing. [Citation Graph (0, 0)][DBLP ] ACM Great Lakes Symposium on VLSI, 2004, pp:202-207 [Conf ] Oluf Faroe , David Pisinger , Martin Zachariasen Local Search for Final Placement in VLSI Design. [Citation Graph (0, 0)][DBLP ] ICCAD, 2001, pp:565-572 [Conf ] Marcus Brazil , Pawel Winter , Martin Zachariasen Flexibility of Steiner Trees in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:196-208 [Conf ] Kristoffer Jensen , Jieping Xu , Martin Zachariasen Rhythm-Based Segmentation of Popular Chinese Music. [Citation Graph (0, 0)][DBLP ] ISMIR, 2005, pp:374-380 [Conf ] David M. Warme , Pawel Winter , Martin Zachariasen Exact Solutions to Large-scale Plane Steiner Tree Problems. [Citation Graph (0, 0)][DBLP ] SODA, 1999, pp:979-980 [Conf ] Marcus Brazil , D. A. Thomas , J. F. Weng , Martin Zachariasen Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:44, n:4, pp:281-300 [Journal ] Martin Zachariasen , Pawel Winter Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1999, v:25, n:4, pp:418-437 [Journal ] Marcus Brazil , Benny K. Nielsen , Pawel Winter , Martin Zachariasen Rotationally optimal spanning and Steiner trees in uniform orientation metrics. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2004, v:29, n:3, pp:251-263 [Journal ] Sven Peyer , Martin Zachariasen , David Grove Jørgensen Delay-related secondary objectives for rectilinear Steiner minimum trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:271-298 [Journal ] Pawel Winter , Martin Zachariasen , Jens Nielsen Short trees in polygons. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:118, n:1-2, pp:55-72 [Journal ] Oluf Faroe , David Pisinger , Martin Zachariasen Guided Local Search for Final Placement in VLSI Design. [Citation Graph (0, 0)][DBLP ] J. Heuristics, 2003, v:9, n:3, pp:269-295 [Journal ] Oluf Faroe , David Pisinger , Martin Zachariasen Guided Local Search for the Three-Dimensional Bin-Packing Problem. [Citation Graph (0, 0)][DBLP ] INFORMS Journal on Computing, 2003, v:15, n:3, pp:267-283 [Journal ] Benny K. Nielsen , Pawel Winter , Martin Zachariasen On the location of Steiner points in uniformly-oriented Steiner trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2002, v:83, n:5, pp:237-241 [Journal ] Giri Narasimhan , Martin Zachariasen Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions. [Citation Graph (0, 0)][DBLP ] ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:6- [Journal ] Marcus Brazil , Pawel Winter , Martin Zachariasen Flexibility of Steiner trees in uniform orientation metrics. [Citation Graph (0, 0)][DBLP ] Networks, 2005, v:46, n:3, pp:142-153 [Journal ] Pawel Winter , Martin Zachariasen Euclidean Steiner minimum trees: An improved exact algorithm. [Citation Graph (0, 0)][DBLP ] Networks, 1997, v:30, n:3, pp:149-166 [Journal ] Martin Zachariasen A catalog of Hanan grid problems. [Citation Graph (0, 0)][DBLP ] Networks, 2001, v:38, n:2, pp:76-83 [Journal ] Martin Zachariasen Rectilinear full Steiner tree generation. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:33, n:2, pp:125-143 [Journal ] Pawel Winter , Martin Zachariasen Two-connected Steiner networks: structural properties. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2005, v:33, n:4, pp:395-402 [Journal ] Martin Zachariasen Comment on "Computing the Shortest Network under a Fixed Topology". [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 2006, v:55, n:6, pp:783-784 [Journal ] Laurent Flindt Muller , Martin Zachariasen Fast and Compact Oracles for Approximate Distances in Planar Graphs. [Citation Graph (0, 0)][DBLP ] ESA, 2007, pp:657-668 [Conf ] Günter Rote , Martin Zachariasen Matrix scaling by network flow. [Citation Graph (0, 0)][DBLP ] SODA, 2007, pp:848-854 [Conf ] K. Hvam , L. Reinhardt , Pawel Winter , Martin Zachariasen Bounding component sizes of two-connected Steiner networks. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2007, v:104, n:5, pp:159-163 [Journal ] Some Structural and Geometric Properties of Two-Connected Steiner Networks. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.282secs