| Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time G Borradaile, PN Klein, S Mozes, Y Nussbaum, C Wulff-Nilsen SIAM Journal on Computing 46 (4), 1280-1303, 2017 | 147 | 2017 |
| Improved algorithms for min cut and max flow in undirected planar graphs GF Italiano, Y Nussbaum, P Sankowski, C Wulff-Nilsen Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 140 | 2011 |
| Submatrix maximum queries in monge matrices and partial monge matrices, and their applications H Kaplan, S Mozes, Y Nussbaum, M Sharir ACM Transactions on Algorithms (TALG) 13 (2), 1-42, 2017 | 79* | 2017 |
| A simpler linear-time recognition of circular-arc graphs H Kaplan, Y Nussbaum Algorithmica 61, 694-737, 2011 | 58* | 2011 |
| Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs H Kaplan, Y Nussbaum Discrete Applied Mathematics 157 (15), 3216-3230, 2009 | 57 | 2009 |
| Isomorphism of graph classes related to the circular-ones property AR Curtis, MC Lin, RM McConnell, Y Nussbaum, FJ Soulignac, ... Discrete Mathematics & Theoretical Computer Science 15 (Discrete Algorithms), 2013 | 48 | 2013 |
| Single source--All sinks max flows in planar digraphs J Lacki, Y Nussbaum, P Sankowski, C Wulff-Nilsen 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 599-608, 2012 | 41 | 2012 |
| Maximum flow in directed planar graphs with vertex capacities H Kaplan, Y Nussbaum Algorithmica 61 (1), 174-189, 2011 | 32 | 2011 |
| Improved distance queries in planar graphs Y Nussbaum Workshop on Algorithms and Data Structures, 642-653, 2011 | 27 | 2011 |
| Minimum Cut of Directed Planar Graphs in O(n log log n) Time S Mozes, K Nikolaev, Y Nussbaum, O Weimann Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 23 | 2018 |
| Linear-time recognition of probe interval graphs RM McConnell, Y Nussbaum SIAM Journal on Discrete Mathematics 29 (4), 2006-2046, 2015 | 23* | 2015 |
| Minimum st cut in undirected planar graphs when the source and the sink are close H Kaplan, Y Nussbaum 28th International Symposium on Theoretical Aspects of Computer Science …, 2011 | 21 | 2011 |
| Faster shortest paths in dense distance graphs, with applications S Mozes, Y Nussbaum, O Weimann Theoretical Computer Science 711, 11-35, 2018 | 17 | 2018 |
| Network flow problems in planar graphs Y Nussbaum Ph. D. Thesis, 2014 | 10 | 2014 |
| Recognition of probe proper interval graphs Y Nussbaum Discrete Applied Mathematics 167, 228-238, 2014 | 6 | 2014 |
| From a circular-arc model to a proper circular-arc model Y Nussbaum International Workshop on Graph-Theoretic Concepts in Computer Science, 324-335, 2008 | 6 | 2008 |
| Multiple-source multiple-sink maximum flow in planar graphs Y Nussbaum arXiv preprint arXiv:1012.4767, 2010 | 4 | 2010 |
| Recognition of circular-arc graphs and some subclasses Y Nussbaum Tel Aviv University, 2007 | 4 | 2007 |
| Min-cost flow duality in planar networks H Kaplan, Y Nussbaum arXiv preprint arXiv:1306.6728, 2013 | 3 | 2013 |
