%0 Conference Paper %1 conf/dagstuhl/Fellows00 %A Fellows, Michael R. %B Experimental Algorithmics %D 2000 %E Fleischer, Rudolf %E Moret, Bernard M. E. %E Schmidt, Erik Meineche %I Springer %K dblp %P 51-77 %T Parameterized Complexity: The Main Ideas and Connections to Practical Computing. %U http://dblp.uni-trier.de/db/conf/dagstuhl/ea2000.html#Fellows00 %V 2547 %@ 3-540-00346-0

@inproceedings{conf/dagstuhl/Fellows00, added-at = {2017-05-19T00:00:00.000+0200}, author = {Fellows, Michael R.}, biburl = {https://www.bibsonomy.org/bibtex/250df56542b773eec7837c0cbf90f5c41/dblp}, booktitle = {Experimental Algorithmics}, crossref = {conf/dagstuhl/2000ea}, editor = {Fleischer, Rudolf and Moret, Bernard M. E. and Schmidt, Erik Meineche}, ee = {https://doi.org/10.1007/3-540-36383-1_3}, interhash = {266046a49b8a74d6ff8d7be936d843fd}, intrahash = {50df56542b773eec7837c0cbf90f5c41}, isbn = {3-540-00346-0}, keywords = {dblp}, pages = {51-77}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T14:34:20.000+0200}, title = {Parameterized Complexity: The Main Ideas and Connections to Practical Computing.}, url = {http://dblp.uni-trier.de/db/conf/dagstuhl/ea2000.html#Fellows00}, volume = 2547, year = 2000 }