Homepage

Arash Farzan

Max-Planck-Institut für Informatik
Department D1: Algorithms and Complexity
Campus E1 4, Room 320
66123 Saarbrücken
Germany

Email: afarzan [AT] mpi-inf [DOT] mpg [DOT] de
Phone: +49 681 9325 120
Fax: +49 681 9325 199

Research Interests

(Space-efficient) data structures
External-memory algorithms and data structures
Computational Geometry

Selected publications

Arash Farzan, Shahin Kamali: Compact Navigation and Distance Oracles for Graphs with Small Treewidth. Accepted to ICALP'11.
Arash Farzan, J. Ian Munro: Succinct Representation of Dynamic Trees. TCS 412(24), pp. 2668-2678.
Arash Farzan, Travis Gagie, Gonzalo Navarro: Entropy-Bounded Representation of Point Grids. ISAAC 2010: To appear.
Guy E. Blelloch, Arash Farzan: Succinct Representations of Separable Graphs. CPM 2010: 138-150.
Arash Farzan, J. Ian Munro: Dynamic Succinct Ordered Trees. ICALP 2009: 439-450.
Arash Farzan, Rajeev Raman, S. Srinivasa Rao: Universal Succinct Representations of Trees? ICALP 2009: 451-462.
Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala: Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance. WADS 2009: 218-22.
Arash Farzan, J. Ian Munro: Succinct Representations of Arbitrary Graphs. ESA 2008: 393-404.
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh: Evaluation of General Set Expressions. ISAAC 2008: 366-377.
Arash Farzan, J. Ian Munro: A Uniform Approach Towards Succinct Representation of Trees. SWAT 2008: 173-184.
Peyman Afshani, Arash Farzan: Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. CCCG 2007: 153-155.
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh: On the Complexity of Finding an Unknown Cut Via Vertex Queries. COCOON 2007: 459-469.
Sonia Waharte, Arash Farzan, Raouf Boutaba: Min-Max Congestion in Interference-Prone Wireless Mesh Networks. ICC 2007: 3746-3751.
Arash Farzan, J. Ian Munro: Succinct representation of finite abelian groups. ISSAC 2006: 87-92.
Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro: Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316.
Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh: Worst Case Optimal Union-Intersection Expression Evaluation. ICALP 2005: 179-190.