default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVeerle Fack
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j28]Ann Vanclooster, Nina Vanhaeren
, Pepijn Viaene, Kristien Ooms, Laure De Cock, Veerle Fack, Nico Van de Weghe, Philippe De Maeyer:
Turn calculations for the indoor application of the fewest turns path algorithm. Int. J. Geogr. Inf. Sci. 33(11): 2284-2304 (2019)- 2018
- [j27]Herman De Beukelaer, Guy F. Davenport, Veerle Fack:
Core Hunter 3: flexible core subset selection. BMC Bioinform. 19(1): 203:1-203:12 (2018) - 2017
- [j26]Herman De Beukelaer, Guy F. Davenport, Geert De Meyer, Veerle Fack:
JAMES: An object-oriented Java framework for discrete optimization using local search metaheuristics. Softw. Pract. Exp. 47(6): 921-938 (2017) - 2015
- [j25]Michaël Vyverman, Bernard De Baets, Veerle Fack, Peter Dawyndt:
A Long Fragment Aligner called ALFALFA. BMC Bioinform. 16: 159:1-159:11 (2015) - 2014
- [j24]Ann Vanclooster, Nico Van de Weghe, Veerle Fack, Philippe De Maeyer:
Comparing indoor and outdoor network models for automatically calculating turns. J. Locat. Based Serv. 8(3): 148-165 (2014) - [c7]Michaël Vyverman, Dieter De Smedt, Yao-Cheng Lin, Lieven Sterck, Bernard De Baets, Veerle Fack, Peter Dawyndt:
Fast and Accurate cDNA Mapping and Splice Site Identification. BIOINFORMATICS 2014: 233-238 - 2013
- [j23]Michaël Vyverman, Bernard De Baets, Veerle Fack, Peter Dawyndt:
essaMEM: finding maximal exact matches using enhanced sparse suffix arrays. Bioinform. 29(6): 802-804 (2013) - 2012
- [j22]Herman De Beukelaer, Petr Smýkal, Guy F. Davenport, Veerle Fack:
Core Hunter II: Fast core subset selection based on multiple genetic diversity measures using Mixed Replica Search. BMC Bioinform. 13: 312 (2012) - [j21]Kristien Ooms, Gennady L. Andrienko, Natalia V. Andrienko, Philippe De Maeyer, Veerle Fack:
Analysing the spatial dimension of eye movement data using a visual analytic approach. Expert Syst. Appl. 39(1): 1324-1332 (2012) - [j20]Stéphanie Vanhove, Veerle Fack:
An effective heuristic for computing many shortest path alternatives in road networks. Int. J. Geogr. Inf. Sci. 26(6): 1031-1050 (2012) - [j19]Kristien Ooms, Philippe De Maeyer, Veerle Fack, Eva Van Assche, Frank Witlox:
Interpreting maps through the eyes of expert and novice users. Int. J. Geogr. Inf. Sci. 26(10): 1773-1788 (2012) - [j18]Stéphanie Vanhove, Veerle Fack:
Route planning with turn restrictions: A computational experiment. Oper. Res. Lett. 40(5): 342-348 (2012) - 2011
- [c6]Michaël Vyverman, Joachim M. De Schrijver, Wim Van Criekinge, Peter Dawyndt, Veerle Fack:
Accurate Long Read Mapping using Enhanced Suffix Arrays. BIOINFORMATICS 2011: 102-107 - [c5]Stéphanie Vanhove, Veerle Fack:
Locally optimal dissimilar paths in road networks. CTW 2011: 271-274 - 2010
- [j17]Stéphanie Vanhove, Veerle Fack:
Applications of graph algorithms in GIS. ACM SIGSPATIAL Special 2(3): 31-36 (2010)
2000 – 2009
- 2009
- [j16]Robert E. L. Aldred, Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay:
Graph structural properties of non-Yutsis graphs allowing fast recognition. Discret. Appl. Math. 157(2): 377-386 (2009) - [j15]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 Cryptogr. 51(2): 105-122 (2009) - 2008
- [j14]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 Cryptogr. 46(1): 25-43 (2008) - [j13]Tsonka Stefanova Baicheva, Iliya Bouyukliev, Stefan M. Dodunekov, Veerle Fack:
Binary and Ternary Linear Quasi-Perfect Codes With Small Dimensions. IEEE Trans. Inf. Theory 54(9): 4335-4339 (2008) - 2007
- [j12]Veerle Fack, Brendan D. McKay:
A generalized switching method for combinatorial estimation. Australas. J Comb. 39: 141-154 (2007) - [j11]Dries Van Dyck, Veerle Fack:
On the reduction of Yutsis graphs. Discret. Math. 307(11-12): 1506-1515 (2007) - [j10]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) - [c4]Adriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack:
GrInvIn for graph theory teaching and research. CTW 2007: 123-126 - 2006
- [j9]Iliya Bouyukliev, Veerle Fack, Wolfgang Willems, Joost Winne:
Projective two-weight codes with small parameters and their corresponding graphs. Des. Codes Cryptogr. 41(1): 59-78 (2006) - [j8]Veerle Fack, Svetlana Topalova, Joost Winne, Rosen Zlatarski:
Enumeration of the doubles of the projective plane of order 4. Discret. Math. 306(18): 2141-2151 (2006) - 2005
- [j7]Dries Van Dyck, Gunnar Brinkmann, Veerle Fack, Brendan D. McKay:
To be or not to be Yutsis: Algorithms for the decision problem. Comput. Phys. Commun. 173(1-2): 61-70 (2005) - 2004
- [j6]Miroslava Cajkova, Veerle Fack:
Clique algorithms for classifying substructures in generalized quadrangles. Electron. Notes Discret. Math. 17: 75-79 (2004) - [j5]Dries Van Dyck, Veerle Fack:
To be or not to be Yutsis. Electron. Notes Discret. Math. 17: 275-279 (2004) - [c3]Miroslava Cajkova, Veerle Fack:
Clique Algorithms for Classifying Substructures in Generalized Quadrangles. CTW 2004: 71-74 - [c2]Dries Van Dyck, Veerle Fack:
To be or not to be Yutsis. CTW 2004: 237-241 - 2002
- [j4]Veerle Fack, Stijn Lievens, Joris Van der Jeugt:
On the diameter of the rotation graph of binary coupling trees. Discret. Math. 245(1-3): 1-18 (2002)
1990 – 1999
- 1999
- [j3]Veerle Fack, Stijn Lievens, Joris Van der Jeugt:
On bounds for the rotation distance between binary coupling trees. Electron. Notes Discret. Math. 3: 40-44 (1999) - 1994
- [j2]Kris Coolsaet, Veerle Fack, Hans E. 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
- [c1]Veerle Fack, Kris Coolsaet, Hans E. De Meyer:
Using a Tabular Method for Verification of Total Exchange Algorithms on Networks of Parallel Processors. PARCO 1993: 605-608 - 1992
- [j1]Kris Coolsaet, Hans E. De Meyer, Veerle Fack:
Optimal Algorithms for Total Exchange without Buffering on the Hypercube. BIT 32(4): 559-569 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
