Matthew P. Johnson

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
Deciding the closure of inconsistent rooted triples is NP-complete (available as arXiv preprint)	2022-07-21	Paper
Turing Tumble is P(SPACE)-complete	2020-02-06	Paper
Secluded connectivity problems Algorithmica	2017-11-09	Paper
Approximating the maximum rectilinear crossing number Lecture Notes in Computer Science	2016-09-02	Paper
Evader interdiction: algorithms, complexity and collateral damage Annals of Operations Research	2015-01-22	Paper
Evader interdiction: algorithms, complexity and collateral damage Annals of Operations Research	2015-01-22	Paper
Secluded path via shortest path Structural Information and Communication Complexity	2014-08-07	Paper
Secluded connectivity problems Lecture Notes in Computer Science	2013-09-17	Paper
Computing the obstacle number of a plane graph	2011-07-22	Paper
Probabilistic conditionals are almost monotonic The Review of Symbolic Logic	2010-08-13	Paper
Peak Shaving through Resource Buffering Approximation and Online Algorithms	2009-02-12	Paper
scientific article; zbMATH DE number 1954153 (Why is no real title available?)	2003-07-28	Paper

Research outcomes over time

This page was built for person: Matthew P. Johnson