Ivan M. Havel

978 total citations
46 papers, 576 citations indexed

About

Ivan M. Havel is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Ivan M. Havel has authored 46 papers receiving a total of 576 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 15 papers in Artificial Intelligence and 7 papers in Computer Networks and Communications. Recurrent topics in Ivan M. Havel's work include semigroups and automata theory (10 papers), Logic, programming, and type systems (7 papers) and Computability, Logic, AI Algorithms (6 papers). Ivan M. Havel is often cited by papers focused on semigroups and automata theory (10 papers), Logic, programming, and type systems (7 papers) and Computability, Logic, AI Algorithms (6 papers). Ivan M. Havel collaborates with scholars based in Czechia, United States and Slovakia. Ivan M. Havel's co-authors include Michael A. Harrison, Petr Hájek, Amiram Yehudai, Olga Štěpánková, Michel Mollard, Ivan Kramosil, Vácłav Koubek, Tomáš Dvořák, Henry Martyn Mulder and Mirko Křivánek and has published in prestigious journals such as Artificial Intelligence, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Ivan M. Havel

37 papers receiving 497 citations

Peers

Ivan M. Havel
Sven Skyum Denmark
Martin Fürer United States
P. van Emde Boas Netherlands
Joel Seiferas United States
Ivan M. Havel
Citations per year, relative to Ivan M. Havel Ivan M. Havel (= 1×) peers D. H. Younger

Countries citing papers authored by Ivan M. Havel

Since Specialization
Citations

This map shows the geographic impact of Ivan M. Havel'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 Ivan M. Havel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ivan M. Havel more than expected).

Fields of papers citing papers by Ivan M. Havel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ivan M. Havel. 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 Ivan M. Havel. The network helps show where Ivan M. Havel may publish in the future.

Co-authorship network of co-authors of Ivan M. Havel

This figure shows the co-authorship network connecting the top 25 collaborators of Ivan M. Havel. A scholar is included among the top collaborators of Ivan M. Havel 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 Ivan M. Havel. Ivan M. Havel 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.
Havel, Ivan M.. (2008). Sixty years of cybernetics: cybernetics still alive. Kybernetika. 44(3). 314–327. 1 indexed citations
2.
Fertin, Guillaume, et al.. (2001). Routing permutations and 2–1 routing requests in the hypercube. Discrete Applied Mathematics. 113(1). 43–58. 2 indexed citations
3.
Havel, Ivan M.. (1984). On Hamiltonian circuits and spanning trees of hypercubes. Časopis pro pěstování matematiky. 109(2). 135–152. 49 indexed citations
4.
Havel, Ivan M. & Mirko Křivánek. (1982). On maximal matchings in $Q_6$ and a conjecture of R. Forcade. Commentationes Mathematicae Universitatis Carolinae. 23(1). 123–136. 1 indexed citations
5.
Harrison, Michael A., Ivan M. Havel, & Amiram Yehudai. (1979). On equivalence of grammars through transformation trees. Theoretical Computer Science. 9(2). 173–205. 32 indexed citations
6.
Havel, Ivan M. & Ivan Kramosil. (1978). A stochastic approach to robot plan formation. Kybernetika. 14(3). 143–173. 6 indexed citations
7.
Štěpánková, Olga & Ivan M. Havel. (1976). Incidental and state-dependent phenomena in robot problem solving. Kybernetika. 13(6). 266–278.
8.
Harrison, Michael A., et al.. (1976). Normal forms of deterministic grammars. Discrete Mathematics. 16(4). 313–321. 11 indexed citations
9.
Havel, Ivan M.. (1974). Finite branching automata.. Kybernetika. 10. 281–302. 2 indexed citations
10.
Štěpánková, Olga & Ivan M. Havel. (1973). Some Results Concerning the Situation Calculus.. 321–326. 2 indexed citations
11.
Havel, Ivan M., et al.. (1973). Embedding the polytomic tree into the $n$-cube. Časopis pro pěstování matematiky. 98(3). 307–314. 28 indexed citations
12.
Harrison, Michael A. & Ivan M. Havel. (1972). On a Family of Deterministic Grammars (Extended Abstract).. International Colloquium on Automata, Languages and Programming. 413–441. 1 indexed citations
13.
Havel, Ivan M., et al.. (1972). Embedding the dichotomic tree into the $n$-cube. Časopis pro pěstování matematiky. 97(2). 201–205. 9 indexed citations
14.
Havel, Ivan M.. (1969). The theory of regular events. II. Kybernetika. 5(6). 400–419. 15 indexed citations
15.
Havel, Ivan M.. (1969). A note on one-sided context-sensitive grammars.. Kybernetika. 5. 186–189. 1 indexed citations
16.
Havel, Ivan M.. (1969). On a conjecture of B. Grünbaum. Journal of Combinatorial Theory. 7(2). 184–186. 28 indexed citations
17.
Havel, Ivan M.. (1968). Regular expressions over generalized alphabet and design of logical nets.. Kybernetika. 4. 516–537. 1 indexed citations
18.
Hájek, Petr, et al.. (1967). The GUHA method of systematical hypotheses searching. II.. Kybernetika. 3. 430–437. 1 indexed citations
19.
Hájek, Petr, et al.. (1966). GUHA - metoda systematického vyhledávání hypotéz. II. Kybernetika. 2(1). 2 indexed citations
20.
Hájek, Petr, et al.. (1966). GUHA - the method of systematical hypotheses searching.. Kybernetika. 2. 31–47. 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026