| |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 2 |       | Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra: Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. FOCS 2008: 573-582 |
Selection of 1 from 2 records - Rajsekar Manokaran has 4 coauthors
Copyright © 2009-12-24 by Michael Ley (ley@uni-trier.de)