Time and Space Efficient Multi-method Dispatching. - Stephen Alstrup; Gerth Stølting Brodal; Inge Li Gørtz; Theis Rauhe (SWAT, 2002)

Asymmetry in k-Center Variants. - Inge Li Gørtz; Anthony Wirth (RANDOM-APPROX, 2003)

Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus. - Inge Li Gørtz; Signe Reuss; Morten Heine Sørensen (High. Order Symb. Comput., 2003)

The Tree Inclusion Problem: In Optimal Space and Faster. - Philip Bille; Inge Li Gørtz (ICALP, 2005)

Hardness of Preemptive Finite Capacity Dial-a-Ride. - Inge Li Gørtz (APPROX-RANDOM, 2006)

Asymmetry in k-center variants. - Inge Li Gørtz; Anthony Wirth (Theor. Comput. Sci., 2006)

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. - Jørgen Bang-Jensen; Daniel Gonçalves 001; Inge Li Gørtz (Discret. Optim., 2007)

Asymmetric k-center with minimum coverage. - Inge Li Gørtz (Inf. Process. Lett., 2008)

Matching subsequences in trees. - Philip Bille; Inge Li Gørtz (J. Discrete Algorithms, 2009)

Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. - Philip Bille; Rolf Fagerberg; Inge Li Gørtz (ACM Trans. Algorithms, 2009)

Capacitated Vehicle Routing with Non-uniform Speeds. - Inge Li Gørtz; Marco Molinaro 001; Viswanath Nagarajan; R. Ravi 001 (IPCO, 2011)

The tree inclusion problem: In linear space and faster. - Philip Bille; Inge Li Gørtz (ACM Trans. Algorithms, 2011)

Stochastic Vehicle Routing with Recourse. - Inge Li Gørtz; Viswanath Nagarajan; Rishi Saket (ICALP (1), 2012)

Longest Common Extensions via Fingerprinting. - Philip Bille; Inge Li Gørtz; Jesper Kristensen (LATA, 2012)

Fast Arc-Annotated Subsequence Matching in Linear Space. - Philip Bille; Inge Li Gørtz (Algorithmica, 2012)

Sparse Suffix Tree Construction with Small Space - Philip Bille; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (CoRR, 2012)

String matching with variable length gaps. - Philip Bille; Inge Li Gørtz; Hjalte Wedel Vildhøj; David Kofoed Wind (Theor. Comput. Sci., 2012)

Sparse Suffix Tree Construction in Small Space. - Philip Bille; Johannes Fischer 001; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (ICALP (1), 2013)

Indexing Motion Detection Data for Surveillance Video. - Søren Vind; Philip Bille; Inge Li Gørtz (ISM, 2014)

Substring Range Reporting. - Philip Bille; Inge Li Gørtz (Algorithmica, 2014)

Compact Subsequence Matching and Packed Tree Coloring. - Philip Bille; Patrick Hagge Cording; Inge Li Gørtz (CoRR, 2014)

Longest Common Extensions in Trees. - Philip Bille; Inge Li Gørtz; Gad M. Landau; Oren Weimann (CoRR, 2014)

Time-space trade-offs for longest common extensions. - Philip Bille; Inge Li Gørtz; Benjamin Sach; Hjalte Wedel Vildhøj (J. Discrete Algorithms, 2014)

String Indexing for Patterns with Wildcards. - Philip Bille; Inge Li Gørtz; Hjalte Wedel Vildhøj; Søren Vind (Theory Comput. Syst., 2014)

Union-Find with Constant Time Deletions. - Stephen Alstrup; Mikkel Thorup; Inge Li Gørtz; Theis Rauhe; Uri Zwick (ACM Trans. Algorithms, 2014)

Compact q-gram profiling of compressed strings. - Philip Bille; Patrick Hagge Cording; Inge Li Gørtz (Theor. Comput. Sci., 2014)

Longest Common Extensions in Sublinear Space. - Philip Bille; Inge Li Gørtz; Mathias Bæk Tejs Knudsen; Moshe Lewenstein; Hjalte Wedel Vildhøj (CPM, 2015)

Compressed Data Structures for Range Searching. - Philip Bille; Inge Li Gørtz; Søren Vind (LATA, 2015)

Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings. - Philip Bille; Anders Roy Christiansen; Patrick Hagge Cording; Inge Li Gørtz (CoRR, 2015)

Dynamic Relative Compression. - Philip Bille; Patrick Hagge Cording; Inge Li Gørtz; Frederik Rye Skjoldjensen; Hjalte Wedel Vildhøj; Søren Vind (CoRR, 2015)

Tree compression with top trees. - Philip Bille; Inge Li Gørtz; Gad M. Landau; Oren Weimann (Inf. Comput., 2015)

Minimum Makespan Multi-Vehicle Dial-a-Ride. - Inge Li Gørtz; Viswanath Nagarajan; R. Ravi 001 (ACM Trans. Algorithms, 2015)

Boxed Permutation Pattern Matching. - Mika Amit; Philip Bille; Patrick Hagge Cording; Inge Li Gørtz; Hjalte Wedel Vildhøj (CPM, 2016)

Distance Labeling Schemes for Trees. - Stephen Alstrup; Inge Li Gørtz; Esben Bistrup Halvorsen; Ely Porat (ICALP, 2016)

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. - Philip Bille; Patrick Hagge Cording; Inge Li Gørtz; Frederik Rye Skjoldjensen; Hjalte Wedel Vildhøj; Søren Vind (ISAAC, 2016)

Capacitated Vehicle Routing with Nonuniform Speeds. - Inge Li Gørtz; Marco Molinaro 001; Viswanath Nagarajan; R. Ravi 001 (Math. Oper. Res., 2016)

Locating depots for capacitated vehicle routing. - Inge Li Gørtz; Viswanath Nagarajan (Networks, 2016)

Sparse Text Indexing in Small Space. - Philip Bille; Johannes Fischer 001; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (ACM Trans. Algorithms, 2016)

Longest common extensions in trees. - Philip Bille; Pawel Gawrychowski; Inge Li Gørtz; Gad M. Landau; Oren Weimann (Theor. Comput. Sci., 2016)

Lempel-Ziv Compression in a Sliding Window. - Philip Bille; Patrick Hagge Cording; Johannes Fischer 001; Inge Li Gørtz (CPM, 2017)

Deterministic Indexing for Packed Strings. - Philip Bille; Inge Li Gørtz; Frederik Rye Skjoldjensen (CPM, 2017)

Space-Efficient Re-Pair Compression. - Philip Bille; Inge Li Gørtz; Nicola Prezza (DCC, 2017)

Fast Dynamic Arrays. - Philip Bille; Anders Roy Christiansen; Mikko Berggren Ettienne; Inge Li Gørtz (ESA, 2017)

Immersive Algorithms: Better Visualization with Less Information. - Philip Bille; Inge Li Gørtz (ITiCSE, 2017)

Tight Bounds for Top Tree Compression. - Philip Bille; Finn Fernstrøm; Inge Li Gørtz (SPIRE, 2017)

Compressed Subsequence Matching and Packed Tree Coloring. - Philip Bille; Patrick Hagge Cording; Inge Li Gørtz (Algorithmica, 2017)

Practical and Effective Re-Pair Compression. - Philip Bille; Inge Li Gørtz; Nicola Prezza (CoRR, 2017)

A Separation Between Run-Length SLPs and LZ77. - Philip Bille; Travis Gagie; Inge Li Gørtz; Nicola Prezza (CoRR, 2017)

Fingerprints in compressed strings. - Philip Bille; Inge Li Gørtz; Patrick Hagge Cording; Benjamin Sach; Hjalte Wedel Vildhøj; Søren Vind (J. Comput. Syst. Sci., 2017)

Subsequence automata with default transitions. - Philip Bille; Inge Li Gørtz; Frederik Rye Skjoldjensen (J. Discrete Algorithms, 2017)

Compressed Communication Complexity of Longest Common Prefixes. - Philip Bille; Mikko Berggren Ettienne; Roberto Grossi; Inge Li Gørtz; Eva Rotenberg (SPIRE, 2018)

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. - Philip Bille; Anders Roy Christiansen; Patrick Hagge Cording; Inge Li Gørtz; Frederik Rye Skjoldjensen; Hjalte Wedel Vildhøj; Søren Vind (Algorithmica, 2018)

Fast Lempel-Ziv Decompression in Linear Space. - Philip Bille; Mikko Berggren Ettienne; Travis Gagie; Inge Li Gørtz; Nicola Prezza (CoRR, 2018)

A separation between RLSLPs and LZ77. - Philip Bille; Travis Gagie; Inge Li Gørtz; Nicola Prezza (J. Discrete Algorithms, 2018)

Finger Search in Grammar-Compressed Strings. - Philip Bille; Anders Roy Christiansen; Patrick Hagge Cording; Inge Li Gørtz (Theory Comput. Syst., 2018)

Time-space trade-offs for Lempel-Ziv compressed indexing. - Philip Bille; Mikko Berggren Ettienne; Inge Li Gørtz; Hjalte Wedel Vildhøj (Theor. Comput. Sci., 2018)

Mergeable Dictionaries With Shifts. - Philip Bille; Mikko Berggren Ettienne; Inge Li Gørtz (CoRR, 2019)

Approximation Algorithms for the A Priori TravelingRepairman. - Inge Li Gørtz; Viswanath Nagarajan; Fatemeh Navidi (CoRR, 2019)

Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111). - Martin Farach-Colton; Inge Li Gørtz; Rob Johnson 001; Donald E. Porter (Dagstuhl Reports, 2019)

Decompressing Lempel-Ziv Compressed Text. - Philip Bille; Mikko Berggren Ettienne; Travis Gagie; Inge Li Gørtz; Nicola Prezza (DCC, 2020)

String Indexing for Top-k Close Consecutive Occurrences. - Philip Bille; Inge Li Gørtz; Max Rishøj Pedersen; Eva Rotenberg; Teresa Anna Steiner (FSTTCS, 2020)

Space Efficient Construction of Lyndon Arrays in Linear Time. - Philip Bille; Jonas Ellert; Johannes Fischer 001; Inge Li Gørtz; Florian Kurpicz; J. Ian Munro; Eva Rotenberg (ICALP, 2020)

Random Access in Persistent Strings. - Philip Bille; Inge Li Gørtz (ISAAC, 2020)

Approximation algorithms for the a priori traveling repairman. - Fatemeh Navidi; Inge Li Gørtz; Viswanath Nagarajan (Oper. Res. Lett., 2020)

Top Tree Compression of Tries. - Philip Bille; Pawel Gawrychowski; Inge Li Gørtz; Gad M. Landau; Oren Weimann (Algorithmica, 2021)

A Conditional Lower Bound for Episode Matching. - Philip Bille; Inge Li Gørtz; Shay Mozes; Teresa Anna Steiner; Oren Weimann (CoRR, 2021)

The Fine-Grained Complexity of Episode Matching. - Philip Bille; Inge Li Gørtz; Shay Mozes; Teresa Anna Steiner; Oren Weimann (CPM, 2022)

The Complexity of the Co-occurrence Problem. - Philip Bille; Inge Li Gørtz; Tord Stordalen (SPIRE, 2022)

From regular expression matching to parsing. - Philip Bille; Inge Li Gørtz (Acta Informatica, 2022)

String indexing for top-k close consecutive occurrences. - Philip Bille; Inge Li Gørtz; Max Rishøj Pedersen; Eva Rotenberg; Teresa Anna Steiner (Theor. Comput. Sci., 2022)

Partial sums on the ultra-wide word RAM. - Philip Bille; Inge Li Gørtz; Frederik Rye Skjoldjensen (Theor. Comput. Sci., 2022)

Sliding Window String Indexing in Streams. - Philip Bille; Johannes Fischer 001; Inge Li Gørtz; Max Rishøj Pedersen; Tord Joakim Stordalen (CPM, 2023)

Hierarchical Relative Lempel-Ziv Compression. - Philip Bille; Inge Li Gørtz; Simon J. Puglisi; Simon R. Tarnow (SEA, 2023)

Faster Compression of Deterministic Finite Automata. - Philip Bille; Inge Li Gørtz; Max Rishøj Pedersen (CoRR, 2023)

Gapped Indexing for Consecutive Occurrences. - Philip Bille; Inge Li Gørtz; Max Rishøj Pedersen; Teresa Anna Steiner (Algorithmica, 2023)

Random Access in Persistent Strings and Segment Selection. - Philip Bille; Inge Li Gørtz (Theory Comput. Syst., 2023)

String Indexing with Compressed Patterns. - Philip Bille; Inge Li Gørtz; Teresa Anna Steiner (ACM Trans. Algorithms, 2023)

Simple and Robust Dynamic Two-Dimensional Convex Hull. - Emil Toftegaard Gæde; Inge Li Gørtz; Ivor van der Hoog; Christoffer Krogh; Eva Rotenberg (ALENEX, 2024)

Connecting de Bruijn Graphs. - Giulia Bernardini 001; Huiping Chen; Inge Li Gørtz; Christoffer Krogh; Grigorios Loukides; Solon P. Pissis; Leen Stougie; Michelle Sweering (CPM, 2024)

Tight Bounds for Compressing Substring Samples. - Philip Bille; Christian Mikkelsen Fuglsang; Inge Li Gørtz (CPM, 2024)

Faster Sliding Window String Indexing in Streams. - Philip Bille; Pawel Gawrychowski; Inge Li Gørtz; Simon R. Tarnow (CPM, 2024)

Rank and Select on Degenerate Strings. - Philip Bille; Inge Li Gørtz; Tord Stordalen (DCC, 2024)

Snake in Optimal Space and Time. - Philip Bille; Martín Farach-Colton; Inge Li Gørtz; Ivor van der Hoog (FUN, 2024)

Sparse Regular Expression Matching. - Philip Bille; Inge Li Gørtz (SODA, 2024)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time. - Philip Bille; Inge Li Gørtz; Moshe Lewenstein; Solon P. Pissis; Eva Rotenberg; Teresa Anna Steiner (STACS, 2024)

Regular Expressions: Matching and Indexing (Dagstuhl Seminar 24472). - Inge Li Gørtz; Sebastian Maneth; Gonzalo Navarro 001; Nicola Prezza (Dagstuhl Reports, 2024)

Predecessor on the Ultra-Wide Word RAM. - Philip Bille; Inge Li Gørtz; Tord Stordalen (Algorithmica, 2024)

Compact Data Structures for Collections of Sets. - Jarno N. Alanko; Philip Bille; Inge Li Gørtz; Gonzalo Navarro 001; Simon J. Puglisi (From Strings to Graphs, and Back Again, 2025)

Text Indexing for Simple Regular Expressions. - Hideo Bannai; Philip Bille; Inge Li Gørtz; Gad M. Landau; Gonzalo Navarro 001; Nicola Prezza; Teresa Anna Steiner; Simon Rumle Tarnow (CPM, 2025)

Compressed Dictionary Matching on Run-Length Encoded Strings. - Philip Bille; Inge Li Gørtz; Simon J. Puglisi; Simon R. Tarnow (CPM, 2025)

Succinct Data Structures for Segments. - Philip Bille; Inge Li Gørtz; Simon R. Tarnow (CPM, 2025)

Dynamic Range Minimum Queries on the Ultra-wide Word RAM. - Philip Bille; Inge Li Gørtz; Máximo Pérez López; Tord Stordalen (SOFSEM (1), 2025)

Fast Practical Compression of Deterministic Finite Automata. - Philip Bille; Inge Li Gørtz; Max Rishøj Pedersen (SOFSEM (1), 2025)

Differentially Private Substring and Document Counting. - Giulia Bernardini 001; Philip Bille; Inge Li Gørtz; Teresa Anna Steiner (Proc. ACM Manag. Data, 2025)