Babak Farzad

According to our database1, Babak Farzad authored at least 16 papers between 2005 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Backbone colourings of graphs.
Discret. Math., 2016

A Human Communication Network Model.
Proceedings of the 12th International Conference on ICT in Education, 2016

Dynamics of large scale networks following a merger.
Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2016

2015
Three-colourability of planar graphs with no 5- or triangular {3, 6}-cycles.
Electron. Notes Discret. Math., 2015

A hierarchical network formation model.
Electron. Notes Discret. Math., 2015

2014
Social and Economic Network Formation: A Dynamic Model.
Proceedings of the Combinatorial Optimization and Applications, 2014

2012
Random Lifts of $K_5\backslashe$ are 3-Colorable.
SIAM J. Discret. Math., 2012

Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem
CoRR, 2012

Complexity of Finding Graph Roots with Girth Conditions.
Algorithmica, 2012

2009
Planar Graphs without 7-Cycles Are 4-Choosable.
SIAM J. Discret. Math., 2009

The chromatic number of random lifts of K<sub>5</sub> e.
Electron. Notes Discret. Math., 2009

On the edge-density of 4-critical graphs.
Comb., 2009

Computing Graph Roots Without Short Cycles.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
A Priority-Based Model of Routing.
Chic. J. Theor. Comput. Sci., 2008

2005
On colourings of graphs.
PhD thesis, 2005

(<i>Delta-k</i>)-critical graphs.
J. Comb. Theory B, 2005


  Loading...