research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo
Titles (16)Keywords (10)Abstracts (61)
[RACTI-RU1-2004-4] Kirousis, Lefteris and Kolaitis, Ph., A dichotomy in the complexity of propositional cir- cumscription, in: Theory of Computing Systems, volume 37, number 6, pages 695-715, 2004.
 
[RACTI-RU1-2006-77] Busch, Costas, Magdon-Ismail, Malik, Mavronicolas, Marios and Spirakis, Paul, Direct Routing: Algorithms and Complexity, in: Algorithmica, volume 45, number 1, pages 45-68, 2006. [DOI]
 
[RACTI-RU1-2004-8] Busch, Costas, Magdon-Ismail, Malik, Mavronicolas, Marios and Spirakis, Paul, Direct Routing: Algorithms and Complexity, in: ESA 2004, pages 134-145, 2004.
 
[RACTI-RU1-2017-63] Caragiannis, Ioannis, Chatzigeorgiou, Xenophon, Kanellopoulos, Panagiotis, Krimpas, George A., Protopapas, Nikos and Voudouris, Alexandros A., Efficiency and complexity of price competition among single-product vendors, in: Artificial Intelligence, volume 248, pages 9-25, 2017.
 
[RACTI-RU1-2006-21] Kaporis, Alexis, Kirousis, Lefteris and Stamatiou, Yannis, How to prove conditional randomness using the Principle of Deferred Decisionseds., Computational Complexity and Statistical Physics, in: Oxford University, pages 179-194, 2006.
 
[RACTI-RU1-2009-22] Spirakis, Paul and Stamatiou, Yannis, Kolmogorov complexity arguments in propositional logi, in: 7o Panellhnio Synedrio Logikhs (PLS07), 2009.
 
[RACTI-RU1-2005-79] Spirakis, Paul, Large Scale Information Systems: Some faces of Complexity, pages 156-162, chapter Project Management: The Greek Experience, PROPOMPOS Publ. Ypsilantis-Syrakoulis Eds, 2005.
 
[RACTI-RU1-2016-28] Deligkas, Argyrios, Mertzios, George and Spirakis, Paul, On the Complexity of Weighted Greedy Matchings, in: CoRR, volume abs/1602.05909, 2016.
 
[RACTI-RU1-2000-4] Efraimidis, Pavlos and Spirakis, Paul, Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note), in: 8th International Euro-Par Conference on Parallel Computing (EuroPar 2002), pages 456-460, Paderborn, Germany, 2000.
 
[RACTI-RU1-2005-61] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, Radiocoloring in planar graphs: Complexity and approximations, in: Theoretical Computer Science (TCS), volume 340, number 3, pages 514-538, 2005. [DOI]
 
[RACTI-RU1-2005-49] Fotakis, Dimitris, Nikoletseas, Sotiris, Papadopoulou, Viki and Spirakis, Paul, Radiocoloring in planar graphs: Complexity and approximations, in: Theoretical Computer Science (TCS), volume 340, number 3, pages 514-538, 2005.
 
[RACTI-RU1-2005-62] Mavronicolas, Marios, Monien, Burkhart, Gairing, Martin, Luecking, T. and Spirakis, Paul, Structure and complexity of extreme Nash equilibria, in: Theoretical Computer Science (TCS), volume 343, number 1-2, pages 133-157, 2005. [DOI]
 
[RACTI-RU1-2005-50] Gairing, Martin, Lucking, Thomas, Mavronicolas, Marios, Monien, Burkhart and Spirakis, Paul, Structure and complexity of extreme Nash equilibria, in: Theoretical Computer Science (TCS), volume 343, number 1-2, pages 133-157, 2005.
 
[RACTI-RU1-2003-1] Kirousis, Lefteris and Kolaitis, Ph., The complexity of minimal satisfiability problems, in: Information and Computation, volume 187, pages 20-39, 2003.
 
[RACTI-RU1-2017-12] Deligkas, Argyrios, Mertzios, George and Spirakis, Paul, The Computational Complexity of Weighted Greedy Matching, in: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 466-474, 2017.
 
[RACTI-RU1-2002-8] Fotakis, Dimitris, Kontogiannis, Spyros, Koutsoupias, Elias, Mavronicolas, Marios and Spirakis, Paul, The Structure and Complexity of Nash Equilibria for a Selfish Routing Game, in: International Colloquium on Automata, Languages and Programming, pages 123-134, 2002.