Markus Hecher

494 total citations
32 papers, 107 citations indexed

About

Markus Hecher is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Markus Hecher has authored 32 papers receiving a total of 107 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Artificial Intelligence, 11 papers in Computational Theory and Mathematics and 6 papers in Computer Networks and Communications. Recurrent topics in Markus Hecher's work include Logic, Reasoning, and Knowledge (20 papers), Multi-Agent Systems and Negotiation (11 papers) and Logic, programming, and type systems (11 papers). Markus Hecher is often cited by papers focused on Logic, Reasoning, and Knowledge (20 papers), Multi-Agent Systems and Negotiation (11 papers) and Logic, programming, and type systems (11 papers). Markus Hecher collaborates with scholars based in Austria, Germany and United States. Markus Hecher's co-authors include Johannes K. Fichte, Arne Meier, Stefan Woltran, Thomas Eiter, Jorge Fandinno, Stefan Szeider, Kuldeep S. Meel, Wolfgang Dvořák, Daniel Le Berre and Ciaran McCreesh and has published in prestigious journals such as Communications of the ACM, Artificial Intelligence and Journal of Artificial Intelligence Research.

In The Last Decade

Markus Hecher

23 papers receiving 107 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Markus Hecher Austria 6 95 46 15 5 4 32 107
Johannes K. Fichte Austria 7 113 1.2× 57 1.2× 23 1.5× 5 1.0× 6 1.5× 31 128
Nikolay Pelov Belgium 5 136 1.4× 36 0.8× 16 1.1× 6 1.2× 4 1.0× 8 137
Friedrich Slivovsky Austria 6 39 0.4× 48 1.0× 23 1.5× 6 1.2× 6 1.5× 15 72
Samuel Gruetter United States 4 66 0.7× 32 0.7× 24 1.6× 7 1.4× 3 0.8× 7 79
Sylvain Schmitz France 7 50 0.5× 55 1.2× 8 0.5× 4 0.8× 11 2.8× 17 74
Daniel Hirschkoff France 5 60 0.6× 47 1.0× 25 1.7× 4 0.8× 4 1.0× 18 70
Jurriaan Rot Netherlands 5 71 0.7× 60 1.3× 8 0.5× 5 1.0× 8 2.0× 30 81
Kaustuv Chaudhuri France 5 56 0.6× 37 0.8× 10 0.7× 3 0.6× 3 0.8× 10 58
Étienne Lozes France 8 105 1.1× 93 2.0× 21 1.4× 3 0.6× 12 3.0× 28 119
Katarina Britz South Africa 6 106 1.1× 42 0.9× 14 0.9× 10 2.0× 2 0.5× 26 117

Countries citing papers authored by Markus Hecher

Since Specialization
Citations

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

Fields of papers citing papers by Markus Hecher

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Markus Hecher

This figure shows the co-authorship network connecting the top 25 collaborators of Markus Hecher. A scholar is included among the top collaborators of Markus Hecher 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 Markus Hecher. Markus Hecher 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.
Fichte, Johannes K., et al.. (2024). Parallel Empirical Evaluations: Resilience despite Concurrency. Proceedings of the AAAI Conference on Artificial Intelligence. 38(8). 8004–8012.
2.
Fichte, Johannes K., et al.. (2024). IASCAR: Incremental Answer Set Counting by Anytime Refinement. Theory and Practice of Logic Programming. 24(3). 505–532.
3.
Hecher, Markus, et al.. (2024). Navigating and Querying Answer Sets: How Hard Is It Really and Why?. 642–653.
4.
Hecher, Markus, et al.. (2023). Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. Proceedings of the International Conference on Automated Planning and Scheduling. 33(1). 100–108.
5.
Fichte, Johannes K., et al.. (2023). Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. 3212–3220. 1 indexed citations
7.
Fichte, Johannes K., Robert Ganian, Markus Hecher, Friedrich Slivovsky, & Sebastian Ordyniak. (2023). Structure-Aware Lower Bounds and Broadening the Horizon of Tractability for QBF. 1–14. 2 indexed citations
8.
Hecher, Markus. (2023). Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 6407–6415.
9.
Fichte, Johannes K., Daniel Le Berre, Markus Hecher, & Stefan Szeider. (2023). The Silent (R)evolution of SAT. Communications of the ACM. 66(6). 64–72. 5 indexed citations
10.
Fichte, Johannes K., et al.. (2022). Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. 2620–2626. 5 indexed citations
11.
Hecher, Markus, et al.. (2022). Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence. 2546–2552. 1 indexed citations
12.
Hecher, Markus, et al.. (2022). ApproxASP – a Scalable Approximate Answer Set Counter. Proceedings of the AAAI Conference on Artificial Intelligence. 36(5). 5755–5764. 6 indexed citations
13.
Fichte, Johannes K., et al.. (2021). Complications for Computational Experiments from Modern Processors. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
14.
Fichte, Johannes K., et al.. (2021). Parallel Model Counting with CUDA: Algorithm Engineering for Efficient Hardware Utilization. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
15.
Eiter, Thomas, et al.. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. 269–279. 11 indexed citations
16.
Fichte, Johannes K., Markus Hecher, & Arne Meier. (2021). Knowledge-Base Degrees of Inconsistency: Complexity and Counting. Proceedings of the AAAI Conference on Artificial Intelligence. 35(7). 6349–6357. 2 indexed citations
17.
18.
Fichte, Johannes K., et al.. (2019). The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations
19.
Fichte, Johannes K. & Markus Hecher. (2018). Exploiting Treewidth for Counting Projected Answer Sets.. Principles of Knowledge Representation and Reasoning. 639–640. 2 indexed citations
20.
Hecher, Markus, et al.. (2016). D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundamenta Informaticae. 147(1). 27–61. 2 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