Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Inge Li Gørtz
2010 – today
- 2013
[c18]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz: Compact q-Gram Profiling of Compressed Strings. CPM 2013: 62-73- [i16]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz: Compact q-gram Profiling of Compressed Strings. CoRR abs/1304.5373 (2013)
- [i15]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann: Tree Compression with Top Trees. CoRR abs/1304.5702 (2013)
- [i14]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind: Fingerprints in Compressed Strings. CoRR abs/1305.2777 (2013)
- 2012
- [j9]Philip Bille, Inge Li Gørtz: Fast Arc-Annotated Subsequence Matching in Linear Space. Algorithmica 62(1-2): 209-223 (2012)
- [j8]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind: String matching with variable length gaps. Theor. Comput. Sci. 443: 25-34 (2012)
- [c17]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj: Time-Space Trade-Offs for Longest Common Extensions. CPM 2012: 293-305
- [c16]Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket: Stochastic Vehicle Routing with Recourse. ICALP (1) 2012: 411-423
- [c15]Philip Bille, Inge Li Gørtz, Jesper Kristensen: Longest Common Extensions via Fingerprinting. LATA 2012: 119-130
- [c14]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind: String Indexing for Patterns with Wildcards. SWAT 2012: 283-294
- [i13]Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket: Stochastic Vehicle Routing with Recourse. CoRR abs/1202.5797 (2012)
- [i12]Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj: Sparse Suffix Tree Construction with Small Space. CoRR abs/1207.1135 (2012)
- [i11]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj: Time-Space Trade-Offs for Longest Common Extensions. CoRR abs/1211.0270 (2012)
- 2011
- [j7]Philip Bille, Inge Li Gørtz: The tree inclusion problem: In linear space and faster. ACM Transactions on Algorithms 7(3): 38 (2011)
- [c13]Inge Li Gørtz, Viswanath Nagarajan: Locating Depots for Capacitated Vehicle Routing. APPROX-RANDOM 2011: 230-241
- [c12]
- [c11]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi: Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011: 235-247
- [i10]Inge Li Gørtz, Viswanath Nagarajan, R. Ravi: Minimum Makespan Multi-vehicle Dial-a-Ride. CoRR abs/1102.5450 (2011)
- [i9]Inge Li Gørtz, Viswanath Nagarajan: Locating Depots for Capacitated Vehicle Routing. CoRR abs/1103.0985 (2011)
- [i8]
- [i7]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind: String Matching with Variable Length Gaps. CoRR abs/1110.2893 (2011)
- [i6]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind: String Indexing for Patterns with Wildcards. CoRR abs/1110.5236 (2011)
- 2010
- [c10]Philip Bille, Inge Li Gørtz: Fast Arc-Annotated Subsequence Matching in Linear Space. SOFSEM 2010: 188-199
- [c9]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind: String Matching with Variable Length Gaps. SPIRE 2010: 385-394
- [i5]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi: Capacitated Vehicle Routing with Non-Uniform Speeds. CoRR abs/1012.1850 (2010)
2000 – 2009
- 2009
- [j6]Philip Bille, Inge Li Gørtz: Matching subsequences in trees. J. Discrete Algorithms 7(3): 306-314 (2009)
- [j5]Philip Bille, Rolf Fagerberg, Inge Li Gørtz: Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Transactions on Algorithms 6(1) (2009)
- [c8]Inge Li Gørtz, Viswanath Nagarajan, R. Ravi: Minimum Makespan Multi-vehicle Dial-a-Ride. ESA 2009: 540-552
- [i4]Philip Bille, Inge Li Gørtz: Fast Arc-Annotated Subsequence Matching in Linear Space. CoRR abs/0911.0577 (2009)
- 2008
- [j4]Inge Li Gørtz: Asymmetric k-center with minimum coverage. Inf. Process. Lett. 105(4): 144-149 (2008)
- 2007
- [j3]Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz: Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs. Discrete Optimization 4(3-4): 334-348 (2007)
- [c7]Philip Bille, Rolf Fagerberg, Inge Li Gørtz: Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM 2007: 52-62
- 2006
- [j2]Inge Li Gørtz, Anthony Wirth: Asymmetry in k-center variants. Theor. Comput. Sci. 361(2-3): 188-199 (2006)
- [c6]
- [c5]
- [i3]Philip Bille, Inge Li Gørtz: The Tree Inclusion Problem: In Linear Space and Faster. CoRR abs/cs/0608124 (2006)
- [i2]Philip Bille, Rolf Fagerberg, Inge Li Gørtz: Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CoRR abs/cs/0609085 (2006)
- 2005
- [c4]Philip Bille, Inge Li Gørtz: The Tree Inclusion Problem: In Optimal Space and Faster. ICALP 2005: 66-77
- [c3]Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick: Union-Find with Constant Time Deletions. ICALP 2005: 78-89
- [i1]
- 2003
- [j1]Inge Li Gørtz, Signe Reuss, Morten Heine Sørensen: Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus. Higher-Order and Symbolic Computation 16(3): 253-285 (2003)
- [c2]
- 2002
- [c1]Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe: Time and Space Efficient Multi-method Dispatching. SWAT 2002: 20-29
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 00:22 CEST by the dblp team