Text Categorization in R: A Reduced N-Gram Approach. - Wilhelm M. Geiger; Johannes Rauch; Patrick Mair; Kurt Hornik (GfKl, 2010)

A general property for time aggregation. - Carol Alexander; Johannes Rauch (Eur. J. Oper. Res., 2021)

Exact and Parameterized Algorithms for the Independent Cutset Problem. - Johannes Rauch; Dieter Rautenbach; Uéverton S. Souza (FCT, 2023)

Efficiently recognizing graphs with equal independence and annihilation numbers. - Johannes Rauch; Dieter Rautenbach (Inf. Process. Lett., 2023)

weberknecht - a One-Sided Crossing Minimization solver. - Johannes Rauch (CoRR, 2024)

Sparse Vertex Cutsets and the Maximum Degree. - Stéphane Bessy; Johannes Rauch; Dieter Rautenbach; Uéverton S. Souza (Electron. J. Comb., 2025)

Forest cuts in sparse graphs. - Vsevolod Chernyshev; Johannes Rauch; Dieter Rautenbach (Discret. Math., 2025)

On conflict-free cuts: Algorithms and complexity. - Johannes Rauch; Dieter Rautenbach; Uéverton S. Souza (Inf. Process. Lett., 2025)

Computing subset vertex covers in H-free graphs. - Nick Brettell; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Johannes Rauch; Erik Jan van Leeuwen (Theor. Comput. Sci., 2025)

Cutwidth and Crossings. - Johannes Rauch; Dieter Rautenbach (CoRR, 2025)

GridOT - a discrete optimal transport solver on grids. - Johannes Rauch; Leo Zanotti (CoRR, 2025)

A Faster Algorithm for Independent Cut. - Vsevolod Chernyshev; Johannes Rauch; Dieter Rautenbach; Liliia Redina (CoRR, 2025)

Colouring Probe H-Free Graphs. - Daniël Paulusma; Johannes Rauch; Erik Jan van Leeuwen (CoRR, 2025)