Lattice Embeddings of Planar Point Sets. - Michael Knopf; Jesse Milzman; Derek Smith; Dantong Zhu; Dara Zirlin (Discret. Comput. Geom., 2016)

Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices. - Alexandr V. Kostochka; Mina Nahvi; Douglas B. West; Dara Zirlin (Graphs Comb., 2020)

Super-pancyclic hypergraphs and bipartite graphs. - Alexandr V. Kostochka; Ruth Luo; Dara Zirlin (J. Comb. Theory B, 2020)

Conditions for a Bigraph to be Super-Cyclic. - Alexandr V. Kostochka; Mikhail Lavrov; Ruth Luo; Dara Zirlin (Electron. J. Comb., 2021)

3-regular graphs are 2-reconstructible. - Alexandr V. Kostochka; Mina Nahvi; Douglas B. West; Dara Zirlin (Eur. J. Comb., 2021)

Cut-Edges and Regular Factors in Regular Graphs of Odd Degree. - Alexandr V. Kostochka; André Raspaud; Bjarne Toft; Douglas B. West; Dara Zirlin (Graphs Comb., 2021)

Longest cycles in 3-connected hypergraphs and bipartite graphs. - Alexandr V. Kostochka; Mikhail Lavrov; Ruth Luo; Dara Zirlin (J. Graph Theory, 2022)

Saturation for the 3-uniform loose 3-cycle. - Sean English; Alexandr V. Kostochka; Dara Zirlin (Discret. Math., 2023)