Jeannette C. M. Janssen

Orcid: 0000-0002-0322-7855

Affiliations:
  • Dalhousie University, Department of Mathematics & Statistics, Halifax, Canada


According to our database1, Jeannette C. M. Janssen authored at least 70 papers between 1990 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph sequences sampled from Robinson graphons.
Eur. J. Comb., February, 2024

2023
Signal processing on large networks with group symmetries.
CoRR, 2023

2021
Uniform Embeddings for Robinson Similarity Matrices.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

2020
Orthogonal colourings of Cayley graphs.
Discret. Math., 2020

Reconstruction of Line-Embeddings of Graphons.
CoRR, 2020

Total colouring of some cartesian and direct product graphs.
Contributions Discret. Math., 2020

2019
An Optimization Parameter for Seriation of Noisy Data.
SIAM J. Discret. Math., 2019

Geometric random graphs and Rado sets in sequence spaces.
Eur. J. Comb., 2019

Strongly n-e.c. Graphs and Independent Distinguishing Labellings.
Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019

2018
Bounds on the burning number.
Discret. Appl. Math., 2018

2017
Rumors Spread Slowly in a Small-World Spatial Network.
SIAM J. Discret. Math., 2017

The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating.
Internet Math., 2017

Uniform linear embeddings of graphons.
Eur. J. Comb., 2017

Burning a graph is hard.
Discret. Appl. Math., 2017

High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks.
Proceedings of the Algorithms and Models for the Web Graph - 14th International Workshop, 2017

2016
Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model.
Internet Math., 2016

How to Burn a Graph.
Internet Math., 2016

2015
Linear embeddings of graphs and graph limits.
J. Comb. Theory, Ser. B, 2015

Finding Safe Strategies for Competitive Diffusion on Trees.
Internet Math., 2015

Uniform Linear Embeddings of Spatial Random Graphs.
Electron. Notes Discret. Math., 2015

On the continuity of graph parameters.
Discret. Appl. Math., 2015

Non-Uniform Distribution of Nodes in the Spatial Preferential Attachment Model.
CoRR, 2015

Partial List Colouring of Certain Graphs.
Electron. J. Comb., 2015

Rumours Spread Slowly in a Small World Spatial Network.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

Recognition of certain square geometric graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Domain-Specific Semantic Relatedness from Wikipedia Structure: A Case Study in Biomedical Text.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2015

2014
Burning a Graph as a Model of Social Contagion.
Proceedings of the Algorithms and Models for the Web Graph - 11th International Workshop, 2014

2013
Geometric graph properties of the spatial preferred attachment model.
Adv. Appl. Math., 2013

Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

2012
Model Selection for Social Networks Using Graphlets.
Internet Math., 2012

Geometric Protean Graphs.
Internet Math., 2012

Infinite Random Geometric Graphs from the Hexagonal Metric.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

2010
Rank-Based Attachment Leads to Power Law Graphs.
SIAM J. Discret. Math., 2010

A Geometric Model for On-line Social Networks.
Proceedings of the 3rd Workshop on Online Social Networks, 2010

The Geometric Protean Model for On-Line Social Networks.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

Estimating node similarity from co-citation in a spatial graph model.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Spatial Models for Virtual Networks.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Protean graphs with a variety of ranking schemes.
Theor. Comput. Sci., 2009

The <i>n</i>-ordered graphs: A new graph class.
J. Graph Theory, 2009

Link-based event detection in email communication networks.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

2008
A Spatial Web Graph Model with Local Influence Regions.
Internet Math., 2008

Link-Based Anomaly Detection in Communication Networks.
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and International Conference on Intelligent Agent Technology, 2008

2007
Node similarity in the citation graph.
Knowl. Inf. Syst., 2007

Infinite Limits and Adjacency Properties of a Generalized Copying Model.
Internet Math., 2007

2006
On the orthogonal Latin squares polytope.
Discret. Math., 2006

Using HMM to learn user browsing patterns for focused Web crawling.
Data Knowl. Eng., 2006

Fractional isometric path number.
Australas. J Comb., 2006

Characterization of Graphs Using Degree Cores.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Workshop on Algorithms and Models for the Web Graph.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Modelling and Mining of Networked Information Spaces.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

2005
Lower Bounds from Tile Covers for the Channel Assignment Problem.
SIAM J. Discret. Math., 2005

2004
Characterizing and Mining the Citation Graph of the Computer Science Literature.
Knowl. Inf. Syst., 2004

Graph covers using t-colourable vertex sets.
Discret. Math., 2004

Distributive online channel assignment for hexagonal cellular networks with constraints.
Discret. Appl. Math., 2004

Probabilistic models for focused web crawling.
Proceedings of the Sixth ACM CIKM International Workshop on Web Information and Data Management (WIDM 2004), 2004

Focused Crawling by Learning HMM from User's Topic-specific Browsing.
Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2004), 2004

Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003
Infinite Limits of Copying Models of the Web Graph.
Internet Math., 2003

2002
Compressibility as a Measure of Local Coherence in Web Graphs.
Proceedings of the Innovative Internet Computing Systems, Second International Workshop, 2002

Characterizing the Citation Graph as a Self-Organizing Networked Information Space.
Proceedings of the Innovative Internet Computing Systems, Second International Workshop, 2002

2001
Approximation algorithms for channel assignment with constraints.
Theor. Comput. Sci., 2001

Node similarity in networked information spaces.
Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative Research, 2001

2000
Distributed Online Frequency Assignment in Cellular Networks.
J. Algorithms, 2000

Adaptive Multicolouring.
Comb., 2000

1999
Bounded Stable Sets: Polytopes and Colorings.
SIAM J. Discret. Math., 1999

1997
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs.
Comb. Probab. Comput., 1997

An Analysis of Channel Assignment Problems Based on Tours.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1996
All-even latin squares.
Discret. Math., 1996

1995
On Even and Odd Latin Squares.
J. Comb. Theory, Ser. A, 1995

1990
Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCH.
IEEE Trans. Inf. Theory, 1990


  Loading...