Academic staff
Kaporis Alexis
Personal Information
Kaporis Alexis
Associate Professor
kaporisa [at] aegean [dot] gr
22730 82239
Lymberis Building, 2nd Floor, Office B5 (enter B1)
Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or mass reproduced without the explicit permission of the copyright holder.
Journal Publications
[1]
A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, Dynamic Interpolation Search revisited, Information and Computation, 2019, Elsevier, (to_appear), https://www.sciencedirect.com/science/ar...
Download PDF[1]
Gerth Stolting Brodal, A. Kaporis, A. Papadopoulos, S. Sioutas, K. Tsakalidis, K. Tsichlas, Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time, Theoretical Computer Science, 2014, Springer, (to_appear), http://www.journals.elsevier.com/theoret..., IF = 0.697
[1]
D. Fotakis, A. Kaporis, T. Lianeas, P. Spirakis, On the Hardness of Network Design for Bottleneck Routing Games, Theoretical Computer Science, 2013, (to_appear)
[2]
A. Kaporis, C. Makris, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, Improved bounds for finger search on a RAM, Algorithmica, Vol. 66, No. 2, pp. 249-286, 2013, Springer, http://link.springer.com/article/10.1007...
[1]
D. Fotakis, P. Spirakis, A. Kaporis, Efficient methods for selfish network design. , Theor. Comput. Sci. , Vol. 448, pp. 9-20 , 2012, Elsevier, http://www.sciencedirect.com/science/art...
[2]
D. Fotakis, V. Gkatzelis, A. Kaporis, P. Spirakis, The Impact of Social Ignorance on Weighted Congestion Games, Theory of Computing Systems, Vol. 3, No. 50, pp. 559-578, 2012, Elsevier, http://link.springer.com/article/10.1007...
[1]
A. Kaporis, P. Spirakis, Selfish splittable flows and NP-completeness, Computer Science Reviews, Vol. 5, No. 3, pp. 209-228, 2011, Elsevier, http://www.sciencedirect.com/science/art...
[1]
A. Kaporis, C. Makris, G. Mavritsakis, S. Sioutas, A. Tsakalidis, K. Tsichlas, C. Zaroliagis, ISB-Tree: A New Indexing Scheme with Efficient Expected Behaviour, Journal of Discrete Algorithms, Vol. 8, No. 4, pp. 373-387 , 2010, http://www.sciencedirect.com/science/art...
[2]
D. Fotakis, A. Kaporis, P. Spirakis, Atomic congestion games: fast, myopic and concurrent, Theory of Computing Systems, Vol. 47, No. 1, pp. 38-59, 2010, http://link.springer.com/article/10.1007...
[1]
A. Kaporis, P. Spirakis, The price of Optimum in Stackelberg games on arbitrary networks, Theoretical Computer Science, 2009, http://www.sciencedirect.com/science/art...
[2]
J. Diaz, A. Kaporis, G. Kemkes, L. M. Kirousis, X. Perez, N. C. Wormald, On the chromatic number of a random 5-regular graph, Journal of Graph Theory, Vol. 61, No. 3, pp. 157-191, 2009, Wiley, http://onlinelibrary.wiley.com/doi/10.10...
[1]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito, The unsatisfiability threshold revisited, Discrete Applied Mathematics, Vol. 155, No. 12, pp. 1525-1538, 2007, Elsevier, http://www.sciencedirect.com/science/art...
[1]
A. Kaporis, L. M. Kirousis, E. G. Lalas, The probabilistic analysis of a greedy satisfiability algorithm, Random Structures and Algorithms, Vol. 28, No. 4, pp. 444--480, 2006, Wiley, http://onlinelibrary.wiley.com/doi/10.10...
[1]
A. Kaporis, L. M. Kirousis, E. G. Lalas, Selecting complementary pairs of literals, Electronic Notes in Discrete Mathematics (ENDM), Vol. 16, pp. 47-70, 2003, Elsevier Science, http://www.sciencedirect.com/science/art...
[1]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, M. Vamvakari, M. Zito, The unsatisfiability threshold revisited., Electronic Notes in Discrete Mathematics (ENDM), Vol. 9, pp. 81-95, 2001, Springer, http://www.sciencedirect.com/science/art...
[2]
A. Kaporis, L. M. Kirousis, E. Kranakis, D. Krizanc, Y. Stamatiou, E. C. Stavropoulos, Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval, Computer Journal, Vol. 44, No. 4, pp. 221—229, 2001, http://comjnl.oxfordjournals.org/content...
[1]
A. Kaporis, L. M. Kirousis, I. Giotis, Corrigendum to: A note on the non-colorability threshold of a random graph, Electronic Journal of Combinatorics, Vol. 7, No. 1, 2000
[2]
A. Kaporis, L. M. Kirousis, Y. Stamatiou, A note on the non-colorability threshold of a random graph, Electronic Journal of Combinatorics, Vol. 7, No. 1, 2000, http://www.combinatorics.org/ojs/index.p...