Barbara Geissmann

Publication Activity (10 Years)

Years Active: 2013-2021
Publications (10 Years): 25

Top Topics

Computational Effort

Geographically Dispersed

Greedy Algorithm

Top Venues

Theory Comput. Syst.

Publications

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