Barbara Geissmann

According to our database, Barbara Geissmann authored at least 18 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

An Optimal Sorting Algorithm for Persistent Random Comparison Faults.

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna

CoRR, August, 2025

2019

Dual-Mode Greedy Algorithms Can Save Energy.

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Optimal Sorting with Persistent Comparison Errors.

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Routing in Stochastic Public Transit Networks.

Barbara Geissmann, Lukas Gianinazzi

Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018

From Sorting to Optimization: Coping with Error-Prone Comparisons.

Barbara Geissmann

PhD thesis, 2018

Longest Increasing Subsequence Under Persistent Comparison Errors.

Barbara Geissmann

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Optimal Dislocation with Persistent Errors in Subquadratic Time.

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Parallel Minimum Cuts in Near-linear Work and Low Depth.

Barbara Geissmann, Lukas Gianinazzi

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Inversions from Sorting with Distance-Based Errors.

Barbara Geissmann, Paolo Penna

Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017

Sorting with Recurrent Comparison Errors.

Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Sorting by swaps with noisy comparisons.

Tomas Gavenciak, Barbara Geissmann, Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2017

Cache Oblivious Minimum Cut.

Barbara Geissmann, Lukas Gianinazzi

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Sort well with energy-constrained comparisons.

Barbara Geissmann, Paolo Penna

CoRR, 2016

Collaborative Delivery with Energy-Constrained Mobile Robots.

Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák

Proceedings of the Structural Information and Communication Complexity, 2016

On Computing the Total Displacement Number via Weighted Motzkin Paths.

Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

2015

Recurring Comparison Faults: Sorting and Finding the Minimum.

Barbara Geissmann, Matús Mihalák, Peter Widmayer

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

Finding Robust Minimum Cuts.

Barbara Geissmann, Rastislav Srámek

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Counting small cuts in a graph

Barbara Geissmann, Rastislav Srámek

CoRR, 2013