default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYahav Nussbaum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j9]Shay Mozes
, Yahav Nussbaum, Oren Weimann:
Faster shortest paths in dense distance graphs, with applications. Theor. Comput. Sci. 711: 11-35 (2018)- [c12]Shay Mozes, Kirill Nikolaev, Yahav Nussbaum, Oren Weimann:
Minimum Cut of Directed Planar Graphs in O(n log log n) Time. SODA 2018: 477-494 - 2017
- [j8]Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. SIAM J. Comput. 46(4): 1280-1303 (2017) - [j7]Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms 13(2): 26:1-26:42 (2017) - 2015
- [j6]Ross M. McConnell, Yahav Nussbaum:
Linear-Time Recognition of Probe Interval Graphs. SIAM J. Discret. Math. 29(4): 2006-2046 (2015) - [i10]Shay Mozes, Cyril Nikolaev, Yahav Nussbaum, Oren Weimann:
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time. CoRR abs/1512.02068 (2015) - 2014
- [j5]Yahav Nussbaum:
Recognition of probe proper interval graphs. Discret. Appl. Math. 167: 228-238 (2014) - [i9]Shay Mozes, Yahav Nussbaum, Oren Weimann:
Faster Shortest Paths in Dense Distance Graphs, with Applications. CoRR abs/1404.0977 (2014) - 2013
- [j4]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. 15(1): 157-182 (2013) - [i8]Haim Kaplan, Yahav Nussbaum:
Min-Cost Flow Duality in Planar Networks. CoRR abs/1306.6728 (2013) - [i7]Ross M. McConnell, Yahav Nussbaum:
Linear-Time Recognition of Probe Interval Graphs. CoRR abs/1307.5547 (2013) - 2012
- [c11]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. FOCS 2012: 599-608 - [c10]Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA 2012: 338-355 - [i6]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Isomorphism of graph classes related to the circular-ones property. CoRR abs/1203.4822 (2012) - [i5]Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Single Source - All Sinks Max Flows in Planar Digraphs. CoRR abs/1210.4811 (2012) - 2011
- [j3]Haim Kaplan, Yahav Nussbaum:
Maximum Flow in Directed Planar Graphs with Vertex Capacities. Algorithmica 61(1): 174-189 (2011) - [j2]Haim Kaplan, Yahav Nussbaum:
A Simpler Linear-Time Recognition of Circular-Arc Graphs. Algorithmica 61(3): 694-737 (2011) - [c9]Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. FOCS 2011: 170-179 - [c8]Haim Kaplan, Yahav Nussbaum:
Minimum s-t cut in undirected planar graphs when the source and the sink are close. STACS 2011: 117-128 - [c7]Giuseppe F. Italiano, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen:
Improved algorithms for min cut and max flow in undirected planar graphs. STOC 2011: 313-322 - [c6]Yahav Nussbaum:
Improved Distance Queries in Planar Graphs. WADS 2011: 642-653 - [i4]Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, Christian Wulff-Nilsen:
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time. CoRR abs/1105.2228 (2011) - 2010
- [i3]Yahav Nussbaum:
Improved distance queries in planar graphs. CoRR abs/1012.2825 (2010) - [i2]Yahav Nussbaum:
Multiple-source multiple-sink maximum flow in planar graphs. CoRR abs/1012.4767 (2010)
2000 – 2009
- 2009
- [j1]Haim Kaplan, Yahav Nussbaum:
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. Discret. Appl. Math. 157(15): 3216-3230 (2009) - [c5]Ross M. McConnell, Yahav Nussbaum:
Linear-Time Recognition of Probe Interval Graphs. ESA 2009: 349-360 - [c4]Haim Kaplan, Yahav Nussbaum:
Maximum Flow in Directed Planar Graphs with Vertex Capacities. ESA 2009: 397-407 - [i1]Haim Kaplan, Yahav Nussbaum:
Maximum Flow in Directed Planar Graphs with Vertex Capacities. CoRR abs/0905.0451 (2009) - 2008
- [c3]Yahav Nussbaum:
From a Circular-Arc Model to a Proper Circular-Arc Model. WG 2008: 324-335 - 2007
- [b1]Yahav Nussbaum:
Recognition of circular-arc graphs and some subclasses. University of Tel-Aviv, 2007, pp. I-IV, 1-88 - 2006
- [c2]Haim Kaplan, Yahav Nussbaum:
A Simpler Linear-Time Recognition of Circular-Arc Graphs. SWAT 2006: 41-52 - [c1]Haim Kaplan, Yahav Nussbaum:
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs. WG 2006: 289-300
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
