default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRan Ziv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c1]Ran Ziv, Ilan Gronau, Michael Fire:
CompanyName2Vec: Company Entity Matching based on Job Ads. DSAA 2022: 1-10- [i1]Ran Ziv, Ilan Gronau, Michael Fire:
CompanyName2Vec: Company Entity Matching Based on Job Ads. CoRR abs/2201.04687 (2022) - 2021
- [j25]Dani Kotlar
, Elad Roda, Ran Ziv:
On Sequential Basis Exchange in Matroids. SIAM J. Discret. Math. 35(4): 2517-2519 (2021)
2010 – 2019
- 2018
- [j24]Ron Aharoni, Dani Kotlar, Ran Ziv:
Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv. Eur. J. Comb. 67: 222-229 (2018) - [j23]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Degree Conditions for Matchability in 3-Partite Hypergraphs. J. Graph Theory 87(1): 61-71 (2018) - 2017
- [j22]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Fair Representation in the Intersection of Two Matroids. Electron. J. Comb. 24(4): 4 (2017) - [j21]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Fair representation in dimatroids. Electron. Notes Discret. Math. 61: 5-11 (2017) - [j20]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Topological methods for the existence of a rainbow matching. Electron. Notes Discret. Math. 63: 479-484 (2017) - [j19]Ron Aharoni, Dani Kotlar, Ran Ziv:
Representation of Large Matchings in Bipartite Graphs. SIAM J. Discret. Math. 31(3): 1726-1731 (2017) - 2016
- [j18]Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
On rainbow matchings in bipartite graphs. Electron. Notes Discret. Math. 54: 33-38 (2016) - [j17]Ron Aharoni, Daniel Kotlar, Ran Ziv:
Rainbow sets in the intersection of two matroids. J. Comb. Theory B 118: 129-136 (2016) - 2015
- [j16]Daniel Kotlar, Ran Ziv:
Rainbow sets in the intersection of two matroids: A generalization of results of Drisko and Chappell. Discret. Math. 338(5): 695-697 (2015) - [j15]Dani Kotlar, Ran Ziv:
Decomposition of bi-colored square arrays into balanced diagonals. Electron. Notes Discret. Math. 49: 17-22 (2015) - 2014
- [j14]Daniel Kotlar, Ran Ziv:
Large matchings in bipartite graphs have a rainbow matching. Eur. J. Comb. 38: 97-101 (2014) - 2013
- [j13]Ron Aharoni, Daniel Kotlar, Ran Ziv:
Rainbow Sets in the Intersection of Two Matroids. Electron. Notes Discret. Math. 43: 39-42 (2013) - [j12]Daniel Kotlar, Ran Ziv:
On Serial Symmetric Exchanges of Matroid Bases. J. Graph Theory 73(3): 296-304 (2013) - 2012
- [j11]Daniel Kotlar, Ran Ziv:
On the Length of a Partial Independent Transversal in a Matroidal Latin Square. Electron. J. Comb. 19(2): 12 (2012) - [j10]Ron Aharoni, Eli Berger, Ran Ziv:
The edge covering number of the intersection of two matroids. Discret. Math. 312(1): 81-85 (2012) - 2011
- [j9]Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv:
Points with Large Quadrant Depth. J. Comput. Geom. 2(1): 128-143 (2011) - 2010
- [j8]Itay Ben-Dan, Rom Pinchasi, Ran Ziv:
On a problem about quadrant-depth. Comput. Geom. 43(6-7): 587-592 (2010)
2000 – 2009
- 2009
- [j7]Itay Ben-Dan, Rom Pinchasi, Ran Ziv:
Points with large alpha-depth. J. Comb. Theory A 116(3): 747-755 (2009) - 2008
- [j6]Eli Berger, Ran Ziv:
A note on the edge cover number and independence number in hypergraphs. Discret. Math. 308(12): 2649-2654 (2008) - 2007
- [j5]Ron Aharoni, Eli Berger, Ran Ziv:
Independent systems of representatives in weighted graphs. Comb. 27(3): 253-267 (2007) - 2005
- [j4]Daniel Kotlar, Ran Ziv:
On partitioning two matroids into common independent subsets. Discret. Math. 300(1-3): 239-244 (2005) - 2002
- [j3]Ron Aharoni, Eli Berger, Ran Ziv:
A Tree Version of Konig's Theorem. Comb. 22(3): 335-343 (2002)
1990 – 1999
- 1991
- [j2]Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv:
On grid intersection graphs. Discret. Math. 87(1): 41-52 (1991) - 1990
- [j1]Ron Aharoni, Ran Ziv:
LP duality in infinite hypergraphs. J. Comb. Theory B 50(1): 82-92 (1990)
Coauthor Index
aka: Dani Kotlar
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-06-10 21:26 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:
