Publications (the ones related to my current research interests):

• E. Chiniforooshan, V. Chvátal, L. Devroye, "Random branching," in preparation.
• A. Bondy, E. Chiniforooshan, V. Chvátal, "Lines in hypergraphs," in preparation.
• L. Beaudou, E. Chiniforooshan, V. Chvátal, "Finite convexity generated by betweenness," in preparation.
• E. Chiniforooshan, A. Farzan, M. Mirzazadeh, "A super adaptive algorithm for evaluating set expressions," in preparation.
• N. Alon, E. Chiniforooshan, V. Chvátal, F. Genest, "Another abstraction of the Erdös-Szekeres Happy End Theorem," submitted.
• A. Bonato, E. Chiniforooshan, P. Pralat, "Cops and robbers from a distance," submitted.
• E. Chiniforooshan, "Testing graph and hypergraph properties using edge queries," submitted.
• E. Chiniforooshan, V. Chvátal, "A de Bruijn-Erdös theorem and metric spaces," arXiv:0906.0123v1 [math.CO].
• E. Chiniforooshan, B. Wu, "Maximum values of Szeged index and edge-Szeged index of graphs," to appear in European Conference on Combinatorics, Graph Theory and Applications (EuroComb'09), 2009.
• A. Bonato, E. Chiniforooshan, "Pursuit and evasion from a distance: algorithms and bounds," Workshop on Analytic Algorithmics and Combinatorics (ANALCO'09), 2009.
• E. Chiniforooshan, "A better bound for the cop number of general graphs," Journal of Graph Theory, vol 58, No. 1, pp 45-48, 2008.
• E. Chiniforooshan, A. Farzan, M. Mirzazadeh, "Evaluation of general set expressions," The 19th International Symposium on Algorithms and Computation (ISAAC'08), 2008.
• P. Afshani, E. Chiniforooshan, R. Dorrigiv, A. Farzan, M. Mirzazadeh, N. Simjour, H. Zarrabi-Zadeh, "On the complexity of finding an unknown cut via vertex queries," The 13th Annual International Computing and Combinatorics Conference (COCOON'07), 2007.
• E. Chiniforooshan, A. Farzan, M. Mirzazadeh, "Worst case optimal union-intersection expression evaluation," The 32th International Colloquium on Automata, Languages and Programming (ICALP'05), 2005.