Eva Rotenberg

Eva Rotenberg

Associate Professor

DTU COMPUTE
Department of Applied Mathematics and Computer Science

Technical University of Denmark

Richard Petersens Plads

Building 322, room 026

2800 Kgs. Lyngby

Request a vCard via e-mail.

Publications
Projects
Courses
CV
Loading

Publications rss feed

2020
  PDF

Fully-dynamic planarity testing in polylogarithmic time

Holm, Jacob ; Rotenberg, Eva
part of: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages: 167-180, 2020
Presented at:
52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2020     |    DOI: https://doi.org/10.1145/3357713.3384249

 

Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity

Holm, Jacob ; Rotenberg, Eva
part of: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pages: 2378-2397, 2020
Presented at:
ACM-SIAM Symposium on Discrete Algorithms

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2020     |    DOI: https://doi.org/10.1137/1.9781611975994.146

2019
  PDF

Online Bipartite Matching with Amortized O(log2 n) Replacements

Bernstein, Aaron ; Holm, Jacob ; Rotenberg, Eva
in: Journal of the ACM, vol: 66, issue: 5

Type: Journal article (Peer reviewed)

Status: Published     |    Year: 2019     |    DOI: https://doi.org/10.1145/3344999

2018
 

A hamiltonian cycle in the square of a 2-connected graph in linear time

Alstrup, Stephen ; Georgakopoulos, Agelos ; Rotenberg, Eva ; Thomassen, Carsten
part of: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages: 1645-1649, 2018
Presented at:
29th Annual ACM-SIAM Symposium on Discrete Algorithms

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2018     |    DOI: https://doi.org/10.1137/1.9781611975031.107

  PDF

Compressed Communication Complexity of Longest Common Prefixes

Bille, Philip ; Berggreen Ettienne, Mikko ; Grossi, Roberto ; Gørtz, Inge Li ; Rotenberg, Eva
part of: String Processing and Information Retrieval, pages: 74-87, 2018
Presented at:
25th International Symposium on String Processing and Information Retrieval

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2018     |    DOI: https://doi.org/10.1007/978-3-030-00479-8_7

  PDF

Decremental SPQR-trees for planar graphs

Holm, Jacob ; Italiano, Giuseppe F. ; Karczmarz, Adam ; Łacki, Jakub ; Rotenberg, Eva
part of: Proceedings of 26th European Symposium on Algorithms, ESA 2018, 2019
Presented at:
26th European Symposium on Algorithms, ESA 2018

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2018     |    DOI: https://doi.org/10.4230/LIPIcs.ESA.2018.46

  PDF

Dynamic bridge-finding in õ(log2 n) amortized time

Holm, Jacob ; Rotenberg, Eva ; Thorup, Mikkel
part of: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages: 35-52, 2018
Presented at:
29th Annual ACM-SIAM Symposium on Discrete Algorithms

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2018

  PDF

Dynamic bridge-finding in Õ (log2 n) amortized time

Holm, Jacob ; Rotenberg, Eva ; Thorup, Mikkel
part of: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages: 35-52, 2019
Presented at:
29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2018     |    DOI: https://doi.org/10.1137/1.9781611975031.3

 

Fast fencing

Abrahamsen, Mikkel ; Adamaszek, Anna ; Bringmann, Karl ; Cohen-Addad, Vincent ; Mehr, Mehran ; Rotenberg, Eva ; Roytman, Alan ; Thorup, Mikkel
part of: Proceedings of 50th Annual ACM Symposium on Theory of Computing, pages: 1319-1332, 2018
Presented at:
50th Annual ACM SIGACT Symposium on Theory of Computing

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2018     |    DOI: https://doi.org/10.1145/3188745.3188878

 

Online bipartite matching with amortized O(log2 n) replacements

Bernstein, Aaron ; Holm, Jacob ; Rotenberg, Eva
part of: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages: 947-959, 2018
Presented at:
29th Annual ACM-SIAM Symposium on Discrete Algorithms

Type: Article in proceedings (Peer reviewed)

Status: Published     |    Year: 2018     |    DOI: https://doi.org/10.1137/1.9781611975031.61