2009 |
40 | EE | Ron Aharoni,
Agelos Georgakopoulos,
Philipp Sprüssel:
Perfect matchings in r-partite r-graphs.
Eur. J. Comb. 30(1): 39-42 (2009) |
2008 |
39 | EE | Ron Aharoni,
Eli Berger,
Ron Holzman,
Ori Kfir:
Independence - domination duality.
J. Comb. Theory, Ser. B 98(6): 1259-1270 (2008) |
38 | EE | Ron Aharoni,
Eli Berger,
Ori Kfir:
Acyclic systems of representatives and acyclic colorings of digraphs.
Journal of Graph Theory 59(3): 177-189 (2008) |
2003 |
37 | EE | Ron Aharoni,
Tamás Fleiner:
On a lemma of Scarf.
J. Comb. Theory, Ser. B 87(1): 72-80 (2003) |
2002 |
36 | EE | Ron Aharoni,
Tamás Fleiner:
On a Lemma of Scarf.
IPCO 2002: 176-187 |
35 | EE | Ron Aharoni,
Eli Berger,
Ran Ziv:
A Tree Version of Konig's Theorem.
Combinatorica 22(3): 335-343 (2002) |
34 | EE | Ron Aharoni,
Ron Holzman,
Michael Krivelevich,
Roy Meshulam:
Fractional Planks.
Discrete & Computational Geometry 27(4): 585-602 (2002) |
2001 |
33 | EE | Ron Aharoni:
Ryser's Conjecture for Tripartite 3-Graphs.
Combinatorica 21(1): 1-4 (2001) |
32 | EE | Ron Aharoni,
Eli Berger:
The number of edges in critical strongly connected graphs.
Discrete Mathematics 234(1-3): 119-123 (2001) |
31 | | Ron Aharoni,
Delman Lee:
On the achievability of the Cramér-Rao bound for Poisson distribution.
IEEE Transactions on Information Theory 47(5): 2096-2100 (2001) |
1998 |
30 | EE | Ron Aharoni,
Ron Holzman:
Fractional Kernels in Digraphs.
J. Comb. Theory, Ser. B 73(1): 1-6 (1998) |
1997 |
29 | EE | Ron Aharoni,
Gabor T. Herman,
Attila Kuba:
Binary vectors partially determined by linear equation systems.
Discrete Mathematics 171(1-3): 1-16 (1997) |
1996 |
28 | | Ron Aharoni,
Gabor T. Herman,
Martin Loebl:
Jordan Graphs.
CVGIP: Graphical Model and Image Processing 58(4): 345-359 (1996) |
27 | | Ron Aharoni,
Ron Holzman,
Michael Krivelevich:
On a Theorem of Lovász on Covers in tau-Partite Hypergraphs.
Combinatorica 16(2): 149-174 (1996) |
26 | EE | Ron Aharoni,
Uri Keich:
A generalization of the Ahlswede-Daykin inequality.
Discrete Mathematics 152(1-3): 1-12 (1996) |
1994 |
25 | | Ron Aharoni,
Reinhard Diestel:
Menger's Theorem for a Countable Source Set.
Combinatorics, Probability & Computing 3: 145-156 (1994) |
24 | EE | Ron Aharoni,
Vladimir Korman:
Strong LP duality in weighted infinite bipartite graphs.
Discrete Mathematics 131(1-3): 1-7 (1994) |
1993 |
23 | EE | Ron Aharoni,
Irith Ben-Arroyo Hartman:
On Greene-Kleitman's theorem for general digraphs.
Discrete Mathematics 120(1-3): 13-24 (1993) |
1992 |
22 | | Ron Aharoni,
Ron Holzman:
How to Guess Two Letters Correctly.
J. Comb. Theory, Ser. A 61(1): 1-12 (1992) |
21 | EE | Ron Aharoni,
Menachem Magidor,
Richard A. Shore:
On the strength of König's duality theorem for infinite bipartite graphs.
J. Comb. Theory, Ser. B 54(2): 257-290 (1992) |
1991 |
20 | EE | Ron Aharoni:
Infinite matching theory.
Discrete Mathematics 95(1-3): 5-22 (1991) |
1990 |
19 | EE | Ron Aharoni,
Rachel Manber,
Bronislaw Wajnryb:
Special parity of perfect matchings in bipartite graphs.
Discrete Mathematics 79(3): 221-228 (1990) |
18 | EE | Ron Aharoni,
Ofra Kessler:
On a possible extension of Hall's theorem to bipartite hypergraphs.
Discrete Mathematics 84(3): 309-313 (1990) |
17 | EE | Ron Aharoni,
E. C. Milner,
Karel Prikry:
Unfriendly partitions of a graph.
J. Comb. Theory, Ser. B 50(1): 1-10 (1990) |
16 | EE | Ron Aharoni,
Ran Ziv:
LP duality in infinite hypergraphs.
J. Comb. Theory, Ser. B 50(1): 82-92 (1990) |
15 | EE | Ron Aharoni,
Mao Lin Zheng:
Counting 1-factors in infinite graphs.
J. Comb. Theory, Ser. B 50(2): 168-178 (1990) |
1988 |
14 | | Ron Aharoni,
Paul Erdös,
Nathan Linial:
Optima of dual integer linear programs.
Combinatorica 8(1): 13-20 (1988) |
13 | EE | Ron Aharoni:
Matchings in infinite graphs.
J. Comb. Theory, Ser. B 44(1): 87-125 (1988) |
1987 |
12 | EE | Ron Aharoni,
Péter Komjáth:
On k-transversals.
J. Comb. Theory, Ser. A 45(1): 1-7 (1987) |
11 | EE | Ron Aharoni:
Menger's theorem for countable graphs.
J. Comb. Theory, Ser. B 43(3): 303-313 (1987) |
1986 |
10 | EE | Ron Aharoni,
Nathan Linial:
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas.
J. Comb. Theory, Ser. A 43(2): 196-204 (1986) |
1985 |
9 | | Ron Aharoni,
Paul Erdös,
Nathan Linial:
Dual Integer Linear Programs and the Relationship between their Optima
STOC 1985: 476-483 |
8 | | Ron Aharoni:
Fractional matchings and covers in infinite hypergraphs.
Combinatorica 5(3): 181-184 (1985) |
1984 |
7 | | Ron Aharoni:
On an obstruction for perfect matching.
Combinatorica 4(1): 1-7 (1984) |
6 | EE | Ron Aharoni:
Matchings in graphs of size N1.
J. Comb. Theory, Ser. B 36(1): 113-117 (1984) |
5 | EE | Ron Aharoni:
A generalization of Tutte's 1-factor theorem to countable graphs.
J. Comb. Theory, Ser. B 37(3): 199-209 (1984) |
1983 |
4 | | Ron Aharoni:
A principle of symmetry in networks.
Discrete Mathematics 44(1): 1-11 (1983) |
3 | | Ron Aharoni:
On the Equivalence of Two Conditions for the Existence of Transversals.
J. Comb. Theory, Ser. A 34(2): 202-214 (1983) |
1980 |
2 | | Ron Aharoni:
Representing Matrices.
J. Comb. Theory, Ser. A 29(2): 151-165 (1980) |
1 | | Ron Aharoni:
Extreme Symmetric Doubly Stochastic Matrices.
J. Comb. Theory, Ser. A 29(2): 263-265 (1980) |