Philipp Matthias Schäfer

Orcid: 0000-0003-3931-6670

According to our database1, Philipp Matthias Schäfer authored at least 15 papers between 2011 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Flexible Robotic Assembly Based on Ontological Representation of Tasks, Skills, and Resources.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

2019
OnToCode: Template-based code-generation from ontologies.
J. Open Source Softw., 2019

Towards Learning from User Feedback for Ontology-based Information Extraction.
Proceedings of the 1st International Workshop on Challenges and Experiences from Data Integration to Knowledge Graphs co-located with the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (KDD 2019), 2019

Digital Availability of Product Information for Collaborative Engineering of Spacecraft.
Proceedings of the Cooperative Design, Visualization, and Engineering, 2019

2014
Irreversible conversion processes with deadlines.
J. Discrete Algorithms, 2014

2013
On the Carathéodory number of interval and graph convexities.
Theor. Comput. Sci., 2013

Open packing, total domination, and the <i>P</i><sub>3</sub>-Radon number.
Discret. Math., 2013

Algorithmic and structural aspects of the P 3-Radon number.
Ann. Oper. Res., 2013

2012
An upper bound on the P<sub>3</sub>-Radon number.
Discret. Math., 2012

On the Radon Number for P 3-Convexity.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Strict Betweennesses Induced by Posets as well as by Graphs.
Order, 2011

On finite convexity spaces induced by sets of paths in graphs.
Discret. Math., 2011

Finite Sholander trees, trees, and their betweenness.
Discret. Math., 2011

Characterization and representation problems for intersection betweennesses.
Discret. Appl. Math., 2011

On subbetweennesses of trees: Hardness, algorithms, and characterizations.
Comput. Math. Appl., 2011


  Loading...