Algorithms for jumbled pattern matching in strings P Burcsi, F Cicalese, G Fici, Z Lipták International Journal of Foundations of Computer Science 23 (02), 357-374, 2012 | 90 | 2012 |

Supermodularity and subadditivity properties of the entropy on the majorization lattice F Cicalese, U Vaccaro IEEE Transactions on Information Theory 48 (4), 933-938, 2002 | 71 | 2002 |

Fault-Tolerant Search Algorithms F Cicalese Springer, 2013 | 70 | 2013 |

Latency-bounded target set selection in social networks F Cicalese, G Cordasco, L Gargano, M Milanič, U Vaccaro Theoretical Computer Science 535, 1-15, 2014 | 68 | 2014 |

Searching for jumbled patterns in strings F Cicalese, G Fici, Z Lipták Proceedings of the Prague Stringology Conference 2009, 105-117, 2009 | 61 | 2009 |

On approximate jumbled pattern matching in strings P Burcsi, F Cicalese, G Fici, Z Lipták Theory of Computing Systems 50, 35-51, 2012 | 55 | 2012 |

On table arrangements, scrabble freaks, and jumbled pattern matching P Burcsi, F Cicalese, G Fici, Z Lipták Fun with Algorithms: 5th International Conference, FUN 2010, Ischia, Italy …, 2010 | 46 | 2010 |

Optimal coding with one asymmetric error: below the sphere packing bound F Cicalese, D Mundici Computing and Combinatorics: 6th Annual International Conference, COCOON …, 2000 | 46 | 2000 |

Faster centralized communication in radio networks F Cicalese, F Manne, Q Xin International Symposium on Algorithms and Computation, 339-348, 2006 | 42 | 2006 |

Spread of influence in weighted networks under time and budget constraints F Cicalese, G Cordasco, L Gargano, M Milanič, J Peters, U Vaccaro Theoretical Computer Science 586, 40-58, 2015 | 39 | 2015 |

On the complexity of searching in trees and partially ordered structures F Cicalese, T Jacobs, E Laber, M Molinaro Theoretical Computer Science 412 (50), 6879-6896, 2011 | 39 | 2011 |

Least adaptive optimal search with unreliable tests F Cicalese, D Mundici, U Vaccaro Theoretical Computer Science 270 (1-2), 877-893, 2002 | 39 | 2002 |

Optimal strategies against a liar F Cicalese, U Vaccaro Theoretical Computer Science 230 (1-2), 167-193, 2000 | 38 | 2000 |

Graphs of separability at most 2 F Cicalese, M Milanič Discrete Applied Mathematics 160 (6), 685-696, 2012 | 35 | 2012 |

Rota-Metropolis cubic logic and Ulam-Rényi games F Cicalese, D Mundici, U Vaccaro Algebraic combinatorics and computer science: a tribute to Gian-Carlo Rota …, 2001 | 33 | 2001 |

Perfect two-fault tolerant search with minimum adaptiveness F Cicalese, D Mundici Advances in Applied Mathematics 25 (1), 65-101, 2000 | 32 | 2000 |

The binary identification problem for weighted trees F Cicalese, T Jacobs, E Laber, C Valentim Theoretical Computer Science 459, 100-112, 2012 | 31 | 2012 |

Optimal binary search with two unreliable tests and minimum adaptiveness F Cicalese, D Mundici Algorithms-ESA’99: 7th Annual European Symposium Prague, Czech Republic …, 1999 | 31 | 1999 |

Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost F Cicalese, E Laber, AM Saettler International conference on machine learning, 414-422, 2014 | 30 | 2014 |

On the approximability and exact algorithms for vector domination and related problems in graphs F Cicalese, M Milanič, U Vaccaro Discrete Applied Mathematics 161 (6), 750-767, 2013 | 28 | 2013 |