( en | de | ru )

 

Disambiguation of "Strozecki, Yann"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Generation of Stable Planar Cages for Chemistry.

, , , , , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 235-246. Springer, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Georgios Yannis

Christos Yannissis

Yann Malato

Role of the IKK complex during liver regeneration: analysis of the differential role of IKKβ/IKK2 IKKbeta/IKK2 and IKKγ/Nemo IKKgamma/Nemo during liver regeneration. TU Aachen, (2009)

Theodoros Yannacopoulos

Anastasia Yannacopoulou

 

Other publications of authors with the same name

Deterministic Scheduling of Periodic Messages for Cloud RAN., , and . CoRR, (2018)A Generic Strategy Improvement Method for Simple Stochastic Games., , and . MFCS, volume 202 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)From patches to pixels in Non-Local methods: Weighted-average reprojection., and . ICIP, page 1929-1932. IEEE, (2010)Efficient Generation of Stable Planar Cages for Chemistry., , , , , and . SEA, volume 9125 of Lecture Notes in Computer Science, page 235-246. Springer, (2015)Solving Simple Stochastic Games with Few Random Nodes Faster Using Bland's Rule., , and . STACS, volume 126 of LIPIcs, page 9:1-9:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Geometric Amortization of Enumeration Algorithms., and . STACS, volume 254 of LIPIcs, page 18:1-18:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Complexity of Acyclic Subhypergraph Problems., and . WALCOM, volume 6552 of Lecture Notes in Computer Science, page 45-56. Springer, (2011)Scheduling periodic messages on a shared link., and . CoRR, (2020)Deterministic Contention Management for Low Latency Cloud RAN over an Optical Ring., , and . ONDM, volume 11616 of Lecture Notes in Computer Science, page 479-491. Springer, (2019)Efficient Enumeration of Solutions Produced by Closure Operations., and . STACS, volume 47 of LIPIcs, page 52:1-52:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)