Veerle Fack

According to our database1, Veerle Fack authored at least 32 papers between 1992 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Core Hunter 3: flexible core subset selection.
BMC Bioinformatics, 2018

2017
JAMES: An object-oriented Java framework for discrete optimization using local search metaheuristics.
Softw., Pract. Exper., 2017

2015
A Long Fragment Aligner called ALFALFA.
BMC Bioinformatics, 2015

2014
Comparing indoor and outdoor network models for automatically calculating turns.
J. Location Based Services, 2014

Fast and Accurate cDNA Mapping and Splice Site Identification.
Proceedings of the BIOINFORMATICS 2014, 2014

2013
essaMEM: finding maximal exact matches using enhanced sparse suffix arrays.
Bioinformatics, 2013

2012
Route planning with turn restrictions: A computational experiment.
Oper. Res. Lett., 2012

An effective heuristic for computing many shortest path alternatives in road networks.
International Journal of Geographical Information Science, 2012

Interpreting maps through the eyes of expert and novice users.
International Journal of Geographical Information Science, 2012

Analysing the spatial dimension of eye movement data using a visual analytic approach.
Expert Syst. Appl., 2012

Core Hunter II: Fast core subset selection based on multiple genetic diversity measures using Mixed Replica Search.
BMC Bioinformatics, 2012

2011
Locally optimal dissimilar paths in road networks.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Accurate Long Read Mapping using Enhanced Suffix Arrays.
Proceedings of the BIOINFORMATICS 2011, 2011

2010
Applications of graph algorithms in GIS.
SIGSPATIAL Special, 2010

2009
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 Cryptogr., 2009

Graph structural properties of non-Yutsis graphs allowing fast recognition.
Discrete Applied Mathematics, 2009

2008
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions.
IEEE Trans. Information Theory, 2008

Small weight codewords in the codes arising from Desarguesian projective planes.
Des. Codes Cryptogr., 2008

2007
On the smallest maximal partial ovoids and spreads of the generalized quadrangles W(q) and Q(4, q).
Eur. J. Comb., 2007

On the reduction of Yutsis graphs.
Discrete Mathematics, 2007

A generalized switching method for combinatorial estimation.
Australasian J. Combinatorics, 2007

GrInvIn for graph theory teaching and research.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Enumeration of the doubles of the projective plane of order 4.
Discrete Mathematics, 2006

Projective two-weight codes with small parameters and their corresponding graphs.
Des. Codes Cryptogr., 2006

2005
To be or not to be Yutsis: Algorithms for the decision problem.
Computer Physics Communications, 2005

2004
To be or not to be Yutsis.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

Clique Algorithms for Classifying Substructures in Generalized Quadrangles.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2002
On the diameter of the rotation graph of binary coupling trees.
Discrete Mathematics, 2002

1999
On bounds for the rotation distance between binary coupling trees.
Electronic Notes in Discrete Mathematics, 1999

1994
A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors.
Nord. J. Comput., 1994

1993
Using a Tabular Method for Verification of Total Exchange Algorithms on Networks of Parallel Processors.
Proceedings of the Parallel Computing: Trends and Applications, 1993

1992
Optimal Algorithms for Total Exchange without Buffering on the Hypercube.
BIT, 1992


  Loading...