pdfformat: 

@InProceedings{giannopoulou_et_al:LIPIcs:2015:5575, author = {Archontia C. Giannopoulou and George B. Mertzios and Rolf Niedermeier}, title = {{Polynomial Fixedparameter Algorithms: A Case Study for Longest Path on Interval Graphs}}, booktitle = {10th International Symposium on Parameterized and Exact Computation (IPEC 2015)}, pages = {102113}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897927}, ISSN = {18688969}, year = {2015}, volume = {43}, editor = {Thore Husfeldt and Iyad Kanj}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5575}, URN = {urn:nbn:de:0030drops55750}, doi = {10.4230/LIPIcs.IPEC.2015.102}, annote = {Keywords: fixedparameter algorithm, preprocessing, data reduction, polynomialtime algorithm, longest path problem, interval graphs, proper interval vertex del} }
Keywords:  fixedparameter algorithm, preprocessing, data reduction, polynomialtime algorithm, longest path problem, interval graphs, proper interval vertex del  
Seminar:  10th International Symposium on Parameterized and Exact Computation (IPEC 2015)  
Issue date:  2015  
Date of publication:  19.11.2015 