A Selection Theorem. - Lefteris M. Kirousis (J. Symb. Log., 1983)

The Complexity of Recognizing Polyhedral Scenes (Extended Abstract) - Lefteris M. Kirousis; Christos H. Papadimitriou (FOCS, 1985)

Interval graphs and seatching. - Lefteris M. Kirousis; Christos H. Papadimitriou (Discret. Math., 1985)

A Polynomial Algorithm for Recognizing Images of Polyhedra. - Lefteris M. Kirousis (Aegean Workshop on Computing, 1986)

Searching and Pebbling. - Lefteris M. Kirousis; Christos H. Papadimitriou (Theor. Comput. Sci., 1986)

Atomic Multireader Register. - Lefteris M. Kirousis; Evangelos Kranakis; Paul M. B. Vitányi (WDAG, 1987)

A Proof Technique for Register Automicity. - Baruch Awerbuch; Lefteris M. Kirousis; Evangelos Kranakis; Paul M. B. Vitányi (FSTTCS, 1988)

Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. - Lefteris M. Kirousis; Paul G. Spirakis (SWAT, 1988)

The Complexity of Recognizing Polyhedral Scenes. - Lefteris M. Kirousis; Christos H. Papadimitriou (J. Comput. Syst. Sci., 1988)

The Parallel Complexity of the Subgraph Connectivity Problem - Lefteris M. Kirousis; Maria J. Serna; Paul G. Spirakis (FOCS, 1989)

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. - Hermann Jung 001; Lefteris M. Kirousis; Paul G. Spirakis (SPAA, 1989)

Effectively Labeling Planar Projections of Polyhedra. - Lefteris M. Kirousis (IEEE Trans. Pattern Anal. Mach. Intell., 1990)

The Complexity of the Reliable Connectivity Problem. - Dimitris Kavadias; Lefteris M. Kirousis; Paul G. Spirakis (Inf. Process. Lett., 1991)

Fast Parallel Constraint Satisfaction . - Lefteris M. Kirousis (Artif. Intell., 1993)

Parallel Complexity of the Connected Subgraph Problem. - Lefteris M. Kirousis; Maria J. Serna; Paul G. Spirakis (SIAM J. Comput., 1993)

Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays - Hermann Jung 001; Lefteris M. Kirousis; Paul G. Spirakis (Inf. Comput., 1993)

An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects. - Nick D. Dendris; Iannis A. Kalafatis; Lefteris M. Kirousis (J. Math. Imaging Vis., 1994)

Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. - Lefteris M. Kirousis; Paul G. Spirakis; Philippas Tsigas (IEEE Trans. Parallel Distributed Syst., 1994)

Partial Arc Consistency. - Nick Lendris; Lefteris M. Kirousis; Yannis C. Stamatiou; Dimitrios M. Thilikos (Over-Constrained Systems, 1995)

Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. - Nick D. Dendris; Lefteris M. Kirousis; Yannis C. Stamatiou; Dimitrios M. Thilikos (FSTTCS, 1995)

Linear-time Parallel Arc Consistency with Reduced Communication Requirements. - Nick D. Dendris; Lefteris M. Kirousis (SIROCCO, 1995)

Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. - Lefteris M. Kirousis; Andreas G. Veneris (Acta Informatica, 1995)

A better upper bound for the unsatisfiability threshold. - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc (Satisfiability Problem: Theory and Applications, 1996)

Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract). - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc (ESA, 1996)

Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. - Lefteris M. Kirousis; Paul G. Spirakis; Philippas Tsigas (Inf. Process. Lett., 1996)

The Linkage of a Graph. - Lefteris M. Kirousis; Dimitrios M. Thilikos (SIAM J. Comput., 1996)

Power Consumption in Packet Radio Networks (Extended Abstract). - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (STACS, 1997)

Fugitive-Search Games on Graphs and Related Parameters. - Nick D. Dendris; Lefteris M. Kirousis; Dimitrios M. Thilikos (Theor. Comput. Sci., 1997)

Approximating the unsatisfiability threshold of random formulas. - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Yannis C. Stamatiou (Random Struct. Algorithms, 1998)

Locating Information with Uncertainty in Fully Interconnected Networks. - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Yannis C. Stamatiou (DISC, 2000)

A Note on the Non-Colorability Threshold of a Random Graph. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou (Electron. J. Comb., 2000)

On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints. - Nick D. Dendris; Lefteris M. Kirousis; Yannis C. Stamatiou; Dimitrios M. Thilikos (Constraints An Int. J., 2000)

The Complexity of Minimal Satisfiability Problems - Lefteris M. Kirousis; Phokion G. Kolaitis (Electron. Colloquium Comput. Complex., 2000)

Power consumption in packet radio networks. - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Andrzej Pelc (Theor. Comput. Sci., 2000)

Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou; Malvina Vamvakari; Michele Zito 001 (ICTCS, 2001)

On the Complexity of Model Checking and Inference in Minimal Models. - Lefteris M. Kirousis; Phokion G. Kolaitis (LPNMR, 2001)

Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval. - Alexis C. Kaporis; Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Yannis C. Stamatiou; Elias C. Stavropoulos (Comput. J., 2001)

Random Constraint Satisfaction: A More Accurate Picture. - Dimitris Achlioptas; Michael S. O. Molloy; Lefteris M. Kirousis; Yannis C. Stamatiou; Evangelos Kranakis; Danny Krizanc (Constraints An Int. J., 2001)

Rigorous results for random (2+p)-SAT. - Dimitris Achlioptas; Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc (Theor. Comput. Sci., 2001)

Station Layouts in the Presence of Location Constraints. - Prosenjit Bose; Evangelos Kranakis; Christos Kaklamanis; Lefteris M. Kirousis; Danny Krizanc; David Peleg (J. Interconnect. Networks, 2002)

Selecting Complementary Pairs of Literals. - Alexis C. Kaporis; Lefteris M. Kirousis; Efthimios G. Lalas (Electron. Notes Discret. Math., 2003)

Preface: Volume 16. - Evangelos Kranakis; Lefteris M. Kirousis (Electron. Notes Discret. Math., 2003)

Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. - Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Yannis C. Stamatiou (Networks, 2003)

A Dichotomy in the Complexity of Propositional Circumscription. - Lefteris M. Kirousis; Phokion G. Kolaitis (Theory Comput. Syst., 2004)

5-Regular Graphs are 3-Colorable with Positive Probability. - Josep Díaz; G. Grammatikopoulos; Alexis C. Kaporis; Lefteris M. Kirousis; Xavier Pérez-Giménez; Dionisios G. Sotiropoulos (ESA, 2005)

Experimental Results for Stackelberg Scheduling Strategies. - Alexis C. Kaporis; Lefteris M. Kirousis; Efpraxia I. Politopoulou; Paul G. Spirakis (WEA, 2005)

Special Issue on Typical Case Complexity and Phase Transitions. - Lefteris M. Kirousis; Evangelos Kranakis (Discret. Appl. Math., 2005)

Proving Conditional Randomness using The Principle of Deferred Decisions. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou (Computational Complexity and Statistical Physics, 2006)

The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements. - Lefteris M. Kirousis; Yannis C. Stamatiou; Michele Zito 001 (Computational Complexity and Statistical Physics, 2006)

Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. - Alexis C. Kaporis; Lefteris M. Kirousis; Elias C. Stavropoulos (ESA, 2006)

The probabilistic analysis of a greedy satisfiability algorithm. - Alexis C. Kaporis; Lefteris M. Kirousis; Efthimios G. Lalas (Random Struct. Algorithms, 2006)

The unsatisfiability threshold revisited. - Alexis C. Kaporis; Lefteris M. Kirousis; Yannis C. Stamatiou; Malvina Vamvakari; Michele Zito 001 (Discret. Appl. Math., 2007)

Probabilistic Protocols for Fair Communication in Wireless Sensor Networks. - Ioannis Chatzigiannakis; Lefteris M. Kirousis; Thodoris Stratiotis (ALGOSENSORS, 2008)

A new upper bound for 3-SAT. - Josep Díaz; Lefteris M. Kirousis; Dieter Mitsche; Xavier Pérez-Giménez (FSTTCS, 2008)

Thresholds of Random k-Sat. - Alexis C. Kaporis; Lefteris M. Kirousis (Encyclopedia of Algorithms, 2008)

Coloring Random Graphs: A Short Survey. - Lefteris M. Kirousis (SYNASC, 2009)

On the chromatic number of a random 5-regular graph. - Josep Díaz; Alexis C. Kaporis; G. D. Kemkes; Lefteris M. Kirousis; Xavier Pérez-Giménez; Nicholas C. Wormald (J. Graph Theory, 2009)

On the satisfiability threshold of formulas with three literals per clause. - Josep Díaz; Lefteris M. Kirousis; Dieter Mitsche; Xavier Pérez-Giménez (Theor. Comput. Sci., 2009)

Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Yiannis Mourtos; Maria J. Serna (CoRR, 2014)

On the Algorithmic Lovász Local Lemma. - Ioannis Giotis 001; Lefteris M. Kirousis; Kostas I. Psaromiligkos; Dimitrios M. Thilikos (CoRR, 2014)

On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. - Ioannis Giotis 001; Lefteris M. Kirousis; Kostas I. Psaromiligkos; Dimitrios M. Thilikos (ANALCO, 2015)

An alternative proof for the constructive Asymmetric Lovász Local Lemma. - Ioannis Giotis 001; Lefteris M. Kirousis; Kostas I. Psaromiligkos; Dimitrios M. Thilikos (CTW, 2015)

Aggregation of Votes with Multiple Positions on Each Issue. - Lefteris M. Kirousis; Phokion G. Kolaitis (CoRR, 2015)

On the Stability of Generalized Second Price Auctions with Budgets. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Evangelos Markakis; Maria J. Serna (Theory Comput. Syst., 2016)

Thresholds of Random k-Sat. - Alexis C. Kaporis; Lefteris M. Kirousis (Encyclopedia of Algorithms, 2016)

The social cost of congestion games by imposing variable delays. - Josep Díaz; Ioannis Giotis 001; Lefteris M. Kirousis; Ioannis Mourtos; Maria J. Serna (ICT Express, 2017)

Acyclic edge coloring through the Lovász Local Lemma. - Ioannis Giotis 001; Lefteris M. Kirousis; Kostas I. Psaromiligkos; Dimitrios M. Thilikos (Theor. Comput. Sci., 2017)

Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. - Ioannis Giotis 001; Lefteris M. Kirousis; John Livieratos; Kostas I. Psaromiligkos; Dimitrios M. Thilikos (GASCom, 2018)

A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma. - Lefteris M. Kirousis; John Livieratos (LION, 2018)

Algorithmically Efficient Syntactic Characterization of Possibility Domains. - Josep Díaz; Lefteris M. Kirousis; Sofia Kokonezi; John Livieratos (ICALP, 2019)

Aggregation of Votes with Multiple Positions on Each Issue. - Lefteris M. Kirousis; Phokion G. Kolaitis; John Livieratos (ACM Trans. Economics and Comput., 2019)

Directed Lovász local lemma and Shearer's lemma. - Lefteris M. Kirousis; John Livieratos; Kostas I. Psaromiligkos (Ann. Math. Artif. Intell., 2020)

Correction to: Directed Lovász Local Lemma and Shearer's Lemma. - Lefteris M. Kirousis; John Livieratos; Kostas I. Psaromiligkos (Ann. Math. Artif. Intell., 2021)

On the Computational Complexity of Non-Dictatorial Aggregation. - John Livieratos; Phokion G. Kolaitis; Lefteris M. Kirousis (J. Artif. Intell. Res., 2021)