The participant of the project are:

BLIN Guillaume - 4B066 Copernic - 01 60 95 77 49 - mail - Associate Professor and ANR Coordinator

SIKORA Florian - 4B058 Copernic - 01 60 95 77 26 - mail - Postdoc

This project is related to three distinct tasks detailed afterwards. The planned schedule for this project is the following.

Events:

> 3 weeks visit in IOWA City University from mid February to beginning of March 2011. Establishment of a new collaboration with Pr Xiaodong Wu -- Dpt of Elec. & Computer Engineering -- and Dr Yusung Kim -- Dpt of Radiation Oncology

> 3 weeks visit of Minghui Jiang in May 2011

> Paul Morel and Philippe Gambette join the project as, resp., PhD student and Associate Professor

> A yearly visit in IOWA City University of Paul Morel.

> Contacts were made with the Radiotherapy group of the Institut Bergonié

Related publications:

1. Paul Morel, Ryan Thomas Flynn, Edgar Gelover, Guillaume Blin, Stéphane Vialette, et al.. MSPT: An open-source motion simulator for proton therapy. Biomedical Physics & Engineering Express, 2015, 1 (3), 12 pp. ⟨hal-01171799⟩
2. Paul Morel, Xiadong Wu, Guillaume Blin, Stéphane Vialette, Ryan Flynn, et al.. Spot Weight Adaptation for Moving Target in Spot Scanning Proton Therapy. Frontiers in Oncology, 2015, 5 (119), pp.1-7. ⟨10.3389/fonc.2015.00119⟩. ⟨hal-01151923⟩
3. Guillaume Blin, Paul Morel, Romeo Rizzi, Stéphane Vialette. Towards unlocking the full potential of Multileaf Collimators. 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Jan 2014, High Tatras, Slovakia. pp.138-149. ⟨hal-00859708⟩
4. Guillaume Blin. MISTREAT: MotIon Simulator in proton-therapy TREATment. The Workshop on Bioinformatics and Stringology 2014 (BioS 2014), Feb 2014, Dakha, Bangladesh. ⟨hal-00918205⟩
5. Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Finding Approximate and Constrained Motifs in Graphs. Theoretical Computer Science, 2013, 483 (-), pp.10-21. ⟨10.1016/j.tcs.2012.08.023⟩. ⟨hal-00726556⟩
6. Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A faster algorithm for finding minimum Tucker submatrices. Theory of Computing Systems, 2012, 51 (3), pp.270-281. ⟨10.1007/s00224-012-9388-1⟩. ⟨hal-00657340⟩
7. Guillaume Blin. Combinatorial Objects in Bio-Algorithmics: Related problems and complexities. Bioinformatics [q-bio.QM]. Université Paris-Est, 2012. ⟨tel-00711879⟩
8. Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-Babou, Irena Rusu, Florian Sikora, et al.. Algorithmic Aspects of Heterogeneous Biological Networks Comparison. COCOA 2011, 2011, Zhangjiajie, China. pp.272-286, ⟨10.1007/978-3-642-22616-8_22⟩. ⟨hal-00606375⟩
9. Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Finding Approximate and Constrained Motifs in Graphs. CPM 2011, 2011, Palermo, Italy. pp.388-401, ⟨10.1007/978-3-642-21458-5_33⟩. ⟨hal-00606173⟩
10. Guillaume Blin, Romeo Rizzi, Stéphane Vialette. A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row. 6th International Computer Science Symposium in Russia (CSR'11), 2011, St Petersbourg, Russia. pp.373-384, ⟨10.1007/978-3-642-20712-9_29⟩. ⟨hal-00620378⟩