
Dr. Irene Heinrich
Graphen und Gruppen
Arbeitsgebiet(e)
Kontakt
heinrich@mathematik.tu-...
work +49 6151 16-22527
Work
S2|15 219
Schlossgartenstraße 7
64289
Darmstadt
Forschungsinteressen
- Strukturelle Graphentheorie (z.B. Graphenzerlegungen, Graphenklassen, unter Minorenbildung abgeschlossene Klassen)
- Hoch reguläre kombinatorische Objekte (z.B. Symmetriegruppen, Homogenität)
- Grapheninvarianten (z.B. Baumweite, twin-width, Dominationszahl, minimale Kreiszerlegungszahl)
- offene Vermutungen der Graphentheorie (Rekonstruktionsvermutung, Vermutung von Hajós, 3-Zerlegungsvermutung)
- Anwendungen (z.B. Optimierung für den öffentlichen Nahverkehr, Chipdesign)
Publikationen (peer-reviewed)
[21] with S. Brenner (long version of [9]) . European Journal of Combinatorics. 2025 Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques
[20] with S. Raßmann (long version of [12]). Discrete Applied Mathematics. 2025 Twin-width of graphs with tree-structured decompositions
[19] Classification of finite highly regular vertex-coloured graphs (to appear) with T. Schneider and P. Schweitzer. SIAM Journal on Discrete Mathematics.
[18] Non-pool-based line planning: a practical analysis of the FPT algorithm tw-lines (to appear) with O. Bachtler, P. Schiewe, and C. Seebach. Transportation Research Procedia.
[17] Finite vertex-colored ultrahomogeneous oriented graphs (to appear) with E. Kaja and P. Schweitzer. In Proceedings of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2024, Gozd Martuljek, Slovenia, June 19-21, 2024.
[16] (wird in neuem Tab geöffnet) with L. Volk. In Proceedings of the Discrete Math Days 2024, DMD 2024, Alcalá de Henares, Spain, July 3-5, 2024. The flexibility among 3-decompositions
[15] (wird in neuem Tab geöffnet) with E. Kaja and P. Schweitzer. In Proceedings of the Discrete Math Days 2024, DMD 2024, Alcalá de Henares, Spain, July 3-5, 2024. Computing edge-colored ultrahomogeneous graphs
[14] with O. Bachtler. Journal of Graph Theory 104(2):289-319, 2023. Automated testing and interactive construction of unavoidable sets for graph classes of small path-width
[13] with J. Baligács, Y. Disser, and P. Schweitzer. Proceedings of the 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, 2023. Exploration of graphs with excluded minors
[12] with S. Raßmann. In Proceedings of the 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands, 2023. Twin-width of graphs with tree-structured decompositions
[11] (wird in neuem Tab geöffnet) with O.Herrala, P. Schiewe, and T. Terho. In Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023, September 7-8, 2023, Amsterdam, The Netherlands, 2023. Using light spanning graphs for passenger assignment in public transport
[10] (wird in neuem Tab geöffnet) with P. Schiewe and C. Seebach. In Proceedings of the 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023, September 7-8, 2023, Amsterdam, The Netherlands, 2023. Non-pool-based line planning on graphs of bounded treewidth
[9] with S. Brenner. In Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB 2023, August 28-September 1, 2023, Prague, Czech Republic, 2023. Countable ultrahomogeneous 2-colored graphs consisting of disjoint unions of cliques
[8] with O. Bachtler. Procedia Computer Science 223: 96–103, 2023. Reductions for the 3-decomposition conjecture
[7] (wird in neuem Tab geöffnet) with P. Schiewe and C. Seebach. In Proceedings of the 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2022, Potsdam, Germany, September 8-9, 2022. Algorithms and hardness for non-pool based line planning
[6] with T. Heller, E. Schmidt, and M. Streicher. In Proceedings of the 46th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2020, Leeds, UK, June 24-26, 2020. 2.5-connectivity: unique components, critical graphs, and applications
[5] with E. Fuchs and L. Gellert. Journal of Graph Theory 94(2): 224-251, 2019. Cycle decompositions of pathwidth-6 graphs
[4] with M. Streicher. Electronic Journal of Graph Theory and Applications 7(2): 411-428, 2019. Cycle decompositions and constructive characterizations
[3] with P. Tittmann. Graphs and Combinatorics 34(6): 1203-1216, 2018. Neighborhood and domination polynomials of graphs
[2] with M. Gentner, S. Jäger, and D. Rautenbach. Discrete Mathematics 341(1): 119-125, 2018. Large values of the clustering coefficient
[1] with M. Jung, M.V. Natale, D.M. Mathew, C. Weis, S.O. Krumke, and N. Wehn. In Proceedings of the Second International Symposium on Memory Systems, MEMSYS 2016, Alexandria, VA, USA, October 3-6, 2016. ConGen: an application specific DRAM memory controller generator