Satisfiability with Exponential Families. - Dominik Scheder; Philipp Zumstein (SAT, 2007)

How Many Conflicts Does It Need to Be Unsatisfiable? - Dominik Scheder; Philipp Zumstein (SAT, 2008)

An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas - Dominik Scheder; Philipp Zumstein (CoRR, 2008)

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)

Extremal colorings and extremal satisfiability. - Philipp Zumstein (2009)

Minimum and Maximum against k Lies. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (SWAT, 2010)

On the minimum degree of minimal Ramsey graphs. - Tibor Szabó; Philipp Zumstein; Stefanie Zürcher (J. Graph Theory, 2010)

The t-Pebbling Number is Eventually Linear in t. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (Electron. J. Comb., 2011)

Minimum and maximum against k lies. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (Chic. J. Theor. Comput. Sci., 2012)

Linked Open Citation Database: Enabling Libraries to Contribute to an Open and Interconnected Citation Graph. - Anne Lauscher; Kai Eckert 001; Lukas Galke; Ansgar Scherp; Syed Tahseen Raza Rizvi; Sheraz Ahmed; Andreas Dengel 001; Philipp Zumstein; Annette Klein (JCDL, 2018)

Metalexicography as Knowledge Graph. - David Lindemann; Christiane Klaes; Philipp Zumstein (LDK, 2019)

The OpenCitations Data Model. - Marilena Daquino; Silvio Peroni; David M. Shotton; Giovanni Colavizza; Behnam Ghavimi; Anne Lauscher; Philipp Mayr 001; Matteo Romanello; Philipp Zumstein (ISWC (2), 2020)

bbw: Matching CSV to Wikidata via Meta-lookup. - Renat Shigapov; Philipp Zumstein; Jan Kamlah; Lars Oberländer; Jörg Mechnich; Irene Schumm (SemTab@ISWC, 2020)