Ernestine Großmann

Orcid: 0000-0002-9678-0253

Affiliations:
  • Heidelberg University, Germany


According to our database1, Ernestine Großmann authored at least 26 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs.
CoRR, February, 2026

FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing.
Transp. Sci., 2026

Finding Maximum Weight 2-Packing Sets on Arbitrary Graphs.
Networks, 2026

Engineering Hypergraph $b$-Matching Algorithms.
J. Graph Algorithms Appl., 2026

Distributed Reductions for the Maximum Weight Independent Set Problem.
Proceedings of the 28th Symposium on Algorithm Engineering and Experiments, 2026

2025
Distributed Reductions for the Maximum Weight Independent Set Problem.
CoRR, October, 2025

Implementation of our dynamic algorithm for minimum orientation.
Dataset, October, 2025

Dense Dataset from the paper "From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation".
Dataset, July, 2025

LearnAndReduce MWIS Trainingdata.
Dataset, April, 2025

KennethLangedal/CHILS: v1.0 - SEA2025.
Dataset, April, 2025

KarlsruheMIS/LearnAndReduce: v1.0 - ACDA2025.
Dataset, April, 2025

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs.
J. Graph Algorithms Appl., 2025

Concurrent Iterated Local Search for the Maximum Weight Independent Set Problem.
Proceedings of the 23rd International Symposium on Experimental Algorithms, 2025

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation.
Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

Engineering Fully Dynamic Exact ∆-Orientation Algorithms.
Proceedings of the 27th Symposium on Algorithm Engineering and Experiments, 2025

Optimal Neighborhood Exploration for Dynamic Independent Sets.
Proceedings of the 27th Symposium on Algorithm Engineering and Experiments, 2025

Accelerating Reductions Using Graph Neural Networks for the Maximum Weight Independent Set Problem.
Proceedings of the 3rd Conference on Applied and Computational Discrete Algorithms, 2025

2024
Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem.
CoRR, 2024

A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem.
CoRR, 2024

Engineering Fully Dynamic Exact Δ-Orientation Algorithms.
CoRR, 2024

Engineering Weighted Connectivity Augmentation Algorithms.
Proceedings of the 22nd International Symposium on Experimental Algorithms, 2024

2023
Finding Optimal 2-Packing Sets on Arbitrary Graphs at Scale.
CoRR, 2023

Arc-Flags Meet Trip-Based Public Transit Routing.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Finding Near-Optimal Weight Independent Sets at Scale.
Proceedings of the Genetic and Evolutionary Computation Conference, 2023

Engineering Fully Dynamic Δ-Orientation Algorithms.
Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms, 2023

2022
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022


  Loading...