Meir Katchalski

According to our database, Meir Katchalski authored at least 30 papers between 1974 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2012

Fat Triangulations, Curvature and Quasiconformal Mappings.

Emil Saucan, Meir Katchalski

Axioms, 2012

2011

No O(N) queries for checking if N

Meir Katchalski, Eliahu Levy

CoRR, 2011

2006

The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n).

Andrei Asinowski, Meir Katchalski

Discret. Comput. Geom., 2006

2005

Forbidden Families of Geometric Permutations in R^d.

Andrei Asinowski, Meir Katchalski

Discret. Comput. Geom., 2005

2003

A Constant Bound for Geometric Permutations of Disjoint Unit Balls.

Meir Katchalski, Subhash Suri, Yunhong Zhou

Discret. Comput. Geom., 2003

A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls.

Andreas F. Holmsen, Meir Katchalski, Ted Lewis

Discret. Comput. Geom., 2003

2001

The triples of geometric permutations for families of disjoint translates.

Andrei Asinowski, Andreas F. Holmsen, Meir Katchalski

Discret. Math., 2001

2000

Covering Squares with Squares.

H. L. Abbott, Meir Katchalski

Discret. Comput. Geom., 2000

1999

A Helly Type Conjecture.

Meir Katchalski, D. Nashtir

Discret. Comput. Geom., 1999

1998

On Geometric Graphs with No Two Edges in Convex Position.

Meir Katchalski, Hagit Last

Discret. Comput. Geom., 1998

1996

Forcing Disjoint Segments in the Plane.

Wayne Goddard, Meir Katchalski, Daniel J. Kleitman

Eur. J. Comb., 1996

1995

Ordered colourings.

Meir Katchalski, William McCuaig, Suzanne M. Seager

Discret. Math., 1995

1994

An Extremal Problem for Families of Pairs of Subspaces.

Meir Katchalski, Roy Meshulam

Eur. J. Comb., 1994

Proof of a conjecture of Dirac concerning 4-critical planar graphs.

H. L. Abbott, Meir Katchalski, Bing Zhou

Discret. Math., 1994

1992

The Different Ways of Stabbling Disjoint Convex Sets.

Meir Katchalski, Ted Lewis, A. Liu

Discret. Comput. Geom., 1992

1991

Further results on snakes in powers of complete graphs.

H. L. Abbott, Meir Katchalski

Discret. Math., 1991

1990

Not All Graphs are Segment T-graphs.

Noga Alon, Meir Katchalski, Edward R. Scheinerman

Eur. J. Comb., 1990

1989

The Maximum Size of a Convex Polygon in a Restricted Set in the Plane.

Noga Alon, Meir Katchalski, William R. Pulleyblank

Discret. Comput. Geom., 1989

Cutting Disjoint Disks by Straight Lines.

Noga Alon, Meir Katchalski, William R. Pulleyblank

Discret. Comput. Geom., 1989

1988

On the snake in the box problem.

H. L. Abbott, Meir Katchalski

J. Comb. Theory B, 1988

Snakes and pseudo-snakes in powers of complete graphs.

H. L. Abbott, Meir Katchalski

Discret. Math., 1988

1987

Geometric permutations of disjoint translates of convex sets.

Meir Katchalski, Ted Lewis, A. Liu

Discret. Math., 1987

1985

Separating Pairs of Points by Standard Boxes.

Noga Alon, Zoltán Füredi, Meir Katchalski

Eur. J. Comb., 1985

Geometric permutations for convex sets.

Meir Katchalski, Ted Lewis, Joseph Zaks

Discret. Math., 1985

1982

On a Set of Lattice Points not Containing the Vertices of a Square.

H. L. Abbott, Meir Katchalski

Eur. J. Comb., 1982

Cutting rectangles in the plane.

Meir Katchalski, Ted Lewis

Discret. Math., 1982

1979

Arcs on the circle and p-tuplets on the line.

Meir Katchalski, A. Liu

Discret. Math., 1979

A Turán type problem for interval graphs.

Harvey L. Abbott, Meir Katchalski

Discret. Math., 1979

1977

Intersecting all edges of convex polytopes by planes.

Meir Katchalski

Discret. Math., 1977

1974

Dimensions of intersections of convex sets (ממדים של חתוכים של קבוצות קמורות.).

Meir Katchalski

PhD thesis, 1974