Xavier Warnes

Xavier Warnes
Stanford University | SU · Woods Institute for the Environment

PhD

About

7
Publications
300
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
20
Citations

Publications

Publications (7)
Article
Full-text available
Many operational settings share the following three features: (i) a centralized planning system allocates tasks to workers or service providers, (ii) the providers generate value by completing the tasks, and (iii) the completion of tasks influences the providers’ welfare. In such cases, the planning system’s allocations often entail trade-offs betw...
Preprint
Full-text available
Problem definition To respond to pandemics such as COVID-19, policy makers have relied on interventions that target specific population groups or activities. Since targeting is potentially contentious, rigorously quantifying its benefits is critical for designing effective and equitable pandemic control policies. Methodology/results We propose a f...
Article
Full-text available
Given a simple graph G, a set \(C \subseteq V(G)\) is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with \(v \in C\), where G[v] denotes the subgraph of G induced by the closed neighborhood of the vertex v. Two elements of \(E(G) \cup V(G)\) are neighborhood-independent if there is no vertex \(v\in V(G)\) such that bot...
Article
Full-text available
Given a simple graph $G$, a set $C \subseteq V(G)$ is a neighborhood cover set if every edge and vertex of $G$ belongs to some $G[v]$ with $v \in C$, where $G[v]$ denotes the subgraph of $G$ induced by the closed neighborhood of the vertex $v$. Two elements of $E(G) \cup V(G)$ are neighborhood-independent if there is no vertex $v\in V(G)$ such that...

Network

Cited By