| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6155599 | 2023-06-05 | Paper |
| Deepest point of a polyhedron and linear programming | 2015-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517161 | 2008-08-12 | Paper |
| Finding the orthogonal projection of a point onto an affine subspace | 2007-04-10 | Paper |
| Minimumk-geodetically connected digraphs | 2005-01-12 | Paper |
| Towards minimumk-geodetically connected graphs | 2003-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552212 | 2002-08-29 | Paper |
| Minimum cost edge subset covering exactly \(k\) vertices of a graph | 2001-01-01 | Paper |
| Constrained weighted matchings and edge coverings in graphs | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222070 | 2000-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934235 | 2000-01-17 | Paper |
| On the structure of digraphs with order close to the Moore bound | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4351074 | 1998-03-12 | Paper |
| A note on constructing large Cayley graphs of given degree and diameter by voltage assignments | 1998-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858166 | 1996-03-31 | Paper |
| Digraphs of degree 3 and order close to the moore bound | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318150 | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304337 | 1994-09-12 | Paper |
| An integer programming formulation of the Steiner problem in graphs | 1993-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4027188 | 1993-02-21 | Paper |
| Heuristics for the Steiner problem in graphs | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3988522 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974150 | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3356329 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800086 | 1988-01-01 | Paper |
| A heuristic for the p-center problem in graphs | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783313 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4731220 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3739159 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3771994 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3754020 | 1985-01-01 | Paper |
| A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs | 1984-01-01 | Paper |
| A note on the complexity of finding regular subgraphs | 1984-01-01 | Paper |
| Equivalence between the minimum covering problem and the maximum matching problem | 1984-01-01 | Paper |
| On the sum of all distances in a graph or digraph | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3325758 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3328585 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3658028 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4740601 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907583 | 1981-01-01 | Paper |
| The complexity of designing a network with minimum diameter | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3879256 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902477 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4744288 | 1980-01-01 | Paper |
| The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3853670 | 1979-01-01 | Paper |
| Bounds on chromatic numbers of multiple factors of a complete graph | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4116463 | 1977-01-01 | Paper |
| Minimum block containing a given graph | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3875973 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068763 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4074921 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079637 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4090373 | 1975-01-01 | Paper |
| One method for proving the impossibility of certain Moore graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4041603 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068761 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4777333 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672938 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5659595 | 1972-01-01 | Paper |
| On the impossibility to construct certain classes of graphs by extensions | 1971-01-01 | Paper |
| Remark on the graphs with a central symmetry | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5604418 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5577692 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5577693 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5581301 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5589884 | 1969-01-01 | Paper |
