Johannes Rauch

Orcid: 0000-0002-6925-8830

According to our database1, Johannes Rauch authored at least 13 papers between 2010 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Colouring Probe <i>H</i>-Free Graphs.
CoRR, May, 2025

A Faster Algorithm for Independent Cut.
CoRR, May, 2025

GridOT - a discrete optimal transport solver on grids.
CoRR, February, 2025

Cutwidth and Crossings.
CoRR, January, 2025

Computing subset vertex covers in H-free graphs.
Theor. Comput. Sci., 2025

On conflict-free cuts: Algorithms and complexity.
Inf. Process. Lett., 2025

Forest cuts in sparse graphs.
Discret. Math., 2025

Sparse Vertex Cutsets and the Maximum Degree.
Electron. J. Comb., 2025

2024
weberknecht - a One-Sided Crossing Minimization solver.
CoRR, 2024

2023
Efficiently recognizing graphs with equal independence and annihilation numbers.
Inf. Process. Lett., August, 2023

Exact and Parameterized Algorithms for the Independent Cutset Problem.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2021
A general property for time aggregation.
Eur. J. Oper. Res., 2021

2010
Text Categorization in R: A Reduced N-Gram Approach.
Proceedings of the Challenges at the Interface of Data Analysis, Computer Science, and Optimization - Proceedings of the 34th Annual Conference of the Gesellschaft für Klassifikation e. V., Karlsruhe, July 21, 2010


  Loading...