Advanced Search
Now showing items 11-14 of 14
A formal framework for comparing linked data fragments
(Springer, 2017)
Fast and compact planar embeddings
(Springer, 2017)
Approximately coloring graphs without long induced paths
(Springer, 2017)