No. Title Author Year
1 Compressed Weighted de Bruijn Graphs Italiano, Giuseppe F. et al. 2021
2 Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice Georgiadis, Loukas et al. 2021
3 Dominating Sets and Connected Dominating Sets in Dynamic Graphs Hjuler, Niklas et al. 2019
4 Dynamic Dominators and Low-High Orders in DAGs Georgiadis, Loukas et al. 2019
5 Faster Algorithms for All-Pairs Bounded Min-Cuts Abboud, Amir et al. 2019
6 Decremental SPQR-trees for Planar Graphs Holm, Jacob et al. 2018
7 All-Pairs 2-Reachability in O(n^w log n) Time Georgiadis, Loukas et al. 2017
8 Approximating the Smallest 2-Vertex-Connected Spanning Subgraph via Low-High Orders Georgiadis, Loukas et al. 2017
9 Contracting a Planar Graph Efficiently Holm, Jacob et al. 2017
10 Decremental Data Structures for Connectivity and Dominators in Directed Graphs Georgiadis, Loukas et al. 2017
11 2-Connectivity in Directed Graphs (Invited Talk) Georgiadis, Loukas et al. 2016
12 Geometric and Graph-based Approaches to Collective Motion (Dagstuhl Seminar 16022) Italiano, Giuseppe F. et al. 2016
13 Incremental 2-Edge-Connectivity in Directed Graphs Georgiadis, Loukas et al. 2016
14 Front Matter, Table of Contents, Preface, Organization Italiano, Giuseppe F. et al. 2015
15 OASIcs, Volume 48, ATMOS'15, Complete Volume Italiano, Giuseppe F. et al. 2015
16 Algorithm Engineering (Dagstuhl Seminar 13391) Goldberg, Andrew V. et al. 2014
17 Horn formulas, directed hypergraphs, lattices and closure systems: related formalisms and applications (Dagstuhl Seminar 14201) Adaricheva, Kira V. et al. 2014
18 Is Timetabling Routing Always Reliable for Public Transport? Firmani, Donatella et al. 2013
19 10261 Abstracts Collection -- Algorithm Engineering Italiano, Giuseppe F. et al. 2010
20 10261 Executive Summary -- Algorithm Engineering Italiano, Giuseppe F. et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 20


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI