Norbert Zeh

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 32

Top Venues

Publications

Aaron Hong, Christina Boucher, Travis Gagie, Yansong Li, Norbert Zeh
Another virtue of wavelet forests. DCC (2024)
Elise Deen, Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A near-linear kernel for bounded-state parsimony distance. J. Comput. Syst. Sci. 140 (2024)
Christina Boucher, Travis Gagie, Aaron Hong, Yansong Li, Norbert Zeh
Another virtue of wavelet forests? CoRR (2023)
Mozhgan Saeidi, Kaveh Mahdaviani, Evangelos E. Milios, Norbert Zeh
Context-enhanced concept disambiguation in Wikification. Intell. Syst. Appl. 19 (2023)
Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
Sum-of-Local-Effects Data Structures for Separable Graphs. COCOON (1) (2023)
Xing Lyu, Travis Gagie, Meng He, Yakov Nekrich, Norbert Zeh
Sum-of-Local-Effects Data Structures for Separable Graphs. CoRR (2023)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. Algorithmica 84 (4) (2022)
Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh
Biomedical Word Sense Disambiguation with Contextualized Representation Learning. WWW (Companion Volume) (2022)
Elise Deen, Leo van Iersel, Remie Janssen, Mark Jones, Yuki Murakami, Norbert Zeh
A Near-Linear Kernel for Two-Parsimony Distance. CoRR (2022)
Md Rashadul Hasan Rakib, Norbert Zeh, Evangelos E. Milios
Efficient clustering of short text streams using online-offline clustering. DocEng (2021)
Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh
Graph Representation Learning in Document Wikification. ICDAR Workshops (2) (2021)
Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh
Graph Convolutional Networks for Categorizing Online Harassment on Twitter. ICMLA (2021)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A unifying characterization of tree-based networks and orchard networks using cherry covers. Adv. Appl. Math. 129 (2021)
Mozhgan Saeidi, Evangelos E. Milios, Norbert Zeh
Contextualized Knowledge Base Sense Embeddings in Word Sense Disambiguation. ICDAR Workshops (2) (2021)
Md. Rashadul Hasan Rakib, Norbert Zeh, Evangelos E. Milios
Short Text Stream Clustering via Frequent Word Pairs and Reassignment of Outliers to Clusters. DocEng (2020)
Neil Burke, Oliver Baltzer, Norbert Zeh
Efficient location-level risk analytics. CASCON (2020)
Md. Rashadul Hasan Rakib, Norbert Zeh, Magdalena Jankowska, Evangelos E. Milios
Enhancement of Short Text Clustering by Iterative Classification. CoRR (2020)
Md. Rashadul Hasan Rakib, Norbert Zeh, Magdalena Jankowska, Evangelos E. Milios
Enhancement of Short Text Clustering by Iterative Classification. NLDB (2020)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. IEEE ACM Trans. Comput. Biol. Bioinform. 17 (1) (2020)
Meng He, Norbert Zeh
Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG). Comput. Geom. 77 (2019)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. CoRR (2019)
Mozhgan Saeidi, Samuel Bruno da Silva Sousa, Evangelos E. Milios, Norbert Zeh, Lilian Berton
Categorizing Online Harassment on Twitter. PKDD/ECML Workshops (2) (2019)
Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh
Polynomial-Time Algorithms for Phylogenetic Inference Problems. AlCoB (2018)
Meng He, Cuong P. Nguyen, Norbert Zeh
Maximal and Convex Layers of Random Point Sets. LATIN (2018)
Md. Rashadul Hasan Rakib, Magdalena Jankowska, Norbert Zeh, Evangelos E. Milios
Improving Short Text Clustering by Similarity Matrix Sparsification. DocEng (2018)
José Fuentes-Sepúlveda, Leo Ferres, Meng He, Norbert Zeh
Parallel construction of succinct trees. Theor. Comput. Sci. 700 (2017)
Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
I/O-Efficient Path Traversal in Succinct Planar Graphs. Algorithmica 77 (3) (2017)
Zhijiang Li, Norbert Zeh
Computing Maximum Agreement Forests without Cluster Partitioning is Folly. ESA (2017)
Zichu Ai, Jie Mei, Abidalrahman Moh'd, Norbert Zeh, Meng He, Evangelos E. Milios
High-performance Computational Framework for Phrase Relatedness. DocEng (2017)
Chris Whidden, Robert G. Beiko, Norbert Zeh
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees. Algorithmica 74 (3) (2016)
Peter Sanders, Norbert Zeh
Introduction to Special Issue ALENEX 2013. ACM J. Exp. Algorithmics 21 (1) (2016)
Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh
Hybridization Number on Three Rooted Binary Trees is EPT. SIAM J. Discret. Math. 30 (3) (2016)
Leo Ferres, José Fuentes-Sepúlveda, Meng He, Norbert Zeh
Parallel Construction of Succinct Trees. SEA (2015)
Meng He, Ganggui Tang, Norbert Zeh
Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. ISAAC (2014)
Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh
Hybridization Number on Three Trees. CoRR (2014)
Andrew Rau-Chaplin, Zhimin Yao, Norbert Zeh
Efficient Data Structures for Risk Modelling in Portfolios of Catastrophic Risk Using MapReduce. ICCS (2014)
Chris Whidden, Robert G. Beiko, Norbert Zeh
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees CoRR (2013)
Andrew Rau-Chaplin, Blesson Varghese, Duane Wilson, Zhimin Yao, Norbert Zeh
QuPARA: Query-Driven Large-Scale Portfolio Aggregate Risk Analysis on MapReduce. CoRR (2013)
Chris Whidden, Robert G. Beiko, Norbert Zeh
Fixed-Parameter Algorithms for Maximum Agreement Forests. SIAM J. Comput. 42 (4) (2013)
Freek van Walderveen, Norbert Zeh, Lars Arge
Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs. SODA (2013)
Andrew Rau-Chaplin, Blesson Varghese, Duane Wilson, Zhimin Yao, Norbert Zeh
QuPARA: Query-driven large-scale portfolio aggregate risk analysis on MapReduce. IEEE BigData (2013)
Oliver Baltzer, Andrew Rau-Chaplin, Norbert Zeh
Building a scalable spatial OLAP system. SAC (2013)
Reza Dorrigiv, Meng He, Norbert Zeh
On the Advice Complexity of Buffer Management. ISAAC (2012)
Meng He, Patrick K. Nicholson, Norbert Zeh
A Space-Efficient Framework for Dynamic Point Location. ISAAC (2012)
Nodari Sitchinava, Norbert Zeh
A parallel buffer tree. SPAA (2012)
Ulrich Meyer, Norbert Zeh
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. ACM Trans. Algorithms 8 (3) (2012)
Peyman Afshani, Norbert Zeh
Lower Bounds for Sorted Geometric Queries in the I/O Model. ESA (2012)
Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh
Ordered and Unordered Top-K Range Reporting in Large Data Sets. SODA (2011)
Peyman Afshani, Norbert Zeh
Improved Space Bounds for Cache-Oblivious Range Reporting. SODA (2011)
Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh
Engineering a Topological Sorting Algorithm for Massive Graphs. ALENEX (2011)
Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
Low-interference networks in metric spaces of bounded doubling dimension. Inf. Process. Lett. 111 (23-24) (2011)
Chris Whidden, Robert G. Beiko, Norbert Zeh
Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests CoRR (2011)
Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh
A topological sorting algorithm for large graphs. ACM J. Exp. Algorithmics 17 (1) (2011)
Deepak Ajwani, Nodari Sitchinava, Norbert Zeh
I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. IPDPS (2011)
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space. Discret. Comput. Geom. 45 (4) (2011)
Glenn Hickey, Mathieu Blanchette, Paz Carmi, Anil Maheshwari, Norbert Zeh
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss. IEEE ACM Trans. Comput. Biol. Bioinform. 8 (2) (2011)
Norbert Zeh
Editorial. Comput. Geom. 43 (4) (2010)
Deepak Ajwani, Nodari Sitchinava, Norbert Zeh
Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). ESA (2) (2010)
Lars Arge, Morten Revsbæk, Norbert Zeh
I/O-efficient computation of water flow across a terrain. SCG (2010)
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
A general approach for cache-oblivious range reporting and approximate range counting. Comput. Geom. 43 (8) (2010)
Chris Whidden, Robert G. Beiko, Norbert Zeh
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. SEA (2010)
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Belén Palop, Perouz Taslakian, Norbert Zeh
Relaxed Gabriel Graphs. CCCG (2009)
Adan Cosgaya-Lozano, Norbert Zeh
A Heuristic Strong Connectivity Algorithm for Large Graphs. SEA (2009)
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
Cache-oblivious range reporting with optimal queries requires superlinear space. SCG (2009)
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
A general approach for cache-oblivious range reporting and approximate range counting. SCG (2009)
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
Geometric spanners with small chromatic number. Comput. Geom. 42 (2) (2009)
Craig Dillabaugh, Meng He, Anil Maheshwari, Norbert Zeh
I/O and Space-Efficient Path Traversal in Planar Graphs. ISAAC (2009)
Vlado Keselj, Haibin Liu, Norbert Zeh, Christian Blouin, Chris Whidden
Finding optimal parameters for edit distance based sequence classification is NP-hard. KDD Workshop on Statistical and Relational Learning in Bioinformatics (2009)
Anil Maheshwari, Norbert Zeh
I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54 (3) (2009)
Chris Whidden, Norbert Zeh
A Unifying View on Approximation and FPT of Agreement Forests. WABI (2009)
Anil Maheshwari, Norbert Zeh
I/O-Efficient Planar Separators. SIAM J. Comput. 38 (3) (2008)
Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem CoRR (2008)
Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh
NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI (2008)
Lars Arge, Thomas Mølhave, Norbert Zeh
Cache-Oblivious Red-Blue Line Segment Intersection. ESA (2008)
Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40 (3) (2008)
Adan Cosgaya-Lozano, Andrew Rau-Chaplin, Norbert Zeh
Parallel Computation of Skyline Queries. HPCS (2007)
Luca Allulli, Peter Lichodzijewski, Norbert Zeh
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. SODA (2007)
Jean-Paul Deveaux, Andrew Rau-Chaplin, Norbert Zeh
Adaptive Tuple Differential Coding. DEXA (2007)
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
Geometric Spanners with Small Chromatic Number. WAOA (2007)
Oliver Baltzer, Andrew Rau-Chaplin, Norbert Zeh
Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions. J. Digit. Inf. Manag. 5 (4) (2007)
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh
Geometric Spanners With Small Chromatic Number CoRR (2007)
Richard J. Nowakowski, Norbert Zeh
Boundary-optimal Triangulation Flooding. Int. J. Comput. Geom. Appl. 16 (2-3) (2006)
Allan E. Scott, Ulrike Stege, Norbert Zeh
Politician's Firefighting. ISAAC (2006)
Ulrich Meyer, Norbert Zeh
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA (2006)
Lars Arge, Norbert Zeh
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. SCG (2006)
Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh
I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45 (4) (2006)
Hema Jampala, Norbert Zeh
Cache-Oblivious Planar Shortest Paths. ICALP (2005)
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
Approximating geometric bottleneck shortest paths. Comput. Geom. 29 (3) (2004)
Richard J. Nowakowski, Norbert Zeh
Boundary-Optimal Triangulation Flooding. ISAAC (2004)
Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. SWAT (2004)
Anil Maheshwari, Norbert Zeh
I/O-Optimal Algorithms for Outerplanar Graphs. J. Graph Algorithms Appl. 8 (2004)
Norbert Zeh
Connectivity of Graphs Under Edge Flips. SWAT (2004)
Lars Arge, Norbert Zeh
I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS (2003)
Ulrich Meyer, Norbert Zeh
I/O-Efficient Undirected Shortest Paths. ESA (2003)
Lars Arge, Laura Toma, Norbert Zeh
I/O-efficient topological sorting of planar DAGs. SPAA (2003)
David A. Hutchinson, Anil Maheshwari, Norbert Zeh
An external memory data structure for shortest path queries. Discret. Appl. Math. 126 (1) (2003)
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
Approximating Geometric Bottleneck Shortest Paths. STACS (2003)
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7 (2) (2003)
Anil Maheshwari, Norbert Zeh
I/O-optimal algorithms for planar graphs using separators. SODA (2002)
Anil Maheshwari, Norbert Zeh
A Survey of Techniques for Designing I/O-Efficient Algorithms. Algorithms for Memory Hierarchies (2002)

Norbert Zeh.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Norbert Zeh