The following pages link to Veerle Fack (Q851772):
Displaying 43 items.
- (Q709828) (redirect page) (← links)
- To be or not to be Yutsis: algorithms for the decision problem (Q709830) (← links)
- Classifying strongly regular graphs using lexical ordering of adjacency matrices (Q757086) (← links)
- Projective two-weight codes with small parameters and their corresponding graphs (Q851774) (← links)
- On the reduction of Yutsis graphs (Q878649) (← links)
- Numerical methods for solving radial Schrödinger equations (Q909412) (← links)
- Graph structural properties of non-Yutsis graphs allowing fast recognition (Q1003683) (← links)
- Small weight codewords in the codes arising from Desarguesian projective planes (Q1008962) (← links)
- 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 (Q1009136) (← links)
- GrInvIn in a nutshell (Q1029769) (← links)
- Some finite difference methods for computing eigenvalues and eigenvectors of special two-point boundary value problems (Q1097655) (← links)
- The Pragacz identity and a new algorithm for Littlewood-Richardson coefficients (Q1174526) (← links)
- Algorithms for generating labelled graphs with given degree (Q1184790) (← links)
- Total exchange algorithms on 'sandwich graphs' (Q1192165) (← links)
- Optimal algorithms for total exchange without buffering on the hypercube (Q1195935) (← links)
- Calculation of general recoupling coefficients using graphical methods (Q1292610) (← links)
- Optimal data exchange algorithms on star graphs (Q1324416) (← links)
- On the diameter of the rotation graph of binary coupling trees (Q1348109) (← links)
- New efficient programs to calculate general recoupling coefficients. I: Generation of a summation formula (Q1355355) (← links)
- New efficient programs to calculate general recoupling coefficients. II: Evaluation of a summation formula (Q1359855) (← links)
- Route planning with turn restrictions: A computational experiment (Q1758274) (← links)
- A parallel iterated correction algorithm for the numerical solution of Volterra equations (Q1891030) (← links)
- A parallel fifth-order algorithm for the numerical solution of Volterra equations (Q1919944) (← links)
- Searching for maximal partial ovoids and spreads in generalized quadrangles (Q2471461) (← links)
- Enumeration of the doubles of the projective plane of order 4 (Q2509290) (← links)
- On the smallest maximal partial ovoids and spreads of the generalized quadrangles \(W(q)\) and \(Q(4,q)\) (Q2643842) (← links)
- (Q2741329) (← links)
- (Extended) Numerov method for computing eigenvalues of specific Schrodinger equations (Q3030161) (← links)
- (Q3210912) (← links)
- Clique algorithms for classifying substructures in generalized quadrangles (Q3439132) (← links)
- To be or not to be Yutsis (Q3439167) (← links)
- (Q3576667) (← links)
- (Q3576674) (← links)
- (Q3576708) (← links)
- Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions (Q3604821) (← links)
- A finite difference approach for the calculation of perturbed oscillator energies (Q3707285) (← links)
- Dynamic-group approach to the <i>x</i>2+λ<i>x</i>2/(1+<i>g</i> <i>x</i>2) potential (Q3739370) (← links)
- An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices (Q4009755) (← links)
- (Q4250922) (← links)
- (Q5441057) (← links)
- (Q5442531) (← links)
- Classification of minimal blocking sets in PG(2,9) (Q6181318) (← links)
- Classification of minimal blocking sets in small Desarguesian projective planes (Q6494515) (← links)
