Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Gørtz, Inge Li - Institut for Informatik og Matematisk Modellering, Danmarks Tekniske Universitet
Minimum Makespan Multi-vehicle Dial-a-Ride Inge Li Grtz
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel
Fast Arc-Annotated Subsequence Matching in Linear Space
arXiv:cs/0608124v5[cs.DS]18Jan2011 The Tree Inclusion Problem: In Linear Space and Faster
Minimum Makespan Multi-vehicle Dial-a-Ride Inge Li Grtz
Hardness of Preemptive Finite Capacity Dial-a-Ride
arXiv:cs/0512061v3[cs.DS]7Dec2007 Matching Subsequences in Trees
Union-Find with Constant Time Deletions Stephen Alstrup1
Asymmetric k-Center with Minimum Coverage Inge Li Grtz
Substring Range Reporting Philip Bille and Inge Li Grtz
Matching Subsequences in Trees Philip Bille1
The Tree Inclusion Problem: In Optimal Space Philip Bille
Asymmetry in k-Center Variants Inge Li Grtz ,1
String Matching with Variable Length Gaps Philip Bille, Inge Li Grtz, Hjalte Wedel Vildhj, and David Kofoed Wind
Substring Range Reporting Philip Bille
Locating Depots for Capacitated Vehicle Routing Inge Li Grtz
Capacitated Vehicle Routing with Non-Uniform Speeds Inge Li Grtz
arXiv:1110.5236v1[cs.DS]24Oct2011 String Indexing for Patterns with Wildcards
Longest Common Extensions via Fingerprinting Philip Bille, Inge Li Grtz, and Jesper Kristensen
