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
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
Is this relevant?
2012
2012
In 2005, Goodman and Pollack introduced the concept of an allowable interval sequence, a combinatorial object which encodes… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
16 MAY 1916 * 30 MAY 2009EPHRAIM KATZIR-KATCHALSKI dedicated his life to science and to the State of Israel, all within the frame… Expand
Is this relevant?
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
Is this relevant?
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… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 4.1
  • figure 4.2
Is this relevant?
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
Is this relevant?
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… Expand
  • figure 1
  • figure 2
Is this relevant?
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
Is this relevant?
1989
1989
We will prove that a finite family <italic>B</italic> = {<italic>B</italic><subscrpt>1</subscrpt>, <italic>B</italic><subscrpt>2… Expand
Is this relevant?