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

1 |
Dominating Sets and Connected Dominating Sets in Dynamic Graphs |
Hjuler, Niklas et al. |
2019 |

2 |
Dynamic Dominators and Low-High Orders in DAGs |
Georgiadis, Loukas et al. |
2019 |

3 |
Faster Algorithms for All-Pairs Bounded Min-Cuts |
Abboud, Amir et al. |
2019 |

4 |
Decremental SPQR-trees for Planar Graphs |
Holm, Jacob et al. |
2018 |

5 |
All-Pairs 2-Reachability in O(n^w log n) Time |
Georgiadis, Loukas et al. |
2017 |

6 |
Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders |
Georgiadis, Loukas et al. |
2017 |

7 |
Contracting a Planar Graph Efficiently |
Holm, Jacob et al. |
2017 |

8 |
Decremental Data Structures for Connectivity and Dominators in Directed Graphs |
Georgiadis, Loukas et al. |
2017 |

9 |
2-Connectivity in Directed Graphs (Invited Talk) |
Georgiadis, Loukas et al. |
2016 |

10 |
Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022) |
Italiano, Giuseppe F. et al. |
2016 |

11 |
Incremental 2-Edge-Connectivity in Directed Graphs |
Georgiadis, Loukas et al. |
2016 |

12 |
Front Matter, Table of Contents, Preface, Organization |
Italiano, Giuseppe F. et al. |
2015 |

13 |
OASIcs, Volume 48, ATMOS'15, Complete Volume |
Italiano, Giuseppe F. et al. |
2015 |

14 |
Algorithm Engineering (Dagstuhl Seminar 13391) |
Goldberg, Andrew V. et al. |
2014 |

15 |
Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201) |
Adaricheva, Kira V. et al. |
2014 |

16 |
Is Timetabling Routing Always Reliable for Public Transport? |
Firmani, Donatella et al. |
2013 |

17 |
10261 Abstracts Collection -- Algorithm Engineering |
Italiano, Giuseppe F. et al. |
2010 |

18 |
10261 Executive Summary -- Algorithm Engineering |
Italiano, Giuseppe F. et al. |
2010 |