Search Results

Documents authored by Michail, Dimitrios

Document
DOI: 10.4230/LIPIcs.COSIT.2024.10
Revealing Differences in Public Transport Share Through District-Wise Comparison and Relating Them to Network Properties

Authors: Manuela Canestrini, Ioanna Gogousou, Dimitrios Michail, and Ioannis Giannopoulos

Published in: LIPIcs, Volume 315, 16th International Conference on Spatial Information Theory (COSIT 2024)

Abstract
Sustainable transport is becoming an increasingly pressing issue, with two major pillars being the reduction of car usage and the promotion of public transport. One way to approach both of these pillars is through the large number of daily commute trips in urban areas, and their modal split. Previous research gathered knowledge on influencing factors on the modal split mainly through travel surveys. We take a different approach by analysing the "raw" network and the time-optimised trips on a multi-modal graph. For the case study of Vienna, Austria we investigate how the option to use a private car influences the modal split of routes towards the city centre. Additionally, we compare the modal split across seven inner districts and we relate properties of the public transport network to the respective share of public transport. The results suggest that different districts have varying options of public transport connections towards the city centre, with a share of public transport between about 5% up to a share of 45%. This reveals areas where investments in public transport could reduce commute times to the city centre. Regarding network properties, our findings suggest, that it is not sufficient to analyse the joint public transport network. Instead, individual public transport modalities should be examined. We show that the network length and the direction of the lines towards the city centre influence the proportion of subway and tram in the modal split.
Cite as

Manuela Canestrini, Ioanna Gogousou, Dimitrios Michail, and Ioannis Giannopoulos. Revealing Differences in Public Transport Share Through District-Wise Comparison and Relating Them to Network Properties. In 16th International Conference on Spatial Information Theory (COSIT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 315, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{canestrini_et_al:LIPIcs.COSIT.2024.10,
  author =	{Canestrini, Manuela and Gogousou, Ioanna and Michail, Dimitrios and Giannopoulos, Ioannis},
  title =	{{Revealing Differences in Public Transport Share Through District-Wise Comparison and Relating Them to Network Properties}},
  booktitle =	{16th International Conference on Spatial Information Theory (COSIT 2024)},
  pages =	{10:1--10:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-330-0},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{315},
  editor =	{Adams, Benjamin and Griffin, Amy L. and Scheider, Simon and McKenzie, Grant},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2024.10},
  URN =		{urn:nbn:de:0030-drops-208255},
  doi =		{10.4230/LIPIcs.COSIT.2024.10},
  annote =	{Keywords: Mobility, Modal Split, Transportation Networks}
}
Document
DOI: 10.4230/LIPIcs.FSTTCS.2013.339
Fair Matchings and Related Problems

Authors: Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail

Published in: LIPIcs, Volume 24, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)

Abstract
Let G = (A union B, E) be a bipartite graph, where every vertex ranks its neighbors in an order of preference (with ties allowed) and let r be the worst rank used. A matching M is fair in G if it has maximum cardinality, subject to this, M matches the minimum number of vertices to rank r neighbors, subject to that, M matches the minimum number of vertices to rank (r-1) neighbors, and so on. We show an efficient combinatorial algorithm based on LP duality to compute a fair matching in G. We also show a scaling based algorithm for the fair b-matching problem. Our two algorithms can be extended to solve other profile-based matching problems. In designing our combinatorial algorithm, we show how to solve a generalized version of the minimum weighted vertex cover problem in bipartite graphs, using a single-source shortest paths computation---this can be of independent interest.
Cite as

Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail. Fair Matchings and Related Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 339-350, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{huang_et_al:LIPIcs.FSTTCS.2013.339,
  author =	{Huang, Chien-Chung and Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios},
  title =	{{Fair Matchings and Related Problems}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)},
  pages =	{339--350},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-64-4},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{24},
  editor =	{Seth, Anil and Vishnoi, Nisheeth K.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.339},
  URN =		{urn:nbn:de:0030-drops-43841},
  doi =		{10.4230/LIPIcs.FSTTCS.2013.339},
  annote =	{Keywords: Matching with Preferences, Fairness and Rank-Maximality, Bipartite Vertex Cover, Linear Programming Duality, Complementary Slackness}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact