Cem Okulmus

Orcid: 0000-0002-7742-0439

According to our database1, Cem Okulmus authored at least 14 papers between 2019 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth.
ACM Trans. Database Syst., March, 2024

Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite.
CoRR, 2024

SHACL Validation under the Well-founded Semantics.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite (Extended Abstract).
Proceedings of the 37th International Workshop on Description Logics (DL 2024), 2024

Expressive Power and Complexity Results for SIGNAL, an Industry-Scale Process Query Language.
Proceedings of the Business Process Management Forum, 2024

2023
Expressivity and Complexity of the Conjunctive Core of the SIGNAL Process Query Language.
CoRR, 2023

Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice.
CoRR, 2023

Rewriting Ontology-Mediated Navigational Queries into Cypher.
Proceedings of the 36th International Workshop on Description Logics (DL 2023) co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning and the 21st International Workshop on Non-Monotonic Reasoning (KR 2023 and NMR 2023)., 2023

Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper).
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

On the Way to Temporal OBDA Systems (short paper).
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

2022
Incremental Updates of Generalized Hypertree Decompositions.
ACM J. Exp. Algorithmics, December, 2022

Fast and parallel decomposition of constraint satisfaction problems.
Constraints An Int. J., 2022

2020
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2020

2019
Parallel Computation of Generalized Hypertree Decompositions.
Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, 2019


  Loading...