Cem Okulmus

28 papers A* 4B 1C 1Journal 13Unranked 9
YearRankTypeTitle / Venue / Authors
2026 C conf
Selective Use of Yannakakis' Algorithm for Consistent Performance Gains.
DOLAP
Daniela Böhm, Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2025 A* conf
Common Foundations for SHACL, ShEx, and PG-Schema.
WWW
Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders, Katja Hose, Maxime Jakubowski, José Emilio Labra Gayo, Wim Martens, Fabio Mogavero, Filip Murlak, Cem Okulmus, Axel Polleres, Ognjen Savkovic, Mantas Simkus, Dominik Tomaszuk
2025 J jnl
Common Foundations for SHACL, ShEx, and PG-Schema.
CoRR
Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders, Katja Hose, Maxime Jakubowski, José Emilio Labra Gayo, Wim Martens, Fabio Mogavero, Filip Murlak, Cem Okulmus, Axel Polleres, Ognjen Savkovic, Mantas Simkus, Dominik Tomaszuk
2025 — conf
Query Rewriting for Nested Navigational Queries over Property Graphs.
DL
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz
2025 J jnl
Selective Use of Yannakakis' Algorithm to Improve Query Performance: Machine Learning to the Rescue.
CoRR
Daniela Böhm, Georg Gottlob, Matthias Lanzinger, Davide M. Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2025 J jnl
Soft and Constrained Hypertree Width.
Proc. ACM Manag. Data
Matthias Lanzinger, Cem Okulmus, Reinhard Pichler, Alexander Selzer, Georg Gottlob
2025 — conf
Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.
ESWC (1)
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz
2024 — conf
Expressive Power and Complexity Results for SIGNAL, an Industry-Scale Process Query Language.
BPM (Forum)
Timotheus Kampik, Cem Okulmus
2024 J jnl
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth.
ACM Trans. Database Syst.
Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
2024 — conf
One Language to Rule Them All: Behavioural Querying of Process Data Using SQL.
ICPM Workshops
Jakob Brand, Timotheus Kampik, Cem Okulmus, Matthias Weidlich
2024 A* conf
SHACL Validation under the Well-founded Semantics.
KR
Cem Okulmus, Mantas Simkus
2024 J jnl
Soft and Constrained Hypertree Width.
CoRR
Matthias Lanzinger, Cem Okulmus, Reinhard Pichler, Alexander Selzer, Georg Gottlob
2024 — conf
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite (Extended Abstract).
Description Logics
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz
2024 J jnl
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite.
CoRR
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz
2023 J jnl
Expressivity and Complexity of the Conjunctive Core of the SIGNAL Process Query Language.
CoRR
Timotheus Kampik, Cem Okulmus
2023 — conf
On the Way to Temporal OBDA Systems (short paper).
AMW
Diego Calvanese, Cem Okulmus, Magdalena Ortiz, Mantas Simkus
2023 — conf
Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper).
AMW
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2023 — conf
Rewriting Ontology-Mediated Navigational Queries into Cypher.
Description Logics
Nikola Dragovic, Cem Okulmus, Magdalena Ortiz
2023 J jnl
Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice.
CoRR
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
2022 A* conf
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth.
PODS
Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
2022 J jnl
Fast and parallel decomposition of constraint satisfaction problems.
Constraints An Int. J.
Georg Gottlob, Cem Okulmus, Reinhard Pichler
2022 J jnl
Incremental Updates of Generalized Hypertree Decompositions.
CoRR
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus
2022 J jnl
Incremental Updates of Generalized Hypertree Decompositions.
ACM J. Exp. Algorithmics
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus
2021 J jnl
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth.
CoRR
Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
2020 A* conf
Fast and Parallel Decomposition of Constraint Satisfaction Problems.
IJCAI
Georg Gottlob, Cem Okulmus, Reinhard Pichler
2020 B conf
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions.
CPAIOR
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler
2020 J jnl
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions.
CoRR
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler
2019 — conf
Parallel Computation of Generalized Hypertree Decompositions.
AMW
Georg Gottlob, Cem Okulmus, Reinhard Pichler