Get started
Author

Inge Li Gørtz

Observed names: Gortz, Inge Li, Gørtz, Inge Li, Gørtz, Inge Li, Inge Li Gørtz, Inge Li Gortz, Li Gørtz, Inge
ORCID: 0000-0002-8322-4952
Observed ORCID: 0000-0002-8322-4952
OpenAlex ID: A5070148734
String matching with variable length gaps
2012 · Philip Bille, Inge Li Gørtz, et al. · Theoretical Computer Science · 56
Tree compression with top trees
2015 · Philip Bille, Inge Li Gørtz, et al. · Information and Computation · 49
Time–space trade-offs for Lempel–Ziv compressed indexing
2017 · Philip Bille, Mikko Berggren Ettienne, et al. · Theoretical Computer Science · 41
PDF
Time–space trade-offs for longest common extensions
2013 · Philip Bille, Inge Li Gørtz, et al. · Journal of Discrete Algorithms · 34
PDF
Substring Range Reporting
2013 · Philip Bille, Inge Li Gørtz · Algorithmica · 31
PDF
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
2017 · Philip Bille, Anders Roy Christiansen, et al. · Algorithmica · 29
PDF
The tree inclusion problem: In linear space and faster
2011 · Philip Bille, Inge Li Gortz · ACM Transactions on Algorithms · 29
String Indexing for Patterns with Wildcards
2013 · Philip Bille, Inge Li Gørtz, et al. · Theory of Computing Systems · 28
PDF
Fingerprints in compressed strings
2017 · Philip Bille, Inge Li Gørtz, et al. · Journal of Computer and System Sciences · 26
PDF
Deterministic Indexing for Packed Strings
2016 · Bille, Philip, Gørtz, Inge Li, et al. · arXiv (Cornell University) · 25
PDF
Sparse Text Indexing in Small Space
2016 · Philip Bille, Johannes Fischer, et al. · ACM Transactions on Algorithms · 24
Finger Search in Grammar-Compressed Strings
2018 · Philip Bille, Anders Roy Christiansen, et al. · Theory of Computing Systems · 23
PDF
Longest Common Extensions in Sublinear Space
2015 · Philip Bille, Inge Li Gørtz, et al. · Lecture notes in computer science · 23
Minimum Makespan Multi-vehicle Dial-a-Ride
2009 · Inge Li Gørtz, Viswanath Nagarajan, et al. · Lecture notes in computer science · 23
The Tree Inclusion Problem: In Optimal Space and Faster
2005 · Philip Bille, Inge Li Gørtz · Lecture notes in computer science · 22
Substring Range Reporting
2011 · Philip Bille, Inge Li Gørtz · Lecture notes in computer science · 20
Space-Efficient Re-Pair Compression
2017 · Philip Bille, Inge Li Gortz, et al. · DCC · 19
PDF
Distance Labeling Schemes for Trees
2016 · Alstrup, Stephen, Gørtz, Inge Li, et al. · Research at the University of Copenhagen (University of Copenhagen) · 19
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
2009 · Philip Bille, Rolf Fagerberg, et al. · ACM Transactions on Algorithms · 18
PDF
Union-Find with Constant Time Deletions
2014 · Stephen Alstrup, Mikkel Thorup, et al. · ACM Transactions on Algorithms · 17
A separation between RLSLPs and LZ77
2018 · Philip Bille, Travis Gagie, et al. · Journal of Discrete Algorithms · 16
PDF
Asymmetry in k -center variants
2006 · Inge Li Gørtz, Anthony Wirth · Theoretical Computer Science · 16
Capacitated Vehicle Routing with Nonuniform Speeds
2016 · Inge Li Gørtz, Marco Molinaro, et al. · Mathematics of Operations Research · 14
PDF
Hardness of Preemptive Finite Capacity Dial-a-Ride
2006 · Inge Li Gørtz · Lecture notes in computer science · 14
Locating depots for capacitated vehicle routing
2016 · Inge Li Gørtz, Viswanath Nagarajan · Networks · 13
PDF
Works count: 153
Citation count: 1,000
H-index: 18
I10-index: 36
Year
Topic
Type