Martin Loebl
- Computational Theory and Mathematics top 2%
- Discrete Mathematics and Combinatorics top 5%
- Statistics and Probability top 5%
- Artificial Intelligence
- Geometry and Topology top 5%
- Co-authors
- Anna GalluccioJ. VondrákS. PoljakJaroslav NešetřilMarcos KiwiJiřı́ MatoušekSvatopluk PoljakIain Moffatt
- Topics
- Advanced Graph Theory Research (20 papers)Advanced Combinatorial Mathematics (11 papers)graph theory and CDMA systems (9 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsStatistics and Probability
- Partner nations
- CzechiaUnited StatesChile
In The Last Decade
Martin Loebl
51 papers receiving 378 citations
Peers
Comparison fields: 5 of 58
- Computational Theory and Mathematics 222
- Discrete Mathematics and Combinatorics 119
- Statistics and Probability 90
- Artificial Intelligence 82
- Geometry and Topology 79
Countries citing papers authored by Martin Loebl
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).
Fields of papers citing papers by Martin Loebl
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.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 19 | |
| 3 | 1 | |
| 4 | 3 | |
| 5 | 8 | |
| 6 | 28 | |
| 7 | 6 | |
| 8 | Optimization via Enumeration: a new algorithm for the Max Cut Problem | 0 |
| 9 | 1 | |
| 10 | 4 | |
| 11 | 22 | |
| 12 | Even directed cycles in H-free digraphs | 1 |
| 13 | 2 | |
| 14 | 30 | |
| 15 | 3 | |
| 16 | Efficient Maximal Cubic Graph Cuts (Extended Abstract) | 1 |
| 17 | Hercules versus Hidden Hydra Helper | 0 |
| 18 | Hercules and Hydra | 0 |
| 19 | 6 | |
| 20 | On matroids induced by packing subgraphs | 1 |
About Martin Loebl
Martin Loebl is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 58 papers that have together received 414 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Advanced Combinatorial Mathematics (11 papers) and graph theory and CDMA systems (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (119 citations), Computational Theory and Mathematics (222 citations) and Statistics and Probability (90 citations). Martin Loebl has collaborated with scholars based in Czechia, United States and Chile. Frequent co-authors include Anna Galluccio, J. Vondrák, S. Poljak, Jaroslav Nešetřil, Marcos Kiwi, Jiřı́ Matoušek, Svatopluk Poljak, Iain Moffatt, Winfried Hochstättler and Ron Aharoni. Their work appears in journals such as Physical Review Letters, Mathematical Programming and Journal of Mathematical Physics.
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.