#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1954

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Tibor SzabÃ³, Philipp Zumstein, Stefanie ZÃ¼rcher
- Journal of Graph Theory
- 2010

We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, ErdÅ‘s, and LovÃ¡sz. We determine the corresponding graph parameter for numerous bipartiteâ€¦ (More)

- Noga Alon, Robert Berke, +5 authors Philipp Zumstein
- Symposium on Computational Geometry
- 2008

We show that the vertices of any plane graph in which every face is of size at least <i>g</i> can be colored by (3g Àý 5)=4 colors so that every color appears in every face. This is nearlyâ€¦ (More)

- Dominik Scheder, Philipp Zumstein
- SAT
- 2008

A pair of clauses in a CNF formula constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other. Clearly, a CNF formula has to have conflicts inâ€¦ (More)

- Philipp Zumstein, Caryn Stiles
- The Journal of biological chemistry
- 1987

Insulin-like growth factor I (IGF I) regulates the expression of a select few genes in quiescent BALB/c-3T3 cells. This was demonstrated by gel electrophoresis of radiolabeled proteins and byâ€¦ (More)

- Michael Hoffmann, JirÃ Matousek, Yoshio Okamoto, Philipp Zumstein
- Electr. J. Comb.
- 2011

In graph pebbling games, one considers a distribution of pebbles on the vertices of a graph, and a pebbling move consists of taking two pebbles off one vertex and placing one on an adjacent vertex.â€¦ (More)

- Dominik Scheder, Philipp Zumstein
- SAT
- 2007

Fix a set S âŠ† {0, 1}âˆ— of exponential size, e.g. |S âˆ© {0, 1}n| âˆˆ Î©(Î±n), Î± > 1. The S-SAT problem asks whether a propositional formula F over variables v1, . . . , vn has a satisfying assignment (v1, .â€¦ (More)

In a CNF formula, we say that a pair C,D of clauses constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other. We show that any a k-CNF formulaâ€¦ (More)

- Philipp Zumstein, Jurgen Zapf, E. Rudolf Froesch
- FEBS letters
- 1974

- Philipp Zumstein
- 2009

Combinatorial problems are often easy to state and hard to solve. A whole bunch of graph coloring problems falls into this class as well as the satisfiability problem. The classical coloring problemsâ€¦ (More)

- Vlad Popa, Philipp Zumstein
- Respiration; international review of thoracicâ€¦
- 1993

UNLABELLED
In 23 subjects with chronic obstructive pulmonary disease (COPD) who wheezed when changing their position from sitting to dorsal decubitus (DD), we recorded lung volumes and flow volumeâ€¦ (More)