Norbert Zeh - RankMe

122 papers A* 8A 10B 23C 6Misc 3Journal 48Unranked 22

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