Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
  • M. Naszódi
  • Discret. Comput. Geom.
  • 2016
  • Corpus ID: 206998268
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… Expand
  • figure 1
2012
2012
In 2005, Goodman and Pollack introduced the concept of an allowable interval sequence, a combinatorial object which encodes… Expand
2008
2008
A fresh look is taken at the fractional Helly theorem for line transversals to families of convex sets in the plane. This theorem… Expand
  • figure 1
2008
2008
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric… Expand
  • figure 1
2007
2007
  • A. Heppes
  • Discret. Comput. Geom.
  • 2007
  • Corpus ID: 32546446
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… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • figure 4.2
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… Expand
Highly Cited
1991
Highly Cited
1991
Geometric partitioning and its applications by P. K. Agarwal On the convex hull of the integer points in a disc by A. Balog and I… Expand
1990
1990
We prove that a finite family ℬ={B1,B2, ...,Bn} of connected compact sets in ℝd has a hyperplane transversal if and only if for… Expand
1986
1986
  • N. Alon
  • J. Graph Theory
  • 1986
  • Corpus ID: 206079422
We show that every graph G on n vertices with minimal degree at least n/k contains a cycle of length at least [n/(k − 1)]. This… Expand
1955
1955
POLYELECTROLYTES of high molecular weight have been shown to inhibit a variety of enzymes in what Spensley and Rogers1 have… Expand