Matthew P. Johnson
From MaRDI portal
Person:490226
Available identifiers
zbMath Open johnson.matthew-pWikidataQ102419522 ScholiaQ102419522MaRDI QIDQ490226
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| https://portal.mardi4nfdi.de/entity/Q5091002 | 2022-07-21 | Paper |
| Turing Tumble is P(SPACE)-complete | 2020-02-06 | Paper |
| Secluded connectivity problems | 2017-11-09 | Paper |
| Approximating the Maximum Rectilinear Crossing Number | 2016-09-02 | Paper |
| Evader interdiction: algorithms, complexity and collateral damage | 2015-01-22 | Paper |
| Secluded Path via Shortest Path | 2014-08-07 | Paper |
| Secluded connectivity problems | 2013-09-17 | Paper |
| Computing the obstacle number of a plane graph | 2011-07-22 | Paper |
| Probabilistic conditionals are almost monotonic | 2010-08-13 | Paper |
| Peak Shaving through Resource Buffering | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415173 | 2003-07-28 | Paper |
Research outcomes over time
This page was built for person: Matthew P. Johnson
