NodeShuffler/doc/doc.bib

@incollection{brandes_fast_2001,
	series = {Lecture {Notes} in {Computer} {Science}},
	title = {Fast and {Simple} {Horizontal} {Coordinate} {Assignment}},
	isbn = {978-3-540-43309-5 978-3-540-45848-7},
	abstract = {We present a simple, linear-time algorithm to determine horizontal coordinates in layered layouts subject to a given ordering within each layer. The algorithm is easy to implement and compares well with existing approaches in terms of assignment quality.},
	language = {english},
	urldate = {2018-06-09},
	booktitle = {Graph {Drawing}},
	publisher = {Springer, Berlin, Heidelberg},
	author = {Brandes, Ulrik and Köpf, Boris},
	month = sep,
	year = {2001},
	doi = {10.1007/3-540-45848-4_3},
	pages = {31--44},
	file = {Full Text PDF:C\:\\Users\\Eren\\Zotero\\storage\\C6DKECDB\\Brandes and Köpf - 2001 - Fast and Simple Horizontal Coordinate Assignment.pdf:application/pdf}
}

@misc{leary_json-java:_2018,
	title = {{JSON}-java: {A} reference implementation of a {JSON} package in {Java}},
	copyright = {MIT},
	shorttitle = {{JSON}-java},
	url = {https://github.com/stleary/JSON-java},
	author = {Leary, Sean and Crockford, Douglas},
	month = jun,
	year = {2018}
}

@article{sugiyama_methods_1981,
	title = {Methods for {Visual} {Understanding} of {Hierarchical} {System} {Structures}},
	volume = {11},
	issn = {0018-9472},
	doi = {10.1109/TSMC.1981.4308636},
	abstract = {Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods. The methods determine the positions of vertices in two steps. First the order of the vertices in each level is determined to reduce the number of crossings of edges. Then horizontal positions of the vertices are determined to improve further the readability of drawings. The theoretical methods are useful in recognizing the nature of the problem, and the heuristic methods make it possible to enlarge the size of hierarchies with which we can deal. Performance tests of the heuristic methods and several applications are presented.},
	number = {2},
	journal = {IEEE Transactions on Systems, Man, and Cybernetics},
	author = {Sugiyama, K. and Tagawa, S. and Toda, M.},
	month = feb,
	year = {1981},
	keywords = {Testing, Computer displays, Constraint theory, Engineering drawings, Flowcharts, Hierarchical systems, Image recognition, Information science, Processor scheduling, Programming},
	pages = {109--125}
}

@misc{noauthor_elk:_2018,
	title = {{ELK}: {Eclipse} {Layout} {Kernel} - {Automatic} layout for {Java} applications},
	copyright = {EPL-1.0},
	shorttitle = {{ELK}},
	url = {https://github.com/eclipse/elk},
	publisher = {Eclipse Foundation},
	month = jun,
	year = {2018}
}

@mastersthesis{carstens_node_2012,
	address = {Kiel},
	title = {Node and {Label} {Placement} in a {Layered} {Layout} {Algorithm}},
	abstract = {In graphical modelling, the arrangement of diagram elements can be a tiresome and mechanic work. To free users from this, layout algorithms arrange the diagram elements automatically. Different modelling domains require different layouts. A layout approach suitable for data flow diagrams is the layered layout approach. This approach is structured in several phases, of which one is called node placement. Present implementations are known to produce many edge bends. One task of this thesis is to employ a node placement algorithm which yields significantly less edge bends. Another well known problem in layout algorithms is label placement. Present approaches rely on a post-processing by placing labels after the diagram has been laid out. The approaches presented in this thesis integrate label placement into the layout, resulting in more freedom and clean placements of labels. Evaluation shows that both tasks can be fulfilled, but have to accept a trade-off which is a generally larger drawing of the respective  diagrams.},
	language = {english},
	school = {Christian-Albrechts-Universität zu Kiel},
	author = {Carstens, John Julian},
	month = sep,
	year = {2012},
	file = {Carstens - Node and Label Placement in a Layered Layout Algor.pdf:C\:\\Users\\Eren\\Zotero\\storage\\AE9E539E\\Carstens - Node and Label Placement in a Layered Layout Algor.pdf:application/pdf}
}