Barbara Geissmann

30 papers A 3B 7C 4Journal 15
YearRankTypeTitle / Venue / Authors
2025 J jnl
An Optimal Sorting Algorithm for Persistent Random Comparison Faults.
CoRR
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2021 J jnl
Parallel Minimum Cuts in Near-linear Work and Low Depth.
ACM Trans. Parallel Comput.
Barbara Geissmann, Lukas Gianinazzi
2020 J jnl
Collaborative delivery with energy-constrained mobile robots.
Theor. Comput. Sci.
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2020 J jnl
Longest Increasing Subsequence under Persistent Comparison Errors.
Theory Comput. Syst.
Barbara Geissmann
2020 J jnl
Optimal Dislocation with Persistent Errors in Subquadratic Time.
Theory Comput. Syst.
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2019 B conf
Dual-Mode Greedy Algorithms Can Save Energy.
ISAAC
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti
2019 A conf
Optimal Sorting with Persistent Comparison Errors.
ESA
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2019 C conf
Routing in Stochastic Public Transit Networks.
ATMOS
Barbara Geissmann, Lukas Gianinazzi
2019 J jnl
Sorting by Swaps with Noisy Comparisons.
Algorithmica
Tomas Gavenciak, Barbara Geissmann, Johannes Lengler
2018 — —
From Sorting to Optimization: Coping with Error-Prone Comparisons.
Barbara Geissmann
2018 B conf
Inversions from Sorting with Distance-Based Errors.
SOFSEM
Barbara Geissmann, Paolo Penna
2018 B conf
Longest Increasing Subsequence Under Persistent Comparison Errors.
WAOA
Barbara Geissmann
2018 J jnl
Longest Increasing Subsequence under Persistent Comparison Errors.
CoRR
Barbara Geissmann
2018 A conf
Optimal Dislocation with Persistent Errors in Subquadratic Time.
STACS
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018 J jnl
Optimal Sorting with Persistent Comparison Errors.
CoRR
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018 B conf
Parallel Minimum Cuts in Near-linear Work and Low Depth.
SPAA
Barbara Geissmann, Lukas Gianinazzi
2018 J jnl
Parallel Minimum Cuts in Near-linear Work and Low Depth.
CoRR
Barbara Geissmann, Lukas Gianinazzi
2018 J jnl
Sorting by Swaps with Noisy Comparisons.
CoRR
Tomas Gavenciak, Barbara Geissmann, Johannes Lengler
2017 C conf
Cache Oblivious Minimum Cut.
CIAC
Barbara Geissmann, Lukas Gianinazzi
2017 A conf
Sorting by swaps with noisy comparisons.
GECCO
Tomas Gavenciak, Barbara Geissmann, Johannes Lengler
2017 B conf
Sorting with Recurrent Comparison Errors.
ISAAC
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2017 J jnl
Sorting with Recurrent Comparison Errors.
CoRR
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2016 B conf
Collaborative Delivery with Energy-Constrained Mobile Robots.
SIROCCO
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2016 J jnl
Collaborative Delivery with Energy-Constrained Mobile Robots.
CoRR
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Barbara Geissmann, Daniel Graf, Arnaud Labourel, Matús Mihalák
2016 C conf
On Computing the Total Displacement Number via Weighted Motzkin Paths.
IWOCA
Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
2016 J jnl
On computing the total displacement number via weighted Motzkin paths.
CoRR
Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
2016 J jnl
Sort well with energy-constrained comparisons.
CoRR
Barbara Geissmann, Paolo Penna
2015 B conf
Recurring Comparison Faults: Sorting and Finding the Minimum.
FCT
Barbara Geissmann, Matús Mihalák, Peter Widmayer
2014 C conf
Finding Robust Minimum Cuts.
AAIM
Barbara Geissmann, Rastislav Srámek
2013 J jnl
Counting small cuts in a graph
CoRR
Barbara Geissmann, Rastislav Srámek