Yahav Nussbaum
Yahav Nussbaum
שותפות לא ידועה
כתובת אימייל מאומתת בדומיין cs.tau.ac.il
כותרת
צוטט על ידי
צוטט על ידי
שנה
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
992011
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
972017
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
69*2017
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
492009
A simpler linear-time recognition of circular-arc graphs
H Kaplan, Y Nussbaum
Algorithmica 61 (3), 694-737, 2011
41*2011
Isomorphism of graph classes related to the circular-ones property
JL Szwarcfiter, JP Spinrad, FJ Soulignac, Y Nussbaum, RM Mcconnell, ...
Discrete Mathematics & Theoretical Computer Science 15, 2013
36*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
362012
Maximum flow in directed planar graphs with vertex capacities
H Kaplan, Y Nussbaum
Algorithmica 61 (1), 174-189, 2011
242011
Improved distance queries in planar graphs
Y Nussbaum
Workshop on Algorithms and Data Structures, 642-653, 2011
222011
Linear-time recognition of probe interval graphs
RM McConnell, Y Nussbaum
SIAM Journal on Discrete Mathematics 29 (4), 2006-2046, 2015
20*2015
Minimum cut in undirected planar graphs when the source and the sink are close
H Kaplan, Y Nussbaum
Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 117-128, 2011
162011
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
152018
Faster shortest paths in dense distance graphs, with applications
S Mozes, Y Nussbaum, O Weimann
Theoretical Computer Science 711, 11-35, 2018
82018
Network flow problems in planar graphs
Y Nussbaum
PhD thesis, Tel-Aviv University, 2014
8*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
52008
Recognition of probe proper interval graphs
Y Nussbaum
Discrete Applied Mathematics 167, 228-238, 2014
42014
Recognition of circular-arc graphs and some subclasses
Y Nussbaum
Tel Aviv University, 2007
32007
Multiple-source multiple-sink maximum flow in planar graphs
Y Nussbaum
arXiv preprint arXiv:1012.4767, 2010
22010
Min-cost flow duality in planar networks
H Kaplan, Y Nussbaum
arXiv preprint arXiv:1306.6728, 2013
12013
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–19