Philipp Zumstein

According to our database, Philipp Zumstein authored at least 13 papers between 2007 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

bbw: Matching CSV to Wikidata via Meta-lookup.

Renat Shigapov, Philipp Zumstein, Jan Kamlah, Lars Oberländer, Jörg Mechnich, Irene Schumm

Proceedings of the Semantic Web Challenge on Tabular Data to Knowledge Graph Matching (SemTab 2020) co-located with the 19th International Semantic Web Conference (ISWC 2020), 2020

The OpenCitations Data Model.

Marilena Daquino, Silvio Peroni, David M. Shotton, Giovanni Colavizza, Behnam Ghavimi, Anne Lauscher, Philipp Mayr, Matteo Romanello, Philipp Zumstein

Proceedings of the Semantic Web - ISWC 2020, 2020

2019

Metalexicography as Knowledge Graph.

David Lindemann, Christiane Klaes, Philipp Zumstein

Proceedings of the 2nd Conference on Language, Data and Knowledge, 2019

2018

Linked Open Citation Database: Enabling Libraries to Contribute to an Open and Interconnected Citation Graph.

Anne Lauscher, Kai Eckert, Lukas Galke, Ansgar Scherp, Syed Tahseen Raza Rizvi, Sheraz Ahmed, Andreas Dengel, Philipp Zumstein, Annette Klein

Proceedings of the 18th ACM/IEEE on Joint Conference on Digital Libraries, 2018

2012

Minimum and maximum against k lies.

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein

Chic. J. Theor. Comput. Sci., 2012

2011

The <i>t</i>-Pebbling Number is Eventually Linear in <i>t</i>.

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein

Electron. J. Comb., 2011

2010

On the minimum degree of minimal Ramsey graphs.

Tibor Szabó, Philipp Zumstein, Stefanie Zürcher

J. Graph Theory, 2010

Minimum and Maximum against <i>k</i> Lies.

Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein

Proceedings of the Algorithm Theory, 2010

2009

Extremal colorings and extremal satisfiability.

Philipp Zumstein

PhD thesis, 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

2008

An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas

Dominik Scheder, Philipp Zumstein

CoRR, 2008

How Many Conflicts Does It Need to Be Unsatisfiable?

Dominik Scheder, Philipp Zumstein

Proceedings of the Theory and Applications of Satisfiability Testing, 2008

2007

Satisfiability with Exponential Families.

Dominik Scheder, Philipp Zumstein

Proceedings of the Theory and Applications of Satisfiability Testing, 2007