Publication | Date of Publication | Type |
---|
Classification of minimal blocking sets in small Desarguesian projective planes | 2024-04-30 | Paper |
Classification of minimal blocking sets in PG(2,9) | 2024-01-22 | Paper |
Route planning with turn restrictions: A computational experiment | 2012-11-08 | Paper |
To be or not to be Yutsis: algorithms for the decision problem | 2010-10-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3576667 | 2010-07-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q3576674 | 2010-07-30 | Paper |
https://portal.mardi4nfdi.de/entity/Q3576708 | 2010-07-30 | Paper |
GrInvIn in a nutshell | 2009-07-13 | Paper |
Small weight codewords in the codes arising from Desarguesian projective planes | 2009-03-31 | Paper |
2-(31,15,7), 2-(35,17,8) and 2-(36,15,6) designs with automorphisms of odd prime order, and their related Hadamard matrices and codes | 2009-03-31 | Paper |
Graph structural properties of non-Yutsis graphs allowing fast recognition | 2009-03-04 | Paper |
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions | 2009-02-24 | Paper |
Searching for maximal partial ovoids and spreads in generalized quadrangles | 2008-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q5442531 | 2008-02-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q5441057 | 2008-02-07 | Paper |
On the smallest maximal partial ovoids and spreads of the generalized quadrangles \(W(q)\) and \(Q(4,q)\) | 2007-08-27 | Paper |
Clique algorithms for classifying substructures in generalized quadrangles | 2007-05-29 | Paper |
To be or not to be Yutsis | 2007-05-29 | Paper |
On the reduction of Yutsis graphs | 2007-04-26 | Paper |
Projective two-weight codes with small parameters and their corresponding graphs | 2006-11-22 | Paper |
Enumeration of the doubles of the projective plane of order 4 | 2006-10-19 | Paper |
On the diameter of the rotation graph of binary coupling trees | 2002-05-15 | Paper |
https://portal.mardi4nfdi.de/entity/Q2741329 | 2001-09-23 | Paper |
Calculation of general recoupling coefficients using graphical methods | 1999-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4250922 | 1999-06-17 | Paper |
New efficient programs to calculate general recoupling coefficients. II: Evaluation of a summation formula | 1998-08-02 | Paper |
New efficient programs to calculate general recoupling coefficients. I: Generation of a summation formula | 1997-07-07 | Paper |
A parallel fifth-order algorithm for the numerical solution of Volterra equations | 1996-09-18 | Paper |
A parallel iterated correction algorithm for the numerical solution of Volterra equations | 1995-10-24 | Paper |
Optimal data exchange algorithms on star graphs | 1995-01-23 | Paper |
Optimal algorithms for total exchange without buffering on the hypercube | 1993-01-26 | Paper |
Total exchange algorithms on 'sandwich graphs' | 1992-09-27 | Paper |
An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices | 1992-09-27 | Paper |
Algorithms for generating labelled graphs with given degree | 1992-06-28 | Paper |
The Pragacz identity and a new algorithm for Littlewood-Richardson coefficients | 1992-06-25 | Paper |
Classifying strongly regular graphs using lexical ordering of adjacency matrices | 1991-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3210912 | 1990-01-01 | Paper |
Numerical methods for solving radial Schrödinger equations | 1989-01-01 | Paper |
Some finite difference methods for computing eigenvalues and eigenvectors of special two-point boundary value problems | 1987-01-01 | Paper |
(Extended) Numerov method for computing eigenvalues of specific Schrodinger equations | 1987-01-01 | Paper |
Dynamic-group approach to the x2+λx2/(1+g x2) potential | 1986-01-01 | Paper |
A finite difference approach for the calculation of perturbed oscillator energies | 1985-01-01 | Paper |