External Memory Algorithms for Outerplanar Graphs. - Anil Maheshwari; Norbert Zeh (ISAAC, 1999)

I/O-Efficient Well-Separated Pair Decomposition and Its Applications. - Sathish Govindarajan; Tamás Lukovszki; Anil Maheshwari; Norbert Zeh (ESA, 2000)

I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. - Tamás Lukovszki; Anil Maheshwari; Norbert Zeh (FSTTCS, 2001)

On Finding Minimum Deadly Sets for Directed Networks. - Norbert Zeh; Nicola Santoro (SIROCCO, 2001)

I/O-Efficient Shortest Path Queries in Geometric Spanners. - Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (WADS, 2001)

On reverse nearest neighbor queries. - Anil Maheshwari; Jan Vahrenhold; Norbert Zeh (CCCG, 2002)

A Survey of Techniques for Designing I/O-Efficient Algorithms. - Anil Maheshwari; Norbert Zeh (Algorithms for Memory Hierarchies, 2002)

I/O-Efficient Algorithms for Sparse Graphs. - Laura Toma; Norbert Zeh (Algorithms for Memory Hierarchies, 2002)

I/O-optimal algorithms for planar graphs using separators. - Anil Maheshwari; Norbert Zeh (SODA, 2002)

I/O-Efficient Undirected Shortest Paths. - Ulrich Meyer 001; Norbert Zeh (ESA, 2003)

I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. - Lars Arge; Norbert Zeh (FOCS, 2003)

I/O-efficient topological sorting of planar DAGs. - Lars Arge; Laura Toma; Norbert Zeh (SPAA, 2003)

An external memory data structure for shortest path queries. - David A. Hutchinson; Anil Maheshwari; Norbert Zeh (Discret. Appl. Math., 2003)

On External-Memory Planar Depth First Search. - Lars Arge; Ulrich Meyer 001; Laura Toma; Norbert Zeh (J. Graph Algorithms Appl., 2003)

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. - Gerth Stølting Brodal; Rolf Fagerberg; Ulrich Meyer 001; Norbert Zeh (SWAT, 2004)

Connectivity of Graphs Under Edge Flips. - Norbert Zeh (SWAT, 2004)

Approximating geometric bottleneck shortest paths. - Prosenjit Bose; Anil Maheshwari; Giri Narasimhan; Michiel H. M. Smid; Norbert Zeh (Comput. Geom., 2004)

I/O-Optimal Algorithms for Outerplanar Graphs. - Anil Maheshwari; Norbert Zeh (J. Graph Algorithms Appl., 2004)

Cache-Oblivious Planar Shortest Paths. - Hema Jampala; Norbert Zeh (ICALP, 2005)

Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. - Lars Arge; Norbert Zeh (SCG, 2006)

I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. - Ulrich Meyer 001; Norbert Zeh (ESA, 2006)

Politician's Firefighting. - Allan E. Scott; Ulrike Stege; Norbert Zeh (ISAAC, 2006)

I/O-Efficient Well-Separated Pair Decomposition and Applications. - Sathish Govindarajan; Tamás Lukovszki; Anil Maheshwari; Norbert Zeh (Algorithmica, 2006)

Boundary-optimal Triangulation Flooding. - Richard J. Nowakowski; Norbert Zeh (Int. J. Comput. Geom. Appl., 2006)

Adaptive Tuple Differential Coding. - Jean-Paul Deveaux; Andrew Rau-Chaplin; Norbert Zeh (DEXA, 2007)

Parallel Computation of Skyline Queries. - Adan Cosgaya-Lozano; Andrew Rau-Chaplin; Norbert Zeh (HPCS, 2007)

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. - Luca Allulli; Peter Lichodzijewski; Norbert Zeh (SODA, 2007)

Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions. - Oliver Baltzer; Andrew Rau-Chaplin; Norbert Zeh (J. Digit. Inf. Manag., 2007)

Cache-Oblivious Red-Blue Line Segment Intersection. - Lars Arge; Thomas Mølhave; Norbert Zeh (ESA, 2008)

NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. - Glenn Hickey; Paz Carmi; Anil Maheshwari; Norbert Zeh (WABI, 2008)

I/O-efficient algorithms for computing planar geometric spanners. - Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (Comput. Geom., 2008)

I/O-Efficient Planar Separators. - Anil Maheshwari; Norbert Zeh (SIAM J. Comput., 2008)

I/O-model. - Norbert Zeh (Encyclopedia of Algorithms, 2008)

Relaxed Gabriel Graphs. - Prosenjit Bose; Jean Cardinal; Sébastien Collette; Erik D. Demaine; Belén Palop; Perouz Taslakian; Norbert Zeh (CCCG, 2009)

I/O and Space-Efficient Path Traversal in Planar Graphs. - Craig Dillabaugh; Meng He 001; Anil Maheshwari; Norbert Zeh (ISAAC, 2009)

Finding optimal parameters for edit distance based sequence classification is NP-hard. - Vlado Keselj; Haibin Liu; Norbert Zeh; Christian Blouin; Chris Whidden (KDD Workshop on Statistical and Relational Learning in Bioinformatics, 2009)

A Unifying View on Approximation and FPT of Agreement Forests. - Chris Whidden; Norbert Zeh (WABI, 2009)

A Heuristic Strong Connectivity Algorithm for Large Graphs. - Adan Cosgaya-Lozano; Norbert Zeh (SEA, 2009)

I/O-Efficient Algorithms for Graphs of Bounded Treewidth. - Anil Maheshwari; Norbert Zeh (Algorithmica, 2009)

Geometric spanners with small chromatic number. - Prosenjit Bose; Paz Carmi; Mathieu Couture; Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (Comput. Geom., 2009)

I/O-efficient computation of water flow across a terrain. - Lars Arge; Morten Revsbæk; Norbert Zeh (SCG, 2010)

Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). - Deepak Ajwani; Nodari Sitchinava; Norbert Zeh (ESA (2), 2010)

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. - Chris Whidden; Robert G. Beiko; Norbert Zeh (SEA, 2010)

A general approach for cache-oblivious range reporting and approximate range counting. - Peyman Afshani; Chris H. Hamilton; Norbert Zeh (Comput. Geom., 2010)

Editorial. - Norbert Zeh (Comput. Geom., 2010)

Engineering a Topological Sorting Algorithm for Massive Graphs. - Deepak Ajwani; Adan Cosgaya-Lozano; Norbert Zeh (ALENEX, 2011)

I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. - Deepak Ajwani; Nodari Sitchinava; Norbert Zeh (IPDPS, 2011)

Ordered and Unordered Top-K Range Reporting in Large Data Sets. - Peyman Afshani; Gerth Stølting Brodal; Norbert Zeh (SODA, 2011)

Improved Space Bounds for Cache-Oblivious Range Reporting. - Peyman Afshani; Norbert Zeh (SODA, 2011)

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests - Chris Whidden; Robert G. Beiko; Norbert Zeh (CoRR, 2011)

Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space. - Peyman Afshani; Chris H. Hamilton; Norbert Zeh (Discret. Comput. Geom., 2011)

Low-interference networks in metric spaces of bounded doubling dimension. - Anil Maheshwari; Michiel H. M. Smid; Norbert Zeh (Inf. Process. Lett., 2011)

A topological sorting algorithm for large graphs. - Deepak Ajwani; Adan Cosgaya-Lozano; Norbert Zeh (ACM J. Exp. Algorithmics, 2011)

An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. - Glenn Hickey; Mathieu Blanchette; Paz Carmi; Anil Maheshwari; Norbert Zeh (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Lower Bounds for Sorted Geometric Queries in the I/O Model. - Peyman Afshani; Norbert Zeh (ESA, 2012)

On the Advice Complexity of Buffer Management. - Reza Dorrigiv; Meng He 001; Norbert Zeh (ISAAC, 2012)

A Space-Efficient Framework for Dynamic Point Location. - Meng He 001; Patrick K. Nicholson; Norbert Zeh (ISAAC, 2012)

A parallel buffer tree. - Nodari Sitchinava; Norbert Zeh (SPAA, 2012)

I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. - Ulrich Meyer 001; Norbert Zeh (ACM Trans. Algorithms, 2012)

QuPARA: Query-driven large-scale portfolio aggregate risk analysis on MapReduce. - Andrew Rau-Chaplin; Blesson Varghese; Duane Wilson; Zhimin Yao; Norbert Zeh (IEEE BigData, 2013)

Building a scalable spatial OLAP system. - Oliver Baltzer; Andrew Rau-Chaplin; Norbert Zeh (SAC, 2013)

Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. - Freek van Walderveen; Norbert Zeh; Lars Arge (SODA, 2013)

Fixed-Parameter Algorithms for Maximum Agreement Forests. - Chris Whidden; Robert G. Beiko; Norbert Zeh (SIAM J. Comput., 2013)

Efficient Data Structures for Risk Modelling in Portfolios of Catastrophic Risk Using MapReduce. - Andrew Rau-Chaplin; Zhimin Yao; Norbert Zeh (ICCS, 2014)

Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. - Meng He 001; Ganggui Tang; Norbert Zeh (ISAAC, 2014)

Hybridization Number on Three Trees. - Leo van Iersel; Steven Kelk; Nela Lekic; Chris Whidden; Norbert Zeh (CoRR, 2014)

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees. - Chris Whidden; Robert G. Beiko; Norbert Zeh (Algorithmica, 2016)

Introduction to Special Issue ALENEX 2013. - Peter Sanders 001; Norbert Zeh (ACM J. Exp. Algorithmics, 2016)

Hybridization Number on Three Rooted Binary Trees is EPT. - Leo van Iersel; Steven Kelk; Nela Lekic; Chris Whidden; Norbert Zeh (SIAM J. Discret. Math., 2016)

I/O-Model. - Norbert Zeh; Ulrich Meyer 001 (Encyclopedia of Algorithms, 2016)

High-performance Computational Framework for Phrase Relatedness. - Zichu Ai; Jie Mei 005; Abidalrahman Moh'd; Norbert Zeh; Meng He 001; Evangelos E. Milios (DocEng, 2017)

Computing Maximum Agreement Forests without Cluster Partitioning is Folly. - Zhijiang Li; Norbert Zeh (ESA, 2017)

I/O-Efficient Path Traversal in Succinct Planar Graphs. - Craig Dillabaugh; Meng He 001; Anil Maheshwari; Norbert Zeh (Algorithmica, 2017)

Parallel construction of succinct trees. - José Fuentes-Sepúlveda; Leo Ferres; Meng He 001; Norbert Zeh (Theor. Comput. Sci., 2017)

Polynomial-Time Algorithms for Phylogenetic Inference Problems. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (AlCoB, 2018)

Improving Short Text Clustering by Similarity Matrix Sparsification. - Md. Rashadul Hasan Rakib; Magdalena Jankowska; Norbert Zeh; Evangelos E. Milios (DocEng, 2018)

Maximal and Convex Layers of Random Point Sets. - Meng He 001; Cuong P. Nguyen; Norbert Zeh (LATIN, 2018)

Categorizing Online Harassment on Twitter. - Mozhgan Saeidi; Samuel Bruno da Silva Sousa; Evangelos E. Milios; Norbert Zeh; Lilian Berton (PKDD/ECML Workshops (2), 2019)

Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG). - Meng He 001; Norbert Zeh (Comput. Geom., 2019)

Efficient location-level risk analytics. - Neil Burke; Oliver Baltzer; Norbert Zeh (CASCON, 2020)

Short Text Stream Clustering via Frequent Word Pairs and Reassignment of Outliers to Clusters. - Md. Rashadul Hasan Rakib; Norbert Zeh; Evangelos E. Milios (DocEng, 2020)

Enhancement of Short Text Clustering by Iterative Classification. - Md. Rashadul Hasan Rakib; Norbert Zeh; Magdalena Jankowska; Evangelos E. Milios (NLDB, 2020)

Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (IEEE ACM Trans. Comput. Biol. Bioinform., 2020)

Efficient clustering of short text streams using online-offline clustering. - Md. Rashadul Hasan Rakib; Norbert Zeh; Evangelos E. Milios (DocEng, 2021)

Contextualized Knowledge Base Sense Embeddings in Word Sense Disambiguation. - Mozhgan Saeidi; Evangelos E. Milios; Norbert Zeh (ICDAR Workshops (2), 2021)

Graph Representation Learning in Document Wikification. - Mozhgan Saeidi; Evangelos E. Milios; Norbert Zeh (ICDAR Workshops (2), 2021)

Graph Convolutional Networks for Categorizing Online Harassment on Twitter. - Mozhgan Saeidi; Evangelos E. Milios; Norbert Zeh (ICMLA, 2021)

A unifying characterization of tree-based networks and orchard networks using cherry covers. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (Adv. Appl. Math., 2021)

Biomedical Word Sense Disambiguation with Contextualized Representation Learning. - Mozhgan Saeidi; Evangelos E. Milios; Norbert Zeh (WWW (Companion Volume), 2022)

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (Algorithmica, 2022)

A Near-Linear Kernel for Two-Parsimony Distance. - Elise Deen; Leo van Iersel; Remie Janssen; Mark Jones 001; Yuki Murakami; Norbert Zeh (CoRR, 2022)

Sum-of-Local-Effects Data Structures for Separable Graphs. - Xing Lyu; Travis Gagie; Meng He 001; Yakov Nekrich; Norbert Zeh (COCOON (1), 2023)

Context-enhanced concept disambiguation in Wikification. - Mozhgan Saeidi; Kaveh Mahdaviani; Evangelos E. Milios; Norbert Zeh (Intell. Syst. Appl., 2023)

Another virtue of wavelet forests. - Aaron Hong; Christina Boucher 001; Travis Gagie; Yansong Li; Norbert Zeh (DCC, 2024)

A Wild Sheep Chase Through an Orchard. - Jordan Dempsey; Leo van Iersel; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (CoRR, 2024)

A near-linear kernel for bounded-state parsimony distance. - Elise Deen; Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (J. Comput. Syst. Sci., 2024)

A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees. - Jordan Dempsey; Leo van Iersel; Mark Jones 001; Norbert Zeh (Inf. Process. Lett., 2025)