Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Martin Strehler"'
Autor:
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 21 no. 1, ICGT 2018 (2019)
End vertices of graph searches can exhibit strong structural properties and are crucial for many graph algorithms. The problem of deciding whether a given vertex of a graph is an end-vertex of a particular search was first introduced by Corneil, K\"o
Externí odkaz:
https://doaj.org/article/7fff84690eb54d538738f8216aaeb13c
Publikováno v:
ACM Transactions on Economics and Computation. 10:1-27
Routing games over time are widely studied due to various applications, e.g., transportation, road and air traffic control, logistic in production systems, communication networks like the internet, and financial flows. In this article, we present a n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::407e3886633f04eaffec107de22e4e59
https://doi.org/10.1145/3488268
https://doi.org/10.1145/3488268
Publikováno v:
Algorithmica.
Solving problems on graphs dynamically calls for algorithms to function under repeated modifications to the graph and to be more efficient than solving the problem for the whole graph from scratch after each modification. Dynamic algorithms have been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fa45a1d5d478b87e2a4d7cd3b4ac53c
https://doi.org/10.1007/s00453-023-01107-1
https://doi.org/10.1007/s00453-023-01107-1
Autor:
Martina Simon, Simone Kirst, Martin Strehler, Julian Sessner, Milenko Saponja, Ronda Ringfort-Felner, Judith Dörrenbächer
Publikováno v:
Meaningful Futures with Robots—Designing a New Coexistence ISBN: 9781003287445
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0bbdf89d80c1087a322f5cfabf886b8
https://doi.org/10.1201/9781003287445-5
https://doi.org/10.1201/9781003287445-5
Autor:
Nevena Pivač, Matjaž Krnc, Carolin Denkert, Martin Strehler, Robert Scheffler, Ekkehard Köhler, Jesse Beisegel
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:1418-1446
Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given spanning tree of a gr...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d5bc7dc44efd25b866b1d89a97e35c3
https://doi.org/10.1137/20m1313301
https://doi.org/10.1137/20m1313301
Autor:
Matjaž Krnc, Nina Chiarelli, Nevena Pivač, Jesse Beisegel, Martin Strehler, Robert Scheffler, Ekkehard Köhler, Martin Milanič
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783030604394
WG
WG
Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is, graphs obtained from an edge-weighted graph by removing all sufficiently light edges. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::add47f59de2845c915980e01d66d5462
https://doi.org/10.1007/978-3-030-60440-0_11
https://doi.org/10.1007/978-3-030-60440-0_11
Publikováno v:
Transportation Research Part B: Methodological. 103:111-135
Electric and hybrid vehicles are a big step towards a greener mobility, but they also open up completely new questions regarding the shortest path problem and the planning of trips. Since recharging an electric car will take much longer than refillin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9327fccd3c33cf68402a3ab4f7b7983
https://doi.org/10.1016/j.trb.2017.03.007
https://doi.org/10.1016/j.trb.2017.03.007
Publikováno v:
ANT/EDI40
This paper contributes to the question how to optimize fixed-time traffic signal coordinations for real-world applications. Therefore, two models are combined: An analytically model that optimizes fixed-time plans based on a cyclically time-expanded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36477d4f31c8c77c50de7bcd414121a6
Publikováno v:
Web and Internet Economics ISBN: 9783030046118
WINE
WINE
In this paper, we present a new routing model with edge priorities. We consider network users that route packages selfishly through a network over time and try to reach their destinations as fast as possible. If the number of packages that want to en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8a269df94eaa2b5890a6bc7318ae838
https://doi.org/10.1007/978-3-030-04612-5_27
https://doi.org/10.1007/978-3-030-04612-5_27
Autor:
Carolin Denkert, Nevena Pivač, Ekkehard Köhler, Robert Scheffler, Jesse Beisegel, Martin Strehler, Matjaž Krnc
Publikováno v:
LAGOS
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science
Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given spanning tree of a graph is a search tree of a particular search on this g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b5926d3709a304483167182c0d7e385