Gerhard Ringel (October 28, 1919, in Kollnbrunn, Austria – June 24, 2008, in Santa Cruz, California) was a German mathematician who earned his Ph.D… (More)

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

2008

2008

- VALERIO TOLEDANO LAREDO
- 2008

Let G be a complex algebraic group and∇ a meromorphic connection on the trivial G–bundle over P with a pole of order 2 at zero… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Kent R. Fuller, Silvana Bazzoni, Kent Fuller, Robert Colby, Ángel Del Río Mateos
- 2006

s of talks Baer modules over tame hereditary algebras Lidia Angeleri Hügel In 1979, Ringel discovered a striking analogy between… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We show that the category of orbits of the bounded derived category of a hereditary category under a well-behaved autoequivalence… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Diana Marculescu, Radu Marculescu, +10 authors Nakad
- Proceedings of the IEEE
- 2003

DIANA MARCULESCU, MEMBER, IEEE, RADU MARCULESCU, MEMBER, IEEE, NICHOLAS H. ZAMORA, PHILLIP STANLEY-MARBELL, STUDENT MEMBER, IEEE… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We provide a quiver-theoretic interpretation of certain smooth complete simplicial fans associated to arbitrary finite root… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Katrin Kirchhoff
- 1999

Current automatic speech recognition systems make use of a single source of information about their input, viz. a preprocessed… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

Recent studies with patients suffering from epidermolysis bullosa simplex associated with muscular dystrophy and the targeted… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Victor W. Marek
- SGAR
- 1992

Nonmonotonic reasoning forms one of the main components of the logical approach to Artificial Intelligence and Knowledge… (More)

Is this relevant?

1985

1985

- Nora Hartsfield, Brad Jackson, Gerhard Ringel
- Graphs and Combinatorics
- 1985

Ifa given graph G can be obtained by s vertex identifications from a suitable planar graph and s is the minimum number for which… (More)

Is this relevant?

1983

1983

- Brad Jackson, Gerhard Ringel
- Discrete Mathematics
- 1983

In this paper we consider a generalization of Heawood's map color theorem. In 1890, P.J. Heawood [2] showed that for a surface… (More)

Is this relevant?