| 2024 | MFCS | Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. | Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt |
| 2020 | IWOCA | On the Complexity of Stackelberg Matroid Pricing Problems. | Toni Bhnlein, Oliver Schaudt |
| 2019 | STACS | How to Secure Matchings Against Edge Failures. | Felix Hommelsheim, Moritz Mhlenthaler, Oliver Schaudt |
| 2019 | WADS | Stackelberg Packing Games. | Toni Bhnlein, Oliver Schaudt, Joachim Schauer |
| 2017 | ICALP | Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. | Toni Bhnlein, Stefan Kratsch, Oliver Schaudt |
| 2017 | WG | Approximately Coloring Graphs Without Long Induced Paths. | Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong |
| 2017 | WG | The Parameterized Complexity of the Equidomination Problem. | Oliver Schaudt, Fabian Senger |
| 2016 | ECAI | Minisum and Minimax Committee Election Rules for General Preference Types. | Dorothea Baumeister, Toni Bhnlein, Lisa Rey, Oliver Schaudt, Ann-Kathrin Selker |
| 2016 | IPCO | Improved Approximation Algorithms for Hitting 3-Vertex Paths. | Samuel Fiorini, Gwenal Joret, Oliver Schaudt |
| 2016 | SODA | Obstructions for three-coloring graphs with one forbidden induced subgraph. | Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong |
| 2016 | WG | Exhaustive Generation of k-Critical ℋ-Free Graphs. | Jan Goedgebeur, Oliver Schaudt |
| 2015 | WG | Recognizing k-equistable Graphs in FPT Time. | Eun Jung Kim, Martin Milanic, Oliver Schaudt |
| 2014 | IPCO | Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time. | Henning Bruhn, Oliver Schaudt |
| 2014 | WG | Structural Parameterizations for Boxicity. | Henning Bruhn, Morgan Chopin, Felix Joos, Oliver Schaudt |
| 2014 | WG | A New Characterization of P | Eglantine Camby, Oliver Schaudt |
| 2014 | WG | Polynomial Time Recognition of Squares of Ptolemaic Graphs and 3-sun-free Split Graphs. | Van Bang Le, Andrea Oversberg, Oliver Schaudt |