2006 |
21 | EE | Andrei Asinowski,
Meir Katchalski:
The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n).
Discrete & Computational Geometry 35(3): 473-480 (2006) |
2005 |
20 | EE | Andrei Asinowski,
Meir Katchalski:
Forbidden Families of Geometric Permutations in Rd.
Discrete & Computational Geometry 34(1): 1-10 (2005) |
2003 |
19 | EE | Meir Katchalski,
Subhash Suri,
Yunhong Zhou:
A Constant Bound for Geometric Permutations of Disjoint Unit Balls.
Discrete & Computational Geometry 29(2): 161-173 (2003) |
18 | EE | Andreas Holmsen,
Meir Katchalski,
Ted Lewis:
A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls.
Discrete & Computational Geometry 29(4): 595-602 (2003) |
2001 |
17 | EE | Andrei Asinowski,
Andreas Holmsen,
Meir Katchalski:
The triples of geometric permutations for families of disjoint translates.
Discrete Mathematics 241(1-3): 23-32 (2001) |
2000 |
16 | EE | H. L. Abbott,
Meir Katchalski:
Covering Squares with Squares.
Discrete & Computational Geometry 24(2-3): 151-170 (2000) |
1999 |
15 | EE | Meir Katchalski,
D. Nashtir:
A Helly Type Conjecture.
Discrete & Computational Geometry 21(1): 37-43 (1999) |
1998 |
14 | EE | Meir Katchalski,
Hagit Last:
On Geometric Graphs with No Two Edges in Convex Position.
Discrete & Computational Geometry 19(3): 399-404 (1998) |
1996 |
13 | EE | Wayne Goddard,
Meir Katchalski,
Daniel J. Kleitman:
Forcing Disjoint Segments in the Plane.
Eur. J. Comb. 17(4): 391-395 (1996) |
1995 |
12 | EE | Meir Katchalski,
William McCuaig,
Suzanne M. Seager:
Ordered colourings.
Discrete Mathematics 142(1-3): 141-154 (1995) |
1994 |
11 | EE | H. L. Abbott,
Meir Katchalski,
Bing Zhou:
Proof of a conjecture of Dirac concerning 4-critical planar graphs.
Discrete Mathematics 132(1-3): 367-371 (1994) |
10 | EE | Meir Katchalski,
Roy Meshulam:
An Extremal Problem for Families of Pairs of Subspaces.
Eur. J. Comb. 15(3): 253-257 (1994) |
1992 |
9 | | Meir Katchalski,
Ted Lewis,
A. Liu:
The Different Ways of Stabbling Disjoint Convex Sets.
Discrete & Computational Geometry 7: 197-206 (1992) |
1991 |
8 | EE | H. L. Abbott,
Meir Katchalski:
Further results on snakes in powers of complete graphs.
Discrete Mathematics 91(2): 111-120 (1991) |
1989 |
7 | | Noga Alon,
Meir Katchalski,
William R. Pulleyblank:
Cutting Disjoint Disks by Straight Lines.
Discrete & Computational Geometry 4: 239-243 (1989) |
6 | | Noga Alon,
Meir Katchalski,
William R. Pulleyblank:
The Maximum Size of a Convex Polygon in a Restricted Set in the Plane.
Discrete & Computational Geometry 4: 245-251 (1989) |
1988 |
5 | EE | H. L. Abbott,
Meir Katchalski:
Snakes and pseudo-snakes in powers of complete graphs.
Discrete Mathematics 68(1): 1-8 (1988) |
4 | EE | H. L. Abbott,
Meir Katchalski:
On the snake in the box problem.
J. Comb. Theory, Ser. B 45(1): 13-24 (1988) |
1987 |
3 | EE | Meir Katchalski,
Ted Lewis,
A. Liu:
Geometric permutations of disjoint translates of convex sets.
Discrete Mathematics 65(3): 249-259 (1987) |
1985 |
2 | EE | Meir Katchalski,
Ted Lewis,
Joseph Zaks:
Geometric permutations for convex sets.
Discrete Mathematics 54(3): 271-284 (1985) |
1982 |
1 | EE | Meir Katchalski,
Ted Lewis:
Cutting rectangles in the plane.
Discrete Mathematics 42(1): 67-71 (1982) |