%0 Book Section %1 noKey %A van Rooij, Johan M. M. %A Nederlof, Jesper %A van Dijk, Thomas C. %B Algorithms - ESA 2009 %D 2009 %E Fiat, Amos %E Sanders, Peter %I Springer Berlin Heidelberg %K myown %P 554-565 %R 10.1007/978-3-642-04128-0_50 %T Inclusion/Exclusion Meets Measure and Conquer %U http://dx.doi.org/10.1007/978-3-642-04128-0_50 %V 5757 %X In this paper, two central techniques from the field of exponential time algorithms are combined for the first time: inclusion/exclusion and branching with measure and conquer analysis. %@ 978-3-642-04127-3

@incollection{noKey, abstract = {In this paper, two central techniques from the field of exponential time algorithms are combined for the first time: inclusion/exclusion and branching with measure and conquer analysis.}, added-at = {2014-10-14T13:46:56.000+0200}, author = {van Rooij, Johan M. M. and Nederlof, Jesper and van Dijk, Thomas C.}, biburl = {https://www.bibsonomy.org/bibtex/2c7fd780938129c8875bcb1e8cb7d03ec/thomasd}, booktitle = {Algorithms - ESA 2009}, doi = {10.1007/978-3-642-04128-0_50}, editor = {Fiat, Amos and Sanders, Peter}, interhash = {4b01bce0d9a76606b0b4311c0aa9efd1}, intrahash = {c7fd780938129c8875bcb1e8cb7d03ec}, isbn = {978-3-642-04127-3}, keywords = {myown}, language = {English}, pages = {554-565}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2014-10-14T14:09:25.000+0200}, title = {Inclusion/Exclusion Meets Measure and Conquer}, url = {http://dx.doi.org/10.1007/978-3-642-04128-0_50}, volume = 5757, year = 2009 }