Masoud T. Omran

According to our database, Masoud T. Omran authored at least 9 papers between 2007 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Maintaining anonymity using -privacy.

Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack

J. Locat. Based Serv., 2017

2014

On the Existence and Heuristic Computation of the Solution for the Commons Game.

Rokhsareh Sakhravi, Masoud T. Omran, B. John Oommen

Trans. Comput. Collect. Intell., 2014

Improved Approximation for Time-Dependent Shortest Paths.

Masoud T. Omran, Jörg-Rüdiger Sack

Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

2013

Finding paths with minimum shared edges.

Masoud T. Omran, Jörg-Rüdiger Sack, Hamid Zarrabi-Zadeh

J. Comb. Optim., 2013

2012

Shortest Paths in Time-Dependent FIFO Networks.

Frank Dehne, Masoud T. Omran, Jörg-Rüdiger Sack

Algorithmica, 2012

Techniques to protect privacy against inference attacks in location based services.

Doron Nussbaum, Masoud T. Omran, Jörg-Rüdiger Sack

Proceedings of the 3rd ACM SIGSPATIAL International Workshop on GeoStreaming, 2012

A Fast Heuristic Solution for the Commons Game.

Rokhsareh Sakhravi, Masoud T. Omran, B. John Oommen

Proceedings of the Distributed Computing and Artificial Intelligence, 2012

2009

Shortest paths in time-dependent FIFO networks using edge load forecasts.

Frank K. H. A. Dehne, Masoud T. Omran, Jörg-Rüdiger Sack

Proceedings of the Second International Workshop on Computational Transportation Science, 2009

2007

Parallel Algorithm to Find Minimum Vertex Guard Set in a Triangulated Irregular Network.

Masoud Taghinezhad Omran

Proceedings of the Parallel Processing and Applied Mathematics, 2007