 | 2009 |
|---|
| 36 |       | Mostafa Nouri,
Mohammad Ghodsi:
Space-Query-Time Tradeoff for Computing the Visibility Polygon.
FAW 2009: 120-131 |
| 2008 |
|---|
| 35 | | Mohammad Ghodsi,
Hamid Mahini,
Vahab S. Mirrokni,
Morteza Zadimoghaddam:
Permutation betting markets: singleton betting with extra information.
ACM Conference on Electronic Commerce 2008: 180-189 |
| 34 |  | Mojtaba Nouri Bygi,
Mohammad Ghodsi:
Polar Diagram of Moving Objects.
CCCG 2008 |
| 33 | | Ramtin Khosravi,
Mohammad Ghodsi:
Visiting a Polygon on the Optimal Way to a Query Point.
FAW 2008: 245-251 |
| 32 | | Shervin Daneshpajouh,
Mojtaba Mohammadi Nasiri,
Mohammad Ghodsi:
A Fast Community Based Algorithm for Generating Web Crawler Seeds Set.
WEBIST (2) 2008: 98-105 |
| 31 | | Alireza Zarei,
Mohammad Ghodsi:
Query point visibility computation in polygons with holes.
Comput. Geom. 39(2): 78-90 (2008) |
| 30 | | Farshad Rostamabadi,
Iman Sadeghi,
Mohammad Ghodsi,
Ramtin Khosravi:
Optimal point removal in closed-2PM labeling.
Inf. Process. Lett. 105(3): 108-113 (2008) |
| 2007 |
|---|
| 29 | | Seyed Iman Mirrezaei,
Javad Shahparian,
Mohammad Ghodsi:
RAQNet: A Topology-Aware Overlay Network.
AIMS 2007: 13-24 |
| 28 | | AmirAli Khosravi,
Alireza Zarei,
Mohammad Ghodsi:
Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon.
CCCG 2007: 249-252 |
| 27 | | Mostafa Nouri,
Alireza Zarei,
Mohammad Ghodsi:
Weak Visibility of Two Objects in Planar Polygonal Scenes.
ICCSA (1) 2007: 68-81 |
| 26 | | Hoda Akbari,
Zeinab Iranmanesh,
Mohammad Ghodsi:
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs.
ICPADS 2007: 1-8 |
| 25 | | Hassan Sayyadi,
Sara Salehi,
Mohammad Ghodsi:
Using Similarity Flooding for Extracting Similar Parts of Proteins.
IMECS 2007: 497-503 |
| 24 | | Sina Jafarpour,
Mohammad Ghodsi,
Keyvan Sadri,
Zuheir Montazeri:
Computational Power of the Quantum Turing Automata.
ITNG 2007: 1077-1082 |
| 23 | | Erik D. Demaine,
Mohammad Ghodsi,
Mohammad Taghi Hajiaghayi,
Amin S. Sayedi-Roshkhar,
Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption.
SPAA 2007: 46-54 |
| 22 | | Mohammad Ghodsi,
Hamid Mahini,
Kian Mirjalali,
Shayan Oveis Gharan,
Amin S. Sayedi-Roshkhar,
Morteza Zadimoghaddam:
Spanning trees with minimum weighted degrees.
Inf. Process. Lett. 104(3): 113-116 (2007) |
| 21 | | Ramtin Khosravi,
Mohammad Ghodsi:
Query-point visibility constrained shortest paths in simple polygons.
Theor. Comput. Sci. 389(1-2): 1-11 (2007) |
| 2006 |
|---|
| 20 | | Alireza Mahdian,
Hamid Khalili,
Ehsan Nourbakhsh,
Mohammad Ghodsi:
Web Graph Compression by Edge Elimination.
DCC 2006: 459 |
| 19 | | Mohammad Ali Abam,
Mohammad Ghodsi:
An approximation algorithm for d1-optimal motion of a rod robot with fixed rotations.
Int. J. Comput. Math. 83(3): 357-370 (2006) |
| 18 | | Farshad Rostamabadi,
Mohammad Ghodsi:
Label updating to avoid point-shaped obstacles in fixed model.
Theor. Comput. Sci. 369(1-3): 197-210 (2006) |
| 17 | | Ghassem Jaberipur,
Behrooz Parhami,
Mohammad Ghodsi:
An Efficient Universal Addition Scheme for All Hybrid-Redundant Representations with Weighted Bit-Set Encoding.
VLSI Signal Processing 42(2): 149-158 (2006) |
| 2005 |
|---|
| 16 | | Hossein Jowhari,
Mohammad Ghodsi:
New Streaming Algorithms for Counting Triangles in Graphs.
COCOON 2005: 710-716 |
| 15 | | Mohammad Ghodsi,
Oktie Hassanzadeh,
Shahab Kamali,
Morteza Monemizadeh:
A Hybrid Approach for Refreshing Web Page Repositories.
DASFAA 2005: 588-593 |
| 14 | | Farshad Rostamabadi,
Mohammad Ghodsi:
An efficient algorithm for label updating in 2PM model to avoid a moving object.
EWCG 2005: 131-134 |
| 13 | | Ramtin Khosravi,
Mohammad Ghodsi:
The fastest way to view a query point in simple polygons.
EWCG 2005: 187-190 |
| 12 | | Saeed Alaei,
Mohammad Toossi,
Mohammad Ghodsi:
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data.
ISAAC 2005: 298-307 |
| 11 | | Hamid Nazerzadeh,
Mohammad Ghodsi:
RAQ: A Range-Queriable Distributed Data Structure.
SOFSEM 2005: 269-277 |
| 10 | | Alireza Zarei,
Mohammad Ghodsi:
Efficient computation of query point visibility in polygons with holes.
Symposium on Computational Geometry 2005: 314-320 |
| 2004 |
|---|
| 9 | | Farshad Rostamabadi,
Mohammad Ghodsi:
A fast algorithm for updating a labeling to avoid a moving point.
CCCG 2004: 204-208 |
| 8 | | Ramtin Khosravi,
Mohammad Ghodsi:
Shortest paths in simple polygons with polygon-meet constraints.
Inf. Process. Lett. 91(4): 171-176 (2004) |
| 2003 |
|---|
| 7 | | Behdad Esfahbod,
Mohammad Ghodsi,
Ali Sharifi:
Common-Deadline Lazy Bureaucrat Scheduling Problems.
WADS 2003: 59-66 |
| 6 | | Arash Termehchy,
Mohammad Ghodsi:
Pipelined operator tree scheduling in heterogeneous environments.
J. Parallel Distrib. Comput. 63(6): 630-637 (2003) |
| 2002 |
|---|
| 5 | | Mohammad Ghodsi,
Mohammad Taghi Hajiaghayi,
Mohammad Mahdian,
Vahab S. Mirrokni:
Length-constrained path-matchings in graphs.
Networks 39(4): 210-215 (2002) |
| 1998 |
|---|
| 4 | | Mohammad Ghodsi,
Jörg-Rüdiger Sack:
A coarse grained parallel solution to terrain simplification.
CCCG 1998 |
| 1991 |
|---|
| 3 | | Mohammad Ghodsi,
Krishna Kant:
Well-formed generalized task graphs.
SPDP 1991: 344-351 |
| 2 | | Mohammad Ghodsi,
Krishna Kant:
Performance Analysis of Parallel Search Algorithms on Multiprocessor Systems.
Perform. Eval. 13(1): 67-81 (1991) |
| 1990 |
|---|
| 1 | | Mohammad Ghodsi,
Krishna Kant:
Performance Analysis of Parallel Search Algorithms on Multiprocessors.
Performance 1990: 407-421 |
