Meir Katchalski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2012

Fat Triangulations, Curvature and Quasiconformal MappingsEmil Saucan, Meir Katchalski. axioms, 1(2):99-110, 2012. [doi]

2006

The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in R Is Omega(n)Andrei Asinowski, Meir Katchalski. dcg, 35(3):473-480, 2006. [doi]

2005

Forbidden Families of Geometric Permutations in R:::d:::Andrei Asinowski, Meir Katchalski. dcg, 34(1):1-10, 2005. [doi]

2003

A Helly-Type Theorem for Line Transversals to Disjoint Unit BallsAndreas Holmsen, Meir Katchalski, Ted Lewis. dcg, 29(4):595-602, 2003. [doi]

A Constant Bound for Geometric Permutations of Disjoint Unit BallsMeir Katchalski, Subhash Suri, Yunhong Zhou. dcg, 29(2):161-173, 2003. [doi]

2001

The triples of geometric permutations for families of disjoint translatesAndrei Asinowski, Andreas Holmsen, Meir Katchalski. DM, 241(1-3):23-32, 2001. [doi]

2000

Covering Squares with SquaresH. L. Abbott, Meir Katchalski. dcg, 24(2-3):151-170, 2000. [doi]

1999

A Helly Type ConjectureMeir Katchalski, D. Nashtir. dcg, 21(1):37-43, 1999. [doi]

1998

On Geometric Graphs with No Two Edges in Convex PositionMeir Katchalski, Hagit Last. dcg, 19(3):399-404, 1998. [doi]

1996

Forcing Disjoint Segments in the PlaneWayne Goddard, Meir Katchalski, Daniel J. Kleitman. ejc, 17(4):391-395, 1996. [doi]

1995

Ordered colouringsMeir Katchalski, William McCuaig, Suzanne M. Seager. DM, 142(1-3):141-154, 1995. [doi]

1994

Proof of a conjecture of Dirac concerning 4-critical planar graphsH. L. Abbott, Meir Katchalski, Bing Zhou. DM, 132(1-3):367-371, 1994. [doi]

An Extremal Problem for Families of Pairs of SubspacesMeir Katchalski, Roy Meshulam. ejc, 15(3):253-257, 1994. [doi]

1992

The Different Ways of Stabbling Disjoint Convex SetsMeir Katchalski, Ted Lewis, A. Liu. dcg, 7:197-206, 1992.

1991

Further results on snakes in powers of complete graphsH. L. Abbott, Meir Katchalski. DM, 91(2):111-120, 1991. [doi]

1990

Not All Graphs are Segment T-graphsNoga Alon, Meir Katchalski, Edward R. Scheinerman. ejc, 11(1):7-13, 1990. [doi]

1989

Cutting Disjoint Disks by Straight LinesNoga Alon, Meir Katchalski, William R. Pulleyblank. dcg, 4:239-243, 1989.

The Maximum Size of a Convex Polygon in a Restricted Set in the PlaneNoga Alon, Meir Katchalski, William R. Pulleyblank. dcg, 4:245-251, 1989.

1988

On the snake in the box problemH. L. Abbott, Meir Katchalski. JCT, 45(1):13-24, 1988. [doi]

Snakes and pseudo-snakes in powers of complete graphsH. L. Abbott, Meir Katchalski. DM, 68(1):1-8, 1988. [doi]

1987

Geometric permutations of disjoint translates of convex setsMeir Katchalski, Ted Lewis, A. Liu. DM, 65(3):249-259, 1987. [doi]

1985

Separating Pairs of Points by Standard BoxesNoga Alon, Zoltán Füredi, Meir Katchalski. ejc, 6(3):205-210, 1985. [doi]

Geometric permutations for convex setsMeir Katchalski, Ted Lewis, Joseph Zaks. DM, 54(3):271-284, 1985. [doi]

1982

On a Set of Lattice Points not Containing the Vertices of a SquareH. L. Abbott, Meir Katchalski. ejc, 3(3):191-193, 1982. [doi]

Cutting rectangles in the planeMeir Katchalski, Ted Lewis. DM, 42(1):67-71, 1982. [doi]

1979

A Turán type problem for interval graphsHarvey L. Abbott, Meir Katchalski. DM, 25(1):85-88, 1979. [doi]

Arcs on the circle and p-tuplets on the lineMeir Katchalski, A. Liu. DM, 27(1):59-69, 1979. [doi]

1977

Intersecting all edges of convex polytopes by planesMeir Katchalski. DM, 19(3):273-279, 1977. [doi]

1974

Dimensions of intersections of convex sets (ממדים של חתוכים של קבוצות קמורות.)Meir Katchalski. PhD thesis, Hebrew University of Jerusalem, Israel, 1974. [doi]

Sign in or sign up to see more results.

runs on WebDSL