126 citations · 834 across the 125 of their papers we have counts for
4 papers · 1 filter
The --Net Problem
Noga Alon, Bruno Jartoux, Chaya Keller +2
We study a natural generalization of the classical -net problem (Haussler--Welzl 1987), which we call the "--net problem": Given a hypergraph on vertices and parameter…
Out-colourings of Digraphs
Noga Alon, Joergen Bang-Jensen, Stéphane Bessy
We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an {\bf out-colouring}. The problem of deciding whether a given digra…
A Graph-Theoretic Approach to Multitasking
Noga Alon, Jonathan D. Cohen, Biswadip Dey +6
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representation…
On the maximum quartet distance between phylogenetic trees
Noga Alon, Humberto Naves, Benny Sudakov
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on leaves is at most . Using the mac…