Publications

(2022). Recent Advances in Positive-Instance Driven Graph Searching. Algorithms 2022.

(2021). Load Balancing: The Long Road From Theory to Practice (ALENEX 2022). ALENEX 2022.

Preprint

(2021). ASAP: Algorithm Substitution Attacks on Cryptographic Protocols (AsiaCCS 2022). AsiaCCS 2022.

(2021). Util::Lookup: Exploiting key decoding in cryptographic libraries (CCS 2021). CCS 2021.

Preprint

(2021). Side-Channel Protections for Picnic Signatures. CHES 2021.

Preprint

(2021). Help, my Signal has bad Device! Breaking the Signal Messenger’s Post-Compromise Security through a Malicious Device. DIMVA 2021.

Preprint

(2021). Robust Online Algorithms for Dynamic Choosing Problems. CIE 2021.

Preprint

(2020). On the Universal Steganography of Optimal Rate (Inf. Comput. 2020). Inf. Comput..

Journal

(2020). Tightness of Sensitivity and Proximity Bounds for Integer Programs (SOFSEM 2021). SOFSEM 2021.

(2020). New Bounds for the Vertices of the Integer Hull (SOSA 2021). SOSA 2021.

(2020). SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis (CCS 2020). CCS 2020.

IACR ePrint

(2020). Solving Packing Problems with Few Small Items Using Rainbow Matchings (MFCS 2020). MFCS 2020.

Arxiv

(2019). Robust Online Algorithms for Certain Dynamic Packing Problems (WAOA 2019). WAOA 2019.

Arxiv

(2019). Robust Online Algorithms for Certain Dynamic Packing Problems (WAOA 2019). WAOA 2019.

Arxiv

(2019). Online Bin Covering with Limited Migration (ESA 2019). ESA 2019.

Arxiv

(2018). SAT-Encodings of Tree Decompositions (SAT 2018). SAT Competition, 2018.

Proceedings

(2018). Fully Dynamic Bin Packing Revisited (Math. Prog. 2018). Math. Program..

Slides Video Journal Arxiv

(2018). Using Structural Properties for Integer Programs (CIE 2018). CIE 2018.

Private Copy

(2017). Jdrasil: A Modular Library for Computing Tree Decompositions (SEA 2017). SEA 2017.

Proceedings

(2017). Learning Residual Alternating Automata (AAAI 2017). AAAI 2017.

Proceedings ECCC

(2016). Hard Communication Channels for Steganography (ISAAC 2016). ISAAC 2016.

Proceedings

(2015). Fully Dynamic Bin Packing Revisited (APPROX-RANDOM 2015). APPROX-RANDOM 2015.

Slides Video Proceedings Arxiv Journal