Go to the corresponding LIPIcs Volume Portal 
Zschoche, Philipp ; Fluschnik, Till ; Molter, Hendrik ; Niedermeier, Rolf
pdfformat: 

@InProceedings{zschoche_et_al:LIPIcs:2018:9627, author = {Philipp Zschoche and Till Fluschnik and Hendrik Molter and Rolf Niedermeier}, title = {{The Complexity of Finding Small Separators in Temporal Graphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {45:145:17}, 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/9627}, URN = {urn:nbn:de:0030drops96277}, doi = {10.4230/LIPIcs.MFCS.2018.45}, annote = {Keywords: (non)strict temporal paths, temporal core, singlesource shortest paths, node multiway cut, lengthbounded cuts, parameterized complexity} }
Keywords:  (non)strict temporal paths, temporal core, singlesource shortest paths, node multiway cut, lengthbounded cuts, parameterized complexity  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 