Publication
Found 2 results
Filters: Author is Mohammad Mahdian [Clear All Filters]
Visibility testing and counting for uncertain segments,
, Theoretical Computer Science, 08/2019, Volume 779, p.1-7, (2019)
Length-constrained path-matchings in graphs,
, Networks, Volume 39, Number 4, p.210–215, (2002)
Useful links
Join our Google Group Now!
GET IN TOUCH WITH US
Contact us
Sharif University of Technology, Department of Computer Engineering
Room 712, CE Algorithms Lab
P.O. Box 11155-9517, Tehran, Iran
Tel: +9821-6616-6675
Education - This is a contributing Drupal Theme
Design by WeebPal.
Design by WeebPal.