default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKris Coolsaet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Kris Coolsaet
:
Nonsingular hypercubes and nonintersecting hyperboloids. Des. Codes Cryptogr. 92(1): 93-112 (2024)- 2023
- [j30]Kris Coolsaet, Sven D'hondt, Jan Goedgebeur:
House of Graphs 2.0: A database of interesting graphs and more. Discret. Appl. Math. 325: 97-107 (2023) - 2022
- [j29]Tom Neutens, Kris Coolsaet, Francis Wyffels:
Assessment of Code, Which Aspects Do Teachers Consider and How Are They Valued? ACM Trans. Comput. Educ. 22(4): 46:1-46:27 (2022) - [i3]Kris Coolsaet, Sven D'hondt, Jan Goedgebeur:
House of Graphs 2.0: a database of interesting graphs and more. CoRR abs/2210.17253 (2022) - 2021
- [j28]Pieter Goetschalckx, Kris Coolsaet, Nico Van Cleemput:
Local orientation-preserving symmetry preserving operations on polyhedra. Discret. Math. 344(1): 112156 (2021) - [j27]Tom Neutens, Evelien Barbion, Kris Coolsaet, Francis Wyffels:
Comparing learning ecologies of primary graphical programming: create or fix? J. Comput. Assist. Learn. 37(5): 1296-1311 (2021) - 2020
- [j26]Pieter Goetschalckx, Kris Coolsaet, Nico Van Cleemput:
Generation of local symmetry-preserving operations on polyhedra. Ars Math. Contemp. 18(2): 223-239 (2020)
2010 – 2019
- 2018
- [j25]Kris Coolsaet, Stan Schein:
Some New Symmetric Equilateral Embeddings of Platonic and Archimedean Polyhedra. Symmetry 10(9): 382 (2018) - 2017
- [j24]Kris Coolsaet:
Spherical quadrangles with three equal sides and rational angles. Ars Math. Contemp. 12(2): 415-424 (2017) - [i2]Kris Coolsaet, Patrick W. Fowler, Jan Goedgebeur:
Generation and properties of nut graphs. CoRR abs/1709.04254 (2017) - 2016
- [j23]Stan Schein, Alexander J. Yeh, Kris Coolsaet, James M. Gayed:
Decoration of the Truncated Tetrahedron - An Archimedean Polyhedron - To Produce a New Class of Convex Equilateral Polyhedra with Tetrahedral Symmetry. Symmetry 8(8): 82 (2016) - 2014
- [j22]Kris Coolsaet, Heide Sticker:
Arcs with Large Conical Subsets in Desarguesian Planes of Even Order. Electron. J. Comb. 21(1): 1 (2014) - [j21]Kris Coolsaet:
Some large partial ovoids of Q-(5, q), for odd q. Des. Codes Cryptogr. 72(1): 119-128 (2014) - 2013
- [j20]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: A database of interesting graphs. Discret. Appl. Math. 161(1-2): 311-314 (2013) - [j19]Kris Coolsaet:
On the classification of nonsingular 2×2×2×2 hypercubes. Des. Codes Cryptogr. 68(1-3): 179-194 (2013) - 2012
- [j18]Kris Coolsaet, Peter D. Johnson Jr., Kenneth J. Roblee, Tom D. Smotzer:
Some Extremal Problems for Edge-Regular Graphs. Ars Comb. 105: 411-418 (2012) - [j17]Kris Coolsaet:
The Lemma of Tangents reformulated. Discret. Math. 312(3): 705-714 (2012) - [c3]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
A Database of Interesting Graphs: The House of Graphs. CTW 2012: 36-39 - [i1]Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot:
House of Graphs: a database of interesting graphs. CoRR abs/1204.3549 (2012) - 2010
- [j16]Kris Coolsaet, Heide Sticker:
Arcs with Large Conical Subsets. Electron. J. Comb. 17(1) (2010) - [j15]Kris Coolsaet:
The smallest split Cayley hexagon has two symplectic embeddings. Finite Fields Their Appl. 16(5): 380-384 (2010)
2000 – 2009
- 2008
- [j14]Kris Coolsaet, Jan Degraer:
Using Algebraic Properties of Minimal Idempotents for Exhaustive Computer Generation of Association Schemes. Electron. J. Comb. 15(1) (2008) - [j13]Kris Coolsaet:
A 51-dimensional embedding of the Ree-Tits generalized octagon. Des. Codes Cryptogr. 47(1-3): 75-97 (2008) - [j12]Jan Degraer, Kris Coolsaet:
Classification of some strongly regular subgraphs of the McLaughlin graph. Discret. Math. 308(2-3): 395-400 (2008) - [j11]Kris Coolsaet, Aleksandar Jurisic, Jack H. Koolen:
On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency. Eur. J. Comb. 29(5): 1186-1199 (2008) - [j10]Kris Coolsaet, Aleksandar Jurisic:
Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs. J. Comb. Theory A 115(6): 1086-1095 (2008) - 2007
- [c2]Adriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack:
GrInvIn for graph theory teaching and research. CTW 2007: 123-126 - 2006
- [j9]Kris Coolsaet, Jan Degraer, Edward Spence:
The Strongly Regular (45, 12, 3, 3) Graphs. Electron. J. Comb. 13(1) (2006) - 2005
- [j8]Kris Coolsaet, Jan Degraer:
A Computer-Assisted Proof of the Uniqueness of the Perkel Graph. Des. Codes Cryptogr. 34(2-3): 155-171 (2005) - [j7]Jan Degraer, Kris Coolsaet:
Classification of three-class association schemes using backtracking with dynamic variable ordering. Discret. Math. 300(1-3): 71-81 (2005) - [j6]Kris Coolsaet:
A distance regular graph with intersection array (21, 16, 8;1, 4, 14) does not exist. Eur. J. Comb. 26(5): 709-716 (2005)
1990 – 1999
- 1997
- [j5]Lynn Margaret Batten, Kris Coolsaet, Anne Penfold Street:
Blocking Sets in (v, {2, 4}, 1)-Designs. Des. Codes Cryptogr. 10(3): 309-314 (1997) - 1995
- [j4]Kris Coolsaet:
Local Structure of Graphs with lambda = mu=2, alpha2 = 4. Comb. 15(4): 481-487 (1995) - 1994
- [j3]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
- [j2]Kris Coolsaet, Hans E. De Meyer, Veerle Fack:
Optimal Algorithms for Total Exchange without Buffering on the Hypercube. BIT 32(4): 559-569 (1992) - [j1]Kris Coolsaet:
A quick introduction to the programming language MIKE. ACM SIGPLAN Notices 27(6): 37-46 (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 2024-06-10 21:22 CEST 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:
