Sledovat
Eva Rotenberg
Eva Rotenberg
Associate Professor, DTU Compute, Denmark
E-mailová adresa ověřena na: dtu.dk - Domovská stránka
Název
Citace
Citace
Rok
Online Bipartite Matching with Amortized O(log^2 n) Replacements
A Bernstein, J Holm, E Rotenberg
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
612018
Faster fully-dynamic minimum spanning forest
J Holm, E Rotenberg, C Wulff-Nilsen
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
382015
Hashing for statistics over k-partitions
S Dahlgaard, MBT Knudsen, E Rotenberg, M Thorup
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1292-1310, 2015
302015
Dynamic bridge-finding in Õ(log^2 n) amortized time
J Holm, E Rotenberg, M Thorup
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
262018
Fully-dynamic planarity testing in polylogarithmic time
J Holm, E Rotenberg
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
232020
Skeletonization via local separators
A Bærentzen, E Rotenberg
ACM Transactions on Graphics (TOG) 40 (5), 1-18, 2021
212021
GeneWiz browser: an interactive tool for visualizing sequenced chromosomes
PF Hallin, HH Stærfeldt, E Rotenberg, TT Binnewies, CJ Benham, ...
Standards in genomic sciences 1, 204-215, 2009
212009
Graph reconstruction with a betweenness oracle
M Abrahamsen, G Bodwin, E Rotenberg, M Stöckel
33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016
192016
Planar reachability in linear space and constant time
J Holm, E Rotenberg, M Thorup
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 370-389, 2015
192015
The power of two choices with simple tabulation
S Dahlgaard, MBT Knudsen, E Rotenberg, M Thorup
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
182016
Worst-case polylog incremental spqr-trees: Embeddings, planarity, and triconnectivity
J Holm, E Rotenberg
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
152020
String attractors: Verification and optimization
D Kempa, A Policriti, N Prezza, E Rotenberg
arXiv preprint arXiv:1803.01695, 2018
132018
The bane of low-dimensionality clustering
V Cohen-Addad, A De Mesmay, E Rotenberg, A Roytman
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
132018
Dynamic Planar Embeddings of Dynamic Graphs
J Holm, E Rotenberg
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
132015
Space efficient construction of Lyndon arrays in linear time
P Bille, J Ellert, J Fischer, IL Gørtz, F Kurpicz, I Munro, E Rotenberg
arXiv preprint arXiv:1911.03542, 2019
122019
Contracting a planar graph efficiently
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski
arXiv preprint arXiv:1706.10228, 2017
122017
Fast fencing
M Abrahamsen, A Adamaszek, K Bringmann, V Cohen-Addad, M Mehr, ...
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
102018
Best laid plans of lions and men
M Abrahamsen, J Holm, E Rotenberg, C Wulff-Nilsen
arXiv preprint arXiv:1703.03687, 2017
102017
Decremental SPQR-trees for planar graphs
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg
arXiv preprint arXiv:1806.10772, 2018
92018
String indexing for top-k close consecutive occurrences
P Bille, IL Gørtz, MR Pedersen, E Rotenberg, TA Steiner
Theoretical Computer Science 927, 133-147, 2022
82022
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20