Wim Martens

2.7k total citations
74 papers, 865 citations indexed

About

Wim Martens is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Wim Martens has authored 74 papers receiving a total of 865 indexed citations (citations by other indexed papers that have themselves been cited), including 60 papers in Artificial Intelligence, 47 papers in Computer Networks and Communications and 22 papers in Computational Theory and Mathematics. Recurrent topics in Wim Martens's work include Advanced Database Systems and Queries (44 papers), Semantic Web and Ontologies (28 papers) and Data Management and Algorithms (20 papers). Wim Martens is often cited by papers focused on Advanced Database Systems and Queries (44 papers), Semantic Web and Ontologies (28 papers) and Data Management and Algorithms (20 papers). Wim Martens collaborates with scholars based in Germany, Belgium and Poland. Wim Martens's co-authors include Frank Neven, Thomas Schwentick, Angela Bonifati, Geert Jan Bex, Domagoj Vrgoč, Leonid Libkin, Wouter Gelade, Henrik Björklund, Joachim Niehren and Marc Gyssens and has published in prestigious journals such as Nature, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Wim Martens

70 papers receiving 821 citations

Peers

Wim Martens

AI

CNC

SP

CTM

CVPR

Peter T. Wood United Kingdom

Shumo Chu United States

Reinhard Pichler Austria

Rahul Shah United States

Balder ten Cate United States

Frank Neven Belgium

Thomas Schwentick Germany

Ibrahim Abdelaziz Saudi Arabia

Jiefeng Cheng Hong Kong

Jan Paredaens Belgium

Peter T. Wood United Kingdom

Wim Martens

523 ×0.8

AI

628 ×1.2

CNC

371 ×1.7

SP

88 ×0.4

CTM

289 ×1.5

CVPR

Citations per year, relative to Wim Martens Wim Martens (= 1×) peers Peter T. Wood

Countries citing papers authored by Wim Martens

Since Specialization

Citations

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

Fields of papers citing papers by Wim Martens

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Wim Martens

This figure shows the co-authorship network connecting the top 25 collaborators of Wim Martens. A scholar is included among the top collaborators of Wim Martens 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 Wim Martens. Wim Martens 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

1.

Kimelfeld, Benny, et al.. (2023). The Complexity of Aggregates over Extractions by Regular Expressions. Logical Methods in Computer Science. Volume 19, Issue 3. 1 indexed citations

2.

Martens, Wim, et al.. (2023). A Trichotomy for Regular Trail Queries. Logical Methods in Computer Science. Volume 19, Issue 4. 3 indexed citations

3.

Martens, Wim, et al.. (2020). A Trichotomy for Regular Trail Queries. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

4.

Bonifati, Angela, et al.. (2019). An analytical study of large SPARQL query logs. The VLDB Journal. 29(2-3). 655–679. 57 indexed citations

5.

Gemulla, Rainer, et al.. (2019). A Unified Framework for Frequent Sequence Mining with Subsequence Constraints. ACM Transactions on Database Systems. 44(3). 1–42. 5 indexed citations

6.

Martens, Wim, et al.. (2018). Evaluation and Enumeration Problems for Regular Path Queries. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16 indexed citations

7.

Martens, Wim, et al.. (2018). Chisel. Document Server@UHasselt (UHasselt). 139–142. 1 indexed citations

8.

Czerwiński, Wojciech, et al.. (2017). A Characterization for Decidable Separability by Piecewise Testable Languages. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 4, FCT '15(special issue FCT'15). 3 indexed citations

9.

Martens, Wim, et al.. (2016). Closure properties and descriptional complexity of deterministic regular expressions. Theoretical Computer Science. 627. 54–70. 3 indexed citations

10.

Björklund, Henrik, et al.. (2015). Efficient Incremental Evaluation of Succinct Regular Expressions. LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas). 1541–1550. 7 indexed citations

11.

Gelade, Wouter, et al.. (2013). Simplifying XML Schema: Single-type approximations of regular tree languages. Journal of Computer and System Sciences. 79(6). 910–936. 3 indexed citations

12.

Björklund, Henrik & Wim Martens. (2011). The tractability frontier for NFA minimization. Journal of Computer and System Sciences. 78(1). 198–210. 13 indexed citations

13.

Björklund, Henrik, Wim Martens, & Thomas Schwentick. (2010). Conjunctive query containment over trees. Journal of Computer and System Sciences. 77(3). 450–472. 20 indexed citations

14.

Martens, Wim, Frank Neven, & Thomas Schwentick. (2008). Deterministic top-down tree automata: past, present, and future.. Nature. 215(5096). 505–530. 3 indexed citations

15.

Martens, Wim, Frank Neven, & Marc Gyssens. (2008). Typechecking top-down XML transformations: Fixed input or output schemas. Information and Computation. 206(7). 806–827. 6 indexed citations

16.

Martens, Wim & Joachim Niehren. (2006). On the minimization of XML Schemas and tree automata for unranked trees. Journal of Computer and System Sciences. 73(4). 550–583. 32 indexed citations

17.

Martens, Wim & Frank Neven. (2006). Frontiers of tractability for typechecking simple XML transformations. Journal of Computer and System Sciences. 73(3). 362–390. 12 indexed citations

18.

Bex, Geert Jan, Wim Martens, Frank Neven, & Thomas Schwentick. (2005). Expressiveness of XSDs. Document Server@UHasselt (UHasselt). 712–712. 19 indexed citations

19.

Martens, Wim & Frank Neven. (2004). On the complexity of typechecking top-down XML transformations. Theoretical Computer Science. 336(1). 153–180. 21 indexed citations

20.

Martens, Wim & Frank Neven. (2004). Frontiers of tractability for typechecking simple XML transformations. Document Server@UHasselt (UHasselt). 23–34. 24 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