Isolde Adler

638 total citations
21 papers, 231 citations indexed

About

Isolde Adler is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Isolde Adler has authored 21 papers receiving a total of 231 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 4 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Isolde Adler's work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (15 papers) and Interconnection Networks and Systems (5 papers). Isolde Adler is often cited by papers focused on Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (15 papers) and Interconnection Networks and Systems (5 papers). Isolde Adler collaborates with scholars based in Germany, United Kingdom and France. Isolde Adler's co-authors include Martin Grohe, Georg Gottlob, Hans H. Adler, Stephan Kreutzer, Dimitrios M. Thilikos, Mamadou Moustapha Kanté, Ignasi Sau, Frederic Dorn, Fedor V. Fomin and Nicolas Trotignon and has published in prestigious journals such as Theoretical Computer Science, Discrete Applied Mathematics and Journal of Combinatorial Theory Series B.

In The Last Decade

Isolde Adler

19 papers receiving 214 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Isolde Adler Germany	8	190	87	53	36	26	21	231
Marcin Kozik Poland	10	376 2.0×	233 2.7×	55 1.0×	39 1.1×	17 0.7×	26	414
Jan Kára Czechia	8	154 0.8×	132 1.5×	62 1.2×	27 0.8×	19 0.7×	16	222
Vincent Bouchitté France	7	196 1.0×	88 1.0×	25 0.5×	26 0.7×	9 0.3×	15	224
Ignasi Sau France	9	222 1.2×	87 1.0×	31 0.6×	65 1.8×	10 0.4×	77	294
Holger Dell Germany	7	206 1.1×	64 0.7×	62 1.2×	31 0.9×	6 0.2×	20	241
Miki Hermann France	7	185 1.0×	63 0.7×	126 2.4×	15 0.4×	22 0.8×	24	251
Arie Matsliah Israel	9	254 1.3×	77 0.9×	123 2.3×	76 2.1×	8 0.3×	26	319
Hubie Chen Spain	11	234 1.2×	193 2.2×	169 3.2×	17 0.5×	39 1.5×	52	364
Jesper Nederlof Netherlands	9	337 1.8×	132 1.5×	71 1.3×	45 1.3×	8 0.3×	35	373
Lauri Hella Finland	9	234 1.2×	61 0.7×	196 3.7×	13 0.4×	29 1.1×	41	300

Countries citing papers authored by Isolde Adler

Since Specialization

Citations

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

Fields of papers citing papers by Isolde Adler

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Isolde Adler

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

Adler, Isolde, et al.. (2021). Connected search for a lazy robber. Journal of Graph Theory. 97(4). 510–552. 1 indexed citations

Adler, Isolde, et al.. (2021). Vapnik–Chervonenkis dimension and density on Johnson and Hamming graphs. Discrete Applied Mathematics. 312. 29–44. 1 indexed citations

Adler, Isolde, et al.. (2021). On the tree-width of even-hole-free graphs. European Journal of Combinatorics. 98. 103394–103394. 9 indexed citations

Adler, Isolde, et al.. (2018). A lower bound on the tree-width of graphs with irrelevant vertices. Journal of Combinatorial Theory Series B. 137. 126–136. 3 indexed citations

Adler, Isolde, et al.. (2018). Property Testing for Bounded Degree Databases. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations

Adler, Isolde, et al.. (2017). On rank-width of even-hole-free graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 19 no. 1(Graph Theory).

Adler, Isolde & Mamadou Moustapha Kanté. (2015). Linear rank-width and linear clique-width of trees. Theoretical Computer Science. 589. 87–98. 6 indexed citations

Adler, Isolde, Stavros G. Kolliopoulos, & Dimitrios M. Thilikos. (2015). Planar Disjoint-Paths Completion. Algorithmica. 76(2). 401–425. 1 indexed citations

Adler, Isolde, Mamadou Moustapha Kanté, & O‐joung Kwon. (2014). Linear rank-width of distance-hereditary graphs I. A polynomial-time\n algorithm. arXiv (Cornell University). 5 indexed citations

10.

Adler, Hans H. & Isolde Adler. (2013). Interpreting nowhere dense graph classes as a classical notion of model theory. European Journal of Combinatorics. 36. 322–330. 26 indexed citations

11.

Adler, Isolde, et al.. (2012). Tree-width for first order formulae. Logical Methods in Computer Science. Volume 8, Issue 1. 5 indexed citations

12.

Adler, Isolde, et al.. (2012). Hypertree-depth and minors in hypergraphs. Theoretical Computer Science. 463. 84–95. 6 indexed citations

13.

Adler, Isolde, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, & Dimitrios M. Thilikos. (2011). Faster parameterized algorithms for minor containment. Theoretical Computer Science. 412(50). 7018–7028. 17 indexed citations

14.

Adler, Isolde, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, & Dimitrios M. Thilikos. (2011). Fast Minor Testing in Planar Graphs. Algorithmica. 64(1). 69–84. 5 indexed citations

15.

Adler, Isolde, Martin Grohe, & Stephan Kreutzer. (2008). Computing Excluded Minors. Oxford University Research Archive (ORA) (University of Oxford). 32 indexed citations

16.

Adler, Isolde. (2008). Tree-width and functional dependencies in databases. 311–320. 4 indexed citations

17.

Adler, Isolde. (2007). Directed tree-width examples. Journal of Combinatorial Theory Series B. 97(5). 718–725. 22 indexed citations

18.

Adler, Isolde, Georg Gottlob, & Martin Grohe. (2007). Hypertree width and related hypergraph invariants. European Journal of Combinatorics. 28(8). 2167–2181. 53 indexed citations

19.

Adler, Isolde, Georg Gottlob, & Martin Grohe. (2005). Hypertree-Width and Related Hypergraph Invariants. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AE,...(Proceedings). 7 indexed citations

20.

Adler, Isolde. (2004). Marshals, monotone marshals, and hypertree‐width. Journal of Graph Theory. 47(4). 275–296. 20 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