Norbert Zeh

According to our database1, Norbert Zeh authored at least 81 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation.
IEEE/ACM Trans. Comput. Biology Bioinform., 2020

Enhancement of Short Text Clustering by Iterative Classification.
CoRR, 2020

2019
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees.
CoRR, 2019

Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG).
Comput. Geom., 2019

2018
Maximal and Convex Layers of Random Point Sets.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Improving Short Text Clustering by Similarity Matrix Sparsification.
Proceedings of the ACM Symposium on Document Engineering 2018, 2018

Polynomial-Time Algorithms for Phylogenetic Inference Problems.
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018

2017
Parallel construction of succinct trees.
Theor. Comput. Sci., 2017

I/O-Efficient Path Traversal in Succinct Planar Graphs.
Algorithmica, 2017

Computing Maximum Agreement Forests without Cluster Partitioning is Folly.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

High-performance Computational Framework for Phrase Relatedness.
Proceedings of the 2017 ACM Symposium on Document Engineering, 2017

2016
I/O-Model.
Encyclopedia of Algorithms, 2016

Hybridization Number on Three Rooted Binary Trees is EPT.
SIAM J. Discrete Math., 2016

Introduction to Special Issue ALENEX 2013.
ACM Journal of Experimental Algorithmics, 2016

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees.
Algorithmica, 2016

2014
Hybridization Number on Three Trees.
CoRR, 2014

Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Efficient Data Structures for Risk Modelling in Portfolios of Catastrophic Risk Using MapReduce.
Proceedings of the International Conference on Computational Science, 2014

2013
Fixed-Parameter Algorithms for Maximum Agreement Forests.
SIAM J. Comput., 2013

Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar Graphs.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Building a scalable spatial OLAP system.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

QuPARA: Query-driven large-scale portfolio aggregate risk analysis on MapReduce.
Proceedings of the 2013 IEEE International Conference on Big Data, 2013

2012
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths.
ACM Trans. Algorithms, 2012

A parallel buffer tree.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

A Space-Efficient Framework for Dynamic Point Location.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

On the Advice Complexity of Buffer Management.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Lower Bounds for Sorted Geometric Queries in the I/O Model.
Proceedings of the Algorithms - ESA 2012, 2012

2011
An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

A topological sorting algorithm for large graphs.
ACM Journal of Experimental Algorithmics, 2011

Low-interference networks in metric spaces of bounded doubling dimension.
Inf. Process. Lett., 2011

Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space.
Discrete & Computational Geometry, 2011

Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests
CoRR, 2011

Improved Space Bounds for Cache-Oblivious Range Reporting.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Ordered and Unordered Top-K Range Reporting in Large Data Sets.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Engineering a Topological Sorting Algorithm for Massive Graphs.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
Editorial.
Comput. Geom., 2010

A general approach for cache-oblivious range reporting and approximate range counting.
Comput. Geom., 2010

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract).
Proceedings of the Algorithms, 2010

I/O-efficient computation of water flow across a terrain.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Geometric spanners with small chromatic number.
Comput. Geom., 2009

I/O-Efficient Algorithms for Graphs of Bounded Treewidth.
Algorithmica, 2009

A Heuristic Strong Connectivity Algorithm for Large Graphs.
Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

A Unifying View on Approximation and FPT of Agreement Forests.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Finding optimal parameters for edit distance based sequence classification is NP-hard.
Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, 2009

I/O and Space-Efficient Path Traversal in Planar Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Relaxed Gabriel Graphs.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
I/O-model.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

I/O-Efficient Planar Separators.
SIAM J. Comput., 2008

I/O-efficient algorithms for computing planar geometric spanners.
Comput. Geom., 2008

NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Cache-Oblivious Red-Blue Line Segment Intersection.
Proceedings of the Algorithms, 2008

2007
Storage and Indexing of Relational OLAP Views with Mixed Categorical and Continuous Dimensions.
JDIM, 2007

A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Parallel Computation of Skyline Queries.
Proceedings of the 21st Annual International Symposium on High Performance Computing Systems and Applications (HPCS 2007), 2007

Adaptive Tuple Differential Coding.
Proceedings of the Database and Expert Systems Applications, 18th International Conference, 2007

2006
Boundary-optimal Triangulation Flooding.
Int. J. Comput. Geometry Appl., 2006

I/O-Efficient Well-Separated Pair Decomposition and Applications.
Algorithmica, 2006

Politician's Firefighting.
Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths.
Proceedings of the Algorithms, 2006

Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Cache-Oblivious Planar Shortest Paths.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
I/O-Optimal Algorithms for Outerplanar Graphs.
J. Graph Algorithms Appl., 2004

Approximating geometric bottleneck shortest paths.
Comput. Geom., 2004

Connectivity of Graphs Under Edge Flips.
Proceedings of the Algorithm Theory, 2004

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.
Proceedings of the Algorithm Theory, 2004

2003
On External-Memory Planar Depth First Search.
J. Graph Algorithms Appl., 2003

An external memory data structure for shortest path queries.
Discrete Applied Mathematics, 2003

I/O-efficient topological sorting of planar DAGs.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs.
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003

I/O-Efficient Undirected Shortest Paths.
Proceedings of the Algorithms, 2003

2002
I/O-optimal algorithms for planar graphs using separators.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

I/O-Efficient Algorithms for Sparse Graphs.
Proceedings of the Algorithms for Memory Hierarchies, 2002

A Survey of Techniques for Designing I/O-Efficient Algorithms.
Proceedings of the Algorithms for Memory Hierarchies, 2002

On reverse nearest neighbor queries.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
I/O-Efficient Shortest Path Queries in Geometric Spanners.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

On Finding Minimum Deadly Sets for Directed Networks.
Proceedings of the SIROCCO 8, 2001

I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

2000
I/O-Efficient Well-Separated Pair Decomposition and Its Applications.
Proceedings of the Algorithms, 2000

1999
External Memory Algorithms for Outerplanar Graphs.
Proceedings of the Algorithms and Computation, 10th International Symposium, 1999


  Loading...