Veerle Fack

From MaRDI portal
Revision as of 18:02, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Veerle Fack to Veerle Fack: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:851772

Available identifiers

zbMath Open fack.veerleMaRDI QIDQ851772

List of research outcomes

PublicationDate of PublicationType
Classification of minimal blocking sets in small Desarguesian projective planes2024-04-30Paper
Classification of minimal blocking sets in PG(2,9)2024-01-22Paper
Route planning with turn restrictions: A computational experiment2012-11-08Paper
To be or not to be Yutsis: algorithms for the decision problem2010-10-18Paper
https://portal.mardi4nfdi.de/entity/Q35766672010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35766742010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35767082010-07-30Paper
GrInvIn in a nutshell2009-07-13Paper
Small weight codewords in the codes arising from Desarguesian projective planes2009-03-31Paper
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 codes2009-03-31Paper
Graph structural properties of non-Yutsis graphs allowing fast recognition2009-03-04Paper
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions2009-02-24Paper
Searching for maximal partial ovoids and spreads in generalized quadrangles2008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54425312008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54410572008-02-07Paper
On the smallest maximal partial ovoids and spreads of the generalized quadrangles \(W(q)\) and \(Q(4,q)\)2007-08-27Paper
Clique algorithms for classifying substructures in generalized quadrangles2007-05-29Paper
To be or not to be Yutsis2007-05-29Paper
On the reduction of Yutsis graphs2007-04-26Paper
Projective two-weight codes with small parameters and their corresponding graphs2006-11-22Paper
Enumeration of the doubles of the projective plane of order 42006-10-19Paper
On the diameter of the rotation graph of binary coupling trees2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27413292001-09-23Paper
Calculation of general recoupling coefficients using graphical methods1999-08-16Paper
https://portal.mardi4nfdi.de/entity/Q42509221999-06-17Paper
New efficient programs to calculate general recoupling coefficients. II: Evaluation of a summation formula1998-08-02Paper
New efficient programs to calculate general recoupling coefficients. I: Generation of a summation formula1997-07-07Paper
A parallel fifth-order algorithm for the numerical solution of Volterra equations1996-09-18Paper
A parallel iterated correction algorithm for the numerical solution of Volterra equations1995-10-24Paper
Optimal data exchange algorithms on star graphs1995-01-23Paper
Optimal algorithms for total exchange without buffering on the hypercube1993-01-26Paper
Total exchange algorithms on 'sandwich graphs'1992-09-27Paper
An algorithm for the classification of strongly regular graphs by means of lexically ordered adjacency matrices1992-09-27Paper
Algorithms for generating labelled graphs with given degree1992-06-28Paper
The Pragacz identity and a new algorithm for Littlewood-Richardson coefficients1992-06-25Paper
Classifying strongly regular graphs using lexical ordering of adjacency matrices1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32109121990-01-01Paper
Numerical methods for solving radial Schrödinger equations1989-01-01Paper
Some finite difference methods for computing eigenvalues and eigenvectors of special two-point boundary value problems1987-01-01Paper
(Extended) Numerov method for computing eigenvalues of specific Schrodinger equations1987-01-01Paper
Dynamic-group approach to the x2+λx2/(1+g x2) potential1986-01-01Paper
A finite difference approach for the calculation of perturbed oscillator energies1985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Veerle Fack