Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30

First Page		Document Content
Complexity classes Matroid theory NP-complete problems Dimension Matroid Cubic graph Induced path NP-hard Time complexity Theoretical computer science Graph theory Mathematics		Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30 Add to Reading List Source URL: www3.math.tu-berlin.de Download Document from Source Website File Size: 29,24 KB Share Document on Facebook

	Finding an induced path of given parity in planar graphs in polynomial time Marcin Kami´nski ∗ Naomi Nishimura† DocID: 1s12G - View Document
	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada DocID: 1rsEH - View Document
	Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar DocID: 1g2wf - View Document
	Randomized Algorithms 2015A Lecture 5 – Edge Sparsification for Cuts∗ Robert Krauthgamer 1 DocID: 1aFtk - View Document
	OntoNav: A Semantic Indoor Navigation System DocID: 1aA1B - View Document