Petra Scheffler

According to our database, Petra Scheffler authored at least 6 papers between 1987 and 1997.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1997

Characterizations and Algorithmic Applications of Chordal Graph Embeddings.

Andreas Parra, Petra Scheffler

Discret. Appl. Math., 1997

1995

How to Use the Minimal Separators of a Graph for its Chordal Triangulation.

Andreas Parra, Petra Scheffler

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1993

Maximum Covering with D Cliques.

Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

The Disjoint Cliques Problem

Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

Generalized Coloring for Tree-like Graphs

Klaus Jansen, Petra Scheffler

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1992

1987

A combinatorial and logical approach to linear-time computability.

Petra Scheffler, Detlef Seese

Proceedings of the EUROCAL '87, 1987