publication venue for
- Algorithms and estimators for summarization of unaggregated data streams. 80:1214-1244. 2014
- Planar graph vertex partition for linear problem kernels. 79:609-621. 2013
- Multicut in trees viewed through the eyes of vertex cover. 78:1637-1650. 2012
- Improved algorithms for feedback vertex set problems. 74:1188-1198. 2008
- Genus characterizes the complexity of certain graph problems: Some tight results. 73:892-907. 2007
- Strong computational lower bounds via parameterized complexity. 72:1346-1367. 2006
- Foreword from the guest editors. 67:653-653. 2003
- Tight bound on Johnson's algorithm for maximum satisfiability. 58:622-640. 1999
- On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. 54:465-474. 1997
- A 2k kernel for the cluster editing problem 2012
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms 2003
- Computational arithmetic geometry I. Sentences nearly in the polynomial hierarchy 2001