Lefteris M. Kirousis

100 papers A* 5A 8B 10C 5Misc 1Journal 51Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An improvement on the bound for the acyclic chromatic index. CoRR Lefteris M. Kirousis, John Livieratos, Alexandros Singh
2021	J	`jnl`	Correction to: Directed Lovász Local Lemma and Shearer's Lemma. Ann. Math. Artif. Intell. Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos
2021	J	`jnl`	On the Computational Complexity of Non-Dictatorial Aggregation. J. Artif. Intell. Res. John Livieratos, Phokion G. Kolaitis, Lefteris M. Kirousis
2020	J	`jnl`	Directed Lovász local lemma and Shearer's lemma. Ann. Math. Artif. Intell. Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos
2019	J	`jnl`	Aggregation of Votes with Multiple Positions on Each Issue. ACM Trans. Economics and Comput. Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos
2019	A*	`conf`	Algorithmically Efficient Syntactic Characterization of Possibility Domains. ICALP Josep Díaz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos
2019	J	`jnl`	Algorithmically Efficient Syntactic Characterization of Possibility Domains. CoRR Josep Díaz, Lefteris M. Kirousis, Sofia Kokonezi, John Livieratos
2018	—	`conf`	A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma. LION Lefteris M. Kirousis, John Livieratos
2018	—	`conf`	Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma. GASCom Ioannis Giotis, Lefteris M. Kirousis, John Livieratos, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2018	C	`conf`	On the Computational Complexity of Non-dictatorial Aggregation. RAMiCS Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos
2017	J	`jnl`	Acyclic edge coloring through the Lovász Local Lemma. Theor. Comput. Sci. Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2017	C	`conf`	Aggregation of Votes with Multiple Positions on Each Issue. RAMiCS Lefteris M. Kirousis, Phokion G. Kolaitis, John Livieratos
2017	J	`jnl`	The social cost of congestion games by imposing variable delays. ICT Express Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Ioannis Mourtos, Maria J. Serna
2016	J	`jnl`	A Simple Algorithmic Proof of the Symmetric Lopsided Lovász Local Lemma. CoRR Lefteris M. Kirousis, John Livieratos
2016	J	`jnl`	On the Stability of Generalized Second Price Auctions with Budgets. Theory Comput. Syst. Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna
2016	—	`ch.`	Thresholds of Random Encyclopedia of Algorithms Alexis C. Kaporis, Lefteris M. Kirousis
2015	J	`jnl`	Aggregation of Votes with Multiple Positions on Each Issue. CoRR Lefteris M. Kirousis, Phokion G. Kolaitis
2015	C	`conf`	An alternative proof for the constructive Asymmetric Lovász Local Lemma. CTW Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2015	J	`jnl`	An alternative proof for the constructive Asymmetric Lovász Local Lemma. CoRR Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2015	—	`conf`	On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. ANALCO Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2014	J	`jnl`	On the Algorithmic Lovász Local Lemma. CoRR Ioannis Giotis, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos
2014	B	`conf`	On the Stability of Generalized Second Price Auctions with Budgets. LATIN Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna
2014	J	`jnl`	Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. CoRR Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Yiannis Mourtos, Maria J. Serna
2013	J	`jnl`	On the Stability of Generalized Second Price Auctions with Budgets. CoRR Josep Díaz, Ioannis Giotis, Lefteris M. Kirousis, Evangelos Markakis, Maria J. Serna
2009	Misc	`conf`	Coloring Random Graphs: A Short Survey. SYNASC Lefteris M. Kirousis
2009	J	`jnl`	On the chromatic number of a random 5-regular graph. J. Graph Theory Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez-Giménez, Nicholas C. Wormald
2009	J	`jnl`	On the satisfiability threshold of formulas with three literals per clause. Theor. Comput. Sci. Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez
2008	J	`jnl`	A new upper bound for 3-SAT CoRR Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez
2008	—	`conf`	A new upper bound for 3-SAT. FSTTCS Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez
2008	C	`conf`	Probabilistic Protocols for Fair Communication in Wireless Sensor Networks. ALGOSENSORS Ioannis Chatzigiannakis, Lefteris M. Kirousis, Thodoris Stratiotis
2008	—	`ch.`	Thresholds of Random k-Sat. Encyclopedia of Algorithms Alexis C. Kaporis, Lefteris M. Kirousis
2007	J	`jnl`	The unsatisfiability threshold revisited. Discret. Appl. Math. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
2006	A	`conf`	Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold. ESA Alexis C. Kaporis, Lefteris M. Kirousis, Elias C. Stavropoulos
2006	—	`ch.`	Proving Conditional Randomness using The Principle of Deferred Decisions. Computational Complexity and Statistical Physics Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou
2006	—	`ch.`	The Satisfiability Threshold Conjecture: Techniques Behind Upper Bound Improvements. Computational Complexity and Statistical Physics Lefteris M. Kirousis, Yannis C. Stamatiou, Michele Zito
2006	J	`jnl`	The probabilistic analysis of a greedy satisfiability algorithm. Random Struct. Algorithms Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas
2005	A	`conf`	5-Regular Graphs are 3-Colorable with Positive Probability. ESA Josep Díaz, G. Grammatikopoulos, Alexis C. Kaporis, Lefteris M. Kirousis, Xavier Pérez-Giménez, Dionisios G. Sotiropoulos
2005	—	`conf`	Experimental Results for Stackelberg Scheduling Strategies. WEA Alexis C. Kaporis, Lefteris M. Kirousis, Efpraxia I. Politopoulou, Paul G. Spirakis
2005	J	`jnl`	Special Issue on Typical Case Complexity and Phase Transitions. Discret. Appl. Math. Lefteris M. Kirousis, Evangelos Kranakis
2004	J	`jnl`	A Dichotomy in the Complexity of Propositional Circumscription. Theory Comput. Syst. Lefteris M. Kirousis, Phokion G. Kolaitis
2003	J	`jnl`	Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. Networks Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
2003	J	`jnl`	Preface: Volume 16. Electron. Notes Discret. Math. Evangelos Kranakis, Lefteris M. Kirousis
2003	J	`jnl`	Selecting Complementary Pairs of Literals. Electron. Notes Discret. Math. Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas
2003	J	`jnl`	The complexity of minimal satisfiability problems. Inf. Comput. Lefteris M. Kirousis, Phokion G. Kolaitis
2002	B	`ed.`	SIROCCO 9, Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, Andros, Greece, June 10-12, 2002 SIROCCO Christos Kaklamanis, Lefteris M. Kirousis
2002	J	`jnl`	Station Layouts in the Presence of Location Constraints. J. Interconnect. Networks Prosenjit Bose, Evangelos Kranakis, Christos Kaklamanis, Lefteris M. Kirousis, Danny Krizanc, David Peleg
2002	A	`conf`	The Probabilistic Analysis of a Greedy Satisfiability Algorithm. ESA Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios G. Lalas
2001	A*	`conf`	A Dichotomy in the Complexity of Propositional Circumscription. LICS Lefteris M. Kirousis, Phokion G. Kolaitis
2001	—	`conf`	Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. ICTCS Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
2001	J	`jnl`	Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval. Comput. J. Alexis C. Kaporis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou, Elias C. Stavropoulos
2001	B	`conf`	On the Complexity of Model Checking and Inference in Minimal Models. LPNMR Lefteris M. Kirousis, Phokion G. Kolaitis
2001	J	`jnl`	Random Constraint Satisfaction: A More Accurate Picture. Constraints An Int. J. Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc
2001	J	`jnl`	Rigorous results for random (2+p)-SAT. Theor. Comput. Sci. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
2001	A	`conf`	The Complexity of Minimal Satisfiability Problems. STACS Lefteris M. Kirousis, Phokion G. Kolaitis
2001	J	`jnl`	The unsatisfiability threshold revisited. Electron. Notes Discret. Math. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
2000	J	`jnl`	A Note on the Non-Colorability Threshold of a Random Graph. Electron. J. Comb. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou
2000	A	`conf`	Locating Information with Uncertainty in Fully Interconnected Networks. DISC Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
2000	J	`jnl`	On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints. Constraints An Int. J. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
2000	J	`jnl`	Power consumption in packet radio networks. Theor. Comput. Sci. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
2000	J	`jnl`	The Complexity of Minimal Satisfiability Problems Electron. Colloquium Comput. Complex. Lefteris M. Kirousis, Phokion G. Kolaitis
1999	B	`conf`	Station Layouts in the Presence of Location Constraints. ISAAC Prosenjit Bose, Christos Kaklamanis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, David Peleg
1998	J	`jnl`	Approximating the unsatisfiability threshold of random formulas. Random Struct. Algorithms Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
1997	J	`jnl`	Fugitive-Search Games on Graphs and Related Parameters. Theor. Comput. Sci. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
1997	A	`conf`	Power Consumption in Packet Radio Networks (Extended Abstract). STACS Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
1997	A	`conf`	Random Constraint Satisfaction: A More Accurate Picture. CP Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou
1996	—	`conf`	A better upper bound for the unsatisfiability threshold. Satisfiability Problem: Theory and Applications Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
1996	A	`conf`	Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract). ESA Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
1996	J	`jnl`	Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. Inf. Process. Lett. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
1996	B	`ed.`	Structure, Information and Communication Complexity, SIROCCO '95, Proceedings of the 2nd Colloquium on Structural Information and Communication Complexity, Olympia Greece, June 12-14, 1995 SIROCCO Lefteris M. Kirousis, Christos Kaklamanis
1996	J	`jnl`	The Linkage of a Graph. SIAM J. Comput. Lefteris M. Kirousis, Dimitrios M. Thilikos
1995	J	`jnl`	Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. Acta Informatica Lefteris M. Kirousis, Andreas G. Veneris
1995	B	`conf`	Linear-time Parallel Arc Consistency with Reduced Communication Requirements. SIROCCO Nick D. Dendris, Lefteris M. Kirousis
1995	—	`conf`	Partial Arc Consistency. Over-Constrained Systems Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
1995	—	`conf`	Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. FSTTCS Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
1994	J	`jnl`	An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects. J. Math. Imaging Vis. Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis
1994	B	`conf`	Fugitive-Search Games on Graphs and Related Parameters. WG Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
1994	J	`jnl`	Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity. IEEE Trans. Parallel Distributed Syst. Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
1993	—	`conf`	Efficient Algorithms for Checking the Atomicity of a Run of Read and Write Operations. WDAG Lefteris M. Kirousis, Andreas G. Veneris
1993	J	`jnl`	Fast Parallel Constraint Satisfaction . Artif. Intell. Lefteris M. Kirousis
1993	A*	`conf`	Fast Parallel Constraint Satisfaction. ICALP Lefteris M. Kirousis
1993	J	`jnl`	Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays Inf. Comput. Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis
1993	J	`jnl`	Parallel Complexity of the Connected Subgraph Problem. SIAM J. Comput. Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis
1992	B	`conf`	An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects. ISAAC Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis
1992	—	`ed.`	Distributed Algorithms, 5th International Workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, Proceedings WDAG Sam Toueg, Paul G. Spirakis, Lefteris M. Kirousis
1991	—	`conf`	Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity. WDAG Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
1991	C	`conf`	Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps. ICCI Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
1991	B	`conf`	The Complexity of The Reliable Connectivity Problem. MFCS Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis
1991	J	`jnl`	The Complexity of the Reliable Connectivity Problem. Inf. Process. Lett. Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis
1990	J	`jnl`	Effectively Labeling Planar Projections of Polyhedra. IEEE Trans. Pattern Anal. Mach. Intell. Lefteris M. Kirousis
1989	B	`conf`	Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Dags with Communication Delays. SPAA Hermann Jung, Lefteris M. Kirousis, Paul G. Spirakis
1989	A*	`conf`	The Parallel Complexity of the Subgraph Connectivity Problem FOCS Lefteris M. Kirousis, Maria J. Serna, Paul G. Spirakis
1988	—	`conf`	A Proof Technique for Register Automicity. FSTTCS Baruch Awerbuch, Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
1988	—	`conf`	Probabilistic Log-Space Reductions and Problems Probabilistically Hard for P. SWAT Lefteris M. Kirousis, Paul G. Spirakis
1988	J	`jnl`	The Complexity of Recognizing Polyhedral Scenes. J. Comput. Syst. Sci. Lefteris M. Kirousis, Christos H. Papadimitriou
1987	—	`conf`	Atomic Multireader Register. WDAG Lefteris M. Kirousis, Evangelos Kranakis, Paul M. B. Vitányi
1986	—	`conf`	A Polynomial Algorithm for Recognizing Images of Polyhedra. Aegean Workshop on Computing Lefteris M. Kirousis
1986	J	`jnl`	Searching and Pebbling. Theor. Comput. Sci. Lefteris M. Kirousis, Christos H. Papadimitriou
1985	J	`jnl`	Interval graphs and seatching. Discret. Math. Lefteris M. Kirousis, Christos H. Papadimitriou
1985	A*	`conf`	The Complexity of Recognizing Polyhedral Scenes (Extended Abstract) FOCS Lefteris M. Kirousis, Christos H. Papadimitriou
1983	J	`jnl`	A Selection Theorem. J. Symb. Log. Lefteris M. Kirousis