default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClara Stegehuis
Person information
- affiliation: University of Twente, Enschede, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Lotte Weedage
, Syllas R. C. Magalhães, Clara Stegehuis, Suzan Bayhan:
On the Resilience of Cellular Networks: How Can National Roaming Help? IEEE Trans. Netw. Serv. Manag. 21(2): 1702-1714 (2024)- [i20]Clara Stegehuis, Lotte Weedage:
Reconstruction of geometric random graphs with the Simple algorithm. CoRR abs/2407.18591 (2024) - 2023
- [j12]Lotte Weedage, Clara Stegehuis, Suzan Bayhan:
Impact of Multi-Connectivity on Channel Capacity and Outage Probability in Wireless Networks. IEEE Trans. Veh. Technol. 72(6): 7973-7986 (2023) - [i19]Lotte Weedage, Syllas Rangel C. Magalhães, Clara Stegehuis, Suzan Bayhan:
On the resilience of cellular networks: how can national roaming help? CoRR abs/2301.03250 (2023) - [i18]Clara Stegehuis, Lotte Weedage:
Resource sharing in wireless networks with co-location. CoRR abs/2304.11881 (2023) - [i17]Thomas Bläsius, Maximilian Katzmann, Clara Stegehuis:
Maximal Cliques in Scale-Free Random Graphs. CoRR abs/2309.02990 (2023) - 2022
- [j11]Clara Stegehuis:
Bringing network science to primary school. Netw. Sci. 10(2): 207-213 (2022) - [i16]Nelly Litvak, Riccardo Michielan, Clara Stegehuis:
Detecting hyperbolic geometry in networks: why triangles are not enough. CoRR abs/2206.01553 (2022) - [i15]Lotte Weedage, Clara Stegehuis, Suzan Bayhan:
Beam-align: distributed user association for mmWave networks with multi-connectivity. CoRR abs/2206.13166 (2022) - 2021
- [j10]Lotte Weedage, Nelly Litvak, Clara Stegehuis:
Locating highly connected clusters in large networks with HyperLogLog counters. J. Complex Networks 9(2) (2021) - [j9]Riccardo Michielan, Clara Stegehuis:
Cliques in geometric inhomogeneous random graphs. J. Complex Networks 10(1) (2021) - [i14]Lotte Weedage, Nelly Litvak, Clara Stegehuis:
Locating highly connected clusters in large networks with HyperLogLog counters. CoRR abs/2101.04610 (2021) - [i13]Clara Stegehuis, Lotte Weedage:
Degree distributions in AB random geometric graphs. CoRR abs/2104.03711 (2021) - [i12]Lotte Weedage, Clara Stegehuis, Suzan Bayhan:
Impact of Multi-connectivity on Channel Capacity and Outage Probability in Wireless Networks. CoRR abs/2104.09823 (2021) - [i11]Johan S. H. van Leeuwaarden, Clara Stegehuis:
Robust subgraph counting with distribution-free random graph analysis. CoRR abs/2107.10089 (2021) - 2020
- [j8]Pu Gao, Remco van der Hofstad, Angus Southwell, Clara Stegehuis:
Counting Triangles in Power-Law Uniform Random Graphs. Electron. J. Comb. 27(3): 3 (2020) - [j7]Clara Stegehuis, Matthieu Latapy:
Closure coefficients in scale-free complex networks. J. Complex Networks 8(3) (2020) - [j6]Clara Stegehuis, Laurent Massoulié:
Efficient Inference in Stochastic Block Models With Vertex Labels. IEEE Trans. Netw. Sci. Eng. 7(3): 1215-1225 (2020)
2010 – 2019
- 2019
- [j5]Tom Bannink, Remco van der Hofstad, Clara Stegehuis:
Switch chain mixing times and triangle counts in simple random graphs with given degrees. J. Complex Networks 7(2): 210-225 (2019) - [j4]Clara Stegehuis, Ellen Cardinaels, Johan S. H. van Leeuwaarden:
Finding induced subgraphs in scale-free inhomogeneous random graphs. Internet Math. 2019 (2019) - [j3]Clara Stegehuis:
Degree correlations in scale-free random graph models. J. Appl. Probab. 56(3): 672-700 (2019) - [i10]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Variational principle for scale-free network motifs. CoRR abs/1904.08114 (2019) - [i9]Clara Stegehuis:
Closure coefficients in scale-free complex networks. CoRR abs/1911.11410 (2019) - 2018
- [c1]Ellen Cardinaels, Johan S. H. van Leeuwaarden, Clara Stegehuis:
Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs. WAW 2018: 1-15 - [i8]Ellen Cardinaels, Johan S. H. van Leeuwaarden, Clara Stegehuis:
Finding induced subgraphs in scale-free inhomogeneous random graphs. CoRR abs/1801.08293 (2018) - [i7]Clara Stegehuis, Laurent Massoulié:
Efficient inference in stochastic block models with vertex labels. CoRR abs/1806.07562 (2018) - [i6]Anatoliy Babic, Harshit Bansal, Gianluca Finocchio, Julian Golak, Mark A. Peletier, Jim Portegies, Clara Stegehuis, Anuj Tyagi, Roland Vincze, William Weimin Yoo:
SciSports: Learning football kinematics through two-dimensional tracking data. CoRR abs/1808.04550 (2018) - [i5]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Scale-free network clustering in hyperbolic and other random graphs. CoRR abs/1812.03002 (2018) - 2017
- [j2]Zümbül Atan, Taher Ahmadi, Clara Stegehuis, Ton de Kok, Ivo J. B. F. Adan:
Assemble-to-order systems: A review. Eur. J. Oper. Res. 261(3): 866-879 (2017) - [i4]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden, A. J. E. M. Janssen:
Clustering Spectrum of hierarchical scale-free networks. CoRR abs/1706.01727 (2017) - 2016
- [i3]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Power-law relations in random networks with communities. CoRR abs/1603.09711 (2016) - [i2]Clara Stegehuis, Remco van der Hofstad, Johan S. H. van Leeuwaarden:
Epidemic spreading on complex networks with community structures. CoRR abs/1611.06092 (2016) - 2015
- [j1]Clara Stegehuis, Nelly Litvak, Ludo Waltman:
Predicting the long-term citation impact of recent publications. J. Informetrics 9(3): 642-657 (2015) - [i1]Clara Stegehuis, Nelly Litvak, Ludo Waltman:
Predicting the long-term citation impact of recent publications. CoRR abs/1503.09156 (2015)
Coauthor Index
aka: Johan S. H. van Leeuwaarden
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-11-14 00:51 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:
