#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2013

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We study the problem of robust routing in urban public transportation networks. In order to propose solutions that are robust for typical delays, we assume that we have past observations of real traffic situations available. In particular, we assume that we have " daily records " containing the observed travel times in the whole network for a few past days.… (More)

Given an urban public transportation network and historic delay information, we consider the problem of computing reliable journeys. We propose new algorithms based on our recently presented solution concept (Böhmová et al., ATMOS 2013), and perform an experimental evaluation using real-world delay data from Zürich, Switzerland. We compare these methods to… (More)

- Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer
- WADS
- 2013

We study an offline interval scheduling problem where every job has exactly one associated interval on every machine. To schedule a set of jobs, exactly one of the intervals associated with each job must be selected, and the intervals selected on the same machine must not intersect. We show that deciding whether all jobs can be scheduled is NP-complete… (More)

- Katerina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot
- Theory of Computing Systems
- 2016

Given a set of directed paths (called lines) L, a public transportation network is a directed graph G L = (V L , A L ) which contains exactly the vertices and arcs of every line l ∈ L. An st-route is a pair (π, γ) where γ = 〈l 1,…, l h 〉 is a line sequence and π is an st-path in G L which is the concatenation of subpaths of the lines l 1,…, l h , in this… (More)

- Katerina Böhmová, Cristina Dalfó, Clemens Huemer
- Electronic Notes in Discrete Mathematics
- 2015

A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs… (More)

- Katerina Böhmová, Enrico Kravina, Matús Mihalák
- ISCO
- 2016

- Katerina Böhmová, Yann Disser, Matús Mihalák, Rastislav Srámek
- LATIN
- 2016

- K. Böhmová, C. Dalfó, C. Huemer
- 2015

A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic… (More)

- ‹
- 1
- ›