Publications

The copyrights for journal and conference proceedings papers generally belong to the publisher of the journal or proceedings. All papers may be downloaded for personal or research purposes only.
Listed in reverse chronological order.

• Sparse Regular Expression Matching.
  Philip Bille and Inge Li Gørtz.
  Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 24).
  
  
• Simple and Robust Dynamic Two-Dimensional Convex Hull
  Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh and Eva Rotenberg.
  SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 24).
  
  
• Gapped String Indexing in Subquadratic Space and Sublinear Query Time.
  Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon Pissis, Eva Rotenberg, Teresa Anna Steiner.
  Proc. 41st Symp. Theor. Aspects of Comp. Science (STACS 2024).
  
  
• Snake in Optimal Space and Time
  Philip Bille, Inge Li Gørtz, Martin Farach-Colton, Ivor van der Hoog.
  12th International Conference on Fun with Algorithms (FUN 2024)
  
  
• Tight Bounds for Compressing Substring Samples.
  Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz.
  Proc. 35th Annual Symp. on Combinatorial Pattern Matching (CPM 2024).
  
  
• Faster Sliding Window String Indexing in Streams.
  Philip Bille, Pawel Gawrychowski, Inge Li Gørtz and S. R. Tarnow.
  Proc. 35th Annual Symp. on Combinatorial Pattern Matching (CPM 2024).
  
  
• Connecting de Bruijn Graphs.
  G. Bernardini, H. Chen, I. L. Gørtz, C. Krogh, G. Loukides, S. Pissis, L. Stougie and M. Sweering.
  Proc. 35th Annual Symp. on Combinatorial Pattern Matching (CPM 2024).
  
  
• Hierarchical Relative Lempel-Ziv Compression.
  Philip Bille, Inge Li Gørtz, Simon J. Puglisi, and Simon Rumle Tarnow.
  Proceedings of the 21st Symposium on Experimental Algorithms (SEA 2023).
  
  
• Sliding Window String Indexing in Streams.
  Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, and Tord Stordalen.
  Proceedings of the 34th Symposium on Combinatorial Pattern Matching (CPM 2023).
  
  
• String Indexing with Compressed Patterns.
  Philip Bille, Inge Li Gørtz, and Teresa Anna Steiner.
  ACM Transaction on Algorithms 19(4): 32:1-32:19 (2023).
  Conference version:
  

  String Indexing with Compressed Patterns.
  Philip Bille, Inge Li Gørtz, and Teresa Anna Steiner.
  Proc. 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020). [draft of full version]
  

• Random Access in Persistent Strings.
  Philip Bille and Inge Li Gørtz.
  Theory of Computing Systems 67(4): 694-713 (2023).
  Conference version:
  

  Random Access in Persistent Strings.
  Philip Bille and Inge Li Gørtz.
  Proc. of the 31st International Symposium on Algorithms and Computation (ISAAC 2020).[draft of full version]
  

• Gapped Indexing for Consecutive Occurrences.
  Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, and Teresa Anna Steiner.
  Algorithmica, volume 85(4), pages 879-901, 2023.
  Conference version:
  

  Gapped Indexing for Consecutive Occurrences.
  Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, and Teresa Anna Steiner.
  Proceedings of the 40th Symposium on Combinatorial Pattern Matching (CPM 2021).
  

• The Fine-Grained Complexity of Episode Matching.
  Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, and Oren Weimann.
  Proceedings of the 41st Symposium on Combinatorial Pattern Matching (CPM 2022).
  
  
• Predecessor on the Ultra-Wide Word RAM.
  Philip Bille, Inge Li Gørtz, and Tord Stordalen
  18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022).
  
  
• The Complexity of the Co-occurrence Problem.
  Philip Bille, Inge Li Gørtz, and Tord Stordalen
  Proc. 29th International Symposium on String Processing and Information Retrieval (SPIRE 2022).
  
  
• From Regular Expression Matching to Parsing.
  Philip Bille and Inge Li Gørtz.
  Acta Informatica (2022), DOI:10.1007/s00236-022-00420-6
  Conference version:
  

  From Regular Expression Matching to Parsing.
  Philip Bille and Inge Li Gørtz.
  Proc. 44th Symposium on Mathematical Foundations of Computer Science (MFCS 2019).
  

• String Indexing for Top-k Close Consecutive Occurrences.
  Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, and Teresa Anna Steiner.
  Theoretical Computer Sicence 927: 133-147 (2022) Conference version:
  

  String Indexing for Top-k Close Consecutive Occurrences.
  Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, and Teresa Anna Steiner.
  Proc. of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020). [draft of full version]
  

• Partial Sums on the Ultra-Wide Word RAM.
  Philip Bille, Inge Li Gørtz, and Frederik Rye Skjoldjensen.
  Theoretical Computer Science 905: 99-105 (2022).
  Conference version:
  

  Partial Sums on the Ultra-Wide Word RAM.
  Philip Bille, Inge Li Gørtz, and Frederik Rye Skjoldjensen.
  Proc. of the 16th Theory and Applications of Models of Computation (TAMC 2020).
  

• Approximation Algorithms for the A Priori Traveling Repairman.
  Fatemeh Navidi, Inge Li Gørtz, Viswanath Nagarjan.
  Operations Research Letters 48(5): 599-606 (2020)
  
  
• Space Efficient Construction of Lyndon Arrays in Linear Time.
  Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, and Eva Rotenberg.
  Proc. of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020).
  
  
• Decompressing Lempel-Ziv Compressed Text.
  Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, and Nicola Prezza.
  Proc. of the 31st Data Compression Conference (DCC 2020). [draft of full version]
  
  
• Top Tree Compression of Tries
  Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, and Oren Weimann.
  Proc. 30th International Symposium on Algorithms and Computation (ISAAC 2019).
  
  
• 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, and Søren Vind.
  Algorithmica 80(11): 3207-3224 (2018).
  Conference version:
  

  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, and Søren Vind.
  Proc. 27th International Symposium on Algorithms and Computation (ISAAC 2016).
  

• Finger Search in Grammar-Compressed Strings.
  Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, and Inge Li Gørtz.
  Theory Comput. Syst. 62(8): 1715-1735(2018).
  Conference version:
  

  Finger Search in Grammar-Compressed Strings.
  Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, and Inge Li Gørtz.
  Proc. 36th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016).
  

• A separation between RLSLPs and LZ77.
  Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza.
  J. Discrete Algorithms 50:36-39 (2018).
  
  
• Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing
  Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz and Hjalte Wedel Vildhøj.
  Theory Comput. Sci. 713: 66-77 (2018)
  Conference version:
  

  Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing
  Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz and Hjalte Wedel Vildhøj.
  Proc. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017).
  

• Compressed Communication Complexity of Longest Common Prefixes.
  Philip Bille, Mikko Berggren Etienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg.
  Proc. 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018).
  
  
• Subsequence Automata with Failure Transitions.
  Philip Bille, Inge Li Gørtz, and Frederik Rye Skjoldjensen.
  Journal of Discrete Algorithms, 2017.
  Conference version:
  

  Subsequence Automata with Failure Transitions.
  Philip Bille, Inge Li Gørtz, and Frederik Rye Skjoldjensen.
  Proceedings of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science, 2016.
  

• Tight Bounds for Top Tree Compression.
  Philip Bille, Finn Fernstrøm, and Inge Li Gørtz.
  Proc. 24th International Symposium on String Processing and Information Retrieval, 2017.
  
  
• Fast Dynamic Arrays.
  Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, and Inge Li Gørtz.
  Proc. 24th European Symposium on Algorithms, 2017.
  
  
• Immersive Algorithms: Better Visualization with Less Information.
  Philip Bille and Inge Li Gørtz.
  Proc. 22nd Innovation and Technology in Computer Science Education, 2017.
  
  
• Lempel-Ziv Compression in a Sliding Window
  Philip Bille, Patrick Hagge Cording, Johannes Fischer and Inge Li Gørtz.
  Proc. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
  
  
• Deterministic Indexing for Packed Strings
  Philip Bille, Inge Li Gørtz and Frederik Rye Skjoldjensen.
  Proc. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
  
  
• Space-Efficient Re-Pair Compression.
  Philip Bille, Inge Li Gørtz, and Nicola Prezza.
  Proc. of the 26th Data Compression Conference (DCC 2017). [draft of full version]
  
  
• Compressed Subsequence Matching and Packed Tree Coloring.
  Philip Bille, Patrick Hagge Cording and Inge Li Gørtz.
  Algorithmica, volume 77(2), pages 336-348, 2017..
  Conference version:
  

  Compressed Subsequence Matching and Packed Tree Coloring.
  Philip Bille, Patrick Hagge Cording and Inge Li Gørtz.
  Proceedings of the 25th Symposium on Combinatorial Pattern Matching (CPM 2014).

• Locating Depots for Capacitated Vehicle Routing.
  Inge Li Gørtz and Viswanath Nagarajan.
  Networks,Volume 68, Issue 2, September 2016, Pages: 94-103.
  Conference version:
  

  Locating Depots for Capacitated Vehicle Routing.
  Inge Li Gørtz and Viswanath Nagarajan.
  Proc. 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2011).
  

• Distance labeling schemes for trees.
  Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat.
  Proc. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016).
  
  
• Longest Common Extensions in Trees.
  Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, and Oren Weimann.
  Theoretical Computer Science. 638, p. 98-107, 2016.
  Conference version:
  

  Longest Common Extensions in Trees.
  Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, and Oren Weimann.
  Proceedings of the 26th Symposium on Combinatorial Pattern Matching (CPM 2015).

• Boxed Permutation Pattern Matching.
  Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, and Hjalte Wedel Vildhøj.
  Proceedings of the 27th Symposium on Combinatorial Pattern Matching, 2016.
  
  
• Sparse Text Indexing in Small Space
  Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, and Hjalte Wedel Vildhøj.
  ACM Transaction on Algorithms, volume 12, Issue 3, June 2016
  Conference version:
  

  Sparse Suffix Tree Construction with Small Space.
  Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, and Hjalte Wedel Vildhøj.
  Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP 2013).

• Capacitated Vehicle Routing with Non-Uniform Speeds.
  Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan and R Ravi.
  Mathematics of Operations Research, volume 41, issue 1, February 2016.
  Conference version:
  

  Capacitated Vehicle Routing with Non-Uniform Speeds
  Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan and R Ravi.
  Proc. 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011).

• Tree Compression with Top Trees.
  Philip Bille, Inge Li Gørtz, Gad Landau and Oren Weimann.
  Information and Computation, Volume 243, Pages 166-177, August 2015.
  Special issue on ICALP 2013.
  Conference version:
  

  Tree Compression with Top Trees.
  Philip Bille, Inge Li Gørtz, Gad Landau and Oren Weimann.
  Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP 2013) .

• Longest Common Extensions in Sublinear Space.
  Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, and Hjalte Wedel Vildhøj.
  Proceedings of the 26th Symposium on Combinatorial Pattern Matching (CPM 2015).
  
  
• Compressed Data Structures for Range Reporting.
  Philip Bille, Inge Li Gørtz, and Søren Vind.
  Proceedings of the 9th International Conference on Language and Automata Theory and Applications, pages 577-586 (LATA 2015).
  
  
• Minimum Makespan Multi-vehicle Dial-a-Ride.
  Inge Li Gørtz, Viswanath Nagarajan and R Ravi.
  ACM Transactions on Algorithms, Volume 11 Issue 3, January 2015 .
  Conference version:
  

  Minimum Makespan Multi-vehicle Dial-a-Ride. [pdf]
  Inge Li Gørtz, Viswanath Nagarajan and R Ravi.
  Proc. 17th European Symposium on Algorithms (ESA 2009).

• Indexing Motion Detection Data for Surveillance Video.
  Søren Vind, Philip Bille, and Inge Li Gørtz.
  Proceedings of the International Symposium on Multimedia, pages 24-27, 2014.
  
  
• Substring Range Reporting.
  Philip Bille and Inge Li Gørtz.
  In Algorithmica Volume 69, Issue 2 (2014), Page 384-396.
  Draft of full version available as Arxiv preprint 1108.3683 [pdf].
  Conference version:
  

  Substring Range Reporting.
  Philip Bille and Inge Li Gørtz.
  Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011).

• Fingerprints in Compressed Strings.
  Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, and Søren Vind.
  Journal of Computer and System Sciences, 86: 171-180 (2017).
  Conference version:
  

  Fingerprints in Compressed Strings.
  Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, and Søren Vind.
  Proc. of the 13th Algorithms and Data Structures Symposium (WADS 2013).

• Time-Space Trade-Offs for Longest Common Extensions
  Philip Bille, Inge Li Gørtz, Benjamin Sach and Hjalte Wedel Vildhøj.
  In Journal of Discrete Algorithms Volume 25, March, 2014 Pages 42-50 .
  Conference version:
  

  Time-Space Trade-Offs for Longest Common Extensions
  Philip Bille, Inge Li Gørtz, Benjamin Sach and Hjalte Wedel Vildhøj.
  Proc. 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012).

• Union-Find with Constant Time Deletions.
  Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, and Uri Zwick.
  ACM Transactions on Algorithms 11(1): 6, 2014.
  Conference version:
  

  Union-Find with Constant Time Deletions. [pdf ]
  Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, and Uri Zwick.
  Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005).

• String Indexing for Patterns with Wildcards
  Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj and Søren Vind.
  Theory of Computing Systems, volume 55(1), pages 41-60, 2014.
  Conference version:
  

  String Indexing for Patterns with Wildcards
  Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj and Søren Vind.
  Proc. 13th Scandinavian Workshop on Algorithm Theory (SWAT 2012).

• Compact q-gram Profiling of Compressed Strings.
  Philip Bille, Patrick Hagge Cording, and Inge Li Gørtz.
  Proceedings of the 24th Symposium on Combinatorial Pattern Matching (CPM 2013).
  
  
• Stochastic Vehicle Routing with Recourse
  Inge Li Gørtz, Viswanath Nagarajan and Rishi Saket
  Proc. 39th International Colloquium on Automata, Languages and Programming (ICALP 2012) .
  Draft of full version available as Arxiv preprint 1202.5797v2 [pdf]
  
  
• String Matching with Variable Length Gaps.
  Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, and David Kofoed Wind.
  Theoretical Computer Science 443 (2012) 25-34.
  Conference version:
  

  String Matching with Variable Length Gaps. [pdf]
  Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, and David Kofoed Wind.
  Proc. 17th Symposium on String Processing and Information Retrieval (SPIRE 2010).

• Fast Arc-Annotated Subsequence Matching in Linear Space [pdf]
  Philip Bille and Inge Li Gørtz.
  Algorithmica (2012) 62: 209-233.
  Conference version:
  

  Fast Arc-Annotated Subsequence Matching in Linear Space [pdf]
  Philip Bille and Inge Li Gørtz.
  Proc. 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010).

• Longest Common Extensions via Fingerprinting. [pdf]
  Philip Bille, Inge Li Gørtz and Jesper Kristensen.
  Proc. 6th LATA, 2012.
  
  
• The Tree Inclusion Problem: In Linear Space and Faster.
  Philip Bille and Inge Li Gørtz.
  ACM Transactions on Algorithms 7(3): Article 38. July 2011.
  Draft of full version available as Arxiv preprint cs.DS/0608124 [pdf].
  Conference version:
  

  The Tree Inclusion Problem: In Optimal Space and Faster. [pdf ]
  Philip Bille and Inge Li Gørtz.
  Proc. 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005).

• Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts.
  Philip Bille, Rolf Fagerberg, and Inge Li Gørtz.
  ACM Transactions on Algorithms 6(1), pages 1- 14, 2009.
  Conference version:
  

  Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts [pdf]
  Philip Bille, Rolf Fagerberg, and Inge Li Gørtz.
  Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007).

• Finding Well-Balanced Pairs of Edge-Disjoint Trees in Edge-Weighted Graphs.
  Jørgen Bang-Jensen, Daniel Goncalves, and Inge Li Gørtz.
  Discrete Optimization 4 (3-4): 334-348.
  Elsevier, December 2007.
  
  
• Hardness of Preemptive Finite Capacity Dial-a-Ride. [pdf]
  Inge Li Gørtz.
  Proc. 9th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006).
  Full version available as technical report:
  

  Hardness of Preemptive Finite Capacity Dial-a-Ride.
  Inge Li Gørtz.
  IMADA Preprints 2006 No. 4.
  

• Matching Subsequences in Trees. [pdf]
  Philip Bille and Inge Li Gørtz.
  Journal of Discrete Algorithms 7 (3): 306-314, Special Issue on the 6th Italian Conference on Algorithms and Complexity (CIAC 2006).
  Elsevier, September 2009.
  Conference version:
  

  Matching Subsequences in Trees. [pdf]
  Philip Bille and Inge Li Gørtz.
  Proc. 6th Conference on Algorithms and Complexity (CIAC 2006).
  

• Asymmetric k-Center with Minimum Coverage.
  Inge Li Gørtz.
  Information Processing Letters 105 (2): 144-149.
  Elsevier, February 2008.
  Other versions:
  

  Asymmetric k-Center with Minimum Coverage. [ps ,pdf ]
  Inge Li Gørtz.
  Technical report TR-2005-66.
  IT University Technical Report Series, July 2005.

• Asymmetry in k-Center Variants. [pdf]
  Inge Li Gørtz and Anthony Wirth.
  Theoretical Computer Science 361 (2006) 188-199, Special Issue on Approximation and Online Algorithms.
  Conferene version:
  

  Asymmetry in k-Center Variants.
  Inge Li Gørtz and Anthony Wirth.
  Proc. 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2003).

• Time and Space Efficient Multi-Method Dispatching. [pdf]
  Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, and Theis Rauhe.
  Proc. 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002).
  Springer Verlag, Berlin, 2002.
  
  
• Strong Normalization from Weak Normalization by Translation into the lambda-I-calculus.
  Inge Li Gørtz, Signe Reuss, and Morten Heine Sørensen.
  Higher-Order and Symbolic Computation 16 (3): 253-285.
  Kluwer Academic Publishers, September 2003.
  
  

Other

• 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. Proceedings.
  Editors: Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman.
  ESA Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, LIPIcs 274 978-3-95977-295-2.
  
  
• 3rd Symposium on Simplicity in Algorithms, SOSA@SODA 2020, Salt Lake City, UT, USA, January 6-7, 2020. Proceedings
  Editors: Martin Farach-Colton and Inge Li Gørtz.
  SIAM 2020, ISBN 978-1-61197-601-4.
  
  
• 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark. Proceedings.
  Editors: Inge Li Gørtz and Oren Weimann
  CPM Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, LIPIcs 161 978-3-95977-149-8.
  
  
• Algorithm Theory-SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings.
  Editors: R. Ravi and Inge Li Gørtz.
  Lecture Notes in Computer Science, volume 8503, 2014.
  
  
• Active Learning in Large Classes.
  Inge Li Gørtz.
  7th International CDIO Conference (CDIO 2011).
  
  
• Topics in Algorithms: Data Structures on Trees and Approximation Algorithms on Graphs. [pdf ]
  Ph.D. Thesis. Inge Li Gørtz.