The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions von Kaporis, A.C., Spirakis, P.G.

Volltext

Atomic Congestion Games: Fast, Myopic and Concurrent von Fotakis, D., Kaporis, A. C., Spirakis, P. G.

Volltext

Selfish splittable flows and NP-completeness von Kaporis, A C, Spirakis, P G

Volltext

Experimental Results for Stackelberg Scheduling Strategies von Kaporis, A. C., Kirousis, L. M., Politopoulou, E. I., Spirakis, P. G.

Volltext

Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval von Kaporis, Alexis C, Kirousis, Lefteris M, Kranakis, Evangelos, Krizanc, Danny, Stamatiou, Yannis C, Stavropoulos, Elias C

Volltext

Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold von Kaporis, A. C., Kirousis, L. M., Stavropoulos, E. C.

Volltext

5-Regular Graphs are 3-Colorable with Positive Probability von Díaz, J., Grammatikopoulos, G., Kaporis, A. C., Kirousis, L. M., Pérez, X., Sotiropoulos, D. G.

Volltext

Atomic Congestion Games: Fast, Myopic andConcurrent von Fotakis, D, Kaporis, A C, Spirakis, P G

Volltext

On the chromatic number of a random 5-regular graph von Díaz, J., Kaporis, A. C., Kemkes, G. D., Kirousis, L. M., Pérez, X., Wormald, N.

Volltext

Efficient methods for selfish network design von Fotakis, Dimitris, Kaporis, Alexis C., Spirakis, Paul G.

Volltext

The Impact of Social Ignorance on Weighted Congestion Games von Fotakis, Dimitris, Gkatzelis, Vasilis, Kaporis, Alexis C., Spirakis, Paul G.

Volltext

Random input helps searching predecessors von Belazzougui, D, Kaporis, A. C, Spirakis, P. G

Volltext bestellen

Resolving Braess’s Paradox in Random Networks von Fotakis, Dimitris, Kaporis, Alexis C., Lianeas, Thanasis, Spirakis, Paul G.

Volltext

On the hardness of network design for bottleneck routing games von Fotakis, Dimitris, Kaporis, Alexis C., Lianeas, Thanasis, Spirakis, Paul G.

Volltext

Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games von Kalles, Dimitris, Kaporis, Alexis C., Spirakis, Paul G.

Volltext

The probabilistic analysis of a greedy satisfiability algorithm von Kaporis, Alexis C., Kirousis, Lefteris M., Lalas, Efthimios G.

Volltext

The Probabilistic Analysis of a Greedy Satisfiability Algorithm von Kaporis, Alexis C., Kirousis, Lefteris M., Lalas, Efthimios G.

Volltext

Random input helps searching predecessors von Belazzougui, D, Kaporis, A C, Spirakis, P G

Volltext

The unsatisfiability threshold revisited von Kaporis, Alexis C., Kirousis, Lefteris M., Stamatiou, Yannis C., Vamvakari, Malvina, Zito, Michele

Volltext

Selecting Complementary Pairs of Literals von Kaporis, Alexis C., Kirousis, Lefteris M., Lalas, Efthimios

Volltext