default search action
Jeannette C. M. Janssen
Person information
- affiliation: Dalhousie University, Department of Mathematics & Statistics, Halifax, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j42]Mahya Ghandehari, Jeannette C. M. Janssen:
Graph sequences sampled from Robinson graphons. Eur. J. Comb. 116: 103859 (2024) - [i11]Mahya Ghandehari, Jeannette C. M. Janssen, Silo Murphy:
Unified Fourier bases for GSP on stochastic block model graphs. CoRR abs/2406.06306 (2024) - 2023
- [i10]Kathryn Beck, Mahya Ghandehari, Jeannette C. M. Janssen, Nauzer Kalyaniwalla:
Signal processing on large networks with group symmetries. CoRR abs/2303.17065 (2023) - 2021
- [c30]Jeannette C. M. Janssen, Zhiyuan Zhang:
Uniform Embeddings for Robinson Similarity Matrices. WADS 2021: 499-512 - 2020
- [j41]Kyle MacKeigan, Jeannette C. M. Janssen:
Total colouring of some cartesian and direct product graphs. Contributions Discret. Math. 15(1): 67-71 (2020) - [j40]Jeannette C. M. Janssen
, Kyle MacKeigan
Orthogonal colourings of Cayley graphs. Discret. Math. 343(11): 112079 (2020) - [i9]Jeannette C. M. Janssen, Aaron Smith:
Reconstruction of Line-Embeddings of Graphons. CoRR abs/2007.06444 (2020)
2010 – 2019
- 2019
- [j39]Anthony Bonato, Jeannette C. M. Janssen
Geometric random graphs and Rado sets in sequence spaces. Eur. J. Comb. 79: 1-14 (2019) - [j38]Mahya Ghandehari
An Optimization Parameter for Seriation of Noisy Data. SIAM J. Discret. Math. 33(2): 712-730 (2019) - [c29]Christopher Duffy
Strongly n-e.c. Graphs and Independent Distinguishing Labellings. WAW 2019: 44-56 - [i8]Joshua Feldman, Jeannette C. M. Janssen:
High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks. CoRR abs/1903.00077 (2019) - 2018
- [j37]Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen
Bounds on the burning number. Discret. Appl. Math. 235: 16-22 (2018) - 2017
- [j36]Stéphane Bessy, Anthony Bonato, Jeannette C. M. Janssen
Burning a graph is hard. Discret. Appl. Math. 232: 73-87 (2017) - [j35]Huda Chuangpishit, Mahya Ghandehari
Uniform linear embeddings of graphons. Eur. J. Comb. 61: 47-68 (2017) - [j34]Christopher Duffy
The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating. Internet Math. 2017 (2017) - [j33]Jeannette C. M. Janssen
Rumors Spread Slowly in a Small-World Spatial Network. SIAM J. Discret. Math. 31(4): 2414-2428 (2017) - [c28]Joshua Feldman, Jeannette C. M. Janssen
High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks. WAW 2017: 60-74 - 2016
- [j32]Anthony Bonato, Jeannette C. M. Janssen
How to Burn a Graph. Internet Math. 12(1-2): 85-100 (2016) - [j31]Jeannette C. M. Janssen
Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model. Internet Math. 12(1-2): 121-144 (2016) - [c27]Christopher Duffy
The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating. WAW 2016: 152-163 - [i7]Jeannette C. M. Janssen, Abbas Mehrabian:
Rumours spread slowly in a small world spatial network. CoRR abs/1608.01697 (2016) - 2015
- [j30]Jeannette C. M. Janssen
Partial List Colouring of Certain Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j29]Matt Hurshman, Jeannette C. M. Janssen
On the continuity of graph parameters. Discret. Appl. Math. 181: 123-129 (2015) - [j28]Huda Chuangpishit, Mahya Ghandehari, Jeannette C. M. Janssen
Uniform Linear Embeddings of Spatial Random Graphs. Electron. Notes Discret. Math. 49: 541-547 (2015) - [j27]Jeannette C. M. Janssen
Finding Safe Strategies for Competitive Diffusion on Trees. Internet Math. 11(3): 232-252 (2015) - [j26]Huda Chuangpishit, Mahya Ghandehari
Linear embeddings of graphs and graph limits. J. Comb. Theory B 113: 162-184 (2015) - [c26]Armin Sajadi, Evangelos E. Milios
Domain-Specific Semantic Relatedness from Wikipedia Structure: A Case Study in Biomedical Text. CICLing (1) 2015: 347-360 - [c25]Jeannette C. M. Janssen
Rumours Spread Slowly in a Small World Spatial Network. WAW 2015: 107-118 - [i6]Huda Chuangpishit, Jeannette C. M. Janssen:
Recognition of certain square geometric graphs. CTW 2015: 265-268 - [i5]Jeannette C. M. Janssen, Pawel Pralat, Rory Wilson:
Non-Uniform Distribution of Nodes in the Spatial Preferential Attachment Model. CoRR abs/1506.06053 (2015) - 2014
- [c24]Anthony Bonato, Jeannette C. M. Janssen
Burning a Graph as a Model of Social Contagion. WAW 2014: 13-22 - [i4]Jeannette C. M. Janssen, Celeste Vautour:
Finding safe strategies for competitive diffusion on trees. CoRR abs/1404.5356 (2014) - 2013
- [j25]Jeannette C. M. Janssen
Geometric graph properties of the spatial preferred attachment model. Adv. Appl. Math. 50(2): 243-267 (2013) - [c23]Jeannette C. M. Janssen
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model. WAW 2013: 1-13 - 2012
- [j24]Anthony Bonato, Jeannette C. M. Janssen
Geometric Protean Graphs. Internet Math. 8(1-2): 2-28 (2012) - [j23]Jeannette C. M. Janssen
Model Selection for Social Networks Using Graphlets. Internet Math. 8(4): 338-363 (2012) - [c22]Anthony Bonato, Jeannette C. M. Janssen
Infinite Random Geometric Graphs from the Hexagonal Metric. IWOCA 2012: 6-19 - [e3]Anthony Bonato, Jeannette C. M. Janssen:
Algorithms and Models for the Web Graph - 9th International Workshop, WAW 2012, Halifax, NS, Canada, June 22-23, 2012. Proceedings. Lecture Notes in Computer Science 7323, Springer 2012, ISBN 978-3-642-30540-5 [contents] - [i3]Huda Chuangpishit, Mahya Ghandehari, Matt Hurshman, Jeannette C. M. Janssen, Nauzer Kalyaniwalla:
Linear embeddings of graphs and graph limits. CoRR abs/1210.4451 (2012) - 2011
- [i2]Anthony Bonato, Jeannette C. M. Janssen, Pawel Pralat:
Geometric protean graphs. CoRR abs/1111.0207 (2011) - [i1]Jeannette C. M. Janssen, Pawel Pralat, Rory Wilson:
Geometric Graph Properties of the Spatial Preferred Attachment model. CoRR abs/1111.0508 (2011) - 2010
- [j22]Jeannette C. M. Janssen
Rank-Based Attachment Leads to Power Law Graphs. SIAM J. Discret. Math. 24(2): 420-440 (2010) - [c21]Jeannette C. M. Janssen
Spatial Models for Virtual Networks. CiE 2010: 201-210 - [c20]Anthony Bonato, Jeannette C. M. Janssen
A geometric model for on-line social networks. MSM 2010: 4:1-4:2 - [c19]Jeannette C. M. Janssen
Estimating node similarity from co-citation in a spatial graph model. SAC 2010: 1329-1333 - [c18]Anthony Bonato, Jeannette C. M. Janssen
The Geometric Protean Model for On-Line Social Networks. WAW 2010: 110-121 - [c17]Anthony Bonato, Jeannette C. M. Janssen, Pawel Pralat:
A Geometric Model for On-line Social Networks. WOSN 2010
2000 – 2009
- 2009
- [j21]Anthony Bonato, Jeannette C. M. Janssen
The n-ordered graphs: A new graph class. J. Graph Theory 60(3): 204-218 (2009) - [j20]Jeannette C. M. Janssen
Protean graphs with a variety of ranking schemes. Theor. Comput. Sci. 410(52): 5491-5504 (2009) - [c16]Xiaomeng Wan, Evangelos E. Milios
Link-based event detection in email communication networks. SAC 2009: 1506-1510 - 2008
- [j19]William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen
A Spatial Web Graph Model with Local Influence Regions. Internet Math. 5(1): 175-196 (2008) - [c15]Xiaomeng Wan, Evangelos E. Milios
Link-Based Anomaly Detection in Communication Networks. Web Intelligence/IAT Workshops 2008: 402-405 - [e2]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers. Lecture Notes in Computer Science 4936, Springer 2008, ISBN 978-3-540-78807-2 [contents] - 2007
- [j18]Anthony Bonato, Jeannette C. M. Janssen
Infinite Limits and Adjacency Properties of a Generalized Copying Model. Internet Math. 4(2): 199-223 (2007) - [j17]Wangzhong Lu, Jeannette C. M. Janssen
Node similarity in the citation graph. Knowl. Inf. Syst. 11(1): 105-129 (2007) - [c14]William Aiello, Anthony Bonato, Colin Cooper, Jeannette C. M. Janssen
A Spatial Web Graph Model with Local Influence Regions. WAW 2007: 96-107 - [e1]Jeannette C. M. Janssen, Pawel Pralat:
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers. Lecture Notes in Computer Science 4852, Springer 2007, ISBN 978-3-540-77293-4 [contents] - 2006
- [j16]Shannon L. Fitzpatrick, Jeannette C. M. Janssen, Richard J. Nowakowski:
Fractional isometric path number. Australas. J Comb. 34: 281-298 (2006) - [j15]Hongyu Liu, Jeannette C. M. Janssen
Using HMM to learn user browsing patterns for focused Web crawling. Data Knowl. Eng. 59(2): 270-291 (2006) - [j14]Gautam Appa, Dimitris Magos, Ioannis Mourtos
On the orthogonal Latin squares polytope. Discret. Math. 306(2): 171-187 (2006) - [c13]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Modelling and Mining of Networked Information Spaces. WAW 2006: 1-17 - [c12]William Aiello, Andrei Z. Broder, Jeannette C. M. Janssen
Workshop on Algorithms and Models for the Web Graph. WAW 2006: 18-23 - [c11]John Healy, Jeannette C. M. Janssen
Characterization of Graphs Using Degree Cores. WAW 2006: 137-148 - 2005
- [j13]Jeannette C. M. Janssen
Lower Bounds from Tile Covers for the Channel Assignment Problem. SIAM J. Discret. Math. 18(4): 679-696 (2005) - 2004
- [j12]Shannon L. Fitzpatrick, Jeannette C. M. Janssen
Distributive online channel assignment for hexagonal cellular networks with constraints. Discret. Appl. Math. 143(1-3): 84-91 (2004) - [j11]Sylvain Gravier, Jeannette C. M. Janssen
Graph covers using t-colourable vertex sets. Discret. Math. 278(1-3): 61-80 (2004) - [j10]Yuan An, Jeannette C. M. Janssen, Evangelos E. Milios:
Characterizing and Mining the Citation Graph of the Computer Science Literature. Knowl. Inf. Syst. 6(6): 664-678 (2004) - [c10]Anthony Bonato, Jeannette C. M. Janssen
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces. CAAN 2004: 42-48 - [c9]Hongyu Liu, Evangelos E. Milios, Jeannette C. M. Janssen:
Focused Crawling by Learning HMM from User's Topic-specific Browsing. Web Intelligence 2004: 732 - [c8]Hongyu Liu, Evangelos E. Milios, Jeannette C. M. Janssen
Probabilistic models for focused web crawling. WIDM 2004: 16-22 - 2003
- [j9]Anthony Bonato, Jeannette C. M. Janssen
Infinite Limits of Copying Models of the Web Graph. Internet Math. 1(2): 193-213 (2003) - 2002
- [c7]Jeannette C. M. Janssen
Compressibility as a Measure of Local Coherence in Web Graphs. IICS 2002: 75-81 - [c6]Yuan An, Jeannette C. M. Janssen
Characterizing the Citation Graph as a Self-Organizing Networked Information Space. IICS 2002: 97-107 - 2001
- [j8]Jeannette C. M. Janssen
Approximation algorithms for channel assignment with constraints. Theor. Comput. Sci. 262(1): 649-667 (2001) - [c5]Wangzhong Lu, Jeannette C. M. Janssen, Evangelos E. Milios, Nathalie Japkowicz:
Node similarity in networked information spaces. CASCON 2001: 11 - 2000
- [j7]Jeannette C. M. Janssen
Adaptive Multicolouring. Comb. 20(1): 87-102 (2000) - [j6]Jeannette C. M. Janssen
Distributed Online Frequency Assignment in Cellular Networks. J. Algorithms 36(2): 119-151 (2000) - [c4]Shannon L. Fitzpatrick, Jeannette C. M. Janssen, Richard J. Nowakowski:
Distributive Online Channel Assignment for Hexagonal Cellular Networks with Constraints. ICALP Satellite Workshops 2000: 147-154
1990 – 1999
- 1999
- [j5]Jeannette C. M. Janssen
Bounded Stable Sets: Polytopes and Colorings. SIAM J. Discret. Math. 12(2): 262-275 (1999) - [c3]Jeannette C. M. Janssen
Approximation Algorithms for Channel Assignment with Constraints. ISAAC 1999: 327-336 - 1998
- [c2]Jeannette C. M. Janssen
Distributed Online Frequency Assignment in Cellular Networks. STACS 1998: 3-13 - 1997
- [j4]Roland Häggkvist, Jeannette C. M. Janssen:
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs. Comb. Probab. Comput. 6(3): 295-313 (1997) - [c1]Jeannette C. M. Janssen, Kyriakos Kilakos:
An Analysis of Channel Assignment Problems Based on Tours. ICC (2) 1997: 565-569 - 1996
- [j3]Roland Häggkvist, Jeannette C. M. Janssen
All-even latin squares. Discret. Math. 157(1-3): 199-206 (1996) - 1995
- [j2]Jeannette C. M. Janssen:
On Even and Odd Latin Squares. J. Comb. Theory A 69(1): 173-181 (1995) - 1990
- [j1]Patrick A. H. Bours, Jeannette C. M. Janssen
Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCH. IEEE Trans. Inf. Theory 36(1): 214-222 (1990)
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-07-25 20:24 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: