2.4k citations
- University of PatrasGR41 papers
- University of LiverpoolGB8 papers
- National and Kapodistrian University of AthensGR7 papers
- Centre National de la Recherche ScientifiqueFR6 papers
- University of PiraeusGR6 papers
- Institute of Informatics and TelematicsIT5 papers
- National Research CouncilLK5 papers
- Hellenic Open UniversityGR4 papers
- University of IoanninaGR4 papers
- University of the AegeanGR4 papers
- Durham UniversityGB3 papers
- École Polytechnique Fédérale de LausanneCH3 papers
6 papers · 1 filter
Design and Management of Vehicle Sharing Systems: A Survey of Algorithmic Approaches
Damianos Gavalas, Charalampos Konstantopoulos, Grammati Pantziou
Vehicle (bike or car) sharing represents an emerging transportation scheme which may comprise an important link in the green mobility chain of smart city environments. This chapter…
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism
Eunjung Kim, Christophe Paul, Ignasi Sau +1
In this paper we design {\sf FPT}-algorithms for two parameterized problems. The first is \textsc{List Digraph Homomorphism}: given two digraphs and and a list of allowed v…
An FPT 2-Approximation for Tree-Cut Decomposition
Eunjung Kim, Sang-il Oum, Christophe Paul +2
The tree-cut width of a graph is a graph parameter defined by Wollan [J. Comb. Theory, Ser. B, 110:47-66, 2015] with the help of tree-cut decompositions. In certain cases, tree-cut…
Hierarchical Time-Dependent Oracles
Spyros Kontogiannis, Dorothea Wagner, Christos Zaroliagis
We study networks obeying \emph{time-dependent} min-cost path metrics, and present novel oracles for them which \emph{provably} achieve two unique features: % (i) \emph{subquadrati…
Distance Oracles for Time-Dependent Networks
Spyros Kontogiannis, Christos Zaroliagis
We present the first approximate distance oracle for sparse directed networks with time-dependent arc-travel-times determined by continuous, piecewise linear, positive functions po…
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
George B. Mertzios, Paul G. Spirakis
In spite of the extensive studies of the 3-coloring problem with respect to several basic parameters, the complexity status of the 3-coloring problem on graphs with small diameter,…