Go to the corresponding Portal 
Fomin, Fedor V. ; Golovach, Petr A.
pdfformat: 

@InProceedings{fomin_et_al:LIPIcs:2012:3398, author = {Fedor V. Fomin and Petr A. Golovach}, title = {{Parameterized Complexity of Connected Even/Odd Subgraph Problems}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {432440}, 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/3398}, URN = {urn:nbn:de:0030drops33986}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.432}, annote = {Keywords: Parameterized complexity, Euler graph, even graph, odd graph, treewidth} }
Keywords:  Parameterized complexity, Euler graph, even graph, odd graph, treewidth  
Seminar:  29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)  
Issue Date:  2012  
Date of publication:  24.02.2012 