Countries citing papers authored by Eric A. Hansen
Since
Specialization
Citations
This map shows the geographic impact of Eric A. Hansen'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 Eric A. Hansen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eric A. Hansen more than expected).
This network shows the impact of papers produced by Eric A. Hansen. 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 Eric A. Hansen. The network helps show where Eric A. Hansen may publish in the future.
Co-authorship network of co-authors of Eric A. Hansen
This figure shows the co-authorship network connecting the top 25 collaborators of Eric A. Hansen.
A scholar is included among the top collaborators of Eric A. Hansen 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 Eric A. Hansen. Eric A. Hansen 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.
Hansen, Eric A., et al.. (2016). A POMDP approach to influence diagram evaluation. International Joint Conference on Artificial Intelligence. 3124–3132.2 indexed citations
2.
Hansen, Eric A.. (2011). Suboptimality bounds for stochastic shortest path problems. arXiv (Cornell University). 301–310.3 indexed citations
3.
Malone, Brandon, Changhe Yuan, Eric A. Hansen, & Susan M. Bridges. (2011). Improving the scalability of optimal Bayesian network learning with external-memory frontier breadth-first branch and bound search. Uncertainty in Artificial Intelligence. 479–488.17 indexed citations
4.
Yuan, Changhe & Eric A. Hansen. (2009). Efficient computation of jointree bounds for systematic MAP search. International Joint Conference on Artificial Intelligence. 1982–1989.14 indexed citations
5.
Dai, Peng & Eric A. Hansen. (2007). Prioritizing bellman backups without a priority queue. International Conference on Automated Planning and Scheduling. 113–119.10 indexed citations
6.
Jensen, Rune Møller, Eric A. Hansen, Simon Richards, & Rong Zhou. (2006). Memory-efficient symbolic heuristic search. IT University Of Copenhagen (IT University of Copenhagen). 304–313.12 indexed citations
7.
Zhou, Rong & Eric A. Hansen. (2005). Beam-stack search: integrating backtracking with beam search. International Conference on Automated Planning and Scheduling. 90–98.76 indexed citations
8.
Brafman, Ronen I., et al.. (2005). Planning with continuous resources in stochastic domains. International Joint Conference on Artificial Intelligence. 1244–1251.27 indexed citations
9.
Bridges, Susan M., et al.. (2005). Incremental estimation of discrete hidden Markov models based on a new backward procedure. National Conference on Artificial Intelligence. 758–763.11 indexed citations
10.
Zhou, Rong & Eric A. Hansen. (2005). External-memory pattern databases using structured duplicate detection. National Conference on Artificial Intelligence. 1398–1404.12 indexed citations
11.
Zhou, Rong & Eric A. Hansen. (2004). Space-efficient memory-based heuristics. National Conference on Artificial Intelligence. 677–682.20 indexed citations
12.
Zhou, Rong & Eric A. Hansen. (2003). Sparse-memory graph search. International Joint Conference on Artificial Intelligence. 1259–1266.18 indexed citations
13.
Zhou, Rong & Eric A. Hansen. (2002). Memory-Bounded A* Graph Search. The Florida AI Research Society. 203–209.17 indexed citations
Zhou, Rong & Eric A. Hansen. (2001). An improved grid-based approximation algorithm for POMDPs. International Joint Conference on Artificial Intelligence. 707–714.63 indexed citations
16.
Hansen, Eric A. & Zhengzhu Feng. (2000). Dynamic programming for POMDPs using a factored state representation. 130–139.64 indexed citations
17.
Hansen, Eric A. & Shlomo Zilberstein. (1998). Heuristic search in cyclic AND/OR graphs. National Conference on Artificial Intelligence. 412–418.21 indexed citations
18.
Hansen, Eric A.. (1997). An Improved Policy Iteration Algorithm for Partially Observable MDPs. Neural Information Processing Systems. 10. 1015–1021.50 indexed citations
19.
Hansen, Eric A., Andrew G. Barto, & Shlomo Zilberstein. (1996). Reinforcement Learning for Mixed Open-loop and Closed-loop Control. Neural Information Processing Systems. 9. 1026–1032.11 indexed citations
20.
Hansen, Eric A. & Shlomo Zilberstein. (1996). Monitoring the progress of anytime problem-solving. National Conference on Artificial Intelligence. 1229–1234.38 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.