Morteza Alipour Langouri

Orcid: 0000-0002-3185-766X

According to our database1, Morteza Alipour Langouri authored at least 14 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Mining Keys for Graphs.
Data Knowl. Eng., 2024

2023
iPartition: a distributed partitioning algorithm for block-centric graph processing systems.
J. Supercomput., December, 2023

Inconsistency Detection with Temporal Graph Functional Dependencies.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
Contextual Data Cleaning with Ontology Functional Dependencies.
ACM J. Data Inf. Qual., 2022

Discovery of Keys for Graphs [Extended Version].
CoRR, 2022

Discovery of Keys for Graphs.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2022

2021
Temporal Graph Functional Dependencies - Technical Report.
CoRR, 2021

Discovery and Contextual Data Cleaning with Ontology Functional Dependencies.
CoRR, 2021

Temporal Dependencies for Graphs.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

2019
Ontology-based Entity Matching in Attributed Graphs.
Proc. VLDB Endow., 2019

2018
Contextual Data Cleaning.
Proceedings of the 34th IEEE International Conference on Data Engineering Workshops, 2018

FastOFD: Contextual Data Cleaning with Ontology Functional Dependencies.
Proceedings of the 21st International Conference on Extending Database Technology, 2018

2017
A fast method to exactly calculate the diameter of incremental disconnected graphs.
World Wide Web, 2017

2016
Calculating Exact Diameter Metric of Large Static Graphs.
J. Univers. Comput. Sci., 2016


  Loading...