Power consumption in packet radio networks LM Kirousis, E Kranakis, D Krizanc, A Pelc Theoretical Computer Science 243 (1-2), 289-305, 2000 | 449 | 2000 |

Searching and pebbling LM Kirousis, CH Papadimitriou Theoretical Computer Science 47, 205-218, 1986 | 381 | 1986 |

Approximating the unsatisfiability threshold of random formulas LM Kirousis, E Kranakis, D Krizanc, YC Stamatiou Random Structures & Algorithms 12 (3), 253-269, 1998 | 238 | 1998 |

The probabilistic analysis of a greedy satisfiability algorithm AC Kaporis, LM Kirousis, EG Lalas Random Structures & Algorithms 28 (4), 444-480, 2006 | 197 | 2006 |

The complexity of recognizing polyhedral scenes LM Kirousis, CH Papadimitriou journal of Computer and System Sciences 37 (1), 14-38, 1988 | 184 | 1988 |

Interval graphs and seatching LM Kirousis, CH Papadimitriou Discrete Mathematics 55 (2), 181-184, 1985 | 181 | 1985 |

Fugitive-search games on graphs and related parameters ND Dendris, LM Kirousis, DM Thilikos Theoretical Computer Science 172 (1-2), 233-254, 1997 | 158 | 1997 |

Random constraint satisfaction: A more accurate picture D Achlioptas, LM Kirousis, E Kranakis, D Krizanc, MSO Molloy, ... International Conference on Principles and Practice of Constraint …, 1997 | 152 | 1997 |

Power consumption in packet radio networks LM Kirousis, E Kranakis, D Krizanc, A Pelc Annual Symposium on Theoretical Aspects of Computer Science, 363-374, 1997 | 130 | 1997 |

Rigorous results for random (2+ p)-SAT D Achlioptas, LM Kirousis, E Kranakis, D Krizanc Theoretical Computer Science 265 (1-2), 109-129, 2001 | 122 | 2001 |

Fast parallel constraint satisfaction LM Kirousis International Colloquium on Automata, Languages, and Programming, 418-429, 1993 | 96 | 1993 |

Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays H Jung, LM Kirousis, P Spirakis Information and Computation 105 (1), 94-104, 1993 | 92 | 1993 |

Atomic multireader register LM Kirousis, E Kranakis, PMB Vitányi International Workshop on Distributed Algorithms, 278-296, 1987 | 77 | 1987 |

Random constraint satisfaction: A more accurate picture D Achlioptas, MSO Molloy, LM Kirousis, YC Stamatiou, E Kranakis, ... Constraints 6 (4), 329-344, 2001 | 71 | 2001 |

Selecting complementary pairs of literals AC Kaporis, LM Kirousis, E Lalas Electronic Notes in Discrete Mathematics 16, 47-70, 2003 | 60 | 2003 |

On the satisfiability threshold of formulas with three literals per clause J Díaz, L Kirousis, D Mitsche, X Pérez-Giménez Theoretical Computer Science 410 (30-32), 2920-2934, 2009 | 45 | 2009 |

Reading many variables in one atomic operation: solutions with linear or sublinear complexity LM Kirousis, P Spirakis, P Tsigas IEEE Transactions on Parallel and Distributed Systems 5 (7), 688-696, 1994 | 45 | 1994 |

Acyclic edge coloring through the Lovász local lemma I Giotis, L Kirousis, KI Psaromiligkos, DM Thilikos Theoretical Computer Science 665, 40-50, 2017 | 42* | 2017 |

The complexity of minimal satisfiability problems LM Kirousis, PG Kolaitis Information and Computation 187 (1), 20-39, 2003 | 41 | 2003 |

The linkage of a graph LM Kirousis, DM Thilikos SIAM Journal on Computing 25 (3), 626-647, 1996 | 41 | 1996 |