Irit Katriel

464 total citations
15 papers, 113 citations indexed

About

Irit Katriel is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Irit Katriel has authored 15 papers receiving a total of 113 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computer Networks and Communications, 8 papers in Computational Theory and Mathematics and 6 papers in Artificial Intelligence. Recurrent topics in Irit Katriel's work include Optimization and Search Problems (6 papers), Advanced Graph Theory Research (4 papers) and Algorithms and Data Compression (4 papers). Irit Katriel is often cited by papers focused on Optimization and Search Problems (6 papers), Advanced Graph Theory Research (4 papers) and Algorithms and Data Compression (4 papers). Irit Katriel collaborates with scholars based in Germany, United States and Denmark. Irit Katriel's co-authors include Gerth Stølting Brodal, Martin Kütz, Eli Upfal, Pascal Van Hentenryck, Claire Kenyon-Mathieu, Loukas Georgiadis, Laurent Michel, Alon Itai, Meena Mahajan and Khaled Elbassioni and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Lecture notes in computer science.

In The Last Decade

Irit Katriel

14 papers receiving 108 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Irit Katriel Germany 8 71 40 32 31 22 15 113
Patrice Boizumault France 6 61 0.9× 21 0.5× 37 1.2× 55 1.8× 62 2.8× 23 131
Samir Loudni France 6 40 0.6× 21 0.5× 17 0.5× 29 0.9× 12 0.5× 25 93
Paola Alimonti Italy 3 82 1.2× 125 3.1× 20 0.6× 26 0.8× 11 0.5× 3 181
Richard Královič Switzerland 8 94 1.3× 61 1.5× 29 0.9× 22 0.7× 26 1.2× 21 134
Ana Silva Brazil 9 29 0.4× 130 3.3× 9 0.3× 9 0.3× 12 0.5× 50 181
Philipp Wanko Germany 7 39 0.5× 39 1.0× 16 0.5× 128 4.1× 11 0.5× 19 177
Haodi Feng China 8 51 0.7× 37 0.9× 67 2.1× 89 2.9× 12 0.5× 20 200
Oliver Giel Germany 6 46 0.6× 139 3.5× 16 0.5× 158 5.1× 20 0.9× 11 207
Fernando Sáenz-Pérez Spain 6 52 0.7× 33 0.8× 8 0.3× 91 2.9× 13 0.6× 43 134
Edson N. Cáceres Brazil 7 52 0.7× 32 0.8× 35 1.1× 83 2.7× 2 0.1× 32 135

Countries citing papers authored by Irit Katriel

Since Specialization
Citations

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

Fields of papers citing papers by Irit Katriel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Irit Katriel

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

All Works

15 of 15 papers shown
1.
Kütz, Martin, et al.. (2011). Faster algorithms for computing longest common increasing subsequences. Journal of Discrete Algorithms. 9(4). 314–325. 8 indexed citations
2.
Katriel, Irit, Claire Kenyon-Mathieu, & Eli Upfal. (2008). Commitment under uncertainty: Two-stage stochastic matching problems. Theoretical Computer Science. 408(2-3). 213–223. 17 indexed citations
3.
Kütz, Martin, Khaled Elbassioni, Irit Katriel, & Meena Mahajan. (2008). Simultaneous matchings: Hardness and approximation. Journal of Computer and System Sciences. 74(5). 884–897. 10 indexed citations
4.
Katriel, Irit, Meinolf Sellmann, Eli Upfal, & Pascal Van Hentenryck. (2007). Propagating knapsack constraints in sublinear time. National Conference on Artificial Intelligence. 231–236. 4 indexed citations
5.
Brodal, Gerth Stølting, Loukas Georgiadis, & Irit Katriel. (2007). An O() version of the Averbakh–Berman algorithm for the robust median of a tree. Operations Research Letters. 36(1). 14–18. 15 indexed citations
6.
Katriel, Irit. (2007). Matchings in Node-Weighted Convex Bipartite Graphs. INFORMS journal on computing. 20(2). 205–211. 3 indexed citations
7.
Itai, Alon & Irit Katriel. (2007). Canonical density control. Information Processing Letters. 104(6). 200–204. 7 indexed citations
8.
Katriel, Irit, Martin Kütz, & Martin Skutella. (2005). Reachability substitutes for planar digraphs. MPG.PuRe (Max Planck Society).
9.
Brodal, Gerth Stølting, et al.. (2005). Faster Algorithms for Computing Longest Common Increasing Subsequences. Lecture notes in computer science. 12(37). 330–341. 13 indexed citations
10.
Katriel, Irit, et al.. (2005). Complete Bound Consistency for the Global Cardinality Constraint. Constraints. 10(3). 191–217. 7 indexed citations
11.
Beldiceanu, Nicolas, et al.. (2005). GCC-Like Restrictions on the Same Constraint. Lecture notes in computer science. 1–11. 2 indexed citations
12.
Katriel, Irit, Laurent Michel, & Pascal Van Hentenryck. (2005). Maintaining Longest Paths Incrementally. Constraints. 10(2). 159–183. 15 indexed citations
13.
Beldiceanu, Nicolas, et al.. (2004). Filtering algorithms for the Same and UsedBy constraints. Max Planck Institute for Plasma Physics. 16(2). 191–220. 2 indexed citations
14.
Katriel, Irit. (2004). On algorithms for online topological ordering and sorting. Max Planck Institute for Plasma Physics. 4 indexed citations
15.
Katriel, Irit, et al.. (2003). Fast Bound-Consistency for the Global Cardinality Constraint. Max Planck Institute for Plasma Physics. 437–451. 6 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

Breakdown of academic impact, for papers by Patrice Boizumault Breakdown of academic impact, for papers by Samir Loudni Breakdown of academic impact, for papers by Paola Alimonti Breakdown of academic impact, for papers by Richard Královič Breakdown of academic impact, for papers by Ana Silva Breakdown of academic impact, for papers by Philipp Wanko Breakdown of academic impact, for papers by Haodi Feng Breakdown of academic impact, for papers by Oliver Giel Breakdown of academic impact, for papers by Fernando Sáenz-Pérez Breakdown of academic impact, for papers by Edson N. Cáceres
Rankless by CCL
2026