László Kozma

CoRR, 2024

Optimization with Pattern-Avoiding Input.

[BibT_eX]

[DOI]

Michal Opler

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Finding the saddlepoint faster than sorting.

[BibT_eX]

[DOI]

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

An Optimal Randomized Algorithm for Finding the Saddlepoint.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Online Sorting and Online TSP: Randomized, Stochastic, and High-Dimensional.

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023

Scalable Data Structures (Dagstuhl Seminar 23211).

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Dagstuhl Reports, 2023

Fast Approximation of Search Trees on Trees with Centroid Trees.

[BibT_eX]

[DOI]

Ishay Golinsky

Haim Kaplan

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Fixed-point cycles and EFX allocations.

[BibT_eX]

[DOI]

Simona Boyadzhiyska

CoRR, 2022

Splay trees on trees.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Fixed-Point Cycles and Approximate EFX Allocations.

[BibT_eX]

[DOI]

Simona Boyadzhiyska

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Group Testing with Geometric Ranges.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Finding and Counting Permutations via CSPs.

[BibT_eX]

[DOI]

Dániel Marx

Algorithmica, 2021

Analysis of Smooth Heaps and Slim Heaps.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Time- and Space-optimal Algorithm for the Many-visits TSP.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Smooth Heaps and a Dual View of Self-Adjusting Data Structures.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Geometric group testing.

[BibT_eX]

[DOI]

CoRR, 2020

Exact Exponential Algorithms for Two Poset Problems.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Faster and simpler algorithms for finding large patterns in permutations.

[BibT_eX]

[DOI]

CoRR, 2019

Hamiltonicity Below Dirac's Condition.

[BibT_eX]

[DOI]

Bart M. P. Jansen

Jesper Nederlof

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2018

Review of Compact Data Structures - a practical approach by Gonzalo Navarro.

[BibT_eX]

[DOI]

SIGACT News, 2018

Time- and space-optimal algorithms for the many-visits TSP.

[BibT_eX]

[DOI]

CoRR, 2018

Pairing heaps: the forward variant.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Multi-Finger Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Improved Bounds for Multipass Pairing Heaps and Path-Balanced Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Maximum Scatter TSP in Doubling Metrics.

[BibT_eX]

[DOI]

Tobias Mömke

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Binary search trees, rectangles and patterns.

[BibT_eX]

[DOI]

PhD thesis, 2016

The landscape of bounds for binary search trees.

[BibT_eX]

[DOI]

CoRR, 2016

Binary search trees and rectangulations.

[BibT_eX]

[DOI]

CoRR, 2016

Hitting Set for Hypergraphs of Low VC-dimension.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

A PTAS for Euclidean Maximum Scatter TSP.

[BibT_eX]

[DOI]

Tobias Mömke

CoRR, 2015

A Global Geometric View of Splaying.

[BibT_eX]

[DOI]

CoRR, 2015

Greedy Is an Almost Optimal Deque.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Pattern-Avoiding Access in Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Self-Adjusting Binary Search Trees: What Makes Them Tick?

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Review of the tower of Hanoi: myths and maths by Andreas M. Hinz, Sandi Klavžar, Urož Milutinović and Ciril Petr.

[BibT_eX]

[DOI]

SIGACT News, 2014

Streaming Algorithms for Partitioning Integer Sequences.

[BibT_eX]

[DOI]

Christian Konrad

CoRR, 2014

2013

Shattering, Graph Orientations, and Connectivity.

[BibT_eX]

[DOI]

Shay Moran

Electron. J. Comb., 2013

Privacy by Fake Data: A Geometric Approach.

[BibT_eX]

[DOI]

Victor Alvarez

Erin W. Chambers

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Minimum Average Distance Triangulations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2009

GaZIR: gaze-based zooming interface for image retrieval.

[BibT_eX]

[DOI]