| Can We Create Large k-Cores by Adding Few Edges? | 0 | 0.34 | 2018 |
| Parameterized Approximation Algorithms for Bidirected Steiner Network Problems. | 0 | 0.34 | 2018 |
| Parameterized complexity of the anchored k-core problem for directed graphs. | 7 | 0.59 | 2016 |
| Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows | 0 | 0.34 | 2015 |
| Parameterized Streaming: Maximal Matching and Vertex Cover. | 15 | 0.66 | 2015 |
| Brief Announcement: New Streaming Algorithms for Parameterized Maximal Matching & Beyond | 1 | 0.38 | 2015 |
| Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). | 6 | 0.46 | 2014 |
| Parameterized Streaming Algorithms for Vertex Cover. | 1 | 0.35 | 2014 |
| A Tight Algorithm For Strongly Connected Steiner Subgraph On Two Terminals With Demands | 3 | 0.39 | 2014 |
| Faster Exact Algorithms for Some Terminal Set Problems. | 6 | 0.45 | 2013 |
| On the SIG-Dimension of Trees Under the L ∞-Metric. | 1 | 0.48 | 2013 |
| List H-Coloring a Graph by Removing Few Vertices. | 7 | 0.55 | 2013 |
| Preventing Unraveling in Social Networks Gets Harder | 8 | 0.51 | 2013 |
| Fixed-Parameter and Approximation Algorithms: A New Look. | 15 | 0.58 | 2013 |
| Directed subset feedback vertex set is fixed-parameter tractable | 12 | 0.61 | 2012 |
| A Game-Theoretic Model Motivated by the DARPA Network Challenge | 2 | 0.38 | 2012 |
| Designing FPT Algorithms for Cut Problems Using Randomized Contractions | 13 | 0.61 | 2012 |
| Parameterized Complexity of Problems in Coalitional Resource Games. | 4 | 0.44 | 2011 |
