Yahav Nussbaum

426 total citations
13 papers, 152 citations indexed

About

Yahav Nussbaum is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications. According to data from OpenAlex, Yahav Nussbaum has authored 13 papers receiving a total of 152 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 5 papers in Computer Graphics and Computer-Aided Design and 4 papers in Computer Networks and Communications. Recurrent topics in Yahav Nussbaum's work include Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (9 papers) and Computational Geometry and Mesh Generation (5 papers). Yahav Nussbaum is often cited by papers focused on Complexity and Algorithms in Graphs (10 papers), Advanced Graph Theory Research (9 papers) and Computational Geometry and Mesh Generation (5 papers). Yahav Nussbaum collaborates with scholars based in Israel, United States and Denmark. Yahav Nussbaum's co-authors include Christian Wulff‐Nilsen, Haim Kaplan, Shay Mozes, Piotr Sankowski, Giuseppe F. Italiano, Philip N. Klein, Glencora Borradaile, Micha Sharir, Ross M. McConnell and Jakub Łącki and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Yahav Nussbaum

12 papers receiving 144 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Yahav Nussbaum Israel 9 101 55 51 13 13 13 152
Anna Adamaszek Denmark 9 58 0.6× 50 0.9× 49 1.0× 18 1.4× 8 0.6× 27 142
Hamid Zarrabi-Zadeh Canada 6 42 0.4× 51 0.9× 46 0.9× 32 2.5× 7 0.5× 22 120
Bart M. P. Jansen Netherlands 10 216 2.1× 54 1.0× 20 0.4× 10 0.8× 22 1.7× 45 254
Pablo Pérez-Lantero Chile 8 44 0.4× 12 0.2× 103 2.0× 53 4.1× 11 0.8× 34 147
Christophe Picouleau France 9 80 0.8× 60 1.1× 10 0.2× 53 4.1× 14 1.1× 31 191
Eiji Miyano Japan 8 113 1.1× 97 1.8× 10 0.2× 8 0.6× 21 1.6× 47 184
Aleksei V. Fishkin Germany 7 32 0.3× 63 1.1× 24 0.5× 30 2.3× 16 1.2× 14 123
Jara Uitto Switzerland 7 113 1.1× 76 1.4× 13 0.3× 21 1.6× 1 0.1× 20 151
Vinícius F. dos Santos Brazil 7 88 0.9× 15 0.3× 4 0.1× 6 0.5× 23 1.8× 39 148
Haruko Okamura Japan 8 217 2.1× 136 2.5× 44 0.9× 2 0.2× 76 5.8× 18 277

Countries citing papers authored by Yahav Nussbaum

Since Specialization
Citations

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

Fields of papers citing papers by Yahav Nussbaum

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yahav Nussbaum

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

All Works

13 of 13 papers shown
1.
Kaplan, Haim, Shay Mozes, Yahav Nussbaum, & Micha Sharir. (2017). Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Transactions on Algorithms. 13(2). 1–42. 9 indexed citations
2.
Mozes, Shay, Yahav Nussbaum, & Oren Weimann. (2017). Faster shortest paths in dense distance graphs, with applications. Theoretical Computer Science. 711. 11–35. 2 indexed citations
3.
Borradaile, Glencora, Philip N. Klein, Shay Mozes, Yahav Nussbaum, & Christian Wulff‐Nilsen. (2017). Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. SIAM Journal on Computing. 46(4). 1280–1303. 21 indexed citations
4.
McConnell, Ross M. & Yahav Nussbaum. (2015). Linear-Time Recognition of Probe Interval Graphs. SIAM Journal on Discrete Mathematics. 29(4). 2006–2046. 2 indexed citations
5.
Nussbaum, Yahav. (2013). Recognition of probe proper interval graphs. Discrete Applied Mathematics. 167. 228–238.
6.
Curtis, Andrew R., Min Chih Lin, Ross M. McConnell, et al.. (2013). Isomorphism of graph classes related to the circular-ones property. Discrete Mathematics & Theoretical Computer Science. Vol. 15 no. 1(Discrete Algorithms). 10 indexed citations
7.
Kaplan, Haim, Shay Mozes, Yahav Nussbaum, & Micha Sharir. (2012). Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. 9 indexed citations
8.
Łącki, Jakub, Yahav Nussbaum, Piotr Sankowski, & Christian Wulff‐Nilsen. (2012). Single Source -- All Sinks Max Flows in Planar Digraphs. Research at the University of Copenhagen (University of Copenhagen). 10. 599–608. 9 indexed citations
9.
Italiano, Giuseppe F., Yahav Nussbaum, Piotr Sankowski, & Christian Wulff‐Nilsen. (2011). Improved algorithms for min cut and max flow in undirected planar graphs. Cineca Institutional Research Information System (Tor Vergata University). 313–322. 39 indexed citations
10.
Borradaile, Glencora, Philip N. Klein, Shay Mozes, Yahav Nussbaum, & Christian Wulff‐Nilsen. (2011). Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. 170–179. 23 indexed citations
11.
Kaplan, Haim & Yahav Nussbaum. (2010). Maximum Flow in Directed Planar Graphs with Vertex Capacities. Algorithmica. 61(1). 174–189. 9 indexed citations
12.
Kaplan, Haim & Yahav Nussbaum. (2010). A Simpler Linear-Time Recognition of Circular-Arc Graphs. Algorithmica. 61(3). 694–737. 5 indexed citations
13.
Kaplan, Haim & Yahav Nussbaum. (2009). Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discrete Applied Mathematics. 157(15). 3216–3230. 14 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 Anna Adamaszek Breakdown of academic impact, for papers by Hamid Zarrabi-Zadeh Breakdown of academic impact, for papers by Bart M. P. Jansen Breakdown of academic impact, for papers by Pablo Pérez-Lantero Breakdown of academic impact, for papers by Christophe Picouleau Breakdown of academic impact, for papers by Eiji Miyano Breakdown of academic impact, for papers by Aleksei V. Fishkin Breakdown of academic impact, for papers by Jara Uitto Breakdown of academic impact, for papers by Vinícius F. dos Santos Breakdown of academic impact, for papers by Haruko Okamura
Rankless by CCL
2026