Norbert Zeh

	2009
48		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: 17-21
47		Adan Cosgaya-Lozano, Norbert Zeh: A Heuristic Strong Connectivity Algorithm for Large Graphs. SEA 2009: 113-124
46		Peyman Afshani, Chris H. Hamilton, Norbert Zeh: Cache-oblivious range reporting with optimal queries requires superlinear space. Symposium on Computational Geometry 2009: 277-286
45		Peyman Afshani, Chris H. Hamilton, Norbert Zeh: A general approach for cache-oblivious range reporting and approximate range counting. Symposium on Computational Geometry 2009: 287-295
44		Chris Whidden, Norbert Zeh: A Unifying View on Approximation and FPT of Agreement Forests. WABI 2009: 390-402
43		Anil Maheshwari, Norbert Zeh: I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Algorithmica 54(3): 413-469 (2009)
42		Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric spanners with small chromatic number. Comput. Geom. 42(2): 134-146 (2009)
	2008
41		Lars Arge, Thomas Mølhave, Norbert Zeh: Cache-Oblivious Red-Blue Line Segment Intersection. ESA 2008: 88-99
40		Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem. WABI 2008: 76-86
39		Norbert Zeh: I/O-model. Encyclopedia of Algorithms 2008
38		Glenn Hickey, Paz Carmi, Anil Maheshwari, Norbert Zeh: NAPX: A Polynomial Time Approximation Scheme for the Noah's Ark Problem CoRR abs/0805.1661: (2008)
37		Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-efficient algorithms for computing planar geometric spanners. Comput. Geom. 40(3): 252-271 (2008)
36		Anil Maheshwari, Norbert Zeh: I/O-Efficient Planar Separators. SIAM J. Comput. 38(3): 767-801 (2008)
	2007
35		Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Norbert Zeh: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings Springer 2007
34		Jean-Paul Deveaux, Andrew Rau-Chaplin, Norbert Zeh: Adaptive Tuple Differential Coding. DEXA 2007: 109-119
33		Adan Cosgaya-Lozano, Andrew Rau-Chaplin, Norbert Zeh: Parallel Computation of Skyline Queries. HPCS 2007: 12
32		Luca Allulli, Peter Lichodzijewski, Norbert Zeh: A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. SODA 2007: 910-919
31		Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners with Small Chromatic Number. WAOA 2007: 75-88
30		Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: Geometric Spanners With Small Chromatic Number CoRR abs/0711.0114: (2007)
	2006
29		Ulrich Meyer, Norbert Zeh: I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA 2006: 540-551
28		Allan E. Scott, Ulrike Stege, Norbert Zeh: Politician's Firefighting. ISAAC 2006: 608-617
27		Lars Arge, Norbert Zeh: Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching. Symposium on Computational Geometry 2006: 158-166
26		Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Applications. Algorithmica 45(4): 585-614 (2006)
25		Richard J. Nowakowski, Norbert Zeh: Boundary-optimal Triangulation Flooding. Int. J. Comput. Geometry Appl. 16(2-3): 271-290 (2006)
	2005
24		Hema Jampala, Norbert Zeh: Cache-Oblivious Planar Shortest Paths. ICALP 2005: 563-575
	2004
23		Richard J. Nowakowski, Norbert Zeh: Boundary-Optimal Triangulation Flooding. ISAAC 2004: 717-728
22		Norbert Zeh: Connectivity of Graphs Under Edge Flips. SWAT 2004: 161-173
21		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: 480-492
20		Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating geometric bottleneck shortest paths. Comput. Geom. 29(3): 233-249 (2004)
19		Anil Maheshwari, Norbert Zeh: I/O-Optimal Algorithms for Outerplanar Graphs. J. Graph Algorithms Appl. 8: 47-87 (2004)
	2003
18		Ulrich Meyer, Norbert Zeh: I/O-Efficient Undirected Shortest Paths. ESA 2003: 434-445
17		Lars Arge, Norbert Zeh: I/O-Efficient Strong Connectivity and Depth-First Search for Directed Planar Graphs. FOCS 2003: 261-270
16		Lars Arge, Laura Toma, Norbert Zeh: I/O-efficient topological sorting of planar DAGs. SPAA 2003: 85-93
15		Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh: Approximating Geometric Bottleneck Shortest Paths. STACS 2003: 38-49
14		David A. Hutchinson, Anil Maheshwari, Norbert Zeh: An external memory data structure for shortest path queries. Discrete Applied Mathematics 126(1): 55-82 (2003)
13		Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7(2): 105-129 (2003)
	2002
12		Anil Maheshwari, Norbert Zeh: A Survey of Techniques for Designing I/O-Efficient Algorithms. Algorithms for Memory Hierarchies 2002: 36-61
11		Laura Toma, Norbert Zeh: I/O-Efficient Algorithms for Sparse Graphs. Algorithms for Memory Hierarchies 2002: 85-109
10		Anil Maheshwari, Jan Vahrenhold, Norbert Zeh: On reverse nearest neighbor queries. CCCG 2002: 128-132
9		Anil Maheshwari, Norbert Zeh: I/O-optimal algorithms for planar graphs using separators. SODA 2002: 372-381
	2001
8		Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. FSTTCS 2001: 244-255
7		Norbert Zeh, Nicola Santoro: On Finding Minimum Deadly Sets for Directed Networks. SIROCCO 2001: 351-366
6		Anil Maheshwari, Norbert Zeh: I/O-efficient algorithms for graphs of bounded treewidth. SODA 2001: 89-90
5		Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh: I/O-Efficient Shortest Path Queries in Geometric Spanners. WADS 2001: 287-299
4		Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. WADS 2001: 471-482
	2000
3		Sathish Govindarajan, Tamás Lukovszki, Anil Maheshwari, Norbert Zeh: I/O-Efficient Well-Separated Pair Decomposition and Its Applications. ESA 2000: 220-231
	1999
2		David A. Hutchinson, Anil Maheshwari, Norbert Zeh: An External Memory Data Structure for Shortest Path Queries. COCOON 1999: 51-60
1		Anil Maheshwari, Norbert Zeh: External Memory Algorithms for Outerplanar Graphs. ISAAC 1999: 307-316

Coauthor Index

1	Peyman Afshani	[45] [46]
2	Luca Allulli	[32]
3	Lars Arge	[4] [13] [16] [17] [27] [41]
4	Christian Blouin	[48]
5	Prosenjit Bose	[15] [20] [30] [31] [42]
6	Gerth Stølting Brodal	[21]
7	Paz Carmi	[30] [31] [38] [40] [42]
8	Adan Cosgaya-Lozano	[33] [47]
9	Mathieu Couture	[30] [31] [42]
10	Frank K. H. A. Dehne	[35]
11	Jean-Paul Deveaux	[34]
12	Rolf Fagerberg	[21]
13	Sathish Govindarajan	[3] [26]
14	Chris H. Hamilton (Christopher H. Hamilton)	[45] [46]
15	Glenn Hickey	[38] [40]
16	David A. Hutchinson	[2] [14]
17	Hema Jampala	[24]
18	Vlado Keselj	[48]
19	Peter Lichodzijewski	[32]
20	Haibin Liu	[48]
21	Tamás Lukovszki	[3] [8] [26]
22	Anil Maheshwari	[1] [2] [3] [5] [6] [8] [9] [10] [12] [14] [15] [19] [20] [26] [30] [31] [36] [37] [38] [40] [42] [43]
23	Ulrich Meyer	[4] [13] [18] [21] [29]
24	Thomas Mølhave	[41]
25	Giri Narasimhan	[15] [20]
26	Richard J. Nowakowski	[23] [25]
27	Andrew Rau-Chaplin	[33] [34]
28	Jörg-Rüdiger Sack	[35]
29	Nicola Santoro	[7]
30	Allan E. Scott	[28]
31	Michiel H. M. Smid	[5] [15] [20] [30] [31] [37] [42]
32	Ulrike Stege	[28]
33	Laura Toma	[4] [11] [13] [16]
34	Jan Vahrenhold	[10]
35	Chris Whidden	[44] [48]

Colors in the list of coauthors