default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeir Katchalski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1974
[b1]Meir Katchalski:
Dimensions of intersections of convex sets (ממדים של חתוכים של קבוצות קמורות.). Hebrew University of Jerusalem, Israel, 1974
Journal Articles
- 2012
- [j28]Emil Saucan, Meir Katchalski:
Fat Triangulations, Curvature and Quasiconformal Mappings. Axioms 1(2): 99-110 (2012) - 2006
- [j27]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): 473-480 (2006) - 2005
- [j26]Andrei Asinowski, Meir Katchalski:
Forbidden Families of Geometric Permutations in Rd. Discret. Comput. Geom. 34(1): 1-10 (2005) - 2003
- [j25]Meir Katchalski, Subhash Suri, Yunhong Zhou:
A Constant Bound for Geometric Permutations of Disjoint Unit Balls. Discret. Comput. Geom. 29(2): 161-173 (2003) - [j24]Andreas F. Holmsen, Meir Katchalski, Ted Lewis:
A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls. Discret. Comput. Geom. 29(4): 595-602 (2003) - 2001
- [j23]Andrei Asinowski, Andreas F. Holmsen, Meir Katchalski:
The triples of geometric permutations for families of disjoint translates. Discret. Math. 241(1-3): 23-32 (2001) - 2000
- [j22]H. L. Abbott, Meir Katchalski:
Covering Squares with Squares. Discret. Comput. Geom. 24(2-3): 151-170 (2000) - 1999
- [j21]Meir Katchalski, D. Nashtir:
A Helly Type Conjecture. Discret. Comput. Geom. 21(1): 37-43 (1999) - 1998
- [j20]Meir Katchalski, Hagit Last:
On Geometric Graphs with No Two Edges in Convex Position. Discret. Comput. Geom. 19(3): 399-404 (1998) - 1996
- [j19]Wayne Goddard, Meir Katchalski, Daniel J. Kleitman:
Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17(4): 391-395 (1996) - 1995
- [j18]Meir Katchalski, William McCuaig, Suzanne M. Seager:
Ordered colourings. Discret. Math. 142(1-3): 141-154 (1995) - 1994
- [j17]H. L. Abbott, Meir Katchalski, Bing Zhou:
Proof of a conjecture of Dirac concerning 4-critical planar graphs. Discret. Math. 132(1-3): 367-371 (1994) - [j16]Meir Katchalski, Roy Meshulam:
An Extremal Problem for Families of Pairs of Subspaces. Eur. J. Comb. 15(3): 253-257 (1994) - 1992
- [j15]Meir Katchalski, Ted Lewis, A. Liu:
The Different Ways of Stabbling Disjoint Convex Sets. Discret. Comput. Geom. 7: 197-206 (1992) - 1991
- [j14]H. L. Abbott, Meir Katchalski:
Further results on snakes in powers of complete graphs. Discret. Math. 91(2): 111-120 (1991) - 1990
- [j13]Noga Alon, Meir Katchalski, Edward R. Scheinerman:
Not All Graphs are Segment T-graphs. Eur. J. Comb. 11(1): 7-13 (1990) - 1989
- [j12]Noga Alon, Meir Katchalski, William R. Pulleyblank:
Cutting Disjoint Disks by Straight Lines. Discret. Comput. Geom. 4: 239-243 (1989) - [j11]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: 245-251 (1989) - 1988
- [j10]H. L. Abbott, Meir Katchalski:
Snakes and pseudo-snakes in powers of complete graphs. Discret. Math. 68(1): 1-8 (1988) - [j9]H. L. Abbott, Meir Katchalski:
On the snake in the box problem. J. Comb. Theory B 45(1): 13-24 (1988) - 1987
- [j8]Meir Katchalski, Ted Lewis, A. Liu:
Geometric permutations of disjoint translates of convex sets. Discret. Math. 65(3): 249-259 (1987) - 1985
- [j7]Meir Katchalski, Ted Lewis, Joseph Zaks:
Geometric permutations for convex sets. Discret. Math. 54(3): 271-284 (1985) - [j6]Noga Alon, Zoltán Füredi, Meir Katchalski:
Separating Pairs of Points by Standard Boxes. Eur. J. Comb. 6(3): 205-210 (1985) - 1982
- [j5]Meir Katchalski, Ted Lewis:
Cutting rectangles in the plane. Discret. Math. 42(1): 67-71 (1982) - [j4]H. L. Abbott, Meir Katchalski:
On a Set of Lattice Points not Containing the Vertices of a Square. Eur. J. Comb. 3(3): 191-193 (1982) - 1979
- [j3]Harvey L. Abbott, Meir Katchalski:
A Turán type problem for interval graphs. Discret. Math. 25(1): 85-88 (1979) - [j2]Meir Katchalski, A. Liu:
Arcs on the circle and p-tuplets on the line. Discret. Math. 27(1): 59-69 (1979) - 1977
- [j1]Meir Katchalski:
Intersecting all edges of convex polytopes by planes. Discret. Math. 19(3): 273-279 (1977)
Informal and Other Publications
- 2011
- [i1]Meir Katchalski, Eliahu Levy:
No O(N) queries for checking if N. CoRR abs/1109.2763 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
