Wojciech Wideł

Since November 2016 I am a Ph.D. student in computer science within the EMSEC team at IRISA Lab in Rennes. I am working on formal foundations of a graphical model for security called attack–defense trees, under the supervision of Barbara Kordy.

In July 2014 I received my master's degree and in May 2017 I obtained a Ph.D., with distinction, both in mathematics and both from AGH University of Science and Technology in Kraków, Poland. I was working on some topics in structural graph theory, under the supervision of prof. A. Paweł Wojda.


Contact | Publications | Talks 



Contact

Office F413
IRISA, Rennes
Campus universitaire de Beaulieu
263 Avenue du Général Leclerc - CS 74205
35042 Rennes Cedex - France
e-mail: wojciech [dot] widel [at] irisa [dot] fr

Publications

Submitted
Wei Zheng, Wojciech Wideł, Ligong Wang,  On implicit heavy subgraphs and hamiltonicity of 2-connected graphs, Discussiones Mathematicae Graph Theory; to appear [PDF]
Wojciech Wideł, On implicit degree-type conditions for hamiltonicity in implicit claw-f-heavy graphs, Ars Combinatoria; to appear

2018
Barbara Kordy, Wojciech Wideł, On quantitative analysis of attack-defense trees with repeated labels, POST 2018: 325-346 (2018) [Errata | PDF | BibTeX from DBLP ]
2017
Barbara Kordy, Wojciech Wideł,  How well can I secure my system?, IFM 2017: 332-347 (2017) [Errata | PDF | BibTeX from DBLP]
Wojciech Wideł, Fan's condition on induced subgraphs for circumference and pancyclicity, Opuscula Mathematica 37 (4): 617-639  (2017) [PDF | BibTeX]
Wojciech Wideł, A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs, Discrete Mathematics 340 (7): 1639-1644  (2017) [PDF | BibTeX from DBLP ]
Wojciech Wideł, A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs, Discussiones Mathematicae Graph Theory 37 (2): 477-500  (2017) [PDF | BibTeX from DBLP ]
Wojciech Wideł, Clique-heavy subgraphs and pancyclicity of 2-connected graphs, Information Processing Letters 117: 6-9  (2017) [PDF | BibTeX from DBLP ]
2016
Wojciech Wideł, A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs, Discussiones Mathematicae Graph Theory 36 (1): 173-184  (2016) [PDF | BibTeX from DBLP ]

Talks

04.2018 On quantitative analysis of attack-defense trees with repeated label, 7th International Conference on Principles of Security and Trust (POST 2018), Thessaloniki, Greece
11.2017 Attributes evaluation in attack-defense trees with repeated labels, Workshop on Formal Methods for Attack Trees, Munich, Germany
09.2017 How well can I secure my system?, 13th International Conference on Integrated Formal Methods (iFM 2017), Turin, Italy
08.2017 On optimization problems in attack-defense trees, 17th International School on Foundations of Security Analysis and Design, Bertinoro, Italy
11.2015 Hamiltonicity of 3-connected claw-heavy graphs, 24th Workshop On Graph Theory '3in1', Krynica-Zdrój, Poland
09.2015 Heavy subgraphs and the existence of cycles in 2-connected graphs, 16th Workshop On Graph Theory 'Colourings, Independence and Domination', Szklarska Poręba, Poland


Academic refereeing

Ars Combinatoria (1)
Frontiers of Mathematics in China (1)
International Journal of Information Security (1) (co-reviewer)
Opuscula Mathematica (2)

Teaching (in Polish)

1 semester of running the exercise sessions in Extremal Combinatorics, Master, AGH UST, 2015-2016
3 semesters of running the exercise sessions in Calculus, AGH UST, 2014-2016
1 semester of running the exercise sessions in Linear Algebra and Geometry, AGH UST, 2014-2015
1 semester of running the exercise sessions in Introduction to Discrete Mathematics, AGH UST, 2014-2015

Organisation

I co-organised the 25th Workshop On Graph Theory ’3in1’, held at Dosłońce, Poland, on 16–19 November 2016.