◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Michael Young

36 papers hereh-index 181k citations65 works total

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

author position
  • sole author1
  • last author34

Across the 35 of 36 papers where every author was matched, so the position is known.

fields
  • math.CO34
  • cs.DM1
  • quant-ph1
same name
  • Michael Young — 2 papers, h 1
  • Michael Young — 2 papers, h 1
  • Michael Young — 1 paper, h 4
  • Michael Young — 1 paper, h 5
  • Michael Young — 1 paper, h 2
  • Michael Young — 1 paper, h 7

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
20112022
most citedPropagation time for zero forcing on a graph

98 citations · 348 across the 30 of their papers we have counts for

collaborators
Showing 2020Show all

4 papers · 1 filter

math.CO2020★ 1 cited

Generalizations of Leaky Forcing

Joseph S. Alameda, Juergen Kritschgau, Michael Young

Vertex leaky forcing was recently introduced as a new variation of zero forcing in order to show how vertex leaks can disrupt the zero forcing process in a graph. An edge leak is a…

math.CO2020

On leaky forcing and resilience

Joseph S. Alameda, Jürgen Kritschgau, Nathan Warnberg +1

A leak is a vertex that is not allowed to perform a force during the zero forcing process. Leaky forcing was recently introduced as a new variation of zero forcing in order to anal…

math.CO2020

The Polychromatic Number of Small Subsets of the Integers Modulo n

Emelie Curl, John Goldwasser, Joe Sampson +1

If S is a subset of an abelian group G, the polychromatic number of S in G is the largest integer k so that there is a k−coloring of the elements of G such that every…

math.CO2020★ 1 cited

An upper bound for the k-power domination number in r-uniform hypergraphs

Joseph S. Alameda, Franklin Kenter, Karen Meagher +1

Generalizing work on graphs, Chang and Roussel introduced k-power domination in hypergraphs and conjectured the upper bound for the k-power domination number for r-uniform hy…

◍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.