Meir Katchalski

929 total citations
58 papers, 524 citations indexed

About

Meir Katchalski is a scholar working on Computer Graphics and Computer-Aided Design, Geometry and Topology and Applied Mathematics. According to data from OpenAlex, Meir Katchalski has authored 58 papers receiving a total of 524 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computer Graphics and Computer-Aided Design, 28 papers in Geometry and Topology and 22 papers in Applied Mathematics. Recurrent topics in Meir Katchalski's work include Computational Geometry and Mesh Generation (29 papers), Point processes and geometric inequalities (19 papers) and Mathematics and Applications (15 papers). Meir Katchalski is often cited by papers focused on Computational Geometry and Mesh Generation (29 papers), Point processes and geometric inequalities (19 papers) and Mathematics and Applications (15 papers). Meir Katchalski collaborates with scholars based in Israel, Canada and Hungary. Meir Katchalski's co-authors include H. L. Abbott, T. Lewis, Andy Liu, William McCuaig, János Pach, Joseph Zaks, Noga Alon, A. Meir, Imre Bárány and Ted G. Lewis and has published in prestigious journals such as Transactions of the American Mathematical Society, American Mathematical Monthly and Pacific Journal of Mathematics.

In The Last Decade

Meir Katchalski

52 papers receiving 472 citations

Peers

Meir Katchalski
Marilyn Breen United States
Valeriu Soltan United States
J. E. Reeve United Kingdom
Nets Hawk Katz United States
Konrad J. Swanepoel South Africa
Larry Guth United States
Meir Katchalski
Citations per year, relative to Meir Katchalski Meir Katchalski (= 1×) peers Helge Tverberg

Countries citing papers authored by Meir Katchalski

Since Specialization
Citations

This map shows the geographic impact of Meir Katchalski's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Meir Katchalski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Meir Katchalski more than expected).

Fields of papers citing papers by Meir Katchalski

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Meir Katchalski. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Meir Katchalski. The network helps show where Meir Katchalski may publish in the future.

Co-authorship network of co-authors of Meir Katchalski

This figure shows the co-authorship network connecting the top 25 collaborators of Meir Katchalski. A scholar is included among the top collaborators of Meir Katchalski based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Meir Katchalski. Meir Katchalski is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Katchalski, Meir, et al.. (2001). The triples of geometric permutations for families of disjoint translates. Discrete Mathematics. 241(1-3). 23–32. 2 indexed citations
2.
Goddard, Wayne, Meir Katchalski, & Daniel J. Kleitman. (1996). Forcing Disjoint Segments in the Plane. European Journal of Combinatorics. 17(4). 391–395. 6 indexed citations
3.
Katchalski, Meir, et al.. (1995). Ordered colourings. Discrete Mathematics. 142(1-3). 141–154. 45 indexed citations
4.
Abbott, H. L., Meir Katchalski, & Bing Zhou. (1994). Proof of a conjecture of Dirac concerning 4-critical planar graphs. Discrete Mathematics. 132(1-3). 367–371.
5.
Katchalski, Meir & Roy Meshulam. (1994). An Extremal Problem for Families of Pairs of Subspaces. European Journal of Combinatorics. 15(3). 253–257. 1 indexed citations
6.
Alon, Noga, Meir Katchalski, & Edward R. Scheinerman. (1990). Not All Graphs are Segment T-graphs. European Journal of Combinatorics. 11(1). 7–13. 2 indexed citations
7.
Alon, Noga, Meir Katchalski, & William R. Pulleyblank. (1989). Cutting disjoint disks by straight lines. Discrete & Computational Geometry. 4(3). 239–243. 15 indexed citations
8.
Abbott, H. L. & Meir Katchalski. (1988). On the snake in the box problem. Journal of Combinatorial Theory Series B. 45(1). 13–24. 19 indexed citations
9.
Katchalski, Meir, T. Lewis, & Joseph Zaks. (1985). Geometric permutations for convex sets. Discrete Mathematics. 54(3). 271–284. 38 indexed citations
10.
Alon, Noga, Zoltán Füredi, & Meir Katchalski. (1985). Separating Pairs of Points by Standard Boxes. European Journal of Combinatorics. 6(3). 205–210. 13 indexed citations
11.
Abbott, H. L. & Meir Katchalski. (1982). On a Set of Lattice Points not Containing the Vertices of a Square. European Journal of Combinatorics. 3(3). 191–193.
12.
Katchalski, Meir, et al.. (1982). Intersection Patterns of Families of Convex Sets. Canadian Journal of Mathematics. 34(4). 921–931. 1 indexed citations
13.
Katchalski, Meir & Ted G. Lewis. (1980). Cutting Families of Convex Sets. Proceedings of the American Mathematical Society. 79(3). 457–457. 5 indexed citations
14.
Katchalski, Meir & Ted G. Lewis. (1980). Cutting families of convex sets. Proceedings of the American Mathematical Society. 79(3). 457–461. 10 indexed citations
15.
Katchalski, Meir, et al.. (1979). Arcs on the circle and p-tuplets on the line. Discrete Mathematics. 27(1). 59–69. 3 indexed citations
16.
Katchalski, Meir, et al.. (1979). A problem of geometry in ${\bf R}\sp{n}$. Proceedings of the American Mathematical Society. 75(2). 284–284. 19 indexed citations
17.
Katchalski, Meir. (1979). Nondegenerate families of convex cones and convex polytopes. Geometriae Dedicata. 8(4).
18.
Katchalski, Meir. (1978). A Helly type Theorem for Convex Sets. Canadian Mathematical Bulletin. 21(1). 121–123. 2 indexed citations
19.
Katchalski, Meir. (1977). A Helly type theorem on the sphere. Proceedings of the American Mathematical Society. 66(1). 119–122. 4 indexed citations
20.
Katchalski, Meir. (1977). Intersecting all edges of convex polytopes by planes. Discrete Mathematics. 19(3). 273–279. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026