This map shows the geographic impact of Martin Loebl'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 Martin Loebl with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Martin Loebl more than expected).
This network shows the impact of papers produced by Martin Loebl. 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 Martin Loebl. The network helps show where Martin Loebl may publish in the future.
Co-authorship network of co-authors of Martin Loebl
This figure shows the co-authorship network connecting the top 25 collaborators of Martin Loebl.
A scholar is included among the top collaborators of Martin Loebl 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 Martin Loebl. Martin Loebl is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Galluccio, Anna & Martin Loebl. (1999). Optimization via Enumeration: a new algorithm for the Max Cut Problem. OpenGrey (Institut de l'Information Scientifique et Technique).
Galluccio, Anna, et al.. (1995). Even directed cycles in H-free digraphs. OpenGrey (Institut de l'Information Scientifique et Technique).1 indexed citations
Loebl, Martin & Svatopluk Poljak. (1987). On matroids induced by packing subgraphs. Journal of Combinatorial Theory Series A. 44(3). 338–354.1 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.