@article{PhysRevB.81.245318,
  added-at = {2012-02-13T22:12:33.000+0100},
  author = {Li, Xiaobo and Maute, Kurt and Dunn, Martin L. and Yang, Ronggui},
  biburl = {http://www.bibsonomy.org/bibtex/22e1d034bea32aa861653f64ef9a52133/fhrleroy},
  description = {Phys. Rev. B 81, 245318 (2010): Strain effects on the thermal conductivity of nanostructures},
  doi = {10.1103/PhysRevB.81.245318},
  interhash = {c8f61b13c6c6cef3fd680c1755abc23c},
  intrahash = {2e1d034bea32aa861653f64ef9a52133},
  issue = {24},
  journal = {Phys. Rev. B},
  keywords = {Heat-Transfer-Solids Heat-Transfer},
  month = jun,
  numpages = {11},
  pages = 245318,
  publisher = {American Physical Society},
  title = {Strain effects on the thermal conductivity of nanostructures},
  url = {http://link.aps.org/doi/10.1103/PhysRevB.81.245318},
  volume = 81,
  year = 2010
}

@electronic{noauthororeditor2009learning,
  abstract = {What are the differences between learning design and instructional design?  Is it the approach?  The breadth?  The focus?  The audience?  Or is a just a new term for the same thing?},
  added-at = {2012-02-13T17:04:22.000+0100},
  author = {Siedlaczek, Kathy and Conole, Gráinne and Castañeda, Linda and Galley, Rebecca and Passos, Rosario and Owen, Martin and Ryberg, Thomas and Low, Alfred and Hill, LeRoy and Cross, Simon},
  biburl = {http://www.bibsonomy.org/bibtex/203f74a32e09a85175c4c08e49d434405/yish},
  interhash = {9310ef190862742fc48b413a752dcf07},
  intrahash = {03f74a32e09a85175c4c08e49d434405},
  keywords = {learning instructional education design cloudworks},
  title = {Learning Design vs. Instructional Design},
  type = {Cloudworks discussion},
  url = {http://cloudworks.ac.uk/cloud/view/2536},
  year = 2009
}

@techreport{accgghmmnprvvw-ccg-07,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Atienza, Nieves and de Castro, Natalia and Cort\'{e}s, Carmen and Garrido, M. {\'A}ngeles and Grima, Clara I. and Hern\'{a}ndez, Gregorio and M\'{a}rquez, Alberto and Moreno, Auxiliadora and N\"{o}llenburg, Martin and Portillo, Jos{\'e} Ramon and Reyes, Pedro and Valenzuela, Jes\'{u}s and Villar, Maria Trinidad and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2a65bd74407e3b645e9e81beb6c6298f7/awolff},
  institution = {Fakult{\"a}t f{\"u}r Informatik, 
                Universit{\"a}t Karlsruhe},
  interhash = {76715ce79d1f606c23a3d704a80ab695},
  intrahash = {a65bd74407e3b645e9e81beb6c6298f7},
  keywords = {myown},
  month = sep,
  note = {Available at \path|http://www.ubka.uni-karlsruhe.de/indexer-vvv/ira/2007/18|},
  number = {2007-18},
  pdf = {http://www.ubka.uni-karlsruhe.de/vvv/ira/2007/18/18.pdf},
  precedes = {accgghmmnprvvw-ccg-08},
  title = {Cover Contact Graphs},
  type = {Technical report},
  url = {http://www.ubka.uni-karlsruhe.de/indexer-vvv/ira/2007/18},
  year = 2007
}

@inproceedings{accgghmmnprvvw-ccg-08,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Atienza, Nieves and de Castro, Natalia and Cort\'{e}s, Carmen and Garrido, M. {\'A}ngeles and Grima, Clara I. and Hern\'{a}ndez, Gregorio and M\'{a}rquez, Alberto and Moreno, Auxiliadora and N\"{o}llenburg, Martin and Portillo, Jos{\'e} Ramon and Reyes, Pedro and Valenzuela, Jes\'{u}s and Villar, Maria Trinidad and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2177212e71192397ccfdb9d392c7c596a/awolff},
  booktitle = {Proc. 15th Int. Sympos. Graph Drawing (GD'07)},
  doi = {10.1007/978-3-540-77537-9_18},
  editor = {Hong, Seok-Hee and Nishizeki, Takao and Quan, Wu},
  interhash = {5828aef569d755ecb923fccd5e69a938},
  intrahash = {177212e71192397ccfdb9d392c7c596a},
  keywords = {myown gd-info1},
  location = {Sydney},
  pages = {171--182},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/accgghmmnprvvw-ccg-08.pdf},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  succeeds = {accgghmmnprvvw-ccg-07},
  title = {Cover Contact Graphs},
  url = {http://dx.doi.org/10.1007/978-3-540-77537-9_18},
  volume = 4875,
  year = 2008
}

@misc{bbbnosw-dcbth-08,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Buchin, Kevin and Buchin, Maike and Byrka, Jaroslaw and N\"ollenburg, Martin and Okamoto, Yoshio and Silveira, Rodrigo I. and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/26abd4c7f466c21a027853f23890047b6/awolff},
  eprint = {arXiv:0806.0920},
  howpublished = {Arxiv report},
  interhash = {6af11fd04994c1ea0d351a93c8652b52},
  intrahash = {6abd4c7f466c21a027853f23890047b6},
  keywords = {myown},
  month = jun,
  note = {Available at http://arxiv.org/abs/0806.0920},
  title = {Drawing (Complete) Binary Tanglegrams: Hardness, 
                  Approximation, Fixed-Parameter Tractability},
  url = {http://arxiv.org/abs/0806.0920},
  year = 2008
}

@inproceedings{bbbnosw-dcbth-09,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Buchin, Kevin and Buchin, Maike and Byrka, Jaroslaw and N\"ollenburg, Martin and Okamoto, Yoshio and Silveira, Rodrigo I. and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2c69ec7f2555f7c901be7ef9ef1fcc6b9/awolff},
  booktitle = {Proc. 16th Int. Sympos. Graph Drawing (GD'08)},
  confmonth = {sep},
  editor = {Tollis, Ioannis G. and Patrignani, Maurizio},
  interhash = {a11159e567dbce151eadc4432ea953c8},
  intrahash = {c69ec7f2555f7c901be7ef9ef1fcc6b9},
  keywords = {myown},
  location = {Hersonissos, Crete},
  pages = {324--335},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bbbnosw-dcbth-09.pdf},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  slides = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/slides/bbbnosw-dcbth-09-slides.ppt},
  title = {Drawing (Complete) Binary Tanglegrams: Hardness,
                  Approximation, Fixed-Parameter Tractability},
  url = {http://dx.doi.org/10.1007/978-3-642-00219-9_32},
  volume = 5417,
  year = 2009
}

@article{bbbnosw-dcbth-12,
  abstract = {A \emph{binary tanglegram} is a drawing of a pair
                  \ttree{S,T} of rooted binary trees whose leaf sets
                  are in one-to-one correspondence; matching leaves
                  are connected by inter-tree edges.  For
                  applications, for example, in phylogenetics, it is
                  essential that both trees are drawn without edge
                  crossings and that the inter-tree edges have as few
                  crossings as possible.  It is known that finding a
                  tanglegram with the minimum number of crossings is
                  NP-hard and that the problem is fixed-parameter
                  tractable with respect to that number. \par We prove
                  that under the Unique Games Conjecture there is no
                  constant-factor approximation for binary trees.  We
                  show that the problem is NP-hard even if both trees
                  are complete binary trees.  For this case we give an
                  $O(n^3)$-time 2-approximation and a new, simple
                  fixed-parameter algorithm.  We show that the
                  maximization version of the dual problem for binary
                  trees can be reduced to a version of \textsc{MaxCut}
                  for which the algorithm of Goemans and Williamson
                  yields a $0.878$-approximation.},
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Buchin, Kevin and Buchin, Maike and Byrka, Jaroslaw and N\"ollenburg, Martin and Okamoto, Yoshio and Silveira, Rodrigo I. and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2790ba3e44de947044ca570be288437c8/awolff},
  doi = {10.1007/s00453-010-9456-3},
  interhash = {fddc301a40472d551cdc26af416276dd},
  intrahash = {790ba3e44de947044ca570be288437c8},
  journal = {Algorithmica},
  keywords = {myown gd-info1 fixed-parameter_tractability binary_tanglegrams approximation_algorithm NP-hardness},
  number = {1--2},
  pages = {309--332},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bbbnosw-dcbth-12.pdf},
  slides = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/slides/bbbnosw-dbtha-09-slides.ppt},
  title = {Drawing (Complete) Binary Tanglegrams: Hardness,
                  Approximation, Fixed-Parameter Tractability},
  url = {http://dx.doi.org/10.1007/s00453-010-9456-3},
  volume = 62,
  year = 2012
}

@inproceedings{bnpw-oarcd-08,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Been, Ken and N{\"o}llenburg, Martin and Poon, Sheung-Hung and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/26c0fea03cb193af20a2a231ebbec219e/awolff},
  booktitle = {Proc. 24th Annu. ACM
                  Sympos. Comput. Geom. (SoCG'08)},
  confmonth = {jun},
  doi = {10.1145/1377676.1377681},
  interhash = {ecb78764f9d781f098fdc6e51cfff20d},
  intrahash = {6c0fea03cb193af20a2a231ebbec219e},
  keywords = {myown},
  location = {College Park, MD},
  pages = {10--19},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bnpw-oarcd-08.pdf},
  slides = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/slides/bnpw-oarcd-08-slides.pdf},
  title = {Optimizing Active Ranges for Consistent Dynamic Map
                  Labeling},
  url = {http://dl.acm.org/authorize?087167},
  url2 = {http://dx.doi.org/10.1145/1377676.1377681},
  year = 2008
}

@article{bnpw-oarcd-10,
  abstract = {Map labeling encounters unique issues in the context
                  of dynamic maps with continuous zooming and
                  panning---an application with increasing practical
                  importance.  In \emph{consistent} dynamic map
                  labeling, distracting behavior such as popping and
                  jumping is avoided.  We use a model for consistent
                  dynamic labeling in which a label is represented by
                  a 3d-solid, with scale as the third dimension.  Each
                  solid can be truncated to a single scale interval,
                  called its \emph{active range}, corresponding to the
                  scales at which the label will be selected.  The
                  \emph{active range optimization (ARO)} problem is to
                  select active ranges so that no two truncated solids
                  intersect and the sum of the heights of the active
                  ranges is maximized.  \emph{Simple} ARO is a variant
                  in which the active ranges are restricted so that a
                  label is never deselected when zooming in.  We
                  investigate both the general and simple variants,
                  for 1d- as well as 2d-maps.  \par Different label
                  shapes define different ARO variants.  We show that
                  2d-ARO and general 1d-ARO are NP-complete, even for
                  quite simple shapes.  We solve simple 1d-ARO
                  optimally with dynamic programming, and present a
                  toolbox of algorithms that yield constant-factor
                  approximations for a number of 1d- and 2d-variants.},
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Been, Ken and N{\"o}llenburg, Martin and Poon, Sheung-Hung and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/27ccaafa79a52ab8517852e9e68d786fe/awolff},
  doi = {10.1016/j.comgeo.2009.03.006},
  interhash = {7addff7292ae362e286e35ac5e8fe02c},
  intrahash = {7ccaafa79a52ab8517852e9e68d786fe},
  journal = {Computational Geometry: Theory and Applications},
  keywords = {myown map_labeling dynamic consistent approximation_algorithm active_range_optimization NP-hardness},
  number = 3,
  pages = {312--328},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bnpw-oarcd-10.pdf},
  succeeds = {bnpw-oarcd-08},
  title = {Optimizing Active Ranges for Consistent Dynamic Map
                  Labeling},
  url = {http://dx.doi.org/10.1016/j.comgeo.2009.03.006},
  volume = 43,
  year = 2010
}

@inproceedings{bnpw-oarcdml-08,
  added-at = {2012-02-13T15:23:25.000+0100},
  address = {Nancy},
  author = {Been, Ken and N{\"o}llenburg, Martin and Poon, Sheung-Hung and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2b5000d5626e47111ffaa13935630370f/awolff},
  booktitle = {Proc. 24th European Workshop on Computational
                  Geometry (EuroCG'08)},
  confmonth = {mar},
  editor = {Petitjean, Silvain},
  interhash = {ecb78764f9d781f098fdc6e51cfff20d},
  intrahash = {b5000d5626e47111ffaa13935630370f},
  keywords = {myown},
  pages = {55--58},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bnpw-oarcdml-08.pdf},
  title = {Optimizing Active Ranges for Consistent Dynamic Map
                  Labeling},
  year = 2008
}

@inproceedings{bnuw-miecw-07,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Benkert, Marc and N{\"o}llenburg, Martin and Uno, Takeaki and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/20ded3818bc7705e9018b54dc3542e919/awolff},
  booktitle = {Proc. 14th Int. Sympos. Graph Drawing (GD'06)},
  confmonth = {{18--20~}#sep},
  doi = {10.1007/978-3-540-70904-6_27},
  editor = {Kaufmann, Michael and Wagner, Dorothea},
  interhash = {312cc5507015b0f4c6b9a2502c2c4bb7},
  intrahash = {0ded3818bc7705e9018b54dc3542e919},
  keywords = {myown gd-info1},
  location = {Karlsruhe, Germany},
  pages = {270--281},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/bnuw-miecw-07.pdf},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {Minimizing Intra-Edge Crossings in Wiring Diagrams
                  and Public Transport Maps},
  url = {http://dx.doi.org/10.1007/978-3-540-70904-6_27},
  volume = 4372,
  year = 2007
}

@inproceedings{fhmsw-dgvsp-12,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Fink, Martin and Haunert, Jan-Henrik and Mchedlidze, Tamara and Spoerhase, Joachim and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2ee095532f8ffd461579f17c9537e0989/awolff},
  booktitle = {Proc. Workshop Algorithms Comput. (WALCOM'12)},
  editor = {Rahman, Md. Saidur and ichi Nakano, Shin},
  interhash = {6d60510e4a3f549e0cf9f18ff618b6ad},
  intrahash = {ee095532f8ffd461579f17c9537e0989},
  keywords = {myown gd-info1},
  pages = {186--197},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  title = {Drawing Graphs with Vertices at Specified Positions
                  and Crossings at Large Angles},
  url = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/fhmsw-dgvsp-12.pdf},
  volume = 7157,
  year = 2012
}

@inproceedings{fhmsw-dgvsp-12p,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Fink, Martin and Haunert, Jan-Henrik and Mchedlidze, Tamara and Spoerhase, Joachim and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/207d37c2721976605fe7f29c71639ef56/awolff},
  booktitle = {Proc. 19th Int. Sympos. Graph Drawing (GD'11)},
  doi = {10.1007/978-3-642-25878-7_43},
  editor = {van Kreveld, Marc and Speckmann, Bettina},
  interhash = {6d60510e4a3f549e0cf9f18ff618b6ad},
  intrahash = {07d37c2721976605fe7f29c71639ef56},
  keywords = {myown gd-info1},
  note = {Poster},
  pages = {441--442},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/fhmsw-dgvsp-12p.pdf},
  poster = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/posters/fhmsw-dgvsp-12p-poster.pdf},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  slides = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/slides/fhmsw-dgvsp-12p-slides.pdf},
  title = {Drawing Graphs with Vertices at Specified Positions
                  and Crossings at Large Angles},
  url = {http://dx.doi.org/10.1007/978-3-642-25878-7_43},
  volume = 7034,
  year = 2012
}

@inproceedings{mnwb-mplst-07,
  added-at = {2012-02-13T15:23:25.000+0100},
  address = {Maynooth, Ireland},
  author = {Merrick, Damian and N{\"o}llenburg, Martin and Wolff, Alexander and Benkert, Marc},
  biburl = {http://www.bibsonomy.org/bibtex/2cf820f3e79800ee65b8a53f2811d31dd/awolff},
  booktitle = {Proc. 15th Annu. Geograph. Inform. Sci. Research
                  Conf. UK (GISRUK'07)},
  confmonth = {apr},
  interhash = {84262ce7c83ed0d0a5c4d3ceffe75c4e},
  intrahash = {cf820f3e79800ee65b8a53f2811d31dd},
  keywords = {myown},
  pages = {390--399},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/mnwb-mplst-07.pdf},
  pdf2 = {http://ncg.nuim.ie/gisruk/materials/proceedings/PDF/7A1.pdf},
  title = {Morphing Polygonal Lines: A Step Towards Continuous
                  Generalization},
  url = {http://ncg.nuim.ie/gisruk/materials/proceedings/},
  year = 2007
}

@inproceedings{mnwb-mplst-07a,
  added-at = {2012-02-13T15:23:25.000+0100},
  address = {Graz},
  author = {Merrick, Damian and N{\"o}llenburg, Martin and Wolff, Alexander and Benkert, Marc},
  biburl = {http://www.bibsonomy.org/bibtex/2fc5aae0ab8a2ce1f677286bc8ae01886/awolff},
  booktitle = {Proc. 23rd European Workshop on Computational
                  Geometry (EWCG'07)},
  confmonth = {mar},
  editor = {Aichholzer, Oswin and Hackl, Thomas},
  interhash = {84262ce7c83ed0d0a5c4d3ceffe75c4e},
  intrahash = {fc5aae0ab8a2ce1f677286bc8ae01886},
  keywords = {myown},
  pages = {6--9},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/mnwb-mplst-07a.pdf},
  title = {Morphing Polygonal Lines: A Step Towards Continuous
                  Generalization},
  year = 2007
}

@article{mnwb-mpstc-08,
  abstract = {We study the problem of morphing between two
                  polylines that represent linear geographical
                  features like roads or rivers generalized at two
                  different scales. This problem occurs frequently
                  during continuous zooming in interactive
                  maps. Situations in which generalization operators
                  like typification and simplification replace, for
                  example, a series of consecutive bends by fewer
                  bends are not always handled well by traditional
                  morphing algorithms. We attempt to cope with such
                  cases by modeling the problem as an optimal
                  correspondence problem between characteristic parts
                  of each polyline. A dynamic programming algorithm is
                  presented that solves the matching problem in
                  $O(nm)$ time, where $n$ and $m$ are the respective
                  numbers of characteristic parts of the two
                  polylines. In a case study we demonstrate that the
                  algorithm yields good results when being applied to
                  data from mountain roads, a river and a region
                  boundary at various scales.},
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {Merrick, Damian and N{\"o}llenburg, Martin and Wolff, Alexander and Benkert, Marc},
  biburl = {http://www.bibsonomy.org/bibtex/276cb5fed357bd5e3a771da1b2f8dca90/awolff},
  doi = {10.1016/j.compenvurbsys.2008.06.004},
  interhash = {736979c3ca51527ca201892085548718},
  intrahash = {76cb5fed357bd5e3a771da1b2f8dca90},
  journal = {Computers, Environment and Urban Systems},
  keywords = {myown mykeypub morphing line_simplification dynamic_programming continuous_generalization},
  number = 4,
  pages = {248--260},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/mnwb-mpstc-08.pdf},
  succeeds = {mnwb-mplst-07a},
  title = {Morphing Polylines: A Step Towards Continuous
                  Generalization},
  url = {http://dx.doi.org/10.1016/j.compenvurbsys.2008.06.004},
  volume = 32,
  year = 2008
}

@inproceedings{nvwh-dbtee-09,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {N{\"o}llenburg, Martin and V{\"o}lker, Markus and Wolff, Alexander and Holten, Danny},
  biburl = {http://www.bibsonomy.org/bibtex/29edf033790b12a0c42fac3da4dfa364f/awolff},
  booktitle = {Proc. 11th Workshop Algorithm Engineering and
                  Experiments (ALENEX'09)},
  interhash = {7da0b5bb258f6dd18d5d3df5b24dc261},
  intrahash = {9edf033790b12a0c42fac3da4dfa364f},
  keywords = {myown gd-info1},
  pages = {106--119},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/nvwh-dbtee-09.pdf},
  pdf2 = {http://www.siam.org/proceedings/alenex/2009/alx09_011_nollenburgm.pdf},
  slides = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/slides/nvwh-dbtee-09-slides.pdf},
  title = {Drawing Binary Tanglegrams: An Experimental
                  Evaluation},
  url = {http://www.siam.org/proceedings/alenex/2009/alenex09.php},
  year = 2009
}

@article{nw-dlhqm-11,
  abstract = {Metro maps are schematic diagrams of public
                  transport networks that serve as visual aids for
                  route planning and navigation tasks. It is a
                  challenging problem in network visualization to
                  automatically draw appealing metro maps. There are
                  two aspects to this problem that depend on each
                  other: the layout problem of finding station and
                  link coordinates and the labeling problem of placing
                  non-overlapping station labels. \par In this paper
                  we present a new integral approach that solves the
                  combined layout and labeling problem (each of which,
                  independently, is known to be NP-hard) using
                  mixed-integer programming (MIP). We identify seven
                  design rules used in most real-world metro maps.  We
                  split these rules into hard and soft constraints and
                  translate them into a MIP model. Our MIP formulation
                  finds a metro map that satisfies all hard
                  constraints (if such a drawing exists) and minimizes
                  a weighted sum of costs that correspond to the soft
                  constraints.  We have implemented the MIP model and
                  present a case study and the results of an expert
                  assessment to evaluate the performance of our
                  approach in comparison to both manually designed
                  official maps and results of previous layout
                  methods.},
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {N{\"o}llenburg, Martin and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/2e928b80335aa36e954d2d93af300d933/awolff},
  doi = {10.1109/TVCG.2010.81},
  interhash = {7b99b573079bd16d9437003a39312a6a},
  intrahash = {e928b80335aa36e954d2d93af300d933},
  jourmonth = {may},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {octilinear_layout network_visualization myown mykeypub mixed-integer_programming metro_map graph_labeling graph_drawing gd-info1},
  number = 5,
  pages = {626--641},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/nw-dlhqm-10.pdf},
  succeeds = {nw-mipdh-06},
  title = {Drawing and Labeling High-Quality Metro Maps by
                  Mixed-Integer Programming},
  url = {http://dx.doi.org/10.1109/TVCG.2010.81},
  volume = 17,
  year = 2011
}

@inproceedings{nw-mipdh-06,
  added-at = {2012-02-13T15:23:25.000+0100},
  author = {N{\"o}llenburg, Martin and Wolff, Alexander},
  biburl = {http://www.bibsonomy.org/bibtex/257ecd0d852b3e101b876489f5fceed9a/awolff},
  booktitle = {Proc. 13th Int. Sympos. Graph Drawing (GD'05)},
  confmonth = {{12--14~}#sep},
  doi = {10.1007/11618058_29},
  editor = {Healy, Patrick and Nikolov, Nikola S.},
  interhash = {b051e8d43f4c1b497bff93902e663c54},
  intrahash = {57ecd0d852b3e101b876489f5fceed9a},
  keywords = {myown},
  location = {Limerick, Ireland},
  pages = {321--333},
  pdf = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/pub/nw-mipdh-06.pdf},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  slides = {http://www1.informatik.uni-wuerzburg.de/pub/wolff/slides/nw-mipdh-06-slides.pdf},
  title = {A Mixed-Integer Program for Drawing High-Quality
                  Metro Maps},
  url = {http://dx.doi.org/10.1007/11618058_29},
  volume = 3843,
  year = 2006
}

@book{metzig2010lernen,
  added-at = {2012-02-13T09:58:26.000+0100},
  address = {Berlin [u.a.]},
  author = {Metzig, Werner and Schuster, Martin},
  biburl = {http://www.bibsonomy.org/bibtex/2e7379ba6a66c37c7e80dc03276c1f236/ulger},
  interhash = {f01c0dff826f22c1b6bb63501bac97ba},
  intrahash = {e7379ba6a66c37c7e80dc03276c1f236},
  isbn = {9783642031120 3642031129},
  keywords = {lernen scientific},
  publisher = {Springer},
  refid = {552445546},
  title = {Lernen zu lernen : Lernstrategien wirkungsvoll einsetzen ; [Lernstrategien - sofort anwendbar ; die richtige Methode für jeden Lernstoff ; Tipps zur Prüfungsvorbereitung]},
  url = {http://www.worldcat.org/search?qt=worldcat_org_all&q=9783642031120},
  year = 2010
}