default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilipp Zumstein
Person information
- affiliation: University of Mannheim, University Library, Germany
- affiliation (PhD 2009): ETH Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c8]Renat Shigapov
, Philipp Zumstein, Jan Kamlah, Lars Oberländer, Jörg Mechnich, Irene Schumm:
bbw: Matching CSV to Wikidata via Meta-lookup. SemTab@ISWC 2020: 17-26- [c7]Marilena Daquino, Silvio Peroni, David M. Shotton, Giovanni Colavizza, Behnam Ghavimi, Anne Lauscher, Philipp Mayr, Matteo Romanello, Philipp Zumstein:
The OpenCitations Data Model. ISWC (2) 2020: 447-463 - [i3]Marilena Daquino, Silvio Peroni, David M. Shotton, Giovanni Colavizza, Behnam Ghavimi, Anne Lauscher, Philipp Mayr, Matteo Romanello, Philipp Zumstein:
The OpenCitations Data Model. CoRR abs/2005.11981 (2020)
2010 – 2019
- 2019
- [c6]David Lindemann, Christiane Klaes, Philipp Zumstein:
Metalexicography as Knowledge Graph. LDK 2019: 19:1-19:8 - 2018
- [c5]Anne Lauscher, Kai Eckert, Lukas Galke, Ansgar Scherp, Syed Tahseen Raza Rizvi, Sheraz Ahmed, Andreas Dengel, Philipp Zumstein, Annette Klein:
Linked Open Citation Database: Enabling Libraries to Contribute to an Open and Interconnected Citation Graph. JCDL 2018: 109-118 - 2012
- [j4]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and maximum against k lies. Chic. J. Theor. Comput. Sci. 2012 (2012) - 2011
- [j3]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
The t-Pebbling Number is Eventually Linear in t. Electron. J. Comb. 18(1) (2011) - 2010
- [j2]Tibor Szabó, Philipp Zumstein, Stefanie Zürcher:
On the minimum degree of minimal Ramsey graphs. J. Graph Theory 64(2): 150-164 (2010) - [c4]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and Maximum against k Lies. SWAT 2010: 139-149 - [i2]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and maximum against k lies. CoRR abs/1002.0562 (2010)
2000 – 2009
- 2009
- [b1]Philipp Zumstein:
Extremal colorings and extremal satisfiability. ETH Zurich, Switzerland, 2009, pp. i-x, 1-127 - [j1]Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein:
Polychromatic Colorings of Plane Graphs. Discret. Comput. Geom. 42(3): 421-442 (2009) - 2008
- [c3]Noga Alon, Robert Berke, Kevin Buchin, Maike Buchin, Péter Csorba, Saswata Shannigrahi, Bettina Speckmann, Philipp Zumstein:
Polychromatic colorings of plane graphs. SCG 2008: 338-345 - [c2]Dominik Scheder, Philipp Zumstein:
How Many Conflicts Does It Need to Be Unsatisfiable? SAT 2008: 246-256 - [i1]Dominik Scheder, Philipp Zumstein:
An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas. CoRR abs/0806.1148 (2008) - 2007
- [c1]Dominik Scheder, Philipp Zumstein:
Satisfiability with Exponential Families. SAT 2007: 148-158
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
