Ran Ziv

According to our database, Ran Ziv authored at least 25 papers between 1990 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

CompanyName2Vec: Company Entity Matching based on Job Ads.

Ran Ziv, Ilan Gronau, Michael Fire

Proceedings of the 9th IEEE International Conference on Data Science and Advanced Analytics, 2022

2021

On Sequential Basis Exchange in Matroids.

Dani Kotlar, Elad Roda, Ran Ziv

SIAM J. Discret. Math., 2021

2018

Degree Conditions for Matchability in 3-Partite Hypergraphs.

Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv

J. Graph Theory, 2018

Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv.

Ron Aharoni, Dani Kotlar, Ran Ziv

Eur. J. Comb., 2018

2017

Representation of Large Matchings in Bipartite Graphs.

Ron Aharoni, Dani Kotlar, Ran Ziv

SIAM J. Discret. Math., 2017

Topological methods for the existence of a rainbow matching.

Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv

Electron. Notes Discret. Math., 2017

Fair representation in dimatroids.

Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv

Electron. Notes Discret. Math., 2017

Fair Representation in the Intersection of Two Matroids.

Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv

Electron. J. Comb., 2017

2016

Rainbow sets in the intersection of two matroids.

Ron Aharoni, Daniel Kotlar, Ran Ziv

J. Comb. Theory B, 2016

On rainbow matchings in bipartite graphs.

Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv

Electron. Notes Discret. Math., 2016

2015

Decomposition of bi-colored square arrays into balanced diagonals.

Dani Kotlar, Ran Ziv

Electron. Notes Discret. Math., 2015

Rainbow sets in the intersection of two matroids: A generalization of results of Drisko and Chappell.

Daniel Kotlar, Ran Ziv

Discret. Math., 2015

2014

Large matchings in bipartite graphs have a rainbow matching.

Daniel Kotlar, Ran Ziv

Eur. J. Comb., 2014

2013

On Serial Symmetric Exchanges of Matroid Bases.

Daniel Kotlar, Ran Ziv

J. Graph Theory, 2013

2012

The edge covering number of the intersection of two matroids.

Ron Aharoni, Eli Berger, Ran Ziv

Discret. Math., 2012

On the Length of a Partial Independent Transversal in a Matroidal Latin Square.

Daniel Kotlar, Ran Ziv

Electron. J. Comb., 2012

2011

Points with Large Quadrant Depth.

Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv

J. Comput. Geom., 2011

2010

On a problem about quadrant-depth.

Itay Ben-Dan, Rom Pinchasi, Ran Ziv

Comput. Geom., 2010

2009

Points with large alpha-depth.

Itay Ben-Dan, Rom Pinchasi, Ran Ziv

J. Comb. Theory A, 2009

2008

A note on the edge cover number and independence number in hypergraphs.

Eli Berger, Ran Ziv

Discret. Math., 2008

2007

Independent systems of representatives in weighted graphs.

Ron Aharoni, Eli Berger, Ran Ziv

Comb., 2007

2005

On partitioning two matroids into common independent subsets.

Daniel Kotlar, Ran Ziv

Discret. Math., 2005

2002

A Tree Version of Konig's Theorem.

Ron Aharoni, Eli Berger, Ran Ziv

Comb., 2002

1991

On grid intersection graphs.

Irith Ben-Arroyo Hartman, Ilan Newman, Ran Ziv

Discret. Math., 1991

1990

LP duality in infinite hypergraphs.

Ron Aharoni, Ran Ziv

J. Comb. Theory B, 1990