Nicole Eggemann

k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4

Frédéric Havet, Nicole Eggemann, Steven D. Noble, 2010, Discret. Appl. Math..

Minimizing the Oriented Diameter of a Planar Graph

Nicole Eggemann, Steven D. Noble, S. D. Noble, 2009, Electron. Notes Discret. Math..

The complexity of two graph orientation problems

Nicole Eggemann, Steven D. Noble, Nicole Eggemann, 2010, Discret. Appl. Math..

Non-searchability of random scale-free graphs

Philippe Duchon, Nicolas Hanusse, Nicole Eggemann, 2007, PODC '07.

Non-Searchability of Random Power-Law Graphs

Philippe Duchon, Nicolas Hanusse, Nicole Eggemann, 2007, OPODIS.

The clustering coefficient of a scale-free random graph

Nicole Eggemann, Steven D. Noble, S. D. Noble, 2008, Discret. Appl. Math..