| 2008 |
|---|
| 14 | EE | Inge Li Gørtz:
Asymmetric k-center with minimum coverage.
Inf. Process. Lett. 105(4): 144-149 (2008) |
| 2007 |
|---|
| 13 | EE | 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 |
| 12 | EE | 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) |
| 2006 |
|---|
| 11 | EE | Inge Li Gørtz:
Hardness of Preemptive Finite Capacity Dial-a-Ride.
APPROX-RANDOM 2006: 200-211 |
| 10 | EE | Philip Bille,
Inge Li Gørtz:
Matching Subsequences in Trees.
CIAC 2006: 248-259 |
| 9 | EE | Philip Bille,
Inge Li Gørtz:
The Tree Inclusion Problem: In Linear Space and Faster
CoRR abs/cs/0608124: (2006) |
| 8 | EE | 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) |
| 7 | EE | Inge Li Gørtz,
Anthony Wirth:
Asymmetry in k-center variants.
Theor. Comput. Sci. 361(2-3): 188-199 (2006) |
| 2005 |
|---|
| 6 | EE | Philip Bille,
Inge Li Gørtz:
The Tree Inclusion Problem: In Optimal Space and Faster.
ICALP 2005: 66-77 |
| 5 | EE | Stephen Alstrup,
Inge Li Gørtz,
Theis Rauhe,
Mikkel Thorup,
Uri Zwick:
Union-Find with Constant Time Deletions.
ICALP 2005: 78-89 |
| 4 | EE | Philip Bille,
Inge Li Gørtz:
Matching Subsequences in Trees
CoRR abs/cs/0512061: (2005) |
| 2003 |
|---|
| 3 | EE | Inge Li Gørtz,
Anthony Wirth:
Asymmetry in k-Center Variants.
RANDOM-APPROX 2003: 59-70 |
| 2 | EE | 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) |
| 2002 |
|---|
| 1 | EE | Stephen Alstrup,
Gerth Stølting Brodal,
Inge Li Gørtz,
Theis Rauhe:
Time and Space Efficient Multi-method Dispatching.
SWAT 2002: 20-29 |
