Person:1344238: Difference between revisions

From MaRDI portal
Person:1344238
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Person:659652 to Jeannette C. M. Janssen: Duplicate
(No difference)

Revision as of 17:22, 9 December 2023

Available identifiers

zbMath Open janssen.jeannette-c-mMaRDI QIDQ1344238

List of research outcomes

PublicationDate of PublicationType
Strongly \(n\)-e.c. graphs and independent distinguishing labellings2024-02-16Paper
Graph sequences sampled from Robinson graphons2024-02-05Paper
Attainable bounds for algebraic connectivity and maximally-connected regular graphs2023-07-14Paper
Signal processing on large networks with group symmetries2023-03-29Paper
Orthogonal Colourings of Random Geometric Graphs2023-03-14Paper
High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks2022-11-04Paper
A noncommutative approach to the graphon Fourier transform2022-08-26Paper
Uniform embeddings for Robinson similarity matrices2022-03-25Paper
The spread of cooperative strategies on grids with random asynchronous updating2022-03-23Paper
Geometric random graphs and Rado sets of continuous functions2021-09-20Paper
Uniform Embeddings for Robinson Similarity Matrices2021-05-19Paper
Finding Safe Strategies for Competitive Diffusion on Trees2021-04-26Paper
How to Burn a Graph2021-03-26Paper
Nonuniform Distribution of Nodes in the Spatial Preferential Attachment Model2021-03-26Paper
Orthogonal colourings of Cayley graphs2020-09-10Paper
Total Colourings of Direct Product Graphs2020-08-12Paper
Geometric random graphs and Rado sets in sequence spaces2019-06-18Paper
An Optimization Parameter for Seriation of Noisy Data2019-05-13Paper
The spread of cooperative strategies on grids with random asynchronous updating2018-10-26Paper
Recovering the structure of random linear graphs2018-10-02Paper
Bounds on the burning number2017-12-06Paper
Rumors Spread Slowly in a Small-World Spatial Network2017-11-02Paper
Burning a graph is hard2017-10-17Paper
Infinite random graphs and properties of metrics2017-01-25Paper
Uniform linear embeddings of graphons2016-12-27Paper
Bratteli diagrams where random orders are imperfect2016-12-14Paper
Conditions on square geometric graphs2016-10-24Paper
Uniform linear embeddings of spatial random graphs2016-10-14Paper
Rumours Spread Slowly in a Small World Spatial Network2016-01-08Paper
Partial list colouring of certain graphs2015-11-02Paper
Burning a Graph as a Model of Social Contagion2015-09-09Paper
Linear embeddings of graphs and graph limits2015-06-10Paper
Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model2015-01-13Paper
On the continuity of graph parameters2014-12-05Paper
Infinite Random Geometric Graphs from the Hexagonal Metric2014-08-19Paper
Properties of metrics and infinite geometric graphs2013-10-17Paper
Geometric graph properties of the spatial preferred attachment model2013-01-18Paper
Geometric Protean Graphs2012-08-29Paper
Infinite random geometric graphs2012-01-24Paper
Infinite Limits and Adjacency Properties of a Generalized Copying Model2011-06-21Paper
Rank-Based Attachment Leads to Power Law Graphs2011-04-15Paper
A Spatial Web Graph Model with Local Influence Regions2011-02-28Paper
Infinite Limits and Adjacency Properties of a Generalized Copying Model2011-02-28Paper
The Geometric Protean Model for On-Line Social Networks2011-01-21Paper
https://portal.mardi4nfdi.de/entity/Q35766932010-07-30Paper
Spatial Models for Virtual Networks2010-07-29Paper
Protean graphs with a variety of ranking schemes2009-11-25Paper
Then-ordered graphs: A new graph class2009-03-04Paper
Modelling and Mining of Networked Information Spaces2008-08-19Paper
Workshop on Algorithms and Models for the Web Graph2008-08-19Paper
A Spatial Web Graph Model with Local Influence Regions2008-04-11Paper
https://portal.mardi4nfdi.de/entity/Q54879222006-09-13Paper
Lower Bounds from Tile Covers for the Channel Assignment Problem2005-09-16Paper
Infinite Limits of Copying Models of the Web Graph2005-04-11Paper
Distributive online channel assignment for hexagonal cellular networks with constraints2004-11-23Paper
https://portal.mardi4nfdi.de/entity/Q30458222004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q30458242004-08-12Paper
Graph covers using \(t\)-colourable vertex sets.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44308432003-10-13Paper
https://portal.mardi4nfdi.de/entity/Q43291362002-07-14Paper
Approximation algorithms for channel assignment with constraints2002-03-03Paper
There is no (46, 6, 1) block design2001-12-09Paper
https://portal.mardi4nfdi.de/entity/Q45112372001-03-06Paper
Distributed Online Frequency Assignment in Cellular Networks2000-11-22Paper
Adaptive multicolouring2000-11-13Paper
Bounded Stable Sets: Polytopes and Colorings1999-06-27Paper
New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs1998-01-19Paper
All-even Latin squares1997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q48449091996-01-07Paper
On even and odd latin squares1995-08-27Paper
The Dinitz problem solved for rectangles1994-01-31Paper
Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e<e/sub BCH/1990-01-01Paper
An approximation algorithm for zero forcing0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jeannette C. M. Janssen