Deciding Relaxed Two-Colorability - A Hardness Jump. - Robert Berke; Tibor Szabó (ESA, 2006)

Relaxed two-coloring of cubic graphs. - Robert Berke; Tibor Szabó (J. Comb. Theory B, 2007)

Propagation Connectivity of Random Hypergraphs. - Robert Berke; Mikael Onsjö (SAGA, 2009)

Deciding Relaxed Two-Colourability: A Hardness Jump. - Robert Berke; Tibor Szabó (Comb. Probab. Comput., 2009)

Polychromatic Colorings of Plane Graphs. - Noga Alon; Robert Berke; Kevin Buchin; Maike Buchin; Péter Csorba; Saswata Shannigrahi; Bettina Speckmann; Philipp Zumstein (Discret. Comput. Geom., 2009)

Colorings at minimum cost. - Robert Berke; Dieter Mitsche (Discret. Math., 2010)

Bounded transversals in multipartite graphs. - Robert Berke; Penny E. Haxell; Tibor Szabó (J. Graph Theory, 2012)

On the Interplay of Human-AI Alignment,Fairness, and Performance Trade-offs in Medical Imaging. - Haozhe Luo; Ziyu Zhou; Shelley Zixin Shu; Aurélie Pahud de Mortanges; Robert Berke; Mauricio Reyes 001 (CoRR, 2025)