pdfformat: 

@InProceedings{eickmeyer_et_al:LIPIcs:2017:7428, author = {Kord Eickmeyer and Archontia C. Giannopoulou and Stephan Kreutzer and Ojoung Kwon and Michal Pilipczuk and Roman Rabinovich and Sebastian Siebertz}, title = {{Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {63:163:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770415}, ISSN = {18688969}, year = {2017}, volume = {80}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7428}, URN = {urn:nbn:de:0030drops74288}, doi = {10.4230/LIPIcs.ICALP.2017.63}, annote = {Keywords: Graph Structure Theory, Nowhere Dense Graphs, Parameterized Complexity, Kernelization, Dominating Set} }
Keywords:  Graph Structure Theory, Nowhere Dense Graphs, Parameterized Complexity, Kernelization, Dominating Set  
Seminar:  44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)  
Issue date:  2017  
Date of publication:  2017 