default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJorik Jooken
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Jorik Jooken
:
Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs. Discret. Appl. Math. 356: 133-141 (2024)- [j7]Jorik Jooken:
A note on X¯-coloring and Aˆ-coloring 4-regular graphs. Discret. Math. 347(7): 114046 (2024) - [j6]Louis Carpentier, Jorik Jooken, Jan Goedgebeur:
A heuristic algorithm using tree decompositions for the maximum happy vertices problem. J. Heuristics 30(1-2): 67-107 (2024) - [c2]Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt:
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS 2024: 55:1-55:15 - 2023
- [j5]Thibault Lechien, Jorik Jooken, Patrick De Causmaecker:
Evolving test instances of the Hamiltonian completion problem. Comput. Oper. Res. 149: 106019 (2023) - [j4]Jorik Jooken, Pieter Leyman, Tony Wauters, Patrick De Causmaecker:
Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems. Comput. Oper. Res. 150: 106070 (2023) - [j3]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. Eur. J. Oper. Res. 311(1): 36-55 (2023) - [c1]Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang:
Critical (P5,dart)-Free Graphs. COCOA (2) 2023: 390-402 - 2022
- [j2]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A new class of hard problem instances for the 0-1 knapsack problem. Eur. J. Oper. Res. 301(3): 841-854 (2022) - [i6]Louis Carpentier, Jorik Jooken, Jan Goedgebeur:
A heuristic algorithm for the maximum happy vertices problem using tree decompositions. CoRR abs/2208.14921 (2022) - [i5]Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu:
Few hamiltonian cycles in graphs with one or two vertex degrees. CoRR abs/2211.08105 (2022) - [i4]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions. CoRR abs/2211.09665 (2022) - 2020
- [j1]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. J. Heuristics 26(5): 743-769 (2020) - [i3]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker, Tony Wauters:
Exploring search space trees using an adapted version of Monte Carlo tree search for a combinatorial optimization problem. CoRR abs/2010.11523 (2020) - [i2]Thibault Lechien, Jorik Jooken, Patrick De Causmaecker:
Evolving test instances of the Hamiltonian completion problem. CoRR abs/2011.02291 (2020)
2010 – 2019
- 2019
- [i1]Jorik Jooken, Pieter Leyman, Patrick De Causmaecker:
A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs. CoRR abs/1904.11337 (2019)
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-08-27 22:57 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:
