@inproceedings{aulbach2014dgwra,
  abstract = {We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the general (undirected) case and for the use case of (directed) \emph{calculation graphs} which are used to analyze the typical mistakes that high school students make when transforming mathematical expressions in the process of calculating, for example, sums of fractions.},
  added-at = {2014-07-23T01:20:33.000+0200},
  author = {Aulbach, Maximilian and Fink, Martin and Schuhmann, Julian and Wolff, Alexander},
  biburl = {https://www.bibsonomy.org/bibtex/2187e9e5deef874dfed06e402d8216f09/fink},
  booktitle = {Proceedings of the 22nd International Symposium on Graph Drawing (GD '14)},
  editor = {Duncan, Christian and Symvonis, Antonios},
  interhash = {2fc9ca71b7d4db5a69ca2621eebf891c},
  intrahash = {187e9e5deef874dfed06e402d8216f09},
  keywords = {area drawing graphs myown restricted},
  pages = {367-379},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  timestamp = {2015-03-04T01:21:27.000+0100},
  title = {Drawing Graphs within Restricted Area},
  url = {http://dx.doi.org/10.1007/978-3-662-45803-7_31},
  volume = 8871,
  year = 2014
}