12 papers
From Whole-Space Theory to Boundary Value Problems for Mixed-Order PDEs
Guillaume Neuttiens, Jonas Sauer
We develop a general principle for passing from the analysis of partial differential operators on the whole space to boundary value problems on the half-space. The reduction separa…
T-REX: Fast and Dynamic Journey Planning for Continental-Scale Public Transit Networks
Jonas Sauer, Patrick Steil, Sascha Witt
We present T-REX (Transfer-Ranked EXploration), a new algorithm for journey planning in public transit networks on the country and continental scale. Our algorithm applies the prin…
Graph-Based Nearest-Neighbor Search without the Spread
Jeff Giliberti, Sariel Har-Peled, Jonas Sauer +1
Recent work showed how to construct nearest-neighbor graphs of linear size, on a given set of points in , such that one can answer ap…
The Time-Periodic Cahn-Hilliard-Gurtin System on the Half Space as a Mixed-Order System with General Boundary Conditions
Guillaume Neuttiens, Jonas Sauer
A well-posedness and maximal regularity result for the time-periodic Cahn-Hilliard-Gurtin system in the half space is proved. For this purpose, we introduce a novel class of comple…
Limited-Range Multilinear Off-Diagonal Extrapolation and Weighted Transference Principle
Jonas Sauer
Multilinear extrapolation results are established in a limited-range, multilinear, and off-diagonal setting for mixed-norm Lebesgue spaces over -finite measure spaces. Int…
The Expiration Streaming Model: Diameter, -Center, Counting, Sampling, and Friends
Lotte Blank, Sergio Cabello, MohammadTaghi Hajiaghayi +5
An important thread in the study of data-stream algorithms focuses on settings where stream items are active only for a limited time. We introduce a new expiration model, where eac…
Bicriteria Polygon Aggregation with Arbitrary Shapes
Lotte Blank, David Eppstein, Jan-Henrik Haunert +6
We study the problem of aggregating a set of polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Equivalently, this can b…
Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs
Franziska Heeg, Jonas Sauer, Petra Mutzel +1
An important characteristic of temporal graphs is how the directed arrow of time influences their causal topology, i.e., which nodes can possibly influence each other causally via…
Schauder Estimates for Germs by Scaling
Jonas Sauer, Scott A. Smith
In this expository note, we show that the blow-up arguments of L. Simon adapt well to the corresponding Schauder theory of germs used in the study of singular SPDEs. We illustrate…
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
Arne Beines, Michael Kaibel, Philip Mayer +2
We present parametric breadth-first search (PBFS), a new algorithm for solving the parametric minimum cut problem in a network with source-sink-monotone capacities. The objective i…
FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing
Ernestine Großmann, Jonas Sauer, Christian Schulz +2
We present FLASH-TB, a journey planning algorithm for public transit networks that combines Trip-Based Public Transit Routing (TB) with the Arc-Flags speedup technique. The basic i…
Fast and Delay-Robust Multimodal Journey Planning
Dominik Bez, Jonas Sauer
We study journey planning in multimodal networks consisting of public transit plus an unrestricted transfer mode (e.g., walking or cycling). In order to provide good results in pra…