The Katchalski-Katzir algorithm is an algorithm for docking of rigid molecules, developed by Ephraim Katchalski/Katzir. It is a purely geometricâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- MÃ¡rton NaszÃ³di
- Discrete & Computational Geometry
- 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â€¦Â (More)

Is this relevant?

2012

2012

- Simon Richardson, Bernard Siow, Eleftheria Panagiotaki, Torben Schneider, Mark F. Lythgoe, Daniel C. Alexander
- 2012

We compare fixed and viable isolated tissue (VIT) in identical conditions at physiological temperature. We acquired DTI data setsâ€¦Â (More)

Is this relevant?

2007

2005

2005

The interactions between the insulin receptor and the two highly homologous receptor-like protein tyrosine phosphatases (PTPaseâ€¦Â (More)

Is this relevant?

2005

2005

- Werner R. Loewenstein
- The Journal of Membrane Biology
- 2005

A man with a razor-sharp mind, overflowing with ideas, a man full of life. This was Aharon Katzir-Katchalsky. He was killed onâ€¦Â (More)

Is this relevant?

1998

1998

- Jerzy Wojciechowski
- Discrete Mathematics
- 1998

We prove the conjecture of Abbott and Katchalski that for every m â‰¥ 2 there is a positive constant Î»m such that S(K d mn) â‰¥ Î»mnSâ€¦Â (More)

Is this relevant?

1997

1997

- Gilles ZÃ©mor
- Combinatorica
- 1997

The n-cube Qn can be considered as the graph whose vertices are indexed by the binary n-tuples and such that two vertices areâ€¦Â (More)

Is this relevant?

1990

1990

On Geometric Permutations and the Katchalski-Lewis Conjecture on Partial Transversals for Translates

- Helge Tverberg
- Discrete and Computational Geometry
- 1990

Â

Is this relevant?

1989

1989

- Richard Pollack, Rephael Wenger
- Symposium on Computational Geometry
- 1989

We will prove that a finite family <italic>B</italic> = {<italic>B</italic><subscrpt>1</subscrpt>, <italic>B</italic><subscrpt>2â€¦Â (More)

Is this relevant?

1986

1986

- Noga Alon
- Journal of Graph Theory
- 1986

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 111â€¦Â (More)

Is this relevant?