pdfformat: 

@InProceedings{kawarabayashi_et_al:LIPIcs:2012:3417, author = {Kenichi Kawarabayashi and Yusuke Kobayashi}, title = {{Edgedisjoint Odd Cycles in 4edgeconnected Graphs}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {206217}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897354}, ISSN = {18688969}, year = {2012}, volume = {14}, editor = {Christoph D{\"u}rr and Thomas Wilke}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3417}, URN = {urn:nbn:de:0030drops34173}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.206}, annote = {Keywords: oddcycles, disjoint paths problem, Erd{\"o}sPosa property, packing algorithm, 4edgeconnectivity } }
Keywords:  oddcycles, disjoint paths problem, ErdösPosa property, packing algorithm, 4edgeconnectivity  
Seminar:  29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)  
Issue date:  2012  
Date of publication:  24.02.2012 