2026 Cynthia A. Phillips: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	39	9593	9317	4065	3896	197	8848

Research.com Recognitions

2016 - SIAM Fellow For contributions to the theory and applications of combinatorial optimization.
2015 - ACM Distinguished Member

Overview

Cynthia A. Phillips is affiliated with Sandia National Laboratories in the United States. Their research spans several fields and subfields within computer science and engineering, focusing primarily on areas such as computer networks and communications, computational theory and mathematics, civil and structural engineering, industrial and manufacturing engineering, and statistics, probability, and uncertainty.

The main topics in Cynthia A. Phillips's work include vehicle routing optimization methods, caching and content delivery, advanced graph theory research, advanced data storage technologies, infrastructure resilience and vulnerability analysis, risk and safety analysis, and probabilistic and robust engineering design.

Their recent publications cover a range of topics and venues, demonstrating a breadth of interest and contribution in both theoretical and applied research. Recent papers include:

"Shortest path network interdiction with asymmetric uncertainty" (2024, Networks)
"Partitioning Communication Streams Into Graph Snapshots" (2022, IEEE Transactions on Network Science and Engineering)
"Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs" (2022, Discrete Optimization)
"Using advanced data structures to enable responsive security monitoring" (2022, Cluster Computing)
"Probing a Set of Trajectories to Maximize Captured Information" (2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl))

Cynthia A. Phillips frequently collaborates with a specific group of researchers. Frequent co-authors include:

William E. Hart
Robert D. Carr
Arash Haddadan
Michael A. Bender
Martín Farach-Colton

Their work has appeared in a range of publication venues, including:

arXiv (Cornell University)
Networks
IEEE Transactions on Network Science and Engineering
Discrete Optimization
Cluster Computing

Cynthia A. Phillips has been recognized with awards such as the SIAM Fellow honor in 2016 for contributions to the theory and applications of combinatorial optimization. They were also named an ACM Distinguished Member in 2015.

Best Publications

A graph-based system for network-vulnerability analysis

Cynthia Phillips;Laura Painton Swiler

1170
Citations
The battle of the water sensor networks (BWSN): A design challenge for engineers and algorithms

Avi Ostfeld;James G. Uber;Elad Salomons;Jonathan W. Berry

674
Citations
Computer-attack graph generation tool

L.P. Swiler;C. Phillips;D. Ellis;S. Chakerian

525
Citations
Optimal time-critical scheduling via resource augmentation

C.A. Phillips;C. Stein;E. Torng;J. Wein

518
Citations
Sensor Placement in Municipal Water Networks

Jonathan W. Berry;Jonathan W. Berry;Lisa Fleischer;Lisa Fleischer;William E. Hart;William E. Hart;Cynthia A. Phillips;Cynthia A. Phillips

394
Citations
Sensor Placement in Municipal Water Networks with Temporal Integer Programming Models

Jonathan Berry;William E. Hart;Cynthia A. Phillips;James G. Uber

357
Citations
Strengthening integrality gaps for capacitated network design and covering problems

Robert D. Carr;Lisa K. Fleischer;Vitus J. Leung;Cynthia A. Phillips

321
Citations
The network inhibition problem

Cynthia A. Phillips

291
Citations
Optimal time-critical scheduling via resource augmentation (extended abstract)

Cynthia A. Phillips;Cliff Stein;Eric Torng;Joel Wein

245
Citations
Tolerating the community detection resolution limit with edge weighting.

Jonathan W. Berry;Bruce Hendrickson;Randall A. LaViolette;Cynthia A. Phillips

233
Citations
Minimizing average completion time in the presence of release dates

Cynthia A. Phillips;Clifford Stein;Joel Wein

226
Citations
Improved Scheduling Algorithms for Minsum Criteria

Soumen Chakrabarti;Cynthia A. Phillips;Andreas S. Schulz;David B. Shmoys

197
Citations
The Asymmetric Median Tree - A New model for Building Consensus Trees

Cynthia A. Phillips;Cynthia A. Phillips;Tandy Warnow;Tandy Warnow

196
Citations
Off-line admission control for general scheduling problems

Cynthia A. Phillips;R. N. Uma;Joel Wein

161
Citations
Pico: An Object-Oriented Framework for Parallel Branch and Bound *

Jonathan Eckstein;Cynthia A. Phillips;William E. Hart

160
Citations
Method and tool for network vulnerability analysis

Laura Painton Swiler;Cynthia A. Phillips

160
Citations
Path Finding for Maximum Value of Information in Multi-Modal Underwater Wireless Sensor Networks

Petrika Gjanci;Chiara Petrioli;Stefano Basagni;Cynthia A. Phillips

137
Citations
Scheduling Jobs that Arrive Over Time (Extended Abstract)

Cynthia A. Phillips;Clifford Stein;Joel Wein

128
Citations
A graph-based network-vulnerability analysis system

L.P. Swiler;C. Phillips;T. Gaylor

127
Citations
Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies

V.J. Leung;E.M. Arkin;Ma. Bender;D. Bunde

111
Citations
Tolerating the community detection resolution limit with edge weighting.

Randall A. LaViolette;Bruce Alan Hendrickson;Cynthia Ann Phillips;Jonathan W. Berry

13
Citations

Frequent Co-Authors

William E. Hart Sandia National Laboratories

Michael A. Bender Stony Brook University

Clifford Stein Columbia University

Jean-Paul Watson Lawrence Livermore National Laboratory

Tandy Warnow University of Illinois at Urbana-Champaign

Chiara Petrioli Sapienza University of Rome

Stefano Basagni Northeastern University

Joseph S. B. Mitchell Stony Brook University

Leslie Ann Goldberg University of Oxford

Ali Pinar Sandia National Laboratories

External Links

Wikipedia of Cynthia A. Phillips Personal website of Cynthia A. Phillips Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online education options in Computer Science opens up flexible and affordable pathways for many students. Those seeking to enter the tech field quickly might consider enrolling in the quickest online masters degree programs, which can be completed in as little as 12 to 18 months. These accelerated degrees help students rapidly gain advanced skills and access new career opportunities.

For learners who are just starting out or looking to transition into tech, an online associate's degree can provide the foundational knowledge needed for entry-level roles in IT, programming, and support. Many of these programs are designed for busy or working professionals, allowing for continued employment while studying.

It’s also important to choose from the most worthwhile masters degrees to ensure your investment in education leads to strong employment prospects and salaries. Finally, pursuing your studies through one of the affordable online colleges can further reduce costs and student debt, making your educational journey more accessible and sustainable.