No. |
Title |
Author |
Year |
---|

1 |
New Clocks, Optimal Line Formation and Self-Replication Population Protocols |
Gąsieniec, Leszek et al. |
2023 |

2 |
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk) |
Klobas, Nina et al. |
2023 |

3 |
Algorithmic Problems on Temporal Graphs (Invited Talk) |
Spirakis, Paul G. |
2022 |

4 |
The Complexity of Computing Optimum Labelings for Temporal Connectivity |
Klobas, Nina et al. |
2022 |

5 |
The Complexity of Transitively Orienting Temporal Graphs |
Mertzios, George B. et al. |
2021 |

6 |
Crystal Structure Prediction via Oblivious Local Search |
Antypov, Dmytro et al. |
2020 |

7 |
Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle |
Deligkas, Argyrios et al. |
2020 |

8 |
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem |
Deligkas, Argyrios et al. |
2019 |

9 |
How Fast Can We Reach a Target Vertex in Stochastic Temporal Graphs? |
Akrida, Eleni C. et al. |
2019 |

10 |
Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time |
Doty, David et al. |
2018 |

11 |
Temporal Vertex Cover with a Sliding Time Window |
Akrida, Eleni C. et al. |
2018 |

12 |
The Price of Stability of Weighted Congestion Games |
Christodoulou, George et al. |
2018 |

13 |
Binary Search in Graphs Revisited |
Deligkas, Argyrios et al. |
2017 |

14 |
Deterministic Population Protocols for Exact Majority and Plurality |
Gasieniec, Leszek et al. |
2017 |

15 |
On the Transformation Capability of Feasible Mechanisms for Programmable Matter |
Michail, Othon et al. |
2017 |

16 |
Stably Computing Order Statistics with Arithmetic Population Protocols |
Mertzios, George B. et al. |
2016 |

17 |
A Cost Mechanism for Fair Pricing of Resource Usage |
Mavronicolas, Marios et al. |
2006 |

18 |
Cost Sharing Mechanisms for Fair Pricing of Resources Usage |
Mavronicolas, Marios et al. |
2006 |