4 papers
The Parameterized Complexity of Coloring Mixed Graphs
Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper +1
A mixed graph contains (undirected) edges as well as (directed) arcs, thus generalizing undirected and directed graphs. A proper coloring of a mixed graph assigns a positiv…
Solving the Line-Based Dial-a-Ride Problem by Generating Stopping Patterns
Antonio Lauerbach, Sven Mallach, Kendra Reiter +2
In the line-based dial-a-ride problem (liDARP), vehicles operate along a predefined bus line, with the possibility of skipping stations and turning when empty. Motivated by the pra…
Eliminating Majority Illusions
Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach +3
An opinion illusion refers to a phenomenon in social networks where agents may witness distributions of opinions among their neighbours that do not accurately reflect the true dist…
The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
Antonio Lauerbach, Kendra Reiter, Marie Schmidt
Dial-a-Ride problems have been proposed to model the challenge to consolidate passenger transportation requests with a fleet of shared vehicles. The line-based Dial-a-Ride problem…