Wojciech Wideł
Data science · Optimization · Graph theory · Security modelling
I work in data science. My research background is in structural graph theory, formal methods for security, and optimization.
Notes & resources
Lecture notes
Cheatsheets
Write-ups
Publications
2023
- The Meta Attack Language – A Formal Description Computers & Security 130: 103284 DOI
2022
- Security Countermeasures Selection using the Meta Attack Language and Probabilistic Attack Graphs IEEE Access 10: 89645–89662 DOI
2021
- On implicit heavy subgraphs and hamiltonicity of 2-connected graphs Discussiones Mathematicae Graph Theory 41(1): 167–181 DOI
2020
- Exploiting attack–defense trees to find an optimal set of countermeasures CSF 2020: 395–410 DOI
2019
- Attack–defense trees for abusing optical power meters: A case study and the OSEAD tool experience report GraMSec 2019: 95–125 DOI
- Efficient attack–defense tree analysis using Pareto attribute domains CSF 2019: 200–215 PDF DOI
- Beyond 2014: Formal methods for attack tree-based security modeling ACM Computing Surveys 52(4): 75:1–75:36 Preprint DOI
2018
2017
- How well can I secure my system? IFM 2017: 332–347 PDF DOI Errata
- Fan's condition on induced subgraphs for circumference and pancyclicity Opuscula Mathematica 37(4): 617–639 DOI
- A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs Discrete Mathematics 340(7): 1639–1644 PDF DOI
- A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs Discussiones Mathematicae Graph Theory 37(2): 477–500 DOI
- Clique-heavy subgraphs and pancyclicity of 2-connected graphs Information Processing Letters 117: 6–9 PDF DOI
2016
- A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs Discussiones Mathematicae Graph Theory 36(1): 173–184 DOI
Ph.D. theses
2019
2017
- Heavy subgraphs and pancyclicity AGH University of Science and Technology PDF