2009 |
17 | EE | Iliya Bouyukliev,
Veerle Fack,
Joost Winne:
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.
Des. Codes Cryptography 51(2): 105-122 (2009) |
16 | EE | Robert E. L. Aldred,
Dries Van Dyck,
Gunnar Brinkmann,
Veerle Fack,
Brendan D. McKay:
Graph structural properties of non-Yutsis graphs allowing fast recognition.
Discrete Applied Mathematics 157(2): 377-386 (2009) |
2008 |
15 | EE | Veerle Fack,
Szabolcs L. Fancsali,
Leo Storme,
Geertrui Van de Voorde,
Joost Winne:
Small weight codewords in the codes arising from Desarguesian projective planes.
Des. Codes Cryptography 46(1): 25-43 (2008) |
14 | EE | Tsonka Stefanova Baicheva,
Iliya Bouyukliev,
Stefan M. Dodunekov,
Veerle Fack:
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions.
IEEE Transactions on Information Theory 54(9): 4335-4339 (2008) |
2007 |
13 | | Adriaan Peeters,
Kris Coolsaet,
Gunnar Brinkmann,
Nicolas Van Cleemput,
Veerle Fack:
GrInvIn for graph theory teaching and research.
CTW 2007: 123-126 |
12 | EE | Dries Van Dyck,
Veerle Fack:
On the reduction of Yutsis graphs.
Discrete Mathematics 307(11-12): 1506-1515 (2007) |
11 | EE | M. Cimráková,
Stefaan De Winter,
Veerle Fack,
Leo Storme:
On the smallest maximal partial ovoids and spreads of the generalized quadrangles W(q) and Q(4, q).
Eur. J. Comb. 28(7): 1934-1942 (2007) |
2006 |
10 | EE | Iliya Bouyukliev,
Veerle Fack,
Wolfgang Willems,
Joost Winne:
Projective two-weight codes with small parameters and their corresponding graphs.
Des. Codes Cryptography 41(1): 59-78 (2006) |
9 | EE | Veerle Fack,
Svetlana Topalova,
Joost Winne,
Rosen Zlatarski:
Enumeration of the doubles of the projective plane of order 4.
Discrete Mathematics 306(18): 2141-2151 (2006) |
2005 |
8 | EE | Dries Van Dyck,
Gunnar Brinkmann,
Veerle Fack,
Brendan D. McKay:
To be or not to be Yutsis: Algorithms for the decision problem.
Computer Physics Communications 173(1-2): 61-70 (2005) |
2004 |
7 | EE | Dries Van Dyck,
Veerle Fack:
To be or not to be Yutsis.
Electronic Notes in Discrete Mathematics 17: 275-279 (2004) |
6 | EE | Miroslava Cajkova,
Veerle Fack:
Clique algorithms for classifying substructures in generalized quadrangles.
Electronic Notes in Discrete Mathematics 17: 75-79 (2004) |
2002 |
5 | EE | Veerle Fack,
Stijn Lievens,
Joris Van der Jeugt:
On the diameter of the rotation graph of binary coupling trees.
Discrete Mathematics 245(1-3): 1-18 (2002) |
1999 |
4 | EE | Veerle Fack,
Stijn Lievens,
Joris Van der Jeugt:
On bounds for the rotation distance between binary coupling trees.
Electronic Notes in Discrete Mathematics 3: 40-44 (1999) |
1994 |
3 | | Kris Coolsaet,
Veerle Fack,
H. De Meyer:
A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors.
Nord. J. Comput. 1(2): 202-213 (1994) |
1993 |
2 | | Veerle Fack,
Kris Coolsaet,
H. De Meyer:
Using a Tabular Method for Verification of Total Exchange Algorithms on Networks of Parallel Processors.
PARCO 1993: 605-608 |
1992 |
1 | | Kris Coolsaet,
H. De Meyer,
Veerle Fack:
Optimal Algorithms for Total Exchange without Buffering on the Hypercube.
BIT 32(4): 559-569 (1992) |