| Characterizations and algorithmic applications of chordal graph embeddings A Parra, P Scheffler Discrete Applied Mathematics 79 (1-3), 171-188, 1997 | 156 | 1997 |
| Generalized coloring for tree-like graphs K Jansen, P Scheffler Discrete Applied Mathematics 75 (2), 135-155, 1997 | 147 | 1997 |
| A practical linear time algorithm for disjoint paths in graphs with bounded tree width P Scheffler Technische Universität Berlin, Fachbereich 3 Mathematik, 1994 | 87 | 1994 |
| Die Baumweite von Graphen als ein Maß für die Kompliziertheit algorithmischer Probleme (PhD Thesis) P Scheffler Akademie der Wissenschaften der DDR, Karl-Weierstraß-Institut für Mathematik …, 1989 | 87 | 1989 |
| A linear algorithm for the pathwidth of trees P Scheffler Topics in combinatorics and graph theory, 613-620, 1990 | 72 | 1990 |
| How to use the minimal separators of a graph for its chordal triangulation A Parra, P Scheffler Automata, languages and programming. ICALP 1995. Lecture Notes in Computer …, 1995 | 56 | 1995 |
| Linear-time algorithms for NP-complete problems restricted to partial k-trees P Scheffler Akademie der Wissenschaften der DDR, Karl-Weierstraß-Institut für Mathematik, 1987 | 36 | 1987 |
| Node ranking and searching on graphs P Scheffler Third Twente Workshop on Graphs and Combinatorial Optimization 1132, 159-162, 1993 | 35 | 1993 |
| The disjoint cliques problem K Jansen, P Scheffler, G Woeginger Revue française d'automatique, d'informatique et de recherche opérationnelle …, 1997 | 30* | 1997 |
| Generalized coloring for tree-like graphs K Jansen, P Scheffler Graph-Theoretic Concepts in Computer Science: 18th International Workshop …, 1993 | 22 | 1993 |
| A combinatorial and logical approach to linear-time computability (extended abstract) P Scheffler, D Seese European Conference on Computer Algebra, Eurocal'87 378, 379-380, 1988 | 22* | 1988 |
| Optimal embedding of a tree into an interval graph in linear time P Scheffler Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity …, 1992 | 19 | 1992 |
| Path systems in acyclic directed graphs HDOF Gronau, W Just, W Schade, P Scheffler, J Wojciechowski Applicationes Mathematicae 19, 399-411, 1987 | 13 | 1987 |
| What graphs have bounded tree-width P Scheffler 7th Fishland-Colloquium Discrete Mathematics und Applications, Wustrow 1988 …, 1990 | 12 | 1990 |
| Dynamic programming algorithms for tree decomposition problems P Scheffler Akademie der Wissenschaften der DDR, Karl-Weierstraß-Institut für Mathematik, 1986 | 9 | 1986 |
| Treewidth equals bandwidth for AT-free claw-free graphs A Parra, P Scheffler Technische Universität Berlin, Fachbereich 3 Mathematik, 1995 | 8 | 1995 |
| Linear-time algorithms for graphs of bounded tree-width. The disjoint paths problem P Scheffler Graphentheorie und ihre Anwendungen 5 (9), 49-52, 1988 | 6* | 1988 |
| The graphs of tree-width k are exactly the partial k-trees P Scheffler Akademie der Wissenschaften der DDR, Karl-Weierstraß-Institut für Mathematik, 1986 | 5 | 1986 |
| Graphs of bounded tree-width and linear-time algorithms for NP-complete problems P Scheffler, D Seese Proceedings of the Bilateral Seminar, 1986 | 5 | 1986 |
| Teaching algorithmics – theory and practice P Scheffler Informatics in the Scientific Knowledge, 259-269, 2008 | 1 | 2008 |
