pdfformat: 

@InProceedings{berenger_et_al:LIPIcs:2018:9621, author = {Cedric Berenger and Peter Niebert and Kevin Perrot}, title = {{Balanced Connected Partitioning of Unweighted Grid Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {39:139:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9621}, URN = {urn:nbn:de:0030drops96213}, doi = {10.4230/LIPIcs.MFCS.2018.39}, annote = {Keywords: grid graphs, connected partitioning, NPcompleteness, graph algorithm} }
Keywords:  grid graphs, connected partitioning, NPcompleteness, graph algorithm  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue date:  2018  
Date of publication:  27.08.2018 