◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Janssen

34 papers hereh-index 232k citations118 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author12
  • middle author10
  • last author9

Across the 32 of 34 papers where every author was matched, so the position is known.

fields
  • math.CO22
  • cs.SI4
  • cs.DM2
  • eess.SP2
  • math.DS1
  • math.PR1
same name
  • J. Janssen — 164 papers
  • J. Janssen — 12 papers, h 43
  • J. Janssen — 3 papers, h 3
  • J. Janssen — 2 papers, h 10
  • J. Janssen — 1 paper, h 65
  • J. Janssen — 1 paper, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
19932026
most citedA noncommutative approach to the graphon Fourier transform

10 citations · 56 across the 26 of their papers we have counts for

collaborators
Showing 2015 · math.COShow all

4 papers · 2 filters

math.CO2015★ 6 cited

Burning a Graph is Hard

Anthony Bonato, Jeannette Janssen, Elham Roshanbin

Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of the spread of contagio…

math.CO2015

Bounds on the Burning Number

Stéphane Bessy, Anthony Bonato, Jeannette Janssen +1

Motivated by a graph theoretic process intended to measure the speed of the spread of contagion in a graph, Bonato, Janssen, and Roshanbin [Burning a Graph as a Model of Social Con…

math.CO2015★ 3 cited

How to burn a graph

Anthony Bonato, Jeannette Janssen, Elham Roshanbin

We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Fir…

math.CO2015

Uniform linear embeddings of graphons

Huda Chuangpishit, Mahya Ghandehari, Jeannette Janssen

Let w:[0,1]2→[0,1] be a symmetric function, and consider the random process G(n,w), where vertices are chosen from [0,1] uniformly at random, and w governs the…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.