Existence of Connected Intersection-Free Subgraphs in Graphs with Redundancy and Coexistence Property. - Lucas Böltz; Hannes Frey (ALGOSENSORS, 2019)

Local Construction of Connected and Plane Spanning Subgraphs under Acyclic Redundancy. - Steffen Böhmer; Lucas Böltz; Hannes Frey (WiOpt, 2020)

Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion and Transfer Axioms. - Hannes Frey; Lucas Böltz (CCCG, 2021)

On Testing Containedness Between Geometric Graph Classes using Second-order Quantifier Elimination and Hierarchical Reasoning (Short Paper). - Lucas Böltz; Hannes Frey; Dennis Peuter; Viorica Sofronie-Stokkermans (SOQE@KR, 2021)

Local Construction of Connected Plane Subgraphs in Graphs Satisfying Redundancy and Coexistence. - Lucas Böltz; Benjamin Becker; Hannes Frey (LAGOS, 2021)

WIP: Local Heuristics for Very Likely Connected and Intersection Free Wireless Network Topologies under Log-Normal Shadowing. - Steffen Böhmer; Lucas Böltz; Hannes Frey (WoWMoM, 2022)

Automatically Testing Containedness between Geometric Graph Classes defined by Inclusion, Exclusion, and Transfer Axioms under Simple Transformations. - Lucas Böltz; Hannes Frey (Inf., 2022)

On the Verification of the Correctness of a Subgraph Construction Algorithm. - Lucas Böltz; Viorica Sofronie-Stokkermans; Hannes Frey (VMCAI (1), 2024)