Non-Searchability of Random Power-Law Graphs. - Philippe Duchon; Nicole Eggemann; Nicolas Hanusse (OPODIS, 2007)

Non-searchability of random scale-free graphs. - Philippe Duchon; Nicole Eggemann; Nicolas Hanusse (PODC, 2007)

Minimizing the Oriented Diameter of a Planar Graph. - Nicole Eggemann; Steven D. Noble (Electron. Notes Discret. Math., 2009)

k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. - Nicole Eggemann; Frédéric Havet; Steven D. Noble (Discret. Appl. Math., 2010)

The clustering coefficient of a scale-free random graph. - Nicole Eggemann; Steven D. Noble (Discret. Appl. Math., 2011)

The complexity of two graph orientation problems. - Nicole Eggemann; Steven D. Noble (Discret. Appl. Math., 2012)