Meir Katchalski

Publication Activity (10 Years)

Years Active: 1977-2012
Publications (10 Years): 0

Top Topics

Constant Curvature

Top Venues

Publications

Emil Saucan, Meir Katchalski
Fat Triangulations, Curvature and Quasiconformal Mappings. Axioms 1 (2) (2012)
Meir Katchalski, Eliahu Levy
No O(N) queries for checking if N CoRR (2011)
Andrei Asinowski, Meir Katchalski
The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n). Discret. Comput. Geom. 35 (3) (2006)
Andrei Asinowski, Meir Katchalski
. Discret. Comput. Geom. 34 (1) (2005)
Meir Katchalski, Subhash Suri, Yunhong Zhou
A Constant Bound for Geometric Permutations of Disjoint Unit Balls. Discret. Comput. Geom. 29 (2) (2003)
Andreas F. Holmsen, Meir Katchalski, Ted Lewis
A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls. Discret. Comput. Geom. 29 (4) (2003)
Andrei Asinowski, Andreas F. Holmsen, Meir Katchalski
The triples of geometric permutations for families of disjoint translates. Discret. Math. 241 (1-3) (2001)
H. L. Abbott, Meir Katchalski
Covering Squares with Squares. Discret. Comput. Geom. 24 (2-3) (2000)
Meir Katchalski, D. Nashtir
A Helly Type Conjecture. Discret. Comput. Geom. 21 (1) (1999)
Meir Katchalski, Hagit Last
On Geometric Graphs with No Two Edges in Convex Position. Discret. Comput. Geom. 19 (3) (1998)
Wayne Goddard, Meir Katchalski, Daniel J. Kleitman
Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17 (4) (1996)
Meir Katchalski, William McCuaig, Suzanne M. Seager
Ordered colourings. Discret. Math. 142 (1-3) (1995)
H. L. Abbott, Meir Katchalski, Bing Zhou
Proof of a conjecture of Dirac concerning 4-critical planar graphs. Discret. Math. 132 (1-3) (1994)
Meir Katchalski, Roy Meshulam
An Extremal Problem for Families of Pairs of Subspaces. Eur. J. Comb. 15 (3) (1994)
Meir Katchalski, Ted Lewis, A. Liu
The Different Ways of Stabbling Disjoint Convex Sets. Discret. Comput. Geom. 7 (1992)
H. L. Abbott, Meir Katchalski
Further results on snakes in powers of complete graphs. Discret. Math. 91 (2) (1991)
Noga Alon, Meir Katchalski, Edward R. Scheinerman
Not All Graphs are Segment T-graphs. Eur. J. Comb. 11 (1) (1990)
Noga Alon, Meir Katchalski, William R. Pulleyblank
Cutting Disjoint Disks by Straight Lines. Discret. Comput. Geom. 4 (1989)
Noga Alon, Meir Katchalski, William R. Pulleyblank
The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. Discret. Comput. Geom. 4 (1989)
H. L. Abbott, Meir Katchalski
On the snake in the box problem. J. Comb. Theory, Ser. B 45 (1) (1988)
H. L. Abbott, Meir Katchalski
Snakes and pseudo-snakes in powers of complete graphs. Discret. Math. 68 (1) (1988)
Meir Katchalski, Ted Lewis, A. Liu
Geometric permutations of disjoint translates of convex sets. Discret. Math. 65 (3) (1987)
Meir Katchalski, Ted Lewis, Joseph Zaks
Geometric permutations for convex sets. Discret. Math. 54 (3) (1985)
Noga Alon, Zoltán Füredi, Meir Katchalski
Separating Pairs of Points by Standard Boxes. Eur. J. Comb. 6 (3) (1985)
Meir Katchalski, Ted Lewis
Cutting rectangles in the plane. Discret. Math. 42 (1) (1982)
H. L. Abbott, Meir Katchalski
On a Set of Lattice Points not Containing the Vertices of a Square. Eur. J. Comb. 3 (3) (1982)
Harvey L. Abbott, Meir Katchalski
A Turán type problem for interval graphs. Discret. Math. 25 (1) (1979)
Meir Katchalski, A. Liu
Arcs on the circle and p-tuplets on the line. Discret. Math. 27 (1) (1979)
Meir Katchalski
Intersecting all edges of convex polytopes by planes. Discret. Math. 19 (3) (1977)