Daniel Kotlar

Orcid: 0000-0003-2662-042X

Affiliations:
  • Tel-Hai College, Upper Galilee, Israel


According to our database1, Daniel Kotlar authored at least 26 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
2-covers of wide Young diagrams.
CoRR, 2023

2021
On Sequential Basis Exchange in Matroids.
SIAM J. Discret. Math., 2021

Computing autotopism groups of partial Latin rectangles: A pilot study.
Comput. Math. Methods, 2021

2020
Computing Autotopism Groups of Partial Latin Rectangles.
ACM J. Exp. Algorithmics, 2020

Refining invariants for computing autotopism groups of partial Latin rectangles.
Discret. Math., 2020

2018
Degree Conditions for Matchability in 3-Partite Hypergraphs.
J. Graph Theory, 2018

Two-line graphs of partial Latin rectangles.
Electron. Notes Discret. Math., 2018

Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv.
Eur. J. Comb., 2018

2017
Representation of Large Matchings in Bipartite Graphs.
SIAM J. Discret. Math., 2017

Topological methods for the existence of a rainbow matching.
Electron. Notes Discret. Math., 2017

Fair representation in dimatroids.
Electron. Notes Discret. Math., 2017

Fair Representation in the Intersection of Two Matroids.
Electron. J. Comb., 2017

2016
Rainbow sets in the intersection of two matroids.
J. Comb. Theory B, 2016

Distance Magic Labeling in Complete 4-partite Graphs.
Graphs Comb., 2016

On rainbow matchings in bipartite graphs.
Electron. Notes Discret. Math., 2016

2015
Decomposition of bi-colored square arrays into balanced diagonals.
Electron. Notes Discret. Math., 2015

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

2014
A Weak Version of Rota's Bases Conjecture for Odd Dimensions.
SIAM J. Discret. Math., 2014

Large matchings in bipartite graphs have a rainbow matching.
Eur. J. Comb., 2014

Computing the autotopy group of a Latin square by cycle structure.
Discret. Math., 2014

2013
On Circuits and Serial Symmetric Basis-Exchange in Matroids.
SIAM J. Discret. Math., 2013

On Serial Symmetric Exchanges of Matroid Bases.
J. Graph Theory, 2013

2012
On the Length of a Partial Independent Transversal in a Matroidal Latin Square.
Electron. J. Comb., 2012

On Extensions of the Alon-Tarsi Latin Square Conjecture.
Electron. J. Comb., 2012

Parity Types, Cycle Structures and Autotopisms of Latin Squares.
Electron. J. Comb., 2012

2005
On partitioning two matroids into common independent subsets.
Discret. Math., 2005


  Loading...