Matthew P. Johnson

Orcid: 0000-0003-1954-0544

Affiliations:
  • Lehman College, Department of Mathematics and Computer Science, New York City, NY, USA
  • City University of New York, Department of Computer Science, NY, USA
  • University of California, Los Angeles, CA, USA
  • University of Southern California, Department of Computer Science, Los Angeles, CA, USA
  • Pennsylvania State University, Department of Computer Science and Engineering, University Park, PA, USA
  • Columbia University, Department of Computer Science, New York, NY, USA


According to our database1, Matthew P. Johnson authored at least 61 papers between 2002 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Maximizing power production in path and tree riverine networks.
Sustain. Comput. Informatics Syst., 2019

Turing Tumble Is P(SPACE)-Complete.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Achieving Pareto-Optimal MI-Based Privacy-Utility Tradeoffs Under Full Data.
IEEE J. Sel. Top. Signal Process., 2018

Deciding the Closure of Inconsistent Rooted Triples Is NP-Complete.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Minimum-Cost Network-Wide Broadcast over Reliable MAC-Layer Multicast.
IEEE Trans. Mob. Comput., 2017

Secluded Connectivity Problems.
Algorithmica, 2017

Gathering Information in Sensor Networks for Synchronized Freshness.
Proceedings of the 14th Annual IEEE International Conference on Sensing, 2017

Mobile r-gather: Distributed and Geographic Clustering for Location Anonymity.
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2017

Computing messages that reveal selected inferences while protecting others.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Joint sensing duty cycle scheduling for heterogeneous coverage guarantee.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Selfish Knapsack.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Optimizing regional power production under thermal pollution constraints.
Proceedings of the Seventh International Green and Sustainable Computing Conference, 2016

Approximating the Maximum Rectilinear Crossing Number.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
You can't get there from here: sensor scheduling with refocusing delays.
Wirel. Networks, 2015

Efficient multicast in hybrid wireless networks.
Proceedings of the 34th IEEE Military Communications Conference, 2015

The Price of Incorrectly Aggregating Coverage Values in Sensor Selection.
Proceedings of the 2015 International Conference on Distributed Computing in Sensor Systems, 2015

2014
Throughput Maximization in Mobile WSN Scheduling With Power Control and Rate Selection.
IEEE Trans. Wirel. Commun., 2014

Evader interdiction: algorithms, complexity and collateral damage.
Ann. Oper. Res., 2014

LP-Based Approaches to Stationary-Constrained Markov Decision Problems.
Proceedings of the 12th International Workshop on Discrete Event Systems, 2014

Secluded Path via Shortest Path.
Proceedings of the Structural Information and Communication Complexity, 2014

Low Expected Latency Routing in Dynamic Networks.
Proceedings of the 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, 2014

2013
Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes.
Wirel. Networks, 2013

Computing Traversal Times on Dynamic Markovian Paths
CoRR, 2013

A framework for context-aware privacy of sensor data on mobile systems.
Proceedings of the 14th Workshop on Mobile Computing Systems and Applications, 2013

Estimating end-to-end delays under changing conditions.
Proceedings of the 8th ACM MobiCom Workshop on Challenged Networks, 2013

Resource Allocation with Non-deterministic Demands and Profits.
Proceedings of the IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, 2013

2012
Proactive data dissemination to mission sites.
Wirel. Networks, 2012

More is more: The benefits of denser sensor deployment.
ACM Trans. Sens. Networks, 2012

Who, When, Where: Timeslot Assignment to Mobile Clients.
IEEE Trans. Mob. Comput., 2012

Funding Games: The Truth but Not the Whole Truth.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Convergecast with aggregatable data classes.
Proceedings of the 9th Annual IEEE Communications Society Conference on Sensor, 2012

TRUSTS: Scheduling Randomized Patrols for Fare Inspection in Transit Systems.
Proceedings of the Twenty-Fourth Conference on Innovative Applications of Artificial Intelligence, 2012

AgentPolis: towards a platform for fully agent-based modeling of multi-modal transportation (demonstration).
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Towards Optimal Patrol Strategies for Fare Inspection in Transit Systems.
Proceedings of the Game Theory for Security, 2012

Patrol Strategies to Maximize Pristine Forest Area.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Energy peak shaving with local storage.
Sustain. Comput. Informatics Syst., 2011

Knapsack Games and the Truth but not the Whole Truth
CoRR, 2011

Pan and scan: Configuring cameras for coverage.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

Evader Interdiction and Collateral Damage.
Proceedings of the Algorithms for Sensor Systems, 2011

Minimum-Cost Broadcast through Varying-Size Neighborcast.
Proceedings of the Algorithms for Sensor Systems, 2011

2010
Sensor-Mission Assignment in Constrained Environments.
IEEE Trans. Parallel Distributed Syst., 2010

Sensor-mission assignment in wireless sensor networks.
ACM Trans. Sens. Networks, 2010

Modeling and Analysis of Time-Varying Graphs
CoRR, 2010

Brief Announcement: Configuration of Actuated Camera Networks for Multi-target Coverage.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: pan and scan.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Distributed utility-based rate adaptation protocols for prioritized, quasi-elastic flows.
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2009

Proactive Data Dissemination to Mission Sites.
Proceedings of the Sixth Annual IEEE Communications Society Conference on Sensor, 2009

Detection and Localization Sensor Assignment with Exact and Fuzzy Locations.
Proceedings of the Distributed Computing in Sensor Systems, 2009

Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multi-hop Wireless Networks.
Proceedings of the Distributed Computing in Sensor Systems, 2009

Cheap or Flexible Sensor Coverage.
Proceedings of the Distributed Computing in Sensor Systems, 2009

2008
Probabilistic Conditionals are Almost Monotonic.
Rev. Symb. Log., 2008

When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

Peak Shaving through Resource Buffering.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

More is more: The benefits of dense sensor deployment.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

Assigning Sensors to Competing Missions.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

An Ontology-Centric Approach to Sensor-Mission Assignment.
Proceedings of the Knowledge Engineering: Practice and Patterns, 2008

Frugal Sensor Assignment.
Proceedings of the Distributed Computing in Sensor Systems, 2008

Utility-based joint sensor selection and congestion control for task-oriented WSNs.
Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007
Assigning Sensors to Missions with Demands.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

2002
Worst-Case Instances and Lower Bounds via Genetic Algorithms.
Proceedings of the Recent Advances in Simulated Evolution and Learning [extended and revised papers selected from the 4th Asia-Pacific Conference on Simulated Evolution and Learning, 2002

Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms.
Proceedings of the AI 2002: Advances in Artificial Intelligence, 2002


  Loading...