publication venue for
- An improved FPT algorithm for Almost Forest Deletion problem. 136:30-36. 2018
- An O(1.84k) parameterized algorithm for the multiterminal cut problem. 114:167-173. 2014
- An improved kernelization for P2-packing. 110:188-192. 2010
- An improved lower bound on approximation algorithms for the Closest Substring problem. 107:24-28. 2008
- Fair service for mice in the presence of elephants. 99:96-101. 2006
- The cost of becoming anonymous: on the participant payload in Crowds. 90:81-86. 2004
- A note on practical construction of maximum bandwidth paths. 83:175-180. 2002
- Closed form bounds for clock synchronization under simple uncertainty assumptions. 80:151-157. 2001
- Time bounds on synchronization in a periodic distributed system. 64:87-93. 1997
- A note on approximating graph genus. 61:317-322. 1997
- On-line longest fragment first parsing algorithm. 59:91-96. 1996
- Improved processor bounds for parallel algorithms for weighted directed graphs. 45:147-152. 1993
- Determining uni-connectivity in directed graphs. 48:9-12. 1993
- Modelling a fast parallel thinning algorithm for shared memory SIMD computers. 40:257-261. 1991
- CHARACTERIZING PARALLEL HIERARCHIES BY REDUCIBILITIES. 39:303-307. 1991
- AN NL HIERARCHY. 39:21-26. 1991