L
Lefteris M. Kirousis
Researcher at National and Kapodistrian University of Athens
Publications - 114
Citations - 2888
Lefteris M. Kirousis is an academic researcher from National and Kapodistrian University of Athens. The author has contributed to research in topics: Lemma (mathematics) & Time complexity. The author has an hindex of 24, co-authored 112 publications receiving 2826 citations. Previous affiliations of Lefteris M. Kirousis include Polytechnic University of Catalonia & University of Patras.
Papers
More filters
Journal ArticleDOI
Power consumption in packet radio networks
TL;DR: For points in three dimensions it is shown that the problem of deciding whether a complete range assignment of a given cost exists, is NP-hard and an O(n 2 ) time approximation algorithm is given which provides a completerange assignment with cost within a factor of two of the minimum.
Journal ArticleDOI
Approximating the unsatisfiability threshold of random formulas
TL;DR: Kirousis et al. as mentioned in this paper considered the problem of computing the least real number k such that if the ratio of the number of clauses over k strictly exceeds k, then f is almost certainly unsatisfiable.
Journal ArticleDOI
The complexity of recognizing polyhedral scenes
TL;DR: This paper presents a fast algorithm for the important special case of orthohedral scenes (all planes are perpendicular to one of the three axes) with a fixed number of "possible" objects.
Journal ArticleDOI
Interval graphs and seatching
Lefteris M. Kirousis,Lefteris M. Kirousis,Christos H. Papadimitriou,Christos H. Papadimitriou +3 more
TL;DR: It is proved that for any graph, the interval thickness of a graph G is the minimum clique number over any interval supergraph of G and the node-search number is the least number of searchers required to clear the ‘contaminated’ edges of agraph.
Book ChapterDOI
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
TL;DR: It is proved that for c < 3.42 a slight modification of this algorithm computes a satisfying truth assignment with probability asymptotically bounded away from zero.