Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles. (Characterization of difficult instances for NP-hard problems). - Valentin Weber (2013)

Hull number: P5-free graphs and reduction rules. - Júlio Araújo 001; Grégory Morel; Leonardo Sampaio Rocha; Ronan Pardo Soares; Valentin Weber (Discret. Appl. Math., 2016)

Recovery of disrupted airline operations using k-Maximum Matching in graphs. - Julien Bensmail; Valentin Garnero; Nicolas Nisse; Alexandre Salch; Valentin Weber (Electron. Notes Discret. Math., 2017)

Shedding Light on Mobile App Store Censorship. - Vasilis Ververis; Marios Isaakidis; Valentin Weber; Benjamin Fabian (UMAP (Adjunct Publication), 2019)

Managing Inhomogeneity in the Control Point Network during Staking Out Cadastral Boundaries in Austria. - Valentin Weber; Gerhard Navratil; Franz Blauensteiner (ISPRS Int. J. Geo Inf., 2022)

Recovery of disrupted airline operations using k-maximum matching in graphs. - Nicolas Nisse; Alexandre Salch; Valentin Weber (Eur. J. Oper. Res., 2023)

Identifying potential emerging human rights implications in Chinese smart cities via machine-learning aided patent analysis. - Joss Wright; Valentin Weber; Gregory Walton (Internet Policy Rev., 2023)