K. Dick, F. Dehne, A. Golshani, J.R. Green, “Positome: A method for improving protein-protein interaction quality and prediction accuracy”, in Proc. IEEE International Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB 2017), Manchester, UK, pp.1-8, IEEE Comp. Soc. Dig. Library, 2017. [pdf]

N. Burke, F. Dehne, A. Rau-Chaplin, D. Robillard, “Quantifying eventual consistency for aggregate queries”, in Proc. 18th Int. Database Applications & Engineering Symposium (IDEAS 2017), Bristol, UK, pp.274-282, ACM Dig. Library, 2017. [pdf]

M. Genkin, F. Dehne, M. Pospelova, Y. Chen, P. Navarro, “Automatic, on-line tuning of YARN container memory and CPU parameters”, in Proc. 18th IEEE Conf. on High Perf. Comp. & Comm. (HPCC 2016), pp. 317-324, IEEE Comp. Soc. Dig. Library, 2016. [pdf]

F.Dehne, D.Robillard, A.Rau-Chaplin, N.Burke, “VOLAP: A scalable distributed system for real-time OLAP with high velocity data”, in Proc. IEEE Cluster Conference 2016, pp. 354-363, IEEE Comp. Soc. Dig. Library, 2016. [pdf]

D.Robillard, F.Dehne, A.Rau-Chaplin, N.Burke, “The Hilbert PDC-tree: A high-velocity structure for many-dimensional data”, in Proc. 20th Int. Database Engineering & Applications Symposium (IDEAS’16), pp. 164-172, ACM Dig. Library, 2016. [pdf]

A.Schoenrock°, D.Burnside°, H.Moteshareie, J.Green, A.Wong, A.Golshani°, F.Dehne°, “Engineering inhibitory proteins with InSiPS: The in-silico protein synthesizer”, in Proc. Supercomputing (SC’15), pp. 25-36, ACM Dig. Library, 2015. [pdf]

F.Dehne, Q.Kong, A.Rau-Chaplin, H.Zaboli, and R.Zhou, “A distributed tree data structure for real-time OLAP on cloud architectures”, in Proc. IEEE Int. Conference on Big Data (IEEE BigData 2013), pp.499-505, IEEE Comp. Soc. Dig. Library, 2013. [pdf]

F.Dehne and H.Zaboli, “Parallel real-time OLAP on multi-core processors”, in Proc. 12th IEEE/ACM Int. Symp. on Cluster, Cloud and Grid Computing (CCGrid 2012), pp. 588-594, IEEE Comp. Soc. Dig. Library, 2012. [pdf]

F.Dehne and H.Zaboli, “Parallel data cubes on multi-core processors with multiple disks”, in Proc. CASCON 2011, pp. 99-106, ACM Dig. Library, 2011. [pdf]

X.Luo, F.Dehne, P.Liang, “Identification of transposon insertion polymorphisms by computational comparative analysis of next generation personal genome data”, in Proc. Int. Conf. on Applied Mathematics, Modeling and Computational Science, AIP Conf. Proc., vol. 1368, pp. 163-166, 2011. [pdf]

A.Schoenrock, F.Dehne, J.R.Green, A.Golshani, S.Pitre, “MP-PIPE: A massively parallel protein-protein interaction prediction engine”, in Proc. Int. Conf. on Supercomputing (ICS ’11), pp.327-337, ACM Dig. Library, 2011. [pdf]

F.Dehne, M. T.Omran, J.Sack, “Shortest paths in time-dependent FIFO networks using edge load forecasts”, in Proc. 2nd Int. Workshop on Computational Transportation Science at ACM GIS 2009, pp. 1-6, ACM Dig. Library, 2009. [pdf]

F.Dehne, G.Hickey, A.Rau-Chaplin, M.Byrne, “Parallel catastrophe modelling on a cell processor”, in Proc. CASCON 2009, pp. 24-31, ACM Dig. Library, 2009. [pdf]

O.Baltzer, F.Dehne, S.Hambrusch, A.Rau-Chaplin, “OLAP for trajectories”, in Proc. 19th Int. Conf. on Database and Expert Systems Applications (DEXA), pp.340-347, Springer LNCS 5181, 2008. [pdf]

R.Derakhshan, B.Stantic, O.Korn, F.Dehne, “Parallel simulated annealing for materialized view selection in data warehousing environments”, in Proc. 8th Int. Conf. on Algorithms and Architectures for Parallel Processing (ICA3PP), pp.121-132, Springer LNCS 5022, 2008. [pdf]

F.Dehne, T.Eavis, and A.Rau-Chaplin, “Efficient computation of view subsets”, in Proc. ACM Int. Workshop on Data Warehousing and OLAP (DOLAP), pp.65-72, ACM Dig. Library, 2007. [pdf]

F.Dehne, M.Lawrence, and A.Rau-Chaplin, “Cooperative caching for grid based data warehouses”, in Proc. IEEE/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), pp.31-38, IEEE Comp. Soc. Dig. Library, 2007. [pdf]

M.Lawrence, F.Dehne, and A.Rau-Chaplin, “Implementing OLAP query fragment aggregation and recombination for the OLAP enabled grid”, in Proc. International Parallel and Distributed Processing Symp. (IPDPS), High-Performance Grid Computing Workshop, pp.1-8, IEEE Comp. Soc. Dig. Library, 2007. [pdf]

F.Dehne, “FPT at work: Using fixed parameter tractability to solve larger instances of hard problems”, in Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC), Invited Lecture (abstract only), p.278, Springer LNCS 4169, 2006. [pdf]

F.Dehne, M.Langston, X.Luo, S.Pitre, P.Shaw, and Y.Zhang, “The cluster editing problem: Implementations and experiments”, in Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC), pp.13-24, Springer LNCS 4169, 2006. [pdf]

F.Dehne, A.Maheshwari, and R.Taylor, “A coarse grained parallel algorithm for Hausdorff Voronoi diagrams”, in Proc. 35th Int. Conf. on Parallel Processing (ICPP), pp.497-504, IEEE Comp. Soc. Dig. Library, 2006. [pdf | link]

F.Dehne, M.Fellows, H.Fernau, E.Prieto, and F.Rosamond, “Nonblocker: Parameterized algorithmics for minimum dominating set”, in Proc. 32nd Int. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp.237-245, Springer LNCS, 2006. [pdf]]

Y.Chen, F.Dehne, T.Eavis, D.Green, A.Rau-Chaplin, and E.Sithirasenan, “cgmOLAP: Efficient parallel generation and querying of terabyte size ROLAP data cubes”, in Proc. 22nd Int. Conf. on Data Engineering (ICDE), pp.164-164, IEEE Comp. Soc. Dig. Library, 2006. [pdf]

F.Dehne, T.Eavis, and A.Rau-Chaplin, “Querying ROLAP cubes in the presence of hierarchies”, in Proc. 17th ACM Int. Workshop on Data Warehousing and OLAP (DOLAP), pp.89-96, ACM Dig. Library, 2005. [pdf]

F.Dehne, M.Fellows, M.Langston, F.Rosamond, and K.Stevens, “An o(2^O(k) n^3 ) FPT algorithm for the undirected feedback vertex set problem”, in Proc. 11th Int. Computing and Combinatorics Conf. (COCOON), pp.859-869, Springer LNCS 3595, 2005. [pdf]

Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, “PnP: Parallel and external memory iceberg cube computation”, in Proc. 21st Int. Conf. on Data Engineering (ICDE), pp.576-577, IEEE Comp. Soc. Dig. Library, 2005. [pdf]

F.Dehne, M.Fellows, F.Rosamond, and P.Shaw, “Greedy localization, iterative compression and modeled crown reductions: new FPT techniques, an improved algorithm for set splitting and a novel 2 k kernelization for vertex cover”, in Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC), pp.271-280, Springer LNCS 3126, 2004. [pdf]

Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, “Building large ROLAP data cubes in parallel”, in Proc. Int. Database Engineering and Applications Symp. (IDEAS), pp.367-377, IEEE Comp. Soc. Dig. Library, 2004. [pdf]

E.Caceres, F.Dehne, H.Mongelli, S.Song, and J.Szwarcfiter, “A coarse-grained parallel algorithm for spanning tree and connected components”, in Proc. Euro-Par, pp.828-831, Springer LNCS 3149, 2004. [pdf]

F.Dehne, T.Eavis, and A.Rau-Chaplin, “Top-down computation of partial ROLAP data cubes”, in Proc. 37th Annual Hawaii Int. Conf. On System Sciences (HICSS), p.80223c, IEEE Comp. Soc. Dig. Library, 2004. [pdf]

F.Dehne, M.Fellows, and F.Rosamond, “An FPT algorithm for set splitting”, in Proc. 29th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.180-191, Springer LNCS 2880, 2003. [pdf]

A.Chan and F.Dehne, “CGMgraph/CGMlib: Implementing and testing CGM graph algorithms on PC clusters”, in Proc. 10th EuroPVM/MPI, pp.117-125, Springer LNCS 2840, 2003. [pdf]

J.Cheetham, F.Dehne, S.Pitre, A.Rau-Chaplin, and P.Taillon, “Parallel CLUSTAL W for PC clusters”, in Proc. Int. Conf. on Computational Science and its Applications (ICCSA), pp.300-309, Springer LNCS 2668 (Part II), 2003. [pdf]

C.Alves, E.Caceres, F.Dehne, and S.Song, “A parallel wavefront algorithm for efficient biological sequence comparison”, in Proc. Int. Conf. on Computational Science and its Applications (ICCSA), pp.249-258, Springer LNCS 2668 (Part II), 2003. [pdf]

Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, “Parallel ROLAP data cube construction on shared-nothing multiprocessors”, in Proc. Int. Parallel and Distributed Processing Symp. (IPDPS), p.70b ff. (10 pages), IEEE Comp. Soc. Digital Library, 2003. [pdf]

F.Dehne, T.Eavis, and A.Rau-Chaplin, “Parallel multi-dimensional ROLAP indexing”, in Proc. IEEE/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), pp.86-93, IEEE Comp. Soc. Dig. Library, 2003. [pdf]

J.Cheetham, F.Dehne, A.Rau-Chaplin, U.Stege, and P.Taillon, “A parallel FPT application for clusters”, in Proc. IEEE/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), IEEE Comp. Soc. Dig. Library, 2003. [pdf]

C.Alves, E.Caceres, F.Dehne, and S.Song, “A CGM/BSP parallel similarity algorithm”, in Proc. Brazilian Workshop on Bioinformatics, pp.1-8, 2002. [pdf]

F.Dehne, R.Klein, and R.Seidel, “Maximizing a Voronoi region: The convex case”, in Proc. 13th Annual Int. Symp. on Algorithms and Computation (ISAAC), pp.624-634, Springer LNCS 2518, 2002. [pdf]

C.Alves, E.Caceres, F.Dehne, and S.Song, “Parallel dynamic programming for solving the string editing problem on a CGM/BSP”, in Proc. 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.275-281, ACM Dig. Library, 2002. [pdf]

F.Dehne, S.Mardegan, A.Pietracaprina, and G.Prencipe, “Distribution sweeping on clustered machines with hierarchical memories”, in Proc. Int. Parallel and Distributed Processing Symp. (IPDPS), p.0031b ff. (6 pages), IEEE Comp. Soc. Dig. Library, 2002. [pdf]

F.Dehne, T.Eavis, and A.Rau-Chaplin, “Computing partial data cubes for parallel data warehousing applications”, in Proc. EuroPVM/MPI, pp.319-326, Springer LNCS 2131, 2001. [pdf]

F.Dehne, T.Eavis, and A.Rau-Chaplin, “Coarse grained parallel on-line analytical processing (OLAP) for data mining”, in Proc. Int. Conf. on Computational Science (ICCS), pp.589-598, Springer LNCS 2074 (Part II), 2001. [pdf]

F.Dehne, T.Eavis, and A.Rau-Chaplin, “A cluster architecture for parallel data warehousing”, in Proc. IEEE/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), pp.161-169, IEEE Comp. Soc. Dig. Library, 2001. [pdf]

F.Dehne, T.Eavis, S.Hambrusch, and A.Rau-Chaplin, “Parallelizing the data cube”, in Proc. Int. Conf. on Database Theory (ICDT), pp.129-143, Springer LNCS 1973, 2001. [pdf]

F.Dehne, C.Langis, and G.Roth, “Mesh simplification in parallel”, in Proc. Int. Conf. on Algorithms and Architectures for Parallel Processing (ICA3PP), pp.281-290, 2000. [pdf]

A.Chan and F.Dehne, “A coarse grained parallel algorithm for maximum weight matching in trees”, in Proc. 12th Int. Conf. Parallel and Distributed Computing and Systems (PDCS), pp.134-138, 2000. [pdf]

E.Caceres, A.Chan, F.Dehne, and G.Prencipe, “Coarse grained parallel algorithms for detecting convex bipartite graphs”, in Proc. 26th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.83-94, Springer LNCS 1928, 2000. [pdf]

E.Caceres, A.Chan, F.Dehne, and S.Song, “Coarse grained parallel graph planarity testing”, in Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), pp.1589-1595, 2000. [pdf]

A.Chan and F.Dehne, “A note on coarse grained parallel integer sorting”, in Proc. 13th Annual Int. Symp. on High Performance Computers (HPCS), pp.261-267, 1999. [pdf]

P.Bose, A.Chan, F.Dehne, and M.Latzel, “Coarse grained parallel maximum matching in convex bipartite graphs”, in Proc. 13th Int. Parallel Processing Symp. (IPPS), pp.125-129, IEEE Comp. Soc. Dig. Library, 1999. [pdf]

F.Dehne, D.Hutchinson, and A.Maheshwari, “Reducing I/O complexity by simulating coarse grained parallel algorithms”, in Proc. 13th Int. Parallel Processing Symp. (IPPS), pp.14-20, IEEE Comp. Soc. Dig. Library, 1999. [pdf]

F.Dehne, W.Dittrich, D.Hutchinson, and A.Maheshwari, “Parallel virtual memory”, in Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.889-890, ACM Dig. Library, 1999. [pdf]

V.Alexandrov, F.Dehne, A.Rau-Chaplin, and K.Taft, “Coarse grained parallel Monte Carlo algorithms for solving SLAE using PVM”, in Proc. 5th European PVM/MPI Users Group Meeting, pp.323-330, Springer LNCS 1497, 1998. [pdf]

F.Dehne and S.Goetz, “Practical parallel algorithms for minimum spanning trees”, in Proc. 17th IEEE Symp. on Reliable Distributed Systems, pp.366-371, 1998. [pdf]

E.Caceres, F.Dehne, A.Ferreira, P.Flocchini, I.Rieping, A.Roncato, N.Santoro, and S.Song, “Efficient parallel graph algorithms for coarse grained multicomputers and BSP”, in Proc. 24th Int. Colloquium on Automata, Languages and Programming (ICALP), pp.390-400, Springer LNCS 1256, 1997. [pdf]

A.Chan, F.Dehne, and A.Rau-Chaplin, “Coarse grained parallel next element search”, in Proc. 11th Int. Parallel Processing Symp. (IPPS), pp.320-325, IEEE Comp. Soc. Dig. Library, 1997. [pdf]

F.Dehne, W.Dittrich, and D.Hutchinson, “Efficient external memory algorithms by simulating coarse grained parallel algorithms”, in Proc. 9th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.106-115, ACM Dig. Library, 1997. [pdf]

F.Dehne and S.Song, “Randomized parallel list ranking for distributed memory multiprocessors”, in Proc. Asian Computer Science Conf. (ASIAN), pp.1-10, Springer LNCS 1179, 1996. [pdf]

F.Dehne and K.Guimaraes, “Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem”, in Proc. 5th Italian Conf. on Theoretical Computer Science, pp.192-200, World Scientific, 1996. [pdf]

F.Dehne, X.Deng, P.Dymond, A.Fabri, and A.Kokhar, “A randomized parallel 3d convex hull algorithm for coarse grained multicomputers”, in Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.27-33, ACM Dig. Library, 1995. [pdf]

F.Dehne, C.Kenyon, and A.Fabri, “Scalable and architecture independent parallel geometric algorithms with high probability optimal time”, in Proc. IEEE Symp. on Parallel and Distributed Processing (SPDP), pp.586-593, IEEE Comp. Soc. Press, 1994. [pdf]

F.Dehne and R.Klein, “The big sweep: On the power of the beach line approach for voronoi diagrams”, in Proc. 19th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), pp.296-305, Springer LNCS 841, 1994. [pdf]

F.Dehne, “Scalable parallel computational geometry”, in Proc. Canada-France Conf. on Parallel and Distributed Computing, pp.115-119, Springer LNCS 805, 1994. [pdf]

F.Dehne and R.Lins, “Distributed cyclic reference counting”, in Proc. Canada-France Conf. on Parallel and Distributed Computing, pp.95-100, Springer LNCS 805, 1994. [pdf]

F.Dehne, A.Fabri, and A.Rau-Chaplin, “Scalable parallel computational geometry for coarse grained multicomputers”, in Proc. ACM Symp. on Computational Geometry (SoCG), pp.298-307, ACM Dig. Library, 1993. [pdf]

F.Dehne, A.Fabri, M.Nasser, and A.Rau-Chaplin, “Construction of d-dimensional hyperoctrees on a hypercube multiprocessor”, in Proc. 30th Annual Allerton Conf. on Communication, Control, and Computing, pp.373-381, 1992. [pdf]

S.Hambrusch and F.Dehne, “Determining maximum k-width connectivity on meshes”, in Proc. 6th Int. Parallel Processing Symp. (IPPS), pp.234-241, IEEE Comp. Soc. Press, 1992. [pdf]

F.Dehne and A.Rau-Chaplin, “Parallel algorithms for color image quantization on hypercubes and meshes”, in Proc. Workshop on Algorithms and Parallel VLSI Architectures, pp.91-96, North Holland, 1991. [pdf]

M.Atallah, F.Dehne, R.Miller, A.Rau-Chaplin, and J.Tsay, “Multisearch techniques for implementing data structures on a mesh-connected computer”, in Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.204-214, ACM Dig. Library, 1991. [pdf]

F.Dehne, A.Ferreira, and A.Rau-Chaplin, “Parallel processing of pointer based quadtrees”, in Proc. Int. Conf. on Parallel Processing (ICPP), pp.255-262, IEEE Comp. Soc. Press, 1991. [pdf]

F.Dehne and S.Hambrusch, “Parallel algorithms for determining k-width-connectivity in binary images”, in Proc. IEEE Symp. on Parallel and Distributed Processing (SPDP), pp.488-496, IEEE Comp. Soc. Press, 1990. [pdf]

F.Dehne, A.Ferreira, and A.Rau-Chaplin, “A massively parallel knowledge-base server using a hypercube multiprocessor”, in Proc. IEEE Int. Conf. on Tools for Artificial Intelligence, pp.660-666, IEEE Comp. Soc. Press, 1990. [pdf]

F.Dehne, A.Ferreira, and A.Rau-Chaplin, “Parallel AI algorithms for fine-grained hypercube multiprocessors”, in Proc. Int. Workshop on Parallel Processing by Cellular Automata and Arrays (PARCELLA), pp.51-65, 1990. [pdf]

F.Dehne and M.Gastaldo, “A note on the load balancing problem for coarse grained hypercube dictionary machines”, in Proc. Joint Conf. on Vector and Parallel Processing (VAPP IV-COMPAR), pp.417-422, Springer LNCS 457, 1990. [pdf]

F.Dehne, A.Ferreira, and A.Rau-Chaplin, “Parallel branch and bound on a fine grained hypercube multiprocessor”, in Proc. IEEE Int. Conf. on Tools for Artificial Intelligence, pp.616-622, IEEE Comp. Soc. Press, 1989. [pdf]

F.Dehne, A.Ferreira, and A.Rau-Chaplin, “Parallel fractional cascading on a hypercube multiprocessor”, in Proc. Allerton Conf. on Communication, Control and Computing, pp.1084-1093, 1989. [pdf]

F.Dehne, A.Hassenklover, and J.Sack, “Computing the configuration space for a robot on a mesh-of-processors”, in Proc. Int. Conf. on Parallel Processing (ICPP), pp.40-47, IEEE Comp. Soc. Press, 1989. [pdf]

F.Dehne and A.Rau-Chaplin, “Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry”, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.316-329, Springer LNCS 411, 1989. [pdf]

F.Dehne and L.Ficocelli, “An efficient computational geometry method for detecting dotted lines in noisy images”, in Proc. Vision Interface, pp.88-93, Canadian Information Processing Society, 1989. [pdf]

F.Dehne, “Computing digitized Voronoi diagrams on a systolic screen and applications to clustering”, in Proc. Int. Symp. on Optimal Algorithms, pp.14-24, Springer LNCS 401, 1989. [pdf]

F.Dehne and N.Santoro, “An improved new embedding for VLSI dictionary machines on meshes”, in Proc. Int. Symp. on Computer Applications in Design, Simulation and Analysis, pp.113-116, 1989. [pdf]

F.Dehne, Q.Pham, and I.Stojmenovic, “Optimal visibility algorithms for binary images on the hypercube”, in Proc. Allerton Conf. on Communication, Control and Computing, pp.1035-1036, 1988. [pdf]

S.Akl and F.Dehne, “The complexity of parallel search on coarse grained networks”, in Proc. Workshop on Parallel and Distributed Algorithms, pp.127-136, North Holland, 1988. [pdf]

F.Dehne and N.Santoro, “An optimal VLSI dictionary machine for hypercube architectures”, in Proc. Workshop on Parallel and Distributed Algorithms, pp.137-144, North Holland, 1988. [pdf]

F.Dehne and J.Sack, “A survey of parallel computational geometry algorithms”, in Proc. Int. Workshop on Parallel Processing by Cellular Automata and Arrays (PARCELLA), pp.73-88, Springer LNCS 342, 1988. [pdf]

F.Dehne and Q.Pham, “Visibility algorithms for binary images on the hypercube and the perfect shuffle computer”, in Proc. IFIP WG 10.3 Working Conf. on Parallel Processing, pp.117-124, North-Holland, 1988. [pdf]

F.Dehne, J.Sack, and I.Stojmenovic, “A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors”, in Proc. Scandinavian Workshop on Algorithm Theory (SWAT), pp.154-162, Springer LNCS 318, 1988. [pdf]

F.Dehne and I.Stojmenovic, “An optimal parallel solution to the ECDF searching problem for higher dimensions on a mesh-of-processors”, in Proc. Allerton Conf. on Communication, Control and Computing, pp.660-661, 1987. [pdf]

F.Dehne and N.Santoro, “Optimal VLSI dictionary machines on meshes”, in Proc. Int. Conf. on Parallel Processing (ICPP), pp.832-840, IEEE Comp. Soc. Press, 1987. [pdf]

F.Dehne and R.Klein, “A sweepcircle algorithm for Voronoi diagrams”, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.59-70, Springer LNCS 314, 1987. [pdf]

F.Dehne, A.Hassenklover, J.Sack, and N.Santoro, “Parallel visibility on a mesh-connected parallel computer”, in Proc. Int. Conf. on Parallel Processing and Applications, pp.173-180, North Holland, 1987. [pdf]

F.Dehne, J.Sack, and N.Santoro, “Computing on a systolic screen: hulls, contours and applications”, in Proc. Conf. on Parallel Architectures and Languages Europe, pp.121-133, Springer LNCS 258, 1987. [pdf]

F.Dehne, “Computational geometry and VLSI”, in Proc. IEEE Int. Conf. on Computer Systems and Software Engineering (CompEuro), pp.870-875, IEEE Comp. Soc. Press, 1987. [pdf]

F.Dehne and J.Sack, “Separabilty of sets of polygons”, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.237-251, Springer LNCS 246, 1986. [pdf]

F.Dehne, “A one dimensional systolic array for the largest empty rectangle problem”, in Proc. Allerton Conf. on Communication, Control and Computing, pp.518-524, 1985. [pdf]

F.Dehne, “Solving geometric problems on mesh-connected and one-dimensional processor arrays”, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.43-59, Trauner, Linz, 1985. [pdf]

F.Dehne and H.Noltemeier, “A computational geometry approach to clustering problems”, in Proc. 1st ACM Symp. on Computational Geometry (SoCG), pp.245-250, ACM Dig. Library, 1985. [pdf]

F.Dehne and H.Noltemeier, “Clustering geometric objects and applications to layout problems”, in Proc. Computer Graphics Tokyo, pp.35-40, Springer, 1985. [pdf]

F.Dehne, “An o(n^4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching in the Euclidean plane”, in Proc. Int. Colloquium on Automata, Languages and Programming (ICALP), pp.160-172, Springer LNCS 154, 1983. [pdf]