Skip to search formSkip to main contentSkip to account menu

Katchalski-Katzir algorithm

Known as: Katchalski, Katzir (disambiguation) 
The Katchalski-Katzir algorithm is an algorithm for docking of rigid molecules, developed by Ephraim Katchalski/Katzir. It is a purely geometric… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Bárány, Katchalski and Pach (Proc Am Math Soc 86(1):109–114, 1982) (see also Bárány et al., Am Math Mon 91(6):362–365, 1984… 
2011
2011
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem… 
2008
2008
  • J. Eckhoff
  • 2008
  • Corpus ID: 34104429
2007
2007
A family of disjoint closed congruent discs is said to have property T(3) if to every triple of discs there exists a common line… 
2003
2003
Abstract. Let F be a family of disjoint unit balls in R3 . We prove that there is a Helly-number n0≤ 46 , such that if every n0… 
1997
1997
A snake in a graph is a simple cycle without chords. We give an upper bound on the size of a snake S in then-dimensional cube of… 
1989
1989
We prove that a finite family ℬ={B1,B2, ...,Bn} of connected compact sets in ℝd has a hyperplane transversal if and only if for… 
Highly Cited
1974
Highly Cited
1974
"First published as volume 12, no. 1, March 1974, of the Neurosciences Research Program bulletin." Includes index. 
1962
1962
Proof. Essentially, only the assertion (iii) is new. The first statement, h(n, 0) = n + 1, is Helly's well-known theorem [5]. The… 
1955
1955
POLYELECTROLYTES of high molecular weight have been shown to inhibit a variety of enzymes in what Spensley and Rogers1 have…