ConGen: An Application Specific DRAM Memory Controller Generator. - Matthias Jung 001; Deepak M. Mathew; Christian Weis; Norbert Wehn; Irene Heinrich; Marco V. Natale; Sven O. Krumke (MEMSYS, 2016)

Large values of the clustering coefficient. - Michael Gentner; Irene Heinrich; Simon Jäger; Dieter Rautenbach (Discret. Math., 2018)

Neighborhood and Domination Polynomials of Graphs. - Irene Heinrich; Peter Tittmann 001 (Graphs Comb., 2018)

Cycle decompositions and constructive characterizations. - Irene Heinrich; Manuel Streicher (Electron. J. Graph Theory Appl., 2019)

2.5-Connectivity: Unique Components, Critical Graphs, and Applications. - Irene Heinrich; Till Heller; Eva Schmidt; Manuel Streicher (WG, 2020)

Cycle decompositions of pathwidth-6 graphs. - Elke Fuchs; Laura Gellert; Irene Heinrich (J. Graph Theory, 2020)

Algorithms and Hardness for Non-Pool-Based Line Planning. - Irene Heinrich; Philine Schiewe; Constantin Seebach (ATMOS, 2022)

Line Planning in Public Transport: Bypassing Line Pool Generation. - Irene Heinrich; Philine Schiewe; Constantin Seebach (CoRR, 2022)

Using Light Spanning Graphs for Passenger Assignment in Public Transport. - Irene Heinrich; Olli Herrala; Philine Schiewe; Topias Terho (ATMOS, 2023)

Non-Pool-Based Line Planning on Graphs of Bounded Treewidth. - Irene Heinrich; Philine Schiewe; Constantin Seebach (ATMOS, 2023)

Exploration of Graphs with Excluded Minors. - Júlia Baligács; Yann Disser; Irene Heinrich; Pascal Schweitzer (ESA, 2023)

Twin-Width of Graphs with Tree-Structured Decompositions. - Irene Heinrich; Simon Raßmann (IPEC, 2023)

Reductions for the 3-Decomposition Conjecture. - Oliver Bachtler; Irene Heinrich (LAGOS, 2023)

Automated testing and interactive construction of unavoidable sets for graph classes of small path-width. - Oliver Bachtler; Irene Heinrich (J. Graph Theory, 2023)

Finite Vertex-Colored Ultrahomogeneous Oriented Graphs. - Irene Heinrich; Eda Kaja; Pascal Schweitzer (WG, 2024)

Classification of countable 2-colored ultrahomogeneous graphs where each color class forms a disjoint union of cliques. - Sofia Brenner; Irene Heinrich (Eur. J. Comb., 2025)

Classification of Finite Highly Regular Vertex-Colored Graphs. - Irene Heinrich; Thomas Schneider; Pascal Schweitzer (SIAM J. Discret. Math., 2025)

Interval Graphs are Reconstructible. - Irene Heinrich; Masashi Kiyomi; Yota Otachi; Pascal Schweitzer (CoRR, 2025)

On the twin-width of near-regular graphs. - Irene Heinrich; Ferdinand Ihringer; Simon Raßmann; Lena Volk (Discret. Appl. Math., 2026)