| Publication | Date of Publication | Type |
|---|
| The History of the Undergraduate Program in Mathematics in the United States | 2014-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3117560 | 2012-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3173626 | 2011-10-10 | Paper |
| What Every Mathematician Should Know about Standards-Based Tests | 2011-05-20 | Paper |
| Polynomial time recognition of unit circular-arc graphs | 2006-04-28 | Paper |
| The use of negative penalty functions in solving partial differential equations | 2005-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4328327 | 1995-03-30 | Paper |
| Balanced matrices with row sum 3 | 1995-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4305278 | 1994-09-13 | Paper |
| Greedy packing and series-parallel graphs | 1988-01-01 | Paper |
| Coloring perfect \((K_ 4\)-e)-free graphs | 1987-01-01 | Paper |
| A reduction procedure for coloring perfect \(K_ 4\)-free graphs | 1987-01-01 | Paper |
| An O(qn) algorithm to q-color a proper family of circular arcs | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216653 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218158 | 1984-01-01 | Paper |
| An O(N2) algorithm for coloring perfect planar graphs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680855 | 1984-01-01 | Paper |
| Coloring graphs with stable cutsets | 1983-01-01 | Paper |
| Uniquely colorable perfect graphs | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3661340 | 1983-01-01 | Paper |
| A matroid related to finitely chainlike, countably infinite networks | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3866122 | 1980-01-01 | Paper |
| An Efficient Test for Circular-Arc Graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3946199 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4173373 | 1978-01-01 | Paper |
| Critical perfect graphs and perfect 3-chromatic graphs | 1977-01-01 | Paper |
| A Note on Convergence of the Ford-Fulkerson Flow Algorithm | 1977-01-01 | Paper |
| A New Applicable Proof of the Euler Circuit Theorem | 1976-01-01 | Paper |
| Coloring a Family of Circular Arcs | 1975-01-01 | Paper |
| The cost of a class of optimal binary trees | 1974-01-01 | Paper |
| Structure theorems for some circular-arc graphs | 1974-01-01 | Paper |
| Polya's Enumeration Formula by Example | 1974-01-01 | Paper |
| The Strong Perfect Graph Conjecture for Planar Graphs | 1973-01-01 | Paper |
| Perfect Graphs and an Application to Optimizing Municipal Services | 1973-01-01 | Paper |
| A structure theorem for the consecutive 1's property | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5641181 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5659564 | 1972-01-01 | Paper |
| Matrix characterizations of circular-arc graphs | 1971-01-01 | Paper |
| Characterizing circular-arc graphs | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5612483 | 1970-01-01 | Paper |
