Babak Farzad - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2016

Dynamics of large scale networks following a mergerJohn Clements, Babak Farzad, Henryk Fuks. asunam 2016: 471-476 [doi]

Backbone colourings of graphsBabak Farzad, Arnoosh Golestanian, Michael Molloy. DM, 339(11):2721-2722, 2016. [doi]

A Human Communication Network ModelOksana Pichugina, Babak Farzad. icteri 2016: 33-40 [doi]

2015

A hierarchical network formation modelOmid Atabati, Babak Farzad. endm, 50:379-384, 2015. [doi]

Three-colourability of planar graphs with no 5- or triangular {3, 6}-cyclesBabak Farzad, Asiyeh Sanaei. endm, 50:409-414, 2015. [doi]

2014

Social and Economic Network Formation: A Dynamic ModelOmid Atabati, Babak Farzad. cocoa 2014: 581-592 [doi]

2012

Random Lifts of $K_5\backslashe$ are 3-ColorableBabak Farzad, Dirk Oliver Theis. siamdm, 26(1):169-176, 2012. [doi]

Complexity of Finding Graph Roots with Girth ConditionsBabak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy. algorithmica, 62(1-2):38-53, 2012. [doi]

2009

Planar Graphs without 7-Cycles Are 4-ChoosableBabak Farzad. siamdm, 23(3):1179-1199, 2009. [doi]

On the edge-density of 4-critical graphsBabak Farzad, Michael Molloy. combinatorica, 29(6):665-689, 2009. [doi]

The chromatic number of random lifts of K::5:: eBabak Farzad, Dirk Oliver Theis. endm, 35:311-316, 2009. [doi]

Computing Graph Roots Without Short CyclesBabak Farzad, Lap Chi Lau, Van Bang Le, Nguyen Ngoc Tuy. STACS 2009: 397-408 [doi]

2008

A Priority-Based Model of RoutingBabak Farzad, Neil Olver, Adrian Vetta. cjtcs, 2008, 2008. [doi]

2005

(::::Delta-k::::)-critical graphsBabak Farzad, Michael S. O. Molloy, Bruce A. Reed. JCT, 93(2):173-185, 2005. [doi]

On colourings of graphsBabak Farzad. PhD thesis, University of Toronto, Canada, 2005. [doi]

Sign in or sign up to see more results.

runs on WebDSL