Preprocessing Under Uncertainty: Matroid Intersection
to appear in Proceedings of 41st MFCSPreprocessing Under Uncertainty
in Proceedings of 33rd STACSA Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
in Proceedings of 40th MFCSAn Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem
in Proceedings of 14th SEAThe Complexity of Finding Effectors
in Proceedings of 12th TAMCStreaming Kernelization
in Proceedings of 39th MFCSSpeeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
in Proceedings of 8th IPECThe Complexity of Finding Effectors
in Theory of Computing SystemsSpeeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
in Algorithmica, Volume 71, Issue 3Preprocessing Under Uncertainty
on arXiv:1510.05503A Shortcut to (Sun)Flowers: Kernels in Logarihtmic Space or Linear Time
on arXiv:1504.08235The Compleixity of Finding Effectors
on arXiv:1411.7838Streaming Kernelization
on arXiv:1405.1356Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions
on arXiv:1305.7448* gave a talk