default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Widel
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Wojciech Widel
, Simon Hacks, Mathias Ekstedt, Pontus Johnson, Robert Lagerström:
The meta attack language - a formal description. Comput. Secur. 130: 103284 (2023)- 2022
- [j7]Wojciech Widel, Preetam Mukherjee, Mathias Ekstedt:
Security Countermeasures Selection Using the Meta Attack Language and Probabilistic Attack Graphs. IEEE Access 10: 89645-89662 (2022) - 2021
- [j6]Ligong Wang, Wojciech Widel, Wei Zheng:
On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs. Discuss. Math. Graph Theory 41(1): 167-181 (2021) - 2020
- [c5]Barbara Fila, Wojciech Widel:
Exploiting attack-defense trees to find an optimal set of countermeasures. CSF 2020: 395-410
2010 – 2019
- 2019
- [b1]Wojciech Widel:
Formal modeling and quantitative analysis of security using attack-defense trees. (Modélisation formelle et analyse quantitative de la sécurité à l'aide d'arbres les attaques et de défense). INSA Rennes, France, 2019 - [j5]Wojciech Widel, Maxime Audinot, Barbara Fila, Sophie Pinchinat:
Beyond 2014: Formal Methods for Attack Tree-based Security Modeling. ACM Comput. Surv. 52(4): 75:1-75:36 (2019) - [c4]Barbara Fila, Wojciech Widel:
Efficient Attack-Defense Tree Analysis using Pareto Attribute Domains. CSF 2019: 200-215 - [c3]Barbara Fila, Wojciech Widel:
Attack-Defense Trees for Abusing Optical Power Meters: A Case Study and the OSEAD Tool Experience Report. GraMSec@CSF 2019: 95-125 - 2018
- [c2]Barbara Kordy, Wojciech Widel:
On Quantitative Analysis of Attack-Defense Trees with Repeated Labels. POST 2018: 325-346 - 2017
- [j4]Wojciech Widel:
A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs. Discret. Math. 340(7): 1639-1644 (2017) - [j3]Wojciech Widel:
A triple of heavy subgraphs ensuring pancyclity of 2-connected graphs. Discuss. Math. Graph Theory 37(2): 477-500 (2017) - [j2]Wojciech Widel:
Clique-heavy subgraphs and pancyclicity of 2-connected graphs. Inf. Process. Lett. 117: 6-9 (2017) - [c1]Barbara Kordy, Wojciech Widel:
How Well Can I Secure My System? IFM 2017: 332-347 - 2016
- [j1]Wojciech Widel:
A Fan-type heavy pair od subgraphs for pancyclicity of 2-connected graphs. Discuss. Math. Graph Theory 36(1): 173-184 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
