English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Finding Even Subgraphs Even Faster

MPS-Authors
There are no MPG-Authors in the publication available
External Resource

http://drops.dagstuhl.de/opus/volltexte/2015/5633/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Goyal, P., Misra, P., Panolan, F., Philip, G., & Saurabh, S. (2015). Finding Even Subgraphs Even Faster. In P. Harsha, & G. Ramalingam (Eds.), 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 434-447). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.FSTTCS.2015.434.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002A-08AC-E
Abstract
There is no abstract available