Citations per year, relative to Magdalena Ortiz Magdalena Ortiz (= 1×)
peers
Mantas Šimkus
Countries citing papers authored by Magdalena Ortiz
Since
Specialization
Citations
This map shows the geographic impact of Magdalena Ortiz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Magdalena Ortiz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Magdalena Ortiz more than expected).
This network shows the impact of papers produced by Magdalena Ortiz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Magdalena Ortiz. The network helps show where Magdalena Ortiz may publish in the future.
Co-authorship network of co-authors of Magdalena Ortiz
This figure shows the co-authorship network connecting the top 25 collaborators of Magdalena Ortiz.
A scholar is included among the top collaborators of Magdalena Ortiz based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Magdalena Ortiz. Magdalena Ortiz is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ortiz, Magdalena, et al.. (2019). Answer Set Programs Challenged by Ontologies.. Description Logics.
3.
Ortiz, Magdalena, et al.. (2017). Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming.. Description Logics.1 indexed citations
4.
Ortiz, Magdalena, et al.. (2016). Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics.. Description Logics.3 indexed citations
5.
Ortiz, Magdalena, et al.. (2016). Closed Predicates in Description Logics: Results on Combined Complexity.. Principles of Knowledge Representation and Reasoning. 237–246.19 indexed citations
6.
Ortiz, Magdalena, et al.. (2016). Polynomial Datalog Rewritings for Ontology Mediated Queries with Closed Predicates..1 indexed citations
7.
Ortiz, Magdalena, et al.. (2015). The Combined Complexity of Reasoning with Closed Predicates in Description Logics.. Description Logics.6 indexed citations
8.
Bienvenu, Meghyn, Magdalena Ortiz, & Mantas Šimkus. (2015). Navigational Queries Based on Frontier-Guarded Datalog: Preliminary Results..2 indexed citations
Calvanese, Diego, et al.. (2011). The Complexity of Conjunctive Query Abduction in DL-Lite.. Oxford University Research Archive (ORA) (University of Oxford).2 indexed citations
Ortiz, Magdalena, Sebastian Rudolph, & Mantas Šimkus. (2010). Worst-case optimal reasoning for the Horn-DL fragments of OWL 1 and 2. Principles of Knowledge Representation and Reasoning. 269–279.45 indexed citations
17.
Calvanese, Diego, Thomas Eiter, & Magdalena Ortiz. (2009). Regular path queries in expressive description logics with nominals. View. 714–720.43 indexed citations
18.
Ortiz, Magdalena, Mantas Šimkus, & Thomas Eiter. (2008). Worst-case optimal conjunctive query answering for an expressive description logic without inverses. National Conference on Artificial Intelligence. 504–510.7 indexed citations
Ortiz, Magdalena, Diego Calvanese, & Thomas Eiter. (2006). Data Complexity of Answering Unions of Conjunctive Queries in SHIQ .. View.17 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.