 | 2012 |
|---|
| 6 |       | Nicole Eggemann,
Steven D. Noble:
The complexity of two graph orientation problems.
Discrete Applied Mathematics 160(4-5): 513-517 (2012) |
| 2011 |
|---|
| 5 | | Nicole Eggemann,
Steven D. Noble:
The clustering coefficient of a scale-free random graph.
Discrete Applied Mathematics 159(10): 953-965 (2011) |
| 2010 |
|---|
| 4 | | Nicole Eggemann,
Frédéric Havet,
Steven D. Noble:
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4.
Discrete Applied Mathematics 158(16): 1777-1788 (2010) |
| 2009 |
|---|
| 3 | | Nicole Eggemann,
Steven D. Noble:
Minimizing the Oriented Diameter of a Planar Graph.
Electronic Notes in Discrete Mathematics 34: 267-271 (2009) |
| 2007 |
|---|
| 2 | | Philippe Duchon,
Nicole Eggemann,
Nicolas Hanusse:
Non-Searchability of Random Power-Law Graphs.
OPODIS 2007: 274-285 |
| 1 | | Philippe Duchon,
Nicole Eggemann,
Nicolas Hanusse:
Non-searchability of random scale-free graphs.
PODC 2007: 380-381 |
Data released under the ODC-BY 1.0 license — See also our legal information page