default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohammad Ghodsi
Person information
- affiliation: Sharif University of Technology, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j53]Sepideh Aghamolaei
, Mohammad Ghodsi:
Explainable graph clustering via expanders in the massively parallel computation model. Inf. Sci. 677: 120897 (2024)- 2023
- [j52]Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi, Ali Mohades:
Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings. Int. J. Data Sci. Anal. 15(2): 201-216 (2023) - [c64]Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi:
Reflective Guarding a Gallery. WALCOM 2023: 78-89 - [i30]Nazanin Hadiniya, Mohammad Ghodsi:
A parallel algorithm for Delaunay triangulation of moving points on the plane. CoRR abs/2308.06484 (2023) - [i29]Sepideh Aghamolaei, Mohammad Ghodsi:
An Efficient Construction of Yao-Graph in Data-Distributed Settings. CoRR abs/2308.15065 (2023) - [i28]Sepideh Aghamolaei, Mohammad Ghodsi:
A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem. CoRR abs/2309.00242 (2023) - [i27]Sepideh Aghamolaei, Mohammad Ghodsi:
A 2-Approximation Algorithm for Data-Distributed Metric k-Center. CoRR abs/2309.04327 (2023) - [i26]Sepideh Aghamolaei, Mohammad Ghodsi:
Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering. CoRR abs/2309.07486 (2023) - [i25]Arash Vaezi, Mahdi Cheraghchi, Seyed Mohammad Hussein Kazemi, Negin Bagheri Noghrehy, Seyed Mohsen Kazemi, Ali Movaghar, Mohammad Ghodsi:
Where Quantum Complexity Helps Classical Complexity. CoRR abs/2312.14075 (2023) - 2022
- [j51]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair allocation of indivisible goods: Beyond additive valuations. Artif. Intell. 303: 103633 (2022) - [j50]Amin Heydari Alashti, Ahmad Asgharian Rezaei, Alireza Elahi, Sobhan Sayyaran, Mohammad Ghodsi:
Parsisanj: an automatic component-based approach toward search engine evaluation. J. Supercomput. 78(8): 10690-10711 (2022) - [i24]Seyed Mohammad Hussein Kazemi, Arash Vaezi, Mohammad Ghodsi:
Trajectory Range Visibility. CoRR abs/2209.04013 (2022) - 2021
- [j49]Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades, Mohammad Ghodsi:
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model. Fundam. Informaticae 184(3): 205-231 (2021) - [j48]Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. J. ACM 68(3): 19:1-19:41 (2021) - [j47]Masoud Seddighin, Mohamad Latifian, Mohammad Ghodsi:
On the Distortion Value of Elections with Abstention. J. Artif. Intell. Res. 70: 567-595 (2021) - [j46]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement. Math. Oper. Res. 46(3): 1038-1053 (2021) - [j45]Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi:
Maximin share guarantee for goods with positive externalities. Soc. Choice Welf. 56(2): 291-324 (2021) - [j44]Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi, Ali Mohades:
Windowing queries using Minkowski sum and their extension to MapReduce. J. Supercomput. 77(1): 936-972 (2021) - [j43]Mahdi Boroujeni, Mohammad Ghodsi, Saeed Seddighin:
Improved MPC Algorithms for Edit Distance and Ulam Distance. IEEE Trans. Parallel Distributed Syst. 32(11): 2764-2776 (2021) - [c63]Azadeh Tabatabaei, Farehe Soheil, Mohammad Aletaha, Mohammad Ghodsi:
Integer Cow-path Problem and Simple Robot Street Search. CCCG 2021: 388-398 - [i23]Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi:
Art Gallery Plus Single Specular-reflection. CoRR abs/2108.10940 (2021) - [i22]Vahideh Keikha, Sepideh Aghamolaei, Ali Mohades, Mohammad Ghodsi:
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model. CoRR abs/2111.13989 (2021) - [i21]Mohammad Ghodsi, Amirmahdi Mirfakhar:
Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits. CoRR abs/2111.14387 (2021) - [i20]Arash Vaezi, Mohammad Ghodsi:
A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery. CoRR abs/2112.01104 (2021) - 2020
- [j42]Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi:
Covering orthogonal polygons with sliding k-transmitters. Theor. Comput. Sci. 815: 163-181 (2020) - [j41]Salma Sadat Mahdavi, Mohammad Ghodsi:
Clearing an orthogonal polygon to find the evaders. Theor. Comput. Sci. 847: 175-184 (2020) - [i19]Sepideh Aghamolaei, Mohammad Ghodsi:
Approximating p-Mean Curve of Large Data-Sets. CoRR abs/2005.06672 (2020) - [i18]Amin Heydari Alashti, Ahmad Asgharian Rezaei, Alireza Elahi, Sobhan Sayyaran, Mohammad Ghodsi:
Parsisanj: a semi-automatic component-based approach towards search engine evaluation. CoRR abs/2009.12097 (2020) - [i17]Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi:
Visibility Extension via Reflection. CoRR abs/2011.03107 (2020) - [i16]Sepideh Aghamolaei, Vahideh Keikha, Mohammad Ghodsi, Ali Mohades:
Computing The Packedness of Curves. CoRR abs/2012.04403 (2020)
2010 – 2019
- 2019
- [j40]Masoud Seddighin, Majid Farhadi, Mohammad Ghodsi, Reza Alijani, Ahmad S. Tajik:
Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts. Algorithmica 81(4): 1728-1755 (2019) - [j39]Alireza Farhadi, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. J. Artif. Intell. Res. 64: 1-20 (2019) - [j38]Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian:
Visibility testing and counting for uncertain segments. Theor. Comput. Sci. 779: 1-7 (2019) - [j37]Arash Vaezi, Mohammad Ghodsi:
Visibility extension via mirror-edges to cover invisible segments. Theor. Comput. Sci. 789: 22-33 (2019) - [c62]Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin:
On the Distortion Value of the Elections with Abstention. AAAI 2019: 1981-1988 - [c61]Sepideh Aghamolaei, Mohammad Ghodsi, Seyyedhamid Miri:
A MapReduce Algorithm for Metric Anonymity Problems. CCCG 2019: 117-123 - [c60]Mahdi Boroujeni, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Saeed Seddighin:
1+ε approximation of tree edit distance in quadratic time. STOC 2019: 709-720 - [c59]Masoud Seddighin, Hamed Saleh, Mohammad Ghodsi:
Externalities and Fairness. WWW 2019: 538-548 - [i15]Sepideh Aghamolaei, Mohammad Ghodsi:
A Composable Coreset for k-Center in Doubling Metrics. CoRR abs/1902.01896 (2019) - 2018
- [j36]Mojtaba Nouri Bygi, Mohammad Ghodsi:
Weak visibility queries of line segments in simple polygons and polygonal domains. Int. J. Comput. Math. 95(4): 721-738 (2018) - [j35]Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:
Randomized approximation algorithms for planar visibility counting problem. Theor. Comput. Sci. 707: 46-55 (2018) - [c58]Sepideh Aghamolaei, Mohammad Ghodsi:
A Composable Coreset for k-Center in Doubling Metrics. CCCG 2018: 165-171 - [c57]Mohammad Ghodsi, Mohamad Latifian, Arman Mohammadi, Sadra Moradian, Masoud Seddighin:
Rent Division Among Groups. COCOA 2018: 577-591 - [c56]Sepideh Aghamolaei, Fatemeh Baharifard, Mohammad Ghodsi:
Geometric Spanners in the MapReduce Model. COCOON 2018: 675-687 - [c55]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvements and Generalizations. EC 2018: 539-556 - [c54]Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. SODA 2018: 1170-1189 - [i14]Mahdi Boroujeni, Soheil Ehsani, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce. CoRR abs/1804.04178 (2018) - [i13]Mohammad Ghodsi, Hamed Saleh, Masoud Seddighin:
Fair Allocation of Indivisible Items With Externalities. CoRR abs/1805.06191 (2018) - [i12]Arash Vaezi, Mohammad Ghodsi:
Visibility Extension via Reflective Edges to an Exact Quantity. CoRR abs/1811.07649 (2018) - [i11]Mohammad Ghodsi, Mohamad Latifian, Masoud Seddighin:
On the Distortion Value of the Elections with Abstention. CoRR abs/1812.09851 (2018) - 2017
- [c53]Reza Alijani, Majid Farhadi, Mohammad Ghodsi, Masoud Seddighin, Ahmad S. Tajik:
Envy-Free Mechanisms with Minimum Number of Cuts. AAAI 2017: 312-318 - [c52]Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohammad Ghodsi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. AAMAS 2017: 1535-1537 - [c51]Mohammad Ali Abam, Sharareh Alipour, Mohammad Ghodsi, Mohammad Mahdian:
Visibility Testing and Counting for Uncertain Segments. CCCG 2017: 84-88 - [c50]Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Approximate Minimum Diameter. COCOON 2017: 237-249 - [c49]Arash Vaezi, Mohammad Ghodsi:
How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments. WALCOM 2017: 42-53 - [i10]Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Sébastien Lahaie, David M. Pennock, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods to Asymmetric Agents. CoRR abs/1703.01649 (2017) - [i9]Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Approximate Minimum Diameter. CoRR abs/1703.10976 (2017) - [i8]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Hadi Yami:
Fair Allocation of Indivisible Goods: Improvement and Generalization. CoRR abs/1704.00222 (2017) - 2016
- [j34]Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari:
Optimal space coverage with white convex polygons. J. Comb. Optim. 32(2): 341-353 (2016) - [j33]Nima Anari, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari:
Euclidean movement minimization. J. Comb. Optim. 32(2): 354-367 (2016) - [c48]Azadeh Tabatabaei, Fardin Shapouri, Mohammad Ghodsi:
A Competitive Strategy for Walking in Generalized Streets for a Simple Robot. CCCG 2016: 75-79 - [c47]Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:
An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem. COCOON 2016: 209-221 - [i7]Sharareh Alipour, Mohammad Ghodsi, Amir Jafari:
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem. CoRR abs/1605.03542 (2016) - [i6]Mohammad Ghodsi, Salma Sadat Mahdavi, Ali Narenji Sheshkalani:
Clearing an Orthogonal Polygon Using Sliding Robots. CoRR abs/1607.03039 (2016) - 2015
- [j32]Ehsan Shoja, Mohammad Ghodsi:
GPU-based parallel algorithm for computing point visibility inside simple polygons. Comput. Graph. 49: 1-9 (2015) - [j31]Sharareh Alipour, Mohammad Ghodsi, Alireza Zarei, Maryam Pourreza:
Visibility testing and counting. Inf. Process. Lett. 115(9): 649-654 (2015) - [j30]Mojtaba Nouri Bygi, Shervin Daneshpajouh, Sharareh Alipour, Mohammad Ghodsi:
Weak visibility counting in simple polygons. J. Comput. Appl. Math. 288: 215-222 (2015) - [j29]Azadeh Tabatabaei, Mohammad Ghodsi:
Walking in streets with minimal sensing. J. Comb. Optim. 30(2): 387-401 (2015) - [j28]Mojtaba Nouri Bygi, Mohammad Ghodsi:
Near optimal line segment queries in simple polygons. J. Discrete Algorithms 35: 51-61 (2015) - [c46]Mohammad Abouei Mehrizi, Mohammad Ghodsi, Azadeh Tabatabaei:
Robots' Cooperation for Finding a Target in Streets. TTCS 2015: 30-43 - [c45]Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin:
Unit Covering in Color-Spanning Set Model. WALCOM 2015: 44-52 - [i5]Azadeh Tabatabaei, Mohammad Ghodsi:
Randomized Strategy for Walking in Streets for a Simple Robot. CoRR abs/1512.01784 (2015) - 2014
- [j27]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri Baygi, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. Comput. Geom. 47(3): 435-446 (2014) - [j26]Mohammad Ali Abam, Shervin Daneshpajouh, Lasse Deleuran, Shayan Ehsani, Mohammad Ghodsi:
Computing homotopic line simplification. Comput. Geom. 47(7): 728-739 (2014) - [j25]MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad:
On non-progressive spread of influence through social networks. Theor. Comput. Sci. 550: 36-50 (2014) - [c44]Salma Sadat Mahdavi, Saeed Seddighin, Mohammad Ghodsi:
Covering Orthogonal Polygons with Sliding k-Transmitters. CCCG 2014 - [c43]Azadeh Tabatabaei, Mohammad Ghodsi:
Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot. COCOA 2014: 101-112 - [c42]Sharareh Alipour, Mohammad Ghodsi, Ugur Güdükbay, Morteza Golkari:
An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing. VISAPP (3) 2014: 699-704 - 2013
- [j24]Mostafa Nouri Baygi, Mohammad Ghodsi:
Space/query-time tradeoff for computing the visibility polygon. Comput. Geom. 46(3): 371-381 (2013) - [j23]Hamed Ghasemieh, Mohammad Ghodsi, Hamid Mahini, Mohammad Ali Safari:
Pricing in population games with semi-rational agents. Oper. Res. Lett. 41(3): 226-231 (2013) - [j22]Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam:
Scheduling to minimize gaps and power consumption. J. Sched. 16(2): 151-160 (2013) - [j21]Nima AhmadiPourAnari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium pricing with positive externalities. Theor. Comput. Sci. 476: 1-15 (2013) - [c41]Azadeh Tabatabaei, Mohammad Ghodsi:
Walking in Streets with Minimal Sensing. COCOA 2013: 361-372 - [i4]Mojtaba Nouri Bygi, Mohammad Ghodsi:
Near Optimal Line Segment Weak Visibility Queries in Simple Polygons. CoRR abs/1309.7803 (2013) - [i3]Mojtaba Nouri Bygi, Mohammad Ghodsi:
Weak Visibility Queries of Line Segments in Simple Polygons and Polygonal Domains. CoRR abs/1310.7197 (2013) - 2012
- [j20]Alireza Zarei, Mohammad Ghodsi:
Efficient Observer-Dependent Simplification in Polygonal Domains. Algorithmica 62(3-4): 842-862 (2012) - [j19]Shervin Daneshpajouh, Mohammad Ghodsi, Alireza Zarei:
Computing polygonal path simplification under area measures. Graph. Model. 74(5): 283-289 (2012) - [j18]Mostafa Nouri, Mohammad Ghodsi:
Scheduling tasks with exponential duration on unrelated parallel machines. Discret. Appl. Math. 160(16-17): 2462-2473 (2012) - [j17]Shayan Ehsani, Mohammad Ghodsi, Ahmad Khajenezhad, Hamid Mahini, Afshin Nikzad:
Optimal online pricing with network externalities. Inf. Process. Lett. 112(4): 118-123 (2012) - [c40]MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi, Vahab S. Mirrokni, Sina Sadeghian Sadeghabad:
On the Non-progressive Spread of Influence through Social Networks. LATIN 2012: 315-326 - [c39]Mohammad Ghodsi, Anil Maheshwari, Mostafa Nouri, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh:
α-Visibility. SWAT 2012: 1-12 - [c38]Mohsen Sayyadiharikandeh, Mohammad Ghodsi, Mohammad Naghibi:
PostRank: a new algorithm for incremental finding of persian blog representative words. WIMS 2012: 17:1-17:6 - 2011
- [j16]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60(4): 853-876 (2011) - [c37]Mojtaba Nouri Bygi, Mohammad Ghodsi:
Weak Visibility Queries in Simple Polygons. CCCG 2011 - [c36]MohammadAmin Fazli, MohammadAli Safari, Nima Anari, Pooya Jalaly Khalilabadi, Mohammad Ghodsi:
Euclidean Movement Minimization. CCCG 2011 - [c35]Shervin Daneshpajouh, Mohammad Ghodsi:
A Heuristic Homotopic Path Simplification Algorithm. ICCSA (3) 2011: 132-140 - [c34]Shayan Ehsani, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari, Morteza Saghafian, Mohammad Tavakkoli:
White Space Regions. SOFSEM 2011: 226-237 - 2010
- [j15]Farshad Rostamabadi, Mohammad Ghodsi:
Incremental labeling in closed-2PM model. Comput. Electr. Eng. 36(5): 895-901 (2010) - [j14]Saeed Alaei, Mohammad Ghodsi, Mohammad Toossi:
Skiptree: A new scalable distributed data structure on multidimensional data supporting range-queries. Comput. Commun. 33(1): 73-82 (2010) - [c33]Hoda Akbari, Mohammad Ghodsi:
Visibility maintenance of a moving segment observer inside polygons with holes. CCCG 2010: 117-120 - [c32]Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni, Hamid Mahini, Afshin Nikzad:
Optimal Iterative Pricing over Social Networks (Extended Abstract). WINE 2010: 415-423 - [c31]Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium Pricing with Positive Externalities (Extended Abstract). WINE 2010: 424-431
2000 – 2009
- 2009
- [c30]Mostafa Nouri, Mohammad Ghodsi:
Space-Query-Time Tradeoff for Computing the Visibility Polygon. FAW 2009: 120-131 - [c29]Mojtaba Nouri Bygi, Mohammad Ghodsi:
Visibility of a Moving Segment. ICCSA Workshops 2009: 169-176 - [c28]Seyed Iman Mirrezaei, Javad Shahparian, Mohammad Ghodsi:
A topology-aware load balancing algorithm for P2P systems. ICDIM 2009: 98-103 - 2008
- [j13]Alireza Zarei, Mohammad Ghodsi:
Query point visibility computation in polygons with holes. Comput. Geom. 39(2): 78-90 (2008) - [j12]Farshad Rostamabadi, Iman Sadeghi, Mohammad Ghodsi, Ramtin Khosravi:
Optimal point removal in closed-2PM labeling. Inf. Process. Lett. 105(3): 108-113 (2008) - [c27]Mojtaba Nouri Bygi, Mohammad Ghodsi:
Polar Diagram of Moving Objects. CCCG 2008 - [c26]Mohsen Asadi, Ali Niknafs, Mohammad Ghodsi:
An Approximation Algorithm for the k -Level Uncapacitated Facility Location Problem with Penalties. CSICC 2008: 41-49 - [c25]Mojtaba Nouri Bygi, Fatemeh Chitforoush, Maryam Yazdandoost, Mohammad Ghodsi:
Kinetic Polar Diagram. CSICC 2008: 283-290 - [c24]Ehsan Akhgari, Alireza Ziaie, Mohammad Ghodsi:
Sorting on OTIS-Networks. CSICC 2008: 871-875 - [c23]Ramtin Khosravi, Mohammad Ghodsi:
Visiting a Polygon on the Optimal Way to a Query Point. FAW 2008: 245-251 - [c22]Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Permutation betting markets: singleton betting with extra information. EC 2008: 180-189 - [c21]Shervin Daneshpajouh, Mojtaba Mohammadi Nasiri, Mohammad Ghodsi:
A Fast Community Based Algorithm for Generating Web Crawler Seeds Set. WEBIST (2) 2008: 98-105 - 2007
- [j11]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) - [j10]Ramtin Khosravi, Mohammad Ghodsi:
Query-point visibility constrained shortest paths in simple polygons. Theor. Comput. Sci. 389(1-2): 1-11 (2007) - [c20]Seyed Iman Mirrezaei, Javad Shahparian, Mohammad Ghodsi:
RAQNet: A Topology-Aware Overlay Network. AIMS 2007: 13-24 - [c19]Amirali Khosravi, Alireza Zarei, Mohammad Ghodsi:
Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon. CCCG 2007: 249-252 - [c18]Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi:
Weak Visibility of Two Objects in Planar Polygonal Scenes. ICCSA (1) 2007: 68-81 - [c17]Mojtaba Nouri Bygi, Mohammad Ghodsi:
3D Visibility and Partial Visibility Complex. ICCSA Workshops 2007: 208-207 - [c16]Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi:
Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs. ICPADS 2007: 1-8 - [c15]Hassan Sayyadi, Sara Salehi, Mohammad Ghodsi:
Using Similarity Flooding for Extracting Similar Parts of Proteins. IMECS 2007: 497-503 - [c14]Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuheir Montazeri:
Computational Power of the Quantum Turing Automata. ITNG 2007: 1077-1082 - [c13]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 - 2006
- [j9]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) - [j8]Farshad Rostamabadi, Mohammad Ghodsi:
Label updating to avoid point-shaped obstacles in fixed model. Theor. Comput. Sci. 369(1-3): 197-210 (2006) - [j7]Ghassem Jaberipur, Behrooz Parhami, Mohammad Ghodsi:
An Efficient Universal Addition Scheme for All Hybrid-Redundant Representations with Weighted Bit-Set Encoding. J. VLSI Signal Process. 42(2): 149-158 (2006) - [c12]Yasser Ganjisaffar, Kyumars Sheykh Esmaili, Mohammad Ghodsi, Hassan Abolhassani:
Parallel Online Ranking of Web Pages. AICCSA 2006: 104-109 - [c11]Alireza Mahdian, Hamid Khalili, Ehsan Nourbakhsh, Mohammad Ghodsi:
Web Graph Compression by Edge Elimination. DCC 2006: 459 - 2005
- [j6]Behzad Eftekhar, Kazem Mohammad, Hassan Ardebili, Mohammad Ghodsi, Ebrahim Ketabchi:
Comparison of artificial neural network and logistic regression models for prediction of mortality in head trauma based on initial clinical data. BMC Medical Informatics Decis. Mak. 5: 3 (2005) - [j5]Ghassem Jaberipur, Behrooz Parhami, Mohammad Ghodsi:
Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems. IEEE Trans. Circuits Syst. I Regul. Pap. 52-I(7): 1348-1357 (2005) - [c10]Hossein Jowhari, Mohammad Ghodsi:
New Streaming Algorithms for Counting Triangles in Graphs. COCOON 2005: 710-716 - [c9]Alireza Zarei, Mohammad Ghodsi:
Efficient computation of query point visibility in polygons with holes. SCG 2005: 314-320 - [c8]Mohammad Ghodsi, Oktie Hassanzadeh, Shahab Kamali, Morteza Monemizadeh:
A Hybrid Approach for Refreshing Web Page Repositories. DASFAA 2005: 588-593 - [c7]Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi:
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data. ISAAC 2005: 298-307 - [c6]Hamid Nazerzadeh, Mohammad Ghodsi:
RAQ: A Range-Queriable Distributed Data Structure. SOFSEM 2005: 269-277 - [i2]Farshad Rostamabadi, Mohammad Ghodsi:
An efficient algorithm for label updating in 2PM model to avoid a moving object. EuroCG 2005: 131-134 - [i1]Ramtin Khosravi, Mohammad Ghodsi:
The fastest way to view a query point in simple polygons. EuroCG 2005: 187-190 - 2004
- [j4]Ramtin Khosravi, Mohammad Ghodsi:
Shortest paths in simple polygons with polygon-meet constraints. Inf. Process. Lett. 91(4): 171-176 (2004) - [c5]Farshad Rostamabadi, Mohammad Ghodsi:
A fast algorithm for updating a labeling to avoid a moving point. CCCG 2004: 204-208 - 2003
- [j3]Arash Termehchy, Mohammad Ghodsi:
Pipelined operator tree scheduling in heterogeneous environments. J. Parallel Distributed Comput. 63(6): 630-637 (2003) - [c4]Behdad Esfahbod, Mohammad Ghodsi, Ali Sharifi:
Common-Deadline Lazy Bureaucrat Scheduling Problems. WADS 2003: 59-66 - 2002
- [j2]Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
Length-constrained path-matchings in graphs. Networks 39(4): 210-215 (2002)
1990 – 1999
- 1998
- [c3]Mohammad Ghodsi, Jörg-Rüdiger Sack:
A coarse grained parallel solution to terrain simplification. CCCG 1998 - 1991
- [j1]Mohammad Ghodsi, Krishna Kant:
Performance Analysis of Parallel Search Algorithms on Multiprocessor Systems. Perform. Evaluation 13(1): 67-81 (1991) - [c2]Mohammad Ghodsi, Krishna Kant:
Well-formed generalized task graphs. SPDP 1991: 344-351 - 1990
- [c1]Mohammad Ghodsi, Krishna Kant:
Performance Analysis of Parallel Search Algorithms on Multiprocessors. Performance 1990: 407-421
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
