| 2018 | ALENEX | Computing Floods Caused by Non-Uniform Sea-Level Rise. | Lars Arge, Yujin Shin, Constantinos Tsirogiannis |
| 2017 | ALENEX | I/O-Efficient Event Based Depression Flood Risk. | Lars Arge, Mathias Rav, Sarfraz Raza, Morten Revsbk |
| 2014 | ALENEX | Simplifying massive planar subdivisions. | Lars Arge, Jakob Truelsen, Jungwoo Yang |
| 2013 | ESA | An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters. | Lars Arge, Gerth Stlting Brodal, Jakob Truelsen, Constantinos Tsirogiannis |
| 2013 | ISAAC | RAM-Efficient External Memory Sorting. | Lars Arge, Mikkel Thorup |
| 2013 | SODA | Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. | Freek van Walderveen, Norbert Zeh, Lars Arge |
| 2013 | WADS | On (Dynamic) Range Minimum Queries in External Memory. | Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava |
| 2012 | ESA | Simplifying Massive Contour Maps. | Lars Arge, Lasse Deleuran, Thomas Mlhave, Morten Revsbk, Jakob Truelsen |
| 2011 | ICDT | (Approximate) uncertain skylines. | Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips |
| 2009 | FOCS | Orthogonal Range Reporting in Three and Higher Dimensions. | Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen |
| 2009 | ISAAC | I/O-Efficient Contour Tree Simplification. | Lars Arge, Morten Revsbk |
| 2009 | PODS | Worst-case efficient range search indexing: invited tutorial. | Lars Arge |
| 2008 | ESA | Cache-Oblivious Red-Blue Line Segment Intersection. | Lars Arge, Thomas Mlhave, Norbert Zeh |
| 2008 | SPAA | Fundamental parallel algorithms for private-cache chip multiprocessors. | Lars Arge, Michael T. Goodrich, Michael J. Nelson, Nodari Sitchinava |
| 2006 | FOCS | Improved Dynamic Planar Point Location. | Lars Arge, Gerth Stlting Brodal, Loukas Georgiadis |
| 2005 | ESA | I/O-Efficient Construction of Constrained Delaunay Triangulations. | Pankaj K. Agarwal, Lars Arge, Ke Yi |
| 2005 | ISAAC | External Data Structures for Shortest Path Queries on Planar Digraphs. | Lars Arge, Laura Toma |
| 2005 | PODC | Skip-webs: efficient distributed data structures for multi-dimensional data sets. | Lars Arge, David Eppstein, Michael T. Goodrich |
| 2005 | SODA | An optimal dynamic interval stabbing-max data structure? | Pankaj K. Agarwal, Lars Arge, Ke Yi |
| 2004 | COCOON | External Geometric Data Structures. | Lars Arge |
| 2004 | ESA | Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu |
| 2004 | ESA | Optimal External Memory Planar Point Enclosure. | Lars Arge, Vasilis Samoladas, Ke Yi |
| 2004 | ICALP | External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. | Lars Arge, Ulrich Meyer, Laura Toma |
| 2004 | SIGMOD | The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. | Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi |
| 2003 | ALENEX | Implementing External Memory Algorithms and Data Structures (Abstract of Invited talk). | Lars Arge |
| 2003 | ALENEX | I/O-efficient Point Location Using Persistent B-Trees. | Lars Arge, Andrew Danner, Sha-Mayn Teh |
| 2003 | ESA | I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. | Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi |
| 2003 | FOCS | I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. | Lars Arge, Norbert Zeh |
| 2003 | ICDT | CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. | Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge |
| 2003 | SPAA | I/O-efficient topological sorting of planar DAGs. | Lars Arge, Laura Toma, Norbert Zeh |
| 2002 | ESA | Implementing I/O-efficient Data Structures Using TPIE. | Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
| 2002 | STOC | Cache-oblivious priority queue and graph algorithm applications. | Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro |
| 2001 | ESA | External Memory Data Structures. | Lars Arge |
| 2001 | ICALP | A Framework for Index Bulk Loading and Dynamization. | Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter |
| 2001 | WADS | Time Responsive External Data Structures for Moving Points. | Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold |
| 2001 | WADS | On External-Memory Planar Depth First Search. | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh |
| 2000 | EDBT | A Unified Approach for Indexed and Non-Indexed Spatial Joins. | Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jan Vahrenhold, Jeffrey Scott Vitter |
| 2000 | PODS | Indexing Moving Points. | Pankaj K. Agarwal, Lars Arge, Jeff Erickson |
| 1999 | ALENEX | Efficient Bulk Operations on Dynamic R-trees. | Lars Arge, Klaus H. Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter |
| 1999 | PODS | On Two-Dimensional Indexability and Optimal Range Search Indexing. | Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter |
| 1999 | SODA | I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. | Pankaj K. Agarwal, Lars Arge, Gerth Stlting Brodal, Jeffrey Scott Vitter |
| 1998 | PODS | Efficient Searching with Linear Constraints. | Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter |
| 1998 | SODA | I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). | Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter |
| 1998 | SODA | Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). | Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter |
| 1998 | VLDB | Scalable Sweeping-Based Spatial Join. | Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter |
| 1997 | STOC | On Sorting Strings in External Memory (Extended Abstract). | Lars Arge, Paolo Ferragina, Roberto Grossi, Jeffrey Scott Vitter |
| 1996 | FOCS | Optimal Dynamic Interval Management in External Memory (extended abstract). | Lars Arge, Jeffrey Scott Vitter |
| 1995 | ESA | External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). | Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vitter |
| 1995 | ISAAC | The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. | Lars Arge |
| 1995 | WADS | The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). | Lars Arge |
| 1993 | WADS | A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. | Lars Arge, Mikael B. Knudsen, Kirsten Larsen |