Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by Héctor Geffner
Since
Specialization
Citations
This map shows the geographic impact of Héctor Geffner'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 Héctor Geffner with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Héctor Geffner more than expected).
This network shows the impact of papers produced by Héctor Geffner. 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 Héctor Geffner. The network helps show where Héctor Geffner may publish in the future.
Co-authorship network of co-authors of Héctor Geffner
This figure shows the co-authorship network connecting the top 25 collaborators of Héctor Geffner.
A scholar is included among the top collaborators of Héctor Geffner 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 Héctor Geffner. Héctor Geffner is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Geffner, Héctor, et al.. (2016). ∃-STRIPS: existential quantification in planning and constraint satisfaction. Repositori digital de la UPF (Universitat Pompeu Fabra). 3082–3088.4 indexed citations
2.
Lipovetzky, Nir, Miquel Ramírez, & Héctor Geffner. (2015). Classical planning with simulators: results on the Atari video games. International Conference on Artificial Intelligence. 1610–1616.30 indexed citations
3.
Geffner, Héctor, et al.. (2015). Width-Based Planning for General Video-Game Playing. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 11(1). 23–29.19 indexed citations
Dechter, Rina, Héctor Geffner, & Joseph Y. Halpern. (2010). Heuristics, Probability and Causality. A Tribute to Judea Pearl.99 indexed citations
7.
Bonet, Blai & Héctor Geffner. (2009). Solving POMDPs: RTDP-bel vs. point-based algorithms. International Joint Conference on Artificial Intelligence. 1641–1646.54 indexed citations
8.
Keyder, Emil & Héctor Geffner. (2009). Trees of shortest paths vs. Steiner trees: understanding and improving delete relaxation heuristics. International Joint Conference on Artificial Intelligence. 1734–1739.12 indexed citations
9.
Geffner, Héctor, Rui Prada, Isabel Machado, & Nuno David. (2008). Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence.1 indexed citations
10.
Bonet, Blai & Héctor Geffner. (2006). Heuristics for planning with penalties and rewards using compiled knowledge. Principles of Knowledge Representation and Reasoning. 452–462.13 indexed citations
11.
Bonet, Blai & Héctor Geffner. (2006). Learning depth-first search: a unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs. International Conference on Automated Planning and Scheduling. 142–151.52 indexed citations
12.
Haslum, Patrik, Blai Bonet, & Héctor Geffner. (2005). New admissible heuristics for domain-independent planning. ANU Open Research (Australian National University). 1163–1168.92 indexed citations
13.
Hoffmann, Jörg & Héctor Geffner. (2003). Branching matters: alternative branching in Graphplan. International Conference on Automated Planning and Scheduling. 22–31.8 indexed citations
Bonet, Blai, et al.. (1997). A robust and fast action selection mechanism for planning. National Conference on Artificial Intelligence. 714–719.137 indexed citations
Geffner, Héctor. (1996). A qualitative model for temporal reasoning with incomplete information. National Conference on Artificial Intelligence. 1176–1181.4 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.