The following pages link to P. G. Spirakis (Q389952):
Displaying 50 items.
- On the structure of equilibria in basic network formation (Q2348039) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Temporal flows in temporal networks (Q2424668) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- The price of defense (Q2663706) (← links)
- Combinatorial randomized rounding: Boosting randomized rounding with combinatorial arguments (Q2752028) (← links)
- The Lagrangian search method (Q2768049) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- Lipschitz Continuity and Approximate Equilibria (Q2819444) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
- On the Structure of Equilibria in Basic Network Formation (Q2842790) (← links)
- Design, analysis and performance evaluation of group key establishment in wireless sensor networks (Q2864178) (← links)
- Traveling Salesman Problems in Temporal Graphs (Q2922641) (← links)
- Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657) (← links)
- Computing Approximate Nash Equilibria in Polymatrix Games (Q2936976) (← links)
- Resolving Braess’s Paradox in Random Networks (Q2937757) (← links)
- Network Constructors: A Model for Programmable Matter (Q2971122) (← links)
- (Q2990267) (← links)
- Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof) (Q3095273) (← links)
- Selected Combinatorial Properties of Random Intersection Graphs (Q3098045) (← links)
- (Q3152424) (← links)
- Deterministic Population Protocols for Exact Majority and Plurality. (Q3174938) (← links)
- Recent Advances in Population Protocols (Q3182913) (← links)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- Paradigms for Fast Parallel Approximability (Q3184627) (← links)
- Naming and Counting in Anonymous Unknown Dynamic Networks (Q3191210) (← links)
- Real-Time Synchronization of Interprocess Communications (Q3321439) (← links)
- Unbounded Speed Variability in Distributed Communications Systems (Q3345762) (← links)
- (Q3395947) (← links)
- (Q3395990) (← links)
- (Q3396550) (← links)
- (Q3396596) (← links)
- (Q3397628) (← links)
- (Q3433910) (← links)
- (Q3433948) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
- Rationality Authority for Provable Rational Behavior (Q3464466) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- (Q3484351) (← links)
- Algorithms for pure Nash equilibria in weighted congestion games (Q3507775) (← links)
- The Second Eigenvalue of Random Walks On Symmetric Random Intersection Graphs (Q3522870) (← links)
- Expander Properties and the Cover Time of Random Intersection Graphs (Q3525554) (← links)
- Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach (Q3525604) (← links)
- Selfish Load Balancing Under Partial Knowledge (Q3525605) (← links)
- The Dynamics of Probabilistic Population Protocols (Q3540255) (← links)
