Jeannette Janssen | Academic Influence

Jeannette Janssen's AcademicInfluence.com Rankings

Jeannette Janssen

Mathematics

#4147

World Rank

#5954

Historical Rank

Measure Theory

#3858

World Rank

#4547

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Jeannette Janssen's Degrees

PhD Mathematics University of Amsterdam
Bachelors Mathematics University of Amsterdam

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Jeannette Janssen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jeannette Catharina Maria Janssen is a Dutch and Canadian mathematician whose research concerns graph theory and the theory of complex networks. She is a professor of mathematics at Dalhousie University, the chair of the Dalhousie Department of Mathematics and Statistics, and the chair of the Activity Group on Discrete Mathematics of the Society for Industrial and Applied Mathematics.

(See a Problem?)

Jeannette Janssen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Workshop on Algorithms and Models for the Web Graph (2007) (199)
Characterizing and Mining the Citation Graph of the Computer Science Literature (2004) (99)
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs (1997) (97)
A Spatial Web Graph Model with Local Influence Regions (2007) (96)
Distributed Online Frequency Assignment in Cellular Networks (1998) (75)
Node similarity in the citation graph (2006) (75)
How to Burn a Graph (2015) (58)
Burning a Graph as a Model of Social Contagion (2014) (56)
Using HMM to learn user browsing patterns for focused Web crawling (2006) (55)
Burning a graph is hard (2015) (54)
Model Selection for Social Networks Using Graphlets (2012) (52)
Node similarity in networked information spaces (2001) (46)
Characterization of Graphs Using Degree Cores (2007) (45)
Bounds on the burning number (2015) (43)
On Even and Odd Latin Squares (1995) (33)
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers (2007) (28)
A geometric model for on-line social networks (2010) (28)
Infinite Limits of Copying Models of the Web Graph (2004) (27)
The Dinitz problem solved for rectangles (1993) (27)
Geometric Protean Graphs (2011) (26)
Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCH (1990) (23)
Geometric Graph Properties of the Spatial Preferred Attachment model (2011) (22)
Channel assignment and graph labeling (2002) (20)
There is no (46, 6, 1) block design* (2001) (20)
An optimal solution to the "Philadelphia" channel assignment problem (1999) (20)
Fixed preference channel assignment for cellular telephone systems (1996) (20)
Link-based event detection in email communication networks (2009) (20)
Focused Crawling by Learning HMM from User's Topic-specific Browsing (2004) (18)
Domain-Specific Semantic Relatedness from Wikipedia Structure: A Case Study in Biomedical Text (2015) (18)
All-even latin squares (1996) (17)
Spatial Models for Virtual Networks (2010) (16)
Infinite Random Geometric Graphs (2009) (15)
The Geometric Protean Model for On-Line Social Networks (2010) (13)
Bounded Stable Sets: Polytopes and Colorings (1999) (12)
Infinite Limits and Adjacency Properties of a Generalized Copying Model (2007) (12)
Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model (2015) (11)
Distributive online channel assignment for hexagonal cellular networks with constraints (2004) (11)
Protean graphs with a variety of ranking schemes (2009) (11)
Linear embeddings of graphs and graph limits (2012) (10)
Estimating node similarity from co-citation in a spatial graph model (2010) (10)
Characterizing the Citation Graph as a Self-Organizing Networked Information Space (2002) (10)
Rank-Based Attachment Leads to Power Law Graphs (2009) (9)
On the orthogonal Latin squares polytope (2006) (9)
Bratteli diagrams where random orders are imperfect (2014) (9)
Approximation algorithms for channel assignment with constraints (1999) (8)
Lower Bounds from Tile Covers for the Channel Assignment Problem (2005) (8)
Rumors Spread Slowly in a Small-World Spatial Network (2016) (8)
Link-Based Anomaly Detection in Communication Networks (2008) (7)
Infinite Random Geometric Graphs from the Hexagonal Metric (2012) (7)
An Optimization Parameter for Seriation of Noisy Data (2018) (7)
Tile Covers, Closed Tours and The Radio Spectrum (1999) (7)
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces (2004) (6)
A partial solution of a partial list colouring problem. (2001) (6)
Algorithms and Models for the Web-Graph, Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers (2007) (6)
Recovering the structure of random linear graphs (2017) (6)
Total Colourings of Direct Product Graphs (2018) (5)
The n‐ordered graphs: A new graph class (2009) (5)
Uniform linear embeddings of graphons (2015) (4)
The difference in even and odd latin rectangles for small cases (1995) (4)
Clique Facets of the Orthogonal Latin Squares Polytope É (2001) (4)
An analysis of channel assignment problems based on tours (1997) (4)
A noncommutative approach to the graphon Fourier transform (2021) (4)
Rumours Spread Slowly in a Small World Spatial Network (2015) (4)
Finding Safe Strategies for Competitive Diffusion on Trees (2014) (4)
Infinite random graphs and properties of metrics (2016) (3)
On Error-and-erasure Decoding Of Cyclic Codes Up To The Roos Bound (1991) (3)
Reconstruction of Line-Embeddings of Graphons (2020) (3)
High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks (2017) (3)
Partial List Colouring of Certain Graphs (2014) (3)
Geometric random graphs and Rado sets in sequence spaces (2016) (3)
Orthogonal colourings of Cayley graphs (2019) (2)
Modelling and Mining of Networked Information Spaces (2007) (2)
Geometric random graphs and Rado sets of continuous functions (2018) (2)
Algebraic decoding beyond $e_{BCH}$ of some buinary cyclic codes (1989) (2)
On the continuity of graph parameters (2015) (2)
Graph sequences sampled from Robinson graphons (2020) (2)
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model (2013) (2)
PROPERTIES OF METRICS AND INFINITE GEOMETRIC GRAPHS (2013) (2)
Bratteli diagrams where almost all orders are imperfect (2014) (2)
Infinite limits of the duplication model and graph folding (2005) (2)
The n-ordered graphs: A new graph class (2009) (1)
Fractional isometric path number (2006) (1)
Recognition of certain square geometric graphs (2015) (1)
Total colouring of some cartesian and direct product graphs (2018) (1)
Adaptive Multicolouring (2000) (1)
The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating (2016) (1)
Uniform Linear Embeddings of Spatial Random Graphs (2015) (1)
Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking (2007) (1)
Algorithms and models for the web graph : 9th International Workshop, WAW 2012, Halifax, NS, Canada, June 22-23, 2012, proceedings (2012) (1)
Infinite Random Geometric Graphs Extended Abstract (0)
Channel assignment for digital networks : a bound and an algorithm (0)
Recognizing graphs with linear random structure (2016) (0)
MODEL SELECTION FOR SOCIAL NETWORKS USING GRAPHLETS TECHNICAL REPORT (2011) (0)
Special Issue on Algorithms and Models for the Web-Graph (2007) (0)
A polynomial time list colouring algorithm for series-parallel graphs (2002) (0)
Uniform Embeddings for Robinson Similarity Matrices (2021) (0)
Conditions on square geometric graphs (2016) (0)
Channel assignment for digital broadcasting: a bound and an algorithm (2002) (0)
Infinite limits and folding (2005) (0)
Jeannette Janssen (Draft Profile) (2013) (0)
Compressibility as a Measure of Local Coherence in Web Graphs (2002) (0)
Knowledge and Information Systems REGULAR PAPER (2006) (0)
INFINITE LIMITS OF STOCHASTIC GRAPH MODELS-DRAFT (2004) (0)
Strongly n-e.c. Graphs and Independent Distinguishing Labellings (2019) (0)
Preface Organizing Committee Program Committee Usefulness as the Criterion for Evaluation of Interactive Information Retrieval Systems Semi-supervised Priors for Microblog Language Identification Scope of Negation Detection in Sentiment Analysis a Multi-dimensional Model for Search Intent Result Div (0)
Using a Hidden Markov Model to Learn User Browsing Patterns for Focused Web Crawling (0)
Graph covers using t-colourable vertex sets (2004) (0)
Note On Even and Odd Latin Squares (2004) (0)
Limit behaviour of models for the web graph and other self-organizing networks (2004) (0)
Bratteli diagrams where random orders are imperfect Journal Item (2019) (0)
C O ] 2 N ov 2 01 6 Bounds on the Burning Number (2018) (0)
Proceedings of the 9th international conference on Algorithms and Models for the Web Graph (2007) (0)
1 Channel assignment and graph labeling (0)
Signal processing on large networks with group symmetries (2023) (0)
Orthogonal Colourings of Random Geometric Graphs (2023) (0)

This paper list is powered by the following services:

Other Resources About Jeannette Janssen

en.wikipedia.org

What Schools Are Affiliated With Jeannette Janssen?

Jeannette Janssen is affiliated with the following schools: