Mohammad Ghodsi

Inf. Sci., 2024

2023

Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings.

[BibT_eX]

[DOI]

Int. J. Data Sci. Anal., March, 2023

Where Quantum Complexity Helps Classical Complexity.

[BibT_eX]

[DOI]

Seyed Mohammad Hussein Kazemi

Mahdi Cheraghchi

Negin Bagheri Noghrehy

Seyed Mohsen Kazemi

Ali Movaghar

CoRR, 2023

Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering.

[BibT_eX]

[DOI]

CoRR, 2023

A 2-Approximation Algorithm for Data-Distributed Metric k-Center.

[BibT_eX]

[DOI]

CoRR, 2023

A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem.

[BibT_eX]

[DOI]

CoRR, 2023

An Efficient Construction of Yao-Graph in Data-Distributed Settings.

[BibT_eX]

[DOI]

CoRR, 2023

A parallel algorithm for Delaunay triangulation of moving points on the plane.

[BibT_eX]

[DOI]

Nazanin Hadiniya

CoRR, 2023

Reflective Guarding a Gallery.

[BibT_eX]

[DOI]

Bodhayan Roy

Proceedings of the WALCOM: Algorithms and Computation, 2023

2022

Parsisanj: an automatic component-based approach toward search engine evaluation.

[BibT_eX]

[DOI]

Amin Heydari Alashti

Ahmad Asgharian Rezaei

Alireza Elahi

Sobhan Sayyaran

Seyed Mohammad Hussein Kazemi

J. Supercomput., 2022

Trajectory Range Visibility.

[BibT_eX]

[DOI]

CoRR, 2022

Fair allocation of indivisible goods: Beyond additive valuations.

[BibT_eX]

[DOI]

Artif. Intell., 2022

2021

Improved MPC Algorithms for Edit Distance and Ulam Distance.

[BibT_eX]

[DOI]

Mahdi Boroujeni

IEEE Trans. Parallel Distributed Syst., 2021

Windowing queries using Minkowski sum and their extension to MapReduce.

[BibT_eX]

[DOI]

J. Supercomput., 2021

Maximin share guarantee for goods with positive externalities.

[BibT_eX]

[DOI]

Hamed Saleh

Soc. Choice Welf., 2021

Fair Allocation of Indivisible Goods: Improvement.

[BibT_eX]

[DOI]

Math. Oper. Res., 2021

On the Distortion Value of Elections with Abstention.

[BibT_eX]

[DOI]

Mohamad Latifian

J. Artif. Intell. Res., 2021

Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce.

[BibT_eX]

[DOI]

Mahdi Boroujeni

Soheil Ehsani

MohammadTaghi Hajiaghayi

J. ACM, 2021

Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

A Constant-Factor Approximation Algorithm for Point Guarding an Art Gallery.

[BibT_eX]

[DOI]

CoRR, 2021

Online Fair Revenue Maximizing Cake Division with Non-Contiguous Pieces in Adversarial Bandits.

[BibT_eX]

[DOI]

Amirmahdi Mirfakhar

CoRR, 2021

Art Gallery Plus Single Specular-reflection.

[BibT_eX]

[DOI]

Bodhayan Roy

CoRR, 2021

Integer Cow-path Problem and Simple Robot Street Search.

[BibT_eX]

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

2020

Covering orthogonal polygons with sliding k-transmitters.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Clearing an orthogonal polygon to find the evaders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Computing The Packedness of Curves.

[BibT_eX]

[DOI]

CoRR, 2020

Visibility Extension via Reflection.

[BibT_eX]

[DOI]

Bodhayan Roy

CoRR, 2020

Parsisanj: a semi-automatic component-based approach towards search engine evaluation.

[BibT_eX]

[DOI]

Amin Heydari Alashti

Ahmad Asgharian Rezaei

Alireza Elahi

Sobhan Sayyaran

CoRR, 2020

Approximating p-Mean Curve of Large Data-Sets.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Visibility extension via mirror-edges to cover invisible segments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Visibility testing and counting for uncertain segments.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Fair Allocation of Indivisible Goods to Asymmetric Agents.

[BibT_eX]

[DOI]

Alireza Farhadi

J. Artif. Intell. Res., 2019

Expand the Shares Together: Envy-Free Mechanisms with a Small Number of Cuts.

[BibT_eX]

[DOI]

Algorithmica, 2019

Externalities and Fairness.

[BibT_eX]

[DOI]

Hamed Saleh

Proceedings of the World Wide Web Conference, 2019

1+ε approximation of tree edit distance in quadratic time.

[BibT_eX]

[DOI]

Mahdi Boroujeni

MohammadTaghi Hajiaghayi

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A MapReduce Algorithm for Metric Anonymity Problems.

[BibT_eX]

Seyyedhamid Miri

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Randomized approximation algorithms for planar visibility counting problem.

[BibT_eX]

[DOI]

Sharareh Alipour

Amir Jafari

Theor. Comput. Sci., 2018

Weak visibility queries of line segments in simple polygons and polygonal domains.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2018

Visibility Extension via Reflective Edges to an Exact Quantity.

[BibT_eX]

[DOI]

CoRR, 2018

Fair Allocation of Indivisible Items With Externalities.

[BibT_eX]

[DOI]

Hamed Saleh

CoRR, 2018

Fair Allocation of Indivisible Goods: Improvements and Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Geometric Spanners in the MapReduce Model.

[BibT_eX]

[DOI]

Fatemeh Baharifard

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Rent Division Among Groups.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2018

A Composable Coreset for k-Center in Doubling Metrics.

[BibT_eX]

[DOI]

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017

Fair Allocation of Indivisible Goods: Improvement and Generalization.

[BibT_eX]

[DOI]

CoRR, 2017

How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, 2017

Approximate Minimum Diameter.

[BibT_eX]

[DOI]

Hamid Homapour

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Envy-Free Mechanisms with Minimum Number of Cuts.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Optimal space coverage with white convex polygons.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Euclidean movement minimization.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Clearing an Orthogonal Polygon Using Sliding Robots.

[BibT_eX]

[DOI]

Ali Narenji Sheshkalani

CoRR, 2016

An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem.

[BibT_eX]

[DOI]

Sharareh Alipour

Amir Jafari

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

A Competitive Strategy for Walking in Generalized Streets for a Simple Robot.

[BibT_eX]

Fardin Shapouri

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Near optimal line segment queries in simple polygons.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Walking in streets with minimal sensing.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

Weak visibility counting in simple polygons.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2015

Visibility testing and counting.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Randomized Strategy for Walking in Streets for a Simple Robot.

[BibT_eX]

[DOI]

CoRR, 2015

GPU-based parallel algorithm for computing point visibility inside simple polygons.

[BibT_eX]

[DOI]

Ehsan Shoja

Comput. Graph., 2015

Unit Covering in Color-Spanning Set Model.

[BibT_eX]

[DOI]

Ehsan Emamjomeh-Zadeh

Hamid Homapour

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Robots' Cooperation for Finding a Target in Streets.

[BibT_eX]

[DOI]

Mohammad Abouei Mehrizi

Proceedings of the Topics in Theoretical Computer Science, 2015

2014

On non-progressive spread of influence through social networks.

[BibT_eX]

[DOI]

MohammadAmin Fazli

Sina Sadeghian Sadeghabad

Jafar Habibi

Pooya Jalaly Khalilabadi

Vahab S. Mirrokni

Theor. Comput. Sci., 2014

α-Visibility.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Computing homotopic line simplification.

[BibT_eX]

[DOI]

Comput. Geom., 2014

An Approximation Algorithm for Computing the Visibility Region of a Point on a Terrain and Visibility Testing.

[BibT_eX]

Proceedings of the VISAPP 2014, 2014

Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2014

Covering Orthogonal Polygons with Sliding k-Transmitters.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

Equilibrium pricing with positive externalities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Scheduling to minimize gaps and power consumption.

[BibT_eX]

[DOI]

Erik D. Demaine

MohammadTaghi Hajiaghayi

Amin S. Sayedi-Roshkhar

Morteza Zadimoghaddam

J. Sched., 2013

Pricing in population games with semi-rational agents.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Near Optimal Line Segment Weak Visibility Queries in Simple Polygons.

[BibT_eX]

[DOI]

CoRR, 2013

Space/query-time tradeoff for computing the visibility polygon.

[BibT_eX]

[DOI]

Mostafa Nouri Baygi

Comput. Geom., 2013

2012

Optimal online pricing with network externalities.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Scheduling tasks with exponential duration on unrelated parallel machines.

[BibT_eX]

[DOI]

Mostafa Nouri

Discret. Appl. Math., 2012

Computing polygonal path simplification under area measures.

[BibT_eX]

[DOI]

Shervin Daneshpajouh

Graph. Model., 2012

Efficient Observer-Dependent Simplification in Polygonal Domains.

[BibT_eX]

[DOI]

Algorithmica, 2012

PostRank: a new algorithm for incremental finding of persian blog representative words.

[BibT_eX]

[DOI]

Mohsen Sayyadiharikandeh

Mohammad Naghibi

Proceedings of the 2nd International Conference on Web Intelligence, Mining and Semantics, 2012

2011

Permutation Betting Markets: Singleton Betting with Extra Information.

[BibT_eX]

[DOI]

Hamid Mahini

Vahab S. Mirrokni

Morteza Zadimoghaddam

Algorithmica, 2011

White Space Regions.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

A Heuristic Homotopic Path Simplification Algorithm.

[BibT_eX]

[DOI]

Shervin Daneshpajouh

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Euclidean Movement Minimization.

[BibT_eX]

[DOI]

MohammadAmin Fazli

MohammadAli Safari

Nima Anari

Pooya Jalaly Khalilabadi

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Weak Visibility Queries in Simple Polygons.

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

Skiptree: A new scalable distributed data structure on multidimensional data supporting range-queries.

[BibT_eX]

[DOI]

Saeed Alaei

Mohammad Toossi

Comput. Commun., 2010

Incremental labeling in closed-2PM model.

[BibT_eX]

[DOI]

Comput. Electr. Eng., 2010

Equilibrium Pricing with Positive Externalities (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Optimal Iterative Pricing over Social Networks (Extended Abstract).

[BibT_eX]

[DOI]

Hessameddin Akhlaghpour

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Visibility maintenance of a moving segment observer inside polygons with holes.

[BibT_eX]

[DOI]

Hoda Akbari

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

A topology-aware load balancing algorithm for P2P systems.

[BibT_eX]

[DOI]

Seyed Iman Mirrezaei

Javad Shahparian

Proceedings of the Fourth IEEE International Conference on Digital Information Management, 2009

Visibility of a Moving Segment.

[BibT_eX]

[DOI]

Proceedings of the Selected Papers of the 2009 International Conference on Computational Science and Its Applications, 2009

2008

Optimal point removal in closed-2PM labeling.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Query point visibility computation in polygons with holes.

[BibT_eX]

[DOI]

Comput. Geom., 2008

A Fast Community Based Algorithm for Generating Web Crawler Seeds Set.

[BibT_eX]

Shervin Daneshpajouh

Mojtaba Mohammadi Nasiri

Proceedings of the WEBIST 2008, 2008

Visiting a Polygon on the Optimal Way to a Query Point.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Kinetic Polar Diagram.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computer Science and Engineering, 2008

An Approximation Algorithm for the k -Level Uncapacitated Facility Location Problem with Penalties.

[BibT_eX]

[DOI]

Mohsen Asadi

Ali Niknafs

Proceedings of the Advances in Computer Science and Engineering, 2008

Sorting on OTIS-Networks.

[BibT_eX]

[DOI]

Ehsan Akhgari

Alireza Ziaie

Proceedings of the Advances in Computer Science and Engineering, 2008

Polar Diagram of Moving Objects.

[BibT_eX]

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Query-point visibility constrained shortest paths in simple polygons.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Spanning trees with minimum weighted degrees.

[BibT_eX]

[DOI]

Amin S. Sayedi-Roshkhar

Morteza Zadimoghaddam

Inf. Process. Lett., 2007

Computational Power of the Quantum Turing Automata.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Information Technology: New Generations (ITNG 2007), 2007

Using Similarity Flooding for Extracting Similar Parts of Proteins.

[BibT_eX]

Hassan Sayyadi

Sara Salehi

Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs.

[BibT_eX]

[DOI]

Hoda Akbari

Zeinab Iranmanesh

Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

Weak Visibility of Two Objects in Planar Polygonal Scenes.

[BibT_eX]

[DOI]

Mostafa Nouri

Proceedings of the Computational Science and Its Applications, 2007

3D Visibility and Partial Visibility Complex.

[BibT_eX]

[DOI]

Proceedings of the Selected Papers of the Fifth International Conference on, 2007

Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon.

[BibT_eX]

[DOI]

Amirali Khosravi

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

RAQNet: A Topology-Aware Overlay Network.

[BibT_eX]

[DOI]

Seyed Iman Mirrezaei

Javad Shahparian

Proceedings of the Inter-Domain Management, 2007

2006

An Efficient Universal Addition Scheme for All Hybrid-Redundant Representations with Weighted Bit-Set Encoding.

[BibT_eX]

[DOI]

Ghassem Jaberipur

Behrooz Parhami

J. VLSI Signal Process., 2006

Label updating to avoid point-shaped obstacles in fixed model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

An approximation algorithm for d1-optimal motion of a rod robot with fixed rotations.

[BibT_eX]

[DOI]

Mohammad Ali Abam

Int. J. Comput. Math., 2006

Web Graph Compression by Edge Elimination.

[BibT_eX]

[DOI]

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

Parallel Online Ranking of Web Pages.

[BibT_eX]

[DOI]

Yasser Ganjisaffar

Kyumars Sheykh Esmaili

Hassan Abolhassani

Proceedings of the 2006 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2006), 2006

2005

Weighted two-valued digit-set encodings: unifying efficient hardware representation schemes for redundant number systems.

[BibT_eX]

[DOI]

Ghassem Jaberipur

Behrooz Parhami

IEEE Trans. Circuits Syst. I Regul. Pap., 2005

Comparison of artificial neural network and logistic regression models for prediction of mortality in head trauma based on initial clinical data.

[BibT_eX]

[DOI]

BMC Medical Informatics Decis. Mak., 2005

RAQ: A Range-Queriable Distributed Data Structure.

[BibT_eX]

[DOI]

Hamid Nazerzadeh

Proceedings of the SOFSEM 2005: Theory and Practice of Computer Science, 2005

SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data.

[BibT_eX]

[DOI]

Saeed Alaei

Mohammad Toossi

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

An efficient algorithm for label updating in 2PM model to avoid a moving object.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

The fastest way to view a query point in simple polygons.

[BibT_eX]

[DOI]

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

A Hybrid Approach for Refreshing Web Page Repositories.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2005

Efficient computation of query point visibility in polygons with holes.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

New Streaming Algorithms for Counting Triangles in Graphs.

[BibT_eX]

[DOI]

Hossein Jowhari

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Shortest paths in simple polygons with polygon-meet constraints.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

A fast algorithm for updating a labeling to avoid a moving point.

[BibT_eX]

[DOI]

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

Pipelined operator tree scheduling in heterogeneous environments.

[BibT_eX]

[DOI]

Arash Termehchy

J. Parallel Distributed Comput., 2003

Common-Deadline Lazy Bureaucrat Scheduling Problems.

[BibT_eX]

[DOI]

Behdad Esfahbod

Ali Sharifi

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002

Length-constrained path-matchings in graphs.

[BibT_eX]

[DOI]

Mohammad Mahdian

Vahab S. Mirrokni

Networks, 2002

1998

A coarse grained parallel solution to terrain simplification.

[BibT_eX]

[DOI]

Jörg-Rüdiger Sack

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1991

Performance Analysis of Parallel Search Algorithms on Multiprocessor Systems.

[BibT_eX]

[DOI]

Krishna Kant

Perform. Evaluation, 1991

Well-formed generalized task graphs.

[BibT_eX]

[DOI]

Krishna Kant

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

Performance Analysis of Parallel Search Algorithms on Multiprocessors.

[BibT_eX]