Search - IFIP - Lecture Notes in Computer Science

3 results

	For these 3 documents Send to ORCID RSS ATOM Export BibTeX XML-TEI CSV RTF EndNote PDF HTML Advanced export	Page :	sorted by Relevance Author A→Z Author Z→A Title A→Z Title Z→A Increasing publication date Decreasing publication date Increasing deposit date Decreasing deposit date

		Efficient Algorithms for the max k -vertex cover Problem Federico Della Croce , Vangelis Paschos 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.295-309, ⟨10.1007/978-3-642-33475-7_21⟩ Conference papers hal-01511883v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More
		The Lazy Matroid Problem Laurent Gourvès , Jérôme Monnot , Aris T. Pagourtzis 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.66-77, ⟨10.1007/978-3-662-44602-7_6⟩ Conference papers hal-01402029v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More
		On the Complexity of the Upper r-Tolerant Edge Cover Problem Ararat Harutyunyan , Mehdi Khosravian Ghadikolaei , Nikolaos Melissinos , Jérôme Monnot , Aris Pagourtzis 3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.32-47, ⟨10.1007/978-3-030-57852-7_3⟩ Conference papers hal-03165379v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More

Filter your results