| Generating linear extensions fast G Pruesse, F Ruskey SIAM Journal on Computing 23 (2), 373-386, 1994 | 194 | 1994 |
| An optimal path cover algorithm for cographs R Lin, S Olariu, G Pruesse Computers & Mathematics with Applications 30 (8), 75-83, 1995 | 89 | 1995 |
| Generating the linear extensions of certain posets by transpositions G Pruesse, F Ruskey SIAM Journal on Discrete Mathematics 4 (3), 413-422, 1991 | 56 | 1991 |
| Gray codes from antimatroids G Pruesse, F Ruskey Order 10 (3), 239-252, 1993 | 38 | 1993 |
| The prism of the acyclic orientation graph is Hamiltonian G Pruesse, F Ruskey the electronic journal of combinatorics, R5-R5, 1995 | 15 | 1995 |
| Circuit delay abstraction tool PE Dudley, PT Gutwin, G Pruesse US Patent 5,796,621, 1998 | 13 | 1998 |
| An optimal path cover for cographs R Lin, S Olariu, G Pruesse preprint, 0 | 7 | |
| All simple Venn diagrams are Hamiltonian G Pruesse, F Ruskey arXiv preprint arXiv:1504.06651, 2015 | 4 | 2015 |
| A generalization of hamiltonicity G Pruesse University of Toronto, 1990 | 2 | 1990 |
| Transposition generation of the linear extensions of certain posets G Pruesse, F Ruskey University of Victoria, Department of Computer Science, 1988 | 2 | 1988 |
| Greed is good for 2-approximating the jump number for interval posets G Pruesse | | 2022 |
| A Fast, Simple Algorithm for Computing the Bump Number of a Poset G Pruesse, D Corneil, L Mouatadid | | 2018 |
| ARIEL WEBSTER G Pruesse Department of Computer Science, Vancouver Island University, 2016 | | 2016 |
| Routing with delays when storage is costly S Baruah, G Pruesse Workshop on Algorithms and Data Structures, 303-314, 1995 | | 1995 |
| Efficient generation of linear extensions and other restricted permutations G Pruesse University of Toronto, 1993 | | 1993 |
