default search action
Daniel Kotlar
Person information
- affiliation: Tel-Hai College, Upper Galilee, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i1]Ron Aharoni, Eli Berger, He Guo, Daniel Kotlar
:
2-covers of wide Young diagrams. CoRR abs/2311.17670 (2023) - 2021
- [j26]Rebecca J. Stones, Raúl M. Falcón
Computing autotopism groups of partial Latin rectangles: A pilot study. Comput. Math. Methods 3(3) (2021) - [j25]Dani Kotlar
On Sequential Basis Exchange in Matroids. SIAM J. Discret. Math. 35(4): 2517-2519 (2021) - 2020
- [j24]Eiran Danan, Raúl M. Falcón
Refining invariants for computing autotopism groups of partial Latin rectangles. Discret. Math. 343(5): 111812 (2020) - [j23]Rebecca J. Stones, Raúl M. Falcón
Computing Autotopism Groups of Partial Latin Rectangles. ACM J. Exp. Algorithmics 25: 1-39 (2020)
2010 – 2019
- 2018
- [j22]Ron Aharoni, Dani Kotlar
Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv. Eur. J. Comb. 67: 222-229 (2018) - [j21]Eiran Danan, Raúl M. Falcón
Two-line graphs of partial Latin rectangles. Electron. Notes Discret. Math. 68: 53-58 (2018) - [j20]Ron Aharoni, Eli Berger, Dani Kotlar
Degree Conditions for Matchability in 3-Partite Hypergraphs. J. Graph Theory 87(1): 61-71 (2018) - 2017
- [j19]Ron Aharoni, Eli Berger, Dani Kotlar
Fair Representation in the Intersection of Two Matroids. Electron. J. Comb. 24(4): 4 (2017) - [j18]Ron Aharoni, Eli Berger, Dani Kotlar
Fair representation in dimatroids. Electron. Notes Discret. Math. 61: 5-11 (2017) - [j17]Ron Aharoni, Eli Berger, Dani Kotlar
Topological methods for the existence of a rainbow matching. Electron. Notes Discret. Math. 63: 479-484 (2017) - [j16]Ron Aharoni, Dani Kotlar
Representation of Large Matchings in Bipartite Graphs. SIAM J. Discret. Math. 31(3): 1726-1731 (2017) - 2016
- [j15]Ron Aharoni, Eli Berger, Dani Kotlar
On rainbow matchings in bipartite graphs. Electron. Notes Discret. Math. 54: 33-38 (2016) - [j14]Daniel Kotlar
Distance Magic Labeling in Complete 4-partite Graphs. Graphs Comb. 32(3): 1027-1038 (2016) - [j13]Ron Aharoni
Rainbow sets in the intersection of two matroids. J. Comb. Theory B 118: 129-136 (2016) - 2015
- [j12]Daniel Kotlar
Rainbow sets in the intersection of two matroids: A generalization of results of Drisko and Chappell. Discret. Math. 338(5): 695-697 (2015) - [j11]Dani Kotlar
Decomposition of bi-colored square arrays into balanced diagonals. Electron. Notes Discret. Math. 49: 17-22 (2015) - 2014
- [j10]Daniel Kotlar
Computing the autotopy group of a Latin square by cycle structure. Discret. Math. 331: 74-82 (2014) - [j9]Daniel Kotlar
Large matchings in bipartite graphs have a rainbow matching. Eur. J. Comb. 38: 97-101 (2014) - [j8]Ron Aharoni, Daniel Kotlar
A Weak Version of Rota's Bases Conjecture for Odd Dimensions. SIAM J. Discret. Math. 28(1): 385-393 (2014) - 2013
- [j7]Ron Aharoni, Daniel Kotlar
Rainbow Sets in the Intersection of Two Matroids. Electron. Notes Discret. Math. 43: 39-42 (2013) - [j6]Daniel Kotlar
On Serial Symmetric Exchanges of Matroid Bases. J. Graph Theory 73(3): 296-304 (2013) - [j5]Daniel Kotlar
On Circuits and Serial Symmetric Basis-Exchange in Matroids. SIAM J. Discret. Math. 27(3): 1274-1286 (2013) - 2012
- [j4]Daniel Kotlar
On the Length of a Partial Independent Transversal in a Matroidal Latin Square. Electron. J. Comb. 19(2): 12 (2012) - [j3]Daniel Kotlar
Parity Types, Cycle Structures and Autotopisms of Latin Squares. Electron. J. Comb. 19(3): 10 (2012) - [j2]Daniel Kotlar
On Extensions of the Alon-Tarsi Latin Square Conjecture. Electron. J. Comb. 19(4): 7 (2012)
2000 – 2009
- 2005
- [j1]Daniel Kotlar
On partitioning two matroids into common independent subsets. Discret. Math. 300(1-3): 239-244 (2005)
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-06-10 20: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: