default search action
Stijn Cambie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Stijn Cambie
, Bradley McCoy, Stephan G. Wagner, Corrine Yap:
Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees. Electron. J. Comb. 31(1) (2024) - [j21]Stijn Cambie
Many Hamiltonian subsets in large graphs with given density. Comb. Probab. Comput. 33(1): 110-120 (2024) - [j20]Stijn Cambie
Corrigendum on Wiener index, Zagreb Indices and Harary index of Eulerian graphs. Discret. Appl. Math. 347: 139-142 (2024) - [j19]Stijn Cambie
Bounds and monotonicity of critical set parameters of colourings. Discret. Math. 347(7): 114041 (2024) - [j18]Stijn Cambie
When removing an independent set is optimal for reducing the chromatic number. Eur. J. Comb. 115: 103781 (2024) - [j17]Stijn Cambie
Optimally reconfiguring list and correspondence colourings. Eur. J. Comb. 115: 103798 (2024) - [j16]Stijn Cambie, Yanni Dong
Extremal values of degree-based entropies of bipartite graphs. Inf. Sci. 676: 120737 (2024) - [j15]Stijn Cambie
Decreasing the mean subtree order by adding k edges. J. Graph Theory 105(3): 357-366 (2024) - [j14]Stijn Cambie
Packing list-colorings. Random Struct. Algorithms 64(1): 62-93 (2024) - [j13]Stijn Cambie
A Precise Condition for Independent Transversals in Bipartite Covers. SIAM J. Discret. Math. 38(2): 1451-1461 (2024) - 2023
- [j12]Stijn Cambie
Maximum size of digraphs of given radius. Discret. Math. 346(8): 113429 (2023) - [j11]Stijn Cambie
Extremal Binary PFAs with Small Number of States. Int. J. Found. Comput. Sci. 34(2&3): 85-115 (2023) - [j10]Stijn Cambie
Regular Turán numbers and some Gan-Loh-Sudakov-type problems. J. Graph Theory 102(1): 67-85 (2023) - [i5]Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski:
A precise condition for independent transversals in bipartite covers. CoRR abs/2308.14778 (2023) - 2022
- [j9]Stijn Cambie
On the relationship between variable Wiener index and variable Szeged index. Appl. Math. Comput. 431: 127320 (2022) - [j8]Stijn Cambie
Maximizing Line Subgraphs of Diameter at Most t. SIAM J. Discret. Math. 36(2): 939-950 (2022) - [i4]Stijn Cambie, Wouter Cames van Batenburg, Daniel W. Cranston:
Optimally Reconfiguring List and Correspondence Colourings. CoRR abs/2204.07928 (2022) - 2021
- [j7]N. R. Aravind, Stijn Cambie
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j6]Stijn Cambie:
Five results on maximizing topological indices in graphs. Discret. Math. Theor. Comput. Sci. 23(3) (2021) - [j5]Stijn Cambie
On the maximum mean subtree order of trees. Eur. J. Comb. 97: 103388 (2021) - [j4]Stijn Cambie
Extremal total distance of graphs of given radius I. J. Graph Theory 97(1): 104-122 (2021) - [c1]Stijn Cambie
Extremal Binary PFAs in a Černý Family. DLT 2021: 78-89 - [i3]Stijn Cambie, Michiel de Bondt, Henk Don:
Extremal Binary PFAs in a Cerny Family. CoRR abs/2108.13927 (2021) - [i2]Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
Packing list-colourings. CoRR abs/2110.05230 (2021) - 2020
- [j3]Stijn Cambie
A Sauer-Shelah-Perles Lemma for Lattices. Electron. J. Comb. 27(4): 4 (2020) - [j2]Stijn Cambie
An asymptotic resolution of a problem of Plesník. J. Comb. Theory B 145: 341-358 (2020)
2010 – 2019
- 2019
- [j1]Stijn Cambie, António Girão, Ross J. Kang:
VC Dimension and a Union Theorem for Set Systems. Electron. J. Comb. 26(3): 3 (2019) - [i1]N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg
Structure and colour in triangle-free graphs. CoRR abs/1912.13328 (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-05 20:18 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: