Arne Meier

499 total citations
40 papers, 150 citations indexed

About

Arne Meier is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Arne Meier has authored 40 papers receiving a total of 150 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Artificial Intelligence, 31 papers in Computational Theory and Mathematics and 4 papers in Computer Networks and Communications. Recurrent topics in Arne Meier's work include Logic, Reasoning, and Knowledge (30 papers), Formal Methods in Verification (19 papers) and Logic, programming, and type systems (17 papers). Arne Meier is often cited by papers focused on Logic, Reasoning, and Knowledge (30 papers), Formal Methods in Verification (19 papers) and Logic, programming, and type systems (17 papers). Arne Meier collaborates with scholars based in Germany, Sweden and France. Arne Meier's co-authors include Heribert Vollmer, Michael E. Thomas, Martin Mundhenk, Olaf Beyersdorff, Markus Hecher, Johannes K. Fichte, Nadia Creignou, Thomas Schneider, Lauri Hella and Christoph Hammerstingl and has published in prestigious journals such as Theoretical Computer Science, Journal of Artificial Intelligence Research and Algorithmica.

In The Last Decade

Arne Meier

32 papers receiving 138 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Arne Meier Germany	8	124	111	20	10	9	40	150
Étienne Lozes France	8	105 0.8×	93 0.8×	21 1.1×	12 1.2×	4 0.4×	28	119
Stefan Göller Germany	6	73 0.6×	79 0.7×	12 0.6×	15 1.5×	6 0.7×	23	92
Gian Luca Cattani United Kingdom	10	148 1.2×	143 1.3×	36 1.8×	11 1.1×	6 0.7×	18	193
Emmanuel Filiot Belgium	6	85 0.7×	94 0.8×	13 0.7×	31 3.1×	9 1.0×	28	120
Dietmar Berwanger France	8	78 0.6×	100 0.9×	23 1.1×	8 0.8×	5 0.6×	15	126
Achim Blumensath Germany	6	122 1.0×	182 1.6×	14 0.7×	13 1.3×	10 1.1×	17	208
Diego Figueira France	6	65 0.5×	48 0.4×	17 0.8×	9 0.9×	5 0.6×	19	78
Sylvain Lombardy France	8	100 0.8×	130 1.2×	8 0.4×	5 0.5×	24 2.7×	14	141
Kamal Lodaya India	6	84 0.7×	110 1.0×	31 1.6×	8 0.8×	22 2.4×	25	136
Oliver Friedmann Germany	6	76 0.6×	95 0.9×	8 0.4×	9 0.9×	4 0.4×	15	119

Countries citing papers authored by Arne Meier

Since Specialization

Citations

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

Fields of papers citing papers by Arne Meier

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Arne Meier

This figure shows the co-authorship network connecting the top 25 collaborators of Arne Meier. A scholar is included among the top collaborators of Arne Meier 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 Arne Meier. Arne Meier is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Fichte, Johannes K., et al.. (2024). Strong Backdoors for Default Logic. ACM Transactions on Computational Logic. 25(3). 1–24.

Kontinen, Juha, et al.. (2024). Parameterized complexity of weighted team definability. Mathematical Structures in Computer Science. 34(5). 375–389.

Meier, Arne, et al.. (2023). Parameterised Counting in Logspace. Algorithmica. 85(10). 2923–2961. 3 indexed citations

Fichte, Johannes K., et al.. (2023). Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. 3212–3220. 1 indexed citations

Kontinen, Juha, et al.. (2022). A parameterized view on the complexity of dependence and independence logic. Journal of Logic and Computation. 32(8). 1624–1644. 1 indexed citations

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

Meier, Arne, et al.. (2020). Parameterized complexity of abduction in Schaefer’s framework. Journal of Logic and Computation. 31(1). 266–296. 3 indexed citations

Hella, Lauri, et al.. (2019). Satisfiability of Modal Inclusion Logic. ACM Transactions on Computational Logic. 21(1). 1–18. 3 indexed citations

Creignou, Nadia, et al.. (2019). Parameterised Enumeration for Modification Problems. Algorithms. 12(9). 189–189. 7 indexed citations

10.

Meier, Arne, et al.. (2018). Backdoors for Linear Temporal Logic. Algorithmica. 81(2). 476–496. 4 indexed citations

11.

Meier, Arne, et al.. (2017). Parametrised Complexity of Satisfiability in Temporal Logic. ACM Transactions on Computational Logic. 18(1). 1–32. 1 indexed citations

12.

Creignou, Nadia, et al.. (2016). Paradigms for Parameterized Enumeration. Theory of Computing Systems. 60(4). 737–758. 13 indexed citations

13.

Sinning, Jan‐Malte, Felix Jansen, Christoph Hammerstingl, et al.. (2016). Circulating Microparticles Decrease After Cardiac Stress in Patients With Significant Coronary Artery Stenosis. Clinical Cardiology. 39(10). 570–577. 7 indexed citations

14.

Krebs, Andreas, Arne Meier, & Martin Mundhenk. (2015). The Model Checking Fingerprints of CTL Operators. 5. 101–110. 2 indexed citations

15.

Meier, Arne, et al.. (2013). Complexity of Model Checking for Logics over Kripke models. Bulletin of the European Association for Theoretical Computer Science. 3(108). 49–89. 3 indexed citations

16.

Meier, Arne & Thomas Schneider. (2013). Generalized satisfiability for the description logicALC. Theoretical Computer Science. 505. 55–73. 2 indexed citations

17.

Beyersdorff, Olaf, Arne Meier, Martin Mundhenk, et al.. (2011). Model Checking CTL is Almost Always Inherently Sequential. Logical Methods in Computer Science. Volume 7, Issue 2. 5 indexed citations

18.

Beyersdorff, Olaf, Arne Meier, Michael E. Thomas, & Heribert Vollmer. (2011). The complexity of reasoning for fragments of default logic. Journal of Logic and Computation. 22(3). 587–604. 7 indexed citations

19.

Creignou, Nadia, Arne Meier, Michael E. Thomas, & Heribert Vollmer. (2010). The Complexity of Reasoning for Fragments of Autoepistemic Logic. arXiv (Cornell University). 0. 1 indexed citations

20.

Beyersdorff, Olaf, Arne Meier, Michael E. Thomas, et al.. (2009). Model Checking CTL is Almost Always Inherently Sequential. Research Explorer (The University of Manchester). 4. 21–28. 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