Nicole Eggemann

According to our database, Nicole Eggemann authored at least 6 papers between 2007 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2012

The complexity of two graph orientation problems.

Nicole Eggemann, Steven D. Noble

Discret. Appl. Math., 2012

2011

The clustering coefficient of a scale-free random graph.

Nicole Eggemann, Steven D. Noble

Discret. Appl. Math., 2011

2010

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

2009

Minimizing the Oriented Diameter of a Planar Graph.

Nicole Eggemann, Steven D. Noble

Electron. Notes Discret. Math., 2009

2007

Non-searchability of random scale-free graphs.

Philippe Duchon, Nicole Eggemann, Nicolas Hanusse

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Non-Searchability of Random Power-Law Graphs.

Philippe Duchon, Nicole Eggemann, Nicolas Hanusse

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007