I am a doctoral student in the algorithm engineering group Heidelberg. Currently I am working on kernelization algorithms, especially for finding maximum weighted independent sets.

Contact

Publications


    Journal Articles

  1. Finding Near-Optimal Weight Independent Sets at Scale. Ernestine Großmann, Sebastian Lamm, Christian Schulz and Darren Strash. Journal of Graph Algorithms and Applications, 2024. [ link ]

    2. Peer-reviewed Papers

  2. The PACE 2022 Parametrized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022), LIPIcs, Volume 249, 2022. [ link ]
  3. Engineering Fully Dynamic ∆-Orientation Algorithms. Jannick Borowitz, Ernestine Großmann, Christian Schulz. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), 2023. To appear. [ preprint ]
  4. Arc-Flags Meet Trip-Based Public Transit Routing. Ernestine Großmann, Jonas Sauer, Christian Schulz, Patrick Steil. In Symposium on Experimental Algorithms (SEA), 2023. To appear. [ preprint ]
  5. Finding Near-Optimal Weight Independent Sets at Scale. Ernestine Großmann, Sebastian Lamm, Christian Schulz and Darren Strash. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), 2023. To appear. [ preprint ]
  6. Engineering Weighted Connectivity Augmentation Algorithms. Thomas Möller, Felix Joos, Ernestine Großmann, Marcelo Fonseca Faraj, Christian Schulz. In Symposium on Experimental Algorithms (SEA), Volume 301 of LIPIcs, pages 11:1--11:22, 2024. [ paper ]
  7. Optimal Neighborhood Exploration for Dynamic Independent Sets. Jannick Borowitz, Ernestine Großmann, Christian Schulz. In Algorithm Engineering and Experiments (ALENEX), to appear, 2025. [ preprint ]
  8. Engineering Fully Dynamic Exact Δ-Orientation Algorithms. Ernestine Großmann, Henrik Reinstädtler, Christian Schulz, Fabian Walliser. In Algorithm Engineering and Experiments (ALENEX), to appear, 2025. [ preprint ]
  9. Accelerating Reductions Using Graph Neural Networks for the Maximum Weight Independent Set Problem. Ernestine Großmann, Kenneth Langedal, and Christian Schulz. In SIAM Conference on Applied and Computational Discrete Algorithms (ACDA25), 2025. To appear. [ preprint ]
  10. Concurrent Iterated Local Search for the Maximum Weight Independent Set Problem. Ernestine Großmann, Kenneth Langedal, and Christian Schulz. In Symposium on Experimental Algorithms (SEA), 2025. To appear. [ preprint ]

    11. Technical Reports

  11. FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing. Ernestine Großmann, Jonas Sauer, Christian Schulz, Patrick Steil, Sascha Witt. Technical Report, Heidelberg University, University of Bonn, Karlsruhe Institute of Technology, 2023. PDF
  12. Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale. Jannick Borowitz, Ernestine Großmann, Christian Schulz, Dominik Schweisgut. Technical report, Heidelberg University, 2023. PDF
  13. Engineering Algorithms for Hypergraph b-Matching. Ernestine Großmann, Felix Joos, Henrik Reinstädtler, Christian Schulz. Technical report, 2024. PDF
  14. A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem. Ernestine Großmann, Kenneth Langedal, Christian Schulz. Technical report, 2024. PDF
  15. Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem. Ernestine Großmann, Kenneth Langedal, Christian Schulz. Technical report, 2024. PDF
  16. Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs at Scale. Jannick Borowitz, Ernestine Großmann, Christian Schulz. Technical report, Heidelberg University, 2025. PDF