Nicole Eggemann
From MaRDI portal
Person:412350
Available identifiers
zbMath Open eggemann.nicoleMaRDI QIDQ412350
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| Non-searchability of random scale-free graphs | 2014-03-13 | Paper |
| Minimizing the oriented diameter of a planar graph | 2013-10-10 | Paper |
| The complexity of two graph orientation problems | 2012-05-04 | Paper |
| The clustering coefficient of a scale-free random graph | 2011-06-28 | Paper |
| \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\) | 2010-11-05 | Paper |
Research outcomes over time
This page was built for person: Nicole Eggemann
