Philipp Zumstein

16 papers A 2C 1Journal 7Unranked 5
YearRankTypeTitle / Venue / Authors
2020 — conf
The OpenCitations Data Model.
ISWC (2)
Marilena Daquino, Silvio Peroni, David M. Shotton, Giovanni Colavizza, Behnam Ghavimi, Anne Lauscher, Philipp Mayr, Matteo Romanello, Philipp Zumstein
2020 J jnl
The OpenCitations Data Model.
CoRR
Marilena Daquino, Silvio Peroni, David M. Shotton, Giovanni Colavizza, Behnam Ghavimi, Anne Lauscher, Philipp Mayr, Matteo Romanello, Philipp Zumstein
2020 — conf
bbw: Matching CSV to Wikidata via Meta-lookup.
SemTab@ISWC
Renat Shigapov, Philipp Zumstein, Jan Kamlah, Lars Oberländer, Jörg Mechnich, Irene Schumm
2019 C conf
Metalexicography as Knowledge Graph.
LDK
David Lindemann, Christiane Klaes, Philipp Zumstein
2018 — conf
Linked Open Citation Database: Enabling Libraries to Contribute to an Open and Interconnected Citation Graph.
JCDL
Anne Lauscher, Kai Eckert, Lukas Galke, Ansgar Scherp, Syed Tahseen Raza Rizvi, Sheraz Ahmed, Andreas Dengel, Philipp Zumstein, Annette Klein
2012 J jnl
Minimum and maximum against k lies.
Chic. J. Theor. Comput. Sci.
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2011 J jnl
The
Electron. J. Comb.
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010 — conf
Minimum and Maximum against
SWAT
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010 J jnl
Minimum and maximum against k lies
CoRR
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010 J jnl
On the minimum degree of minimal Ramsey graphs.
J. Graph Theory
Tibor Szabó, Philipp Zumstein, Stefanie Zürcher
2009 — —
Extremal colorings and extremal satisfiability.
Philipp Zumstein
2009 J jnl
Polychromatic Colorings of Plane Graphs.
Discret. Comput. Geom.
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein
2008 J jnl
An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas
CoRR
Dominik Scheder, Philipp Zumstein
2008 A conf
How Many Conflicts Does It Need to Be Unsatisfiable?
SAT
Dominik Scheder, Philipp Zumstein
2008 — conf
Polychromatic colorings of plane graphs.
SCG
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein
2007 A conf
Satisfiability with Exponential Families.
SAT
Dominik Scheder, Philipp Zumstein