Up a level |
2008
Estrella-Balderrama, Alejandro, Gassner, Elisabeth, Jünger, Michael, Percan, Merijam, Schaefer, Marcus and Schulz, Michael (2008). Simultaneous Geometric Graph Embeddings. In: Graph drawing : 15th international symposium, GD 2007, Sydney, Australia, September 24 - 26, 2007 ; revised papers, pp. 280-290. Springer.
2007
Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Kandyba, Maria, Percan, Merijam and Schulz, Michael (2007). Planarization With Fixed Subgraph Embedding. Working Paper.
Buchheim, Christoph ORCID: 0000-0001-9974-404X, Jünger, Michael, Percan, Merijam, Schulz, Michael and Thelen, Christina (2007). Drawing cycles in networks. Working Paper.
Percan, Merijam (2007). Constrained Planarity and Augmentation Problems. PhD thesis, Universität zu Köln.
2006
Gassner, Elisabeth, Jünger, Michael, Percan, Merijam, Schaefer, Marcus and Schulz, Michael (2006). Simultaneous Graph Embeddings with Fixed Edges. In: Graph-theoretic concepts in computer science : 32nd international workshop, WG 2006, Bergen, Norway, June 22 - 24, 2006 ; revised papers, pp. 325-335. Springer.
Gassner, Elisabeth and Percan, Merijam (2006). Maximum Planar Subgraph on Graphs not Contractive to K5 or K3,3. Working Paper.
2003
Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Jünger, Michael and Weiskircher, René (2003). Subgraph Induced Connectivity Augmentation. In: Graph-theoretic concepts in computer science : 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19 - 21, 2003 ; revised papers, pp. 261-272. Springer.
2002
Gutwenger, Carsten, Leipert, Sebastian, Mutzel, Petra ORCID: 0000-0001-7621-971X, Percan, Merijam, Weiskircher, René and Jünger, Michael (2002). Advances in C-Planarity Testing of Clustered Graphs (Extended Abstract). In: Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26 - 28, 2002 ; revised papers, pp. 220-336. Springer.
Jünger, Michael, Leipert, Sebastian and Percan, Merijam (2002). Triangulating Clustered Graphs. Working Paper.