default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNico Van Cleemput
Person information
- affiliation: Ghent University, Department of Applied Mathematics, Computer Science and Statistics, Gent, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i5]Craig E. Larson, Nicolas Van Cleemput:
Top-down Automated Theorem Proving (Notes for Sir Timothy). CoRR abs/2308.02540 (2023)- 2022
- [j24]Nico Van Cleemput, Carol T. Zamfirescu
:
Hamiltonian cycles and 1-factors in 5-regular graphs. J. Comb. Theory B 154: 239-261 (2022) - [j23]Alewyn P. Burger, Johan P. de Wet, Marietjie Frick, Nico Van Cleemput, Carol T. Zamfirescu:
Planar hypohamiltonian oriented graphs. J. Graph Theory 100(1): 50-68 (2022) - 2021
- [j22]Igor Fabrici, Tomás Madaras, Maria Timkova, Nico Van Cleemput, Carol T. Zamfirescu:
Non-hamiltonian graphs in which every edge-contracted subgraph is hamiltonian. Appl. Math. Comput. 392: 125714 (2021) - [j21]Pieter Goetschalckx, Kris Coolsaet, Nico Van Cleemput:
Local orientation-preserving symmetry preserving operations on polyhedra. Discret. Math. 344(1): 112156 (2021) - [j20]Gunnar Brinkmann, Thomas W. Tucker, Nico Van Cleemput:
On the genera of polyhedral embeddings of cubic graph. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j19]Gunnar Brinkmann, Nico Van Cleemput:
4-connected polyhedra have at least a linear number of hamiltonian cycles. Eur. J. Comb. 97: 103395 (2021) - 2020
- [j18]Pieter Goetschalckx, Kris Coolsaet, Nico Van Cleemput:
Generation of local symmetry-preserving operations on polyhedra. Ars Math. Contemp. 18(2): 223-239 (2020) - [j17]On-Hei Solomon Lo, Jens M. Schmidt, Nico Van Cleemput, Carol T. Zamfirescu:
Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j16]Alexander Bradford, J. Kain Day, Laura Hutchinson, Bryan Kaperick, Craig E. Larson, Matthew Mills, David Muncy, Nico Van Cleemput:
Automated Conjecturing II: Chomp and Reasoned Game Play. J. Artif. Intell. Res. 68: 447-461 (2020) - [i4]J. Paul Brooks, D. J. Edwards, Craig E. Larson, Nicolas Van Cleemput:
Conjecturing-Based Computational Discovery of Patterns in Data. CoRR abs/2011.11576 (2020)
2010 – 2019
- 2019
- [j15]Gunnar Brinkmann, Kenta Ozeki, Nico Van Cleemput:
Types of triangle in Hamiltonian triangulations and an application to domination and k-walks. Ars Math. Contemp. 17(1): 51-66 (2019) - [j14]Nico Van Cleemput:
Hamiltonian-connectedness of triangulations with few separating triangles. Contributions Discret. Math. 14(1) (2019) - [j13]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. Discret. Math. 342(11): 3000-3005 (2019) - 2018
- [j12]Nico Van Cleemput, Carol T. Zamfirescu:
Regular non-hamiltonian polyhedral graphs. Appl. Math. Comput. 338: 192-206 (2018) - [j11]Kenta Ozeki, Nico Van Cleemput, Carol T. Zamfirescu:
Hamiltonian properties of polyhedra with few 3-cuts - A survey. Discret. Math. 341(9): 2646-2660 (2018) - [j10]Gunnar Brinkmann, Jasper Souffriau, Nico Van Cleemput:
On the number of hamiltonian cycles in triangulations with few separating triangles. J. Graph Theory 87(2): 164-175 (2018) - [i3]Neal Bushaw, Craig E. Larson, Nicolas Van Cleemput:
Automated Conjecturing VII: The Graph Brain Project & Big Mathematics. CoRR abs/1801.01814 (2018) - [i2]Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput, Gábor Wiener:
On the minimum leaf number of cubic graphs. CoRR abs/1806.04451 (2018) - 2017
- [j9]Craig E. Larson, Nicolas Van Cleemput:
Automated conjecturing III - Property-relations conjectures. Ann. Math. Artif. Intell. 81(3-4): 315-327 (2017) - [c3]Craig E. Larson, Nico Van Cleemput:
Automated Conjecturing I: Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract). IJCAI 2017: 5015-5019 - 2016
- [j8]Craig E. Larson, Nicolas Van Cleemput:
Automated conjecturing I: Fajtlowicz's Dalmatian heuristic revisited. Artif. Intell. 231: 17-38 (2016) - [j7]Gunnar Brinkmann, Jasper Souffriau, Nico Van Cleemput:
On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations. J. Graph Theory 83(1): 78-91 (2016) - 2015
- [j6]Yohji Akama, Nico Van Cleemput:
Spherical tilings by congruent quadrangles: Forbidden cases and substructures. Ars Math. Contemp. 8(2): 297-318 (2015) - [j5]Ingo Althöfer, Jan Kristian Haugland, Karl Scherer, Frank Schneider, Nico Van Cleemput:
Alternating plane graphs. Ars Math. Contemp. 8(2): 337-363 (2015) - [j4]Gunnar Brinkmann, Craig E. Larson, Jasper Souffriau, Nico Van Cleemput:
Construction of planar 4-connected triangulations. Ars Math. Contemp. 9(2): 145-149 (2015) - [j3]Tomás Kaiser, Maria Saumell, Nico Van Cleemput:
10-Gabriel graphs are Hamiltonian. Inf. Process. Lett. 115(11): 877-881 (2015) - 2014
- [i1]Tomás Kaiser, Maria Saumell, Nico Van Cleemput:
10-Gabriel graphs are Hamiltonian. CoRR abs/1410.0309 (2014) - 2013
- [j2]Gunnar Brinkmann, Nicolas Van Cleemput, Tomaz Pisanski:
Generation of various classes of trivalent graphs. Theor. Comput. Sci. 502: 16-29 (2013) - 2011
- [j1]Gunnar Brinkmann, Nicolas Van Cleemput:
Classification and generation of nanocones. Discret. Appl. Math. 159(15): 1528-1539 (2011)
2000 – 2009
- 2009
- [c2]Gunnar Brinkmann, Nicolas Van Cleemput:
NANOCONES - A Classification Result in Chemistry. CTW 2009: 333-336 - 2007
- [c1]Adriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack:
GrInvIn for graph theory teaching and research. CTW 2007: 123-126
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:21 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:
