<
From version < 35.1 >
edited by ssm
on 2014/09/02 10:39
To version < 36.1 >
edited by cds
on 2014/09/15 13:35
>
Change comment: There is no comment for this version

Summary

Details

Page properties
Author
... ... @@ -1,1 +1,1 @@
1 -XWiki.ssm
1 +XWiki.cds
Content
... ... @@ -1,5 +1,11 @@
1 -Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we could do together.
1 +Here's a selection of possible bachelor and master topics. If you're interested in one of them, don't hesitate to contact us! We'll sit down, have tea, and talk about what we great things we could do together.
2 2  
3 +**On this Page**
4 +
5 +
6 +
7 +{{toc/}}
8 +
3 3  = Bachelor Topics =
4 4  
5 5  == Graph Layout ==
... ... @@ -8,7 +8,9 @@
8 8  The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for. 
9 9  * **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-891"}}KIPRA-891{{/jira}}Layering Algorithms**
10 10  Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout.
11 -* **Integrate KIML with JGraph**
17 +* Tight Packing of Connected Components
18 +Different connected components of a graph are often laid out separately and combined again afterwards. This combination step often produces too much whitespace. Research relevant 2D packing literature and implement a better solution.
19 +* **{{jira columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" jqlQuery="key in (KIPRA-1262,KIPRA-1031)" source="jql" maximumIssues="20"}}key in (KIPRA-1262,KIPRA-1031){{/jira}}Integrate KIML with JGraph**
12 12  Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.
13 13  * **{{jira showSummary="true" columns="key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution" id="KIELER JIRA" serverId="2851bd34-0bf1-3f02-ab12-7d77ccab0fae" key="KIPRA-1214"}}KIPRA-1214{{/jira}}Improved Edge Label Placement**
14 14  Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement...
... ... @@ -65,8 +65,6 @@
65 65  
66 66  == Modeling Pragmatics ==
67 67  
68 -
69 -
70 70  * **Diagram Description Language**
71 71  Developing the concepts and implementation of a diagram description language based on Klighd, with SyncCharts as application example.
72 72  
Confluence.Code.ConfluencePageClass[0]
Id
... ... @@ -1,1 +1,1 @@
1 -9471821
1 +9471823
URL
... ... @@ -1,1 +1,1 @@
1 -https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/9471821/Topics for Student Theses
1 +https://rtsys.informatik.uni-kiel.de/confluence//wiki/spaces/RTSYS/pages/9471823/Topics for Student Theses