187 publications with more than 5,000 citations

Papers In Peer-Reviewed Journals

Note: For Biochemistry, Genomics and Bioinformatics journals, the main senior authors are always at the end of the author list.

  • T.Kazmirchuk, C.Bradbury-Jost, T.Withey, T.Gessese, T.Azad, B.Samanfar, F.Dehne, A.Golshani, “Peptides of a Feather: How Computation Is Taking Peptide Therapeutics under Its Wing”, to appear in Genes, 2023. [pdf]
  • M.Hajikarimlou, M.Hooshyar, M.T.Moutaoufik, K.A.Aly, T.Azad, S.Takalloo, S.Jagadeesan, S.Phanse, K.B.Said, B.Samanfar, J.Bell, F.Dehne, M.Babu, A.Golshani, “A computational approach to rapidly design peptides that detect SARS-CoV-2 surface protein S”, NAR Genomics and Bioinformatics, Vol.4, No.3, 2022. [pdf]
  • M.Hooshyar, D.Burnside, M.Hajikarimlou, K.Omidi, A.Jesso, M.Vanstone, A.Young, P.M.Cherubini, M.Jessulat, T.Potter, A.Schoenrock, U.Bhojoo, E.Silva, H.Moteshareie, M.Babu, J.-S.Diallo, F.Dehne, B.Samanfar, A.Golshani, “Actin-Related Protein 6 (Arp6) influences double-strand break repair in yeast”, Applied Microbiology, Vol.1(2), 2021, pp.225-238. [pdf|doi]
  • K.Dick, B.Samanfar, B.Barnes, E.Cober, B.Mimee, L.H.Tan, S.J.Molnar, K.Biggar, A.Golshani, F.Dehne, JR. Green, “PIPE4: Fast PPI predictor for comprehensive inter- and cross-species interactomes”, Nature Scientific Reports (www.Nature.com/srep), Vol. 10, Art. 1390, 2020. [pdf]
  • J.F.de Alencar Vasconcellos, E.N.Cáceres, H.Mongelli, S.W.Song, F.Dehne, J.L.Szwarcfiter, “New BSP/CGM algorithms for spanning trees”, International Journal of High Performance Computing Applications, Vol. 33, No. 3, 2019. [pdf]
  • N.Grigg, A.Schoenrock, K.Dick, J.R.Green, A.Golshani, A.Wong, F.Dehne, E.C.Tsai, K.K.Biggar, “Insights into the suitability of utilizing brown rats (Rattus norvegicus) as a model for healing spinal cord injury with epidermal growth factor and fibroblast growth factor-II by predicting protein-protein interactions”, Computers In Biology And Medicine, Vol. 104, pp.220-226, 2019. [pdf]
  • D.Burnside, A.Schoenrock, H.Moteshareie, M.Hooshyar, P.Basra, M.Hajikarimlou, K.Dick, B.Barnes, T.Kazmirchuk, M.Jessulat, S.Pitre, B.Samanfar, M.Babu, J.R.Green, A.Wong, F.Dehne, K.K.Biggar, A.Golshani, “In silico engineering of synthetic binding proteins from random amino acid sequences”, iScience, Vol. 11, pp.375-387, 2018. [pdf]
  • J.F. de Alencar Vasconcellos, E.N.Cáceres, H.Mongelli, S.W.Song, F.Dehne, J.L.Szwarcfiter, “New BSP/CGM algorithms for spanning trees”, The International Journal of High Performance Computing Applications, 1-18, 2018. [pdf]
  • K.Omidi, M.Jessulat, M.Hooshyar, D.Burnside, A.Schoenrock, T.Kazmirchuk, M.Hajikarimlou, M.Daniel, H.Moteshareie, U.Bhojoo, M.Sanders, D.Ramotar, F.Dehne, B.Samanfar, M.Babu, A.Golshani, “Uncharacterized ORF HUR1 influences the efficiency of non-homologous end-joining repair in Saccharomyces cerevisiae”, Gene, Vol. 639, pp.128-136, 2018. [pdf]
  • F.Dehne, D.E.Robillard, A.Rau-Chaplin, N.Burke, “VOLAP: A scalable distributed real-time OLAP system for high velocity data”, IEEE Transactions on Parallel and Distributed Systems, Vol. 29 (1), pp.226-239, 2018. [pdf]
  • K.Omidi, M.Jessulat, M.Hooshyar, D.Burnside, A.Schoenrock, T.Kazmirchuk, M.Hajikarimlou, M.Daniel, H.Moteshareie, U.Bhojoo, M.Sanders, D.Ramotar, F.Dehne, B.Samanfar, M.Babu, A.Golshani, “Uncharacterized ORF HUR1 influences the efficiency of non-homologous end-joining repair in Saccharomyces cerevisiae”, Gene, Vol. 639, pp.128-136, 2018. [pdf]
  • T.Kazmirchuk, K.Dick, D.J.Burnside, B.Barnes, H.Moteshareie, M.Hajikarimlou, K.Omidi, D.Ahmed, A.Low, C.Lettl, M.Hooshyar, A.Schoenrock, S.Pitre, M.Babu, E.Cassol, B.Samanfar, A.Wong, F.Dehne, J.R.Green, A.Golshani, “Designing anti-Zika virus peptides derived from predicted human-Zika virus protein-protein interactions”, Computational Biology and Chemistry, Vol. 71, pp. 180-187, 2017 . [pdf]
  • A. Schoenrock, D. Burnside, H. Moteshareie, S. Pitre, M. Hooshyar, J.R. Green, A. Golshani, F. Dehne, A. Wong, “Evolution of protein-protein interaction networks in yeast”, PLoS ONE Vol.12, No.3, e0171920, 2017. [pdf]
  • B. Samanfar, S.J. Molnar, M. Charette, A. Schoenrock, F. Dehne, A. Golshani, F. Belzile, E.R. Cober, “Mapping and identification of a potential candidate gene for a novel maturity locus, E10, in soybean”, Theoretical and Applied Genetics, 130:377, 2016. [pdf]
  • D.E. Robillard, P.T. Mpangase, S. Hazelhurst, F. Dehne, “SpeeDB: Fast structural protein searches”, Bioinformatics, Vol. 31, No. 18, pp. 3027-3034, 2015. [pdf]
  • F. Dehne, Q. Kong, A. Rau-Chaplin, H. Zaboli, R. Zhou, “Scalable real-time OLAP on cloud architectures”, Journal of Parallel and Distributed Computing (JPDC), Vol. 79-80, pp. 31-41, 2015. [pdf]
  • F.Dehne and H.Zaboli, “Parallel real-time OLAP on multi-core processors”, Int. J. Data Warehousing and Mining (IJDWM), Vol. 11, No.1, pp. 22-44, 2015. [pdf]
  • A. Schoenrock*, B. Samanfar*, S. Pitre*, M. Hooshyar*, K. Jin, C. Phillips, H. Wang, S. Phanse, K. Omidi, Y. Gui, M. Alamgir, A. Wong, F. Barrenas, M. Babu, M. Benson, M. Langston, J. Green, F. Dehne*, A. Golshani*, “Efficient prediction of human protein-protein interactions at a global scale”, BMC Bioinformatics 15:383, 2014. [pdf]
  • O.Baltzer, F.Dehne, A.Rau-Chaplin, “OLAP for moving object data”, Int. J. Intelligent Information and Database Systems, Vol. 7, No. 1, pp. 79-111, 2013. [pdf]
  • F.Dehne and H.Zaboli, “Parallel construction of data cubes on multi-core multi-disk platforms”, Parallel Processing Letters, Vol. 23, No.1, pp. 1350002 (20 pages), 2013. [pdf]
  • S.Pitre, M.Hooshyar, A.Schoenrock, B.Samanfar, M.Jessulat, J.R.Green, F.Dehne, A.Golshani, “Short co-occurring polypeptide regions can predict global protein interaction maps”, Nature Scientific Reports (www.Nature.com/srep), vol.2, art.239, 2012. [pdf]
  • F.Dehne and H.Zaboli, “Deterministic sample sort for GPUs”, Parallel Processing Letters, vol. 22, no.3, pp. 1250008, 2012. [pdf]
  • F.Dehne, M.T.Omran, J.-R.Sack, “Shortest paths in time-dependent FIFO networks”, Algorithmica, vol.62, no.1-2, pp.416-435, 2012. [pdf]
  • A.Amos-Binks*, C.Patulea*, S.Pitre, A.Schoenrock, Y.Gui, J.R.Green, A.Golshani, F.Dehne*, “Binding site prediction for protein-protein interactions and novel motif discovery using re-occurring polypeptide sequences”, BMC Bioinformatics, 12:225, 2011 (Note: flagged by the publisher as ‘highly accessed’). [pdf]
  • M.Jessula, S.Pitre, Y.Gui, M.Hooshyar, K.Omidi, B.Samanfar , H.Tan , M.Alamgir, J.Green, F.Dehne, A.Golshani, “Recent advances in protein-protein interaction prediction: experimental and computational methods”, Expert Opin Drug Discov, vol.6, no.9, pp.921-935, 2011. [pdf]
  • X.Luo*, M.McKeague*, S.Pitre, M.Dumontier, J.Green, A.Golshani, M.C.DeRosa*, F.Dehne*, “Computational approaches towards the design of pools for the in vitro selection of complex aptamers”, RNA, vol.12, no.16, pp.2252-2262, 2010. [pdf]
  • F.Dehne, G.Hickey, A.Rau-Chaplin, and M.Byrne, “Parallel catastrophe modelling on a Cell B.E.”, Int. Journal of Parallel, Emergent and Distributed Systems (formerly Parallel Algorithms and Applications), vol.25, no.5, pp.401-410, 2010. [pdf]
  • C.E. R.Alves, E.N.Cáceres, F.Dehne, and S.W.Song, “Some communication issues on scalable parallel computing”, Refereed survey article, Handbook of Research on Scalable Computing Techniques, K.-C.Li, C.H.Hsu, L.T.Yang, J.Dongarra, H.Zima (Ed.), IGI Global, 2010. [pdf]
  • G.Clermont, C.Auffray, Y.Moreau, D.M.Rocke, D.Dalevi, D.Dubhashi, D.Marshall, P.Raasch, F.Dehne, P.Provero, J.Tegner, B.J.Aronow, M.A.Langston, and M.Benson, “Bridging the gap between systems biology and medicine”, Genome Medicine, vol.1, no.9, pp.88 ff., 2009. [pdf]
  • F.Dehne, T.Eavis, and A.Rau-Chaplin, “Rcube: Parallel multi-dimensional rolap indexing”, Refereed survey article, Strategic Advancements in Utilizing Data Mining and Warehousing Technologies: New Concepts and Developments, IGI Global, 2009. [pdf]
  • F.Dehne, M.Lawrence, and A.Rau-Chaplin, “Cooperative caching for grid-enabled OLAP”, Int. Journal of Grid and Utility Computing, vol.1, no.2, pp.169-181, 2009. [pdf]
  • S.Pitre*, C.North*, M.Alamgir, M.Jessulat, A.Chan, X.Luo, J.R. Green, M.Dumontier, F.Dehne*, and A.Golshani*, “Global investigation of protein–protein interactions in yeast saccharomyces cerevisiae using re-occurring short polypeptide sequences”, Nucleic Acids Research, vol.36, pp.4286-4294, 2008. [pdf]
  • B.Bhattacharyya and F.Dehne, “Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees”, Information Processing Letters, vol.108, pp.293-297, 2008. [pdf]
  • Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, “PnP: Sequential, external memory, and parallel iceberg cube computation”, Distributed and Parallel Databases, vol.23, no.2, pp.99-126, 2008. [pdf]
  • A.Chan, F.Dehne, P.Bose, and M.Latzel, “Coarse grained parallel algorithms for graph matching”, Parallel Computing, vol.34, p.47–62, 2008. [pdf]
  • G.Hickey, F.Dehne, A.Rau-Chaplin, and C.Blouin, “SPR distance computation for unrooted trees”, Evolutionary Bioinformatics, vol.4, pp.17-27, 2008. [pdf]
  • S.Pitre, M.Alamgir, J.Green, M.Dumontier, F.Dehne, and A.Golshani, “Computational methods for predicting protein-protein interactions”, Refereed survey article, Advances in Biochemical Engineering/Biotechnology, H. Seitz (Ed.), Springer-Verlag, 2008. [pdf]
  • F.Dehne, T.Eavis, and A.Rau-Chaplin, “RCUBE: Parallel multi-dimensional rolap indexing”, Journal of Data Warehousing and Mining, vol.4, no.3, pp.1-14, 2008. [pdf]
  • F.Dehne, T.Eavis, and B.Liang, “Compressing data cubes in parallel OLAP systems”, Data Science Journal, vol.6, pp.S184-S197, 2007. [pdf]
  • S.Pitre*, F.Dehne*, A.Chan, J.Cheetham, A.Duong, A.Emili, M.Gebbia, J.Greenblatt, M.Jessulat, N.Krogan, X.Luo, and A.Golshani*, “PIPE: a protein-protein interaction prediction engine based on the re-occurring short polypeptide sequences between known interacting protein pairs”, BMC Bioinformatics, vol.7, p.365 (15 pages), 2006, (Note: flagged by the publisher as ‘highly accessed’ and cited e.g. in Nature Chemical Biology 3:83-84, 2007). [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”, Theory of Computing Systems, vol.41, no.3, pp.479 – 492, 2007. [pdf]
  • F.Dehne, T.Eavis, and A.Rau-Chaplin, “The cgmCUBE project: Optimizing parallel data cube generation for ROLAP”, Distributed and Parallel Databases, vol.19, no.1, pp.29-62, 2006. [pdf]
  • F.Dehne, “Guest editor’s introduction: Special issue on coarse grained parallel algorithms for scientific applications”, Algorithmica, vol.45, no.3, pp.263-267, 2006. [pdf]
  • F.Dehne, R.Klein, and R.Seidel, “Maximizing a Voronoi region: the convex case”, Int. Journal of Computational Geometry and Applications, vol.15, no.5, pp.463-475, 2005. [pdf]
  • Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, “Improved data partitioning for building large ROLAP data cubes in parallel”, Journal of Data Warehousing and Mining, vol.2, no.1, pp.1-26, 2006. [pdf]
  • A.Chan, F.Dehne, and R.Taylor, “Implementing and testing cgm graph algorithms on pc clusters and shared memory machines”, Int. Journal of High Performance Computing Applications, vol.19, no.1, pp.81-97, 2005. [pdf]
  • Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, “Parallel ROLAP data cube construction on shared-nothing multiprocessors”, Distributed and Parallel Databases, vol.15, pp.219-236, 2004. [pdf]
  • F.Dehne, W.Dittrich, and D.Hutchinson, “Efficient external memory algorithms by simulating coarse-grained parallel algorithms”, Algorithmica, vol.36, pp.97-122, 2003. [pdf]
  • J.Cheetham, F.Dehne, A.Rau-Chaplin, U.Stege, and P.Taillon, “Solving large FPT problems on coarse grained parallel machines”, Journal of Computer and System Sciences, vol.67, no.4, pp.691-706, 2003. [pdf]
  • F.Dehne, W.Dittrich, D.Hutchinson, and A.Maheshwari, “Bulk synchronous parallel algorithms for the external memory model”, Theory of Computing Systems, vol.35, no.6, pp.567-598, 2002. [pdf]
  • F.Dehne, T.Eavis, S.Hambrusch, and A.Rau-Chaplin, “Parallelizing the data cube”, Distributed and Parallel Databases, vol.11, no.2, pp.181-201, 2002. [pdf]
  • F.Dehne, A.Ferreira, E.Caceres, S.Song, and A.Roncato, “Efficient parallel graph algorithms for coarse grained multicomputers and BSP”, Algorithmica, vol.33, no.2, pp.183-200, 2002. [pdf]
  • A.Chan and F.Dehne, “A note on coarse grained parallel integer sorting”, Parallel Processing Letters, vol.9, no.4, pp.533-538, 1999. [pdf]
  • F.Dehne, “Guest editor’s introduction: Special issue on coarse grained parallel algorithms”, Algorithmica, vol.24, no.3/4, pp.173-176, 1999. [pdf]
  • A.Chan, F.Dehne, and A.Rau-Chaplin, “Coarse grained parallel geometric search”, Journal of Parallel and Distributed Computing, vol.57, no.2, pp.224-236, 1999. [pdf]
  • F.Dehne and S.Song, “Randomized parallel list ranking for distributed memory multiprocessors”, Int. Journal of Parallel Programming, vol.25, no.1, pp.1-16, 1997. [pdf]
  • F.Dehne and K.Guimaraes, “Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem”, Information Processing Letters, vol.64, pp.107-114, 1997. [pdf]
  • F.Dehne, X.Deng, P.Dymond, A.Fabri, and A.Kokhar, “A randomized parallel 3d convex hull algorithm for coarse grained multicomputers”, Theory of Computing Systems, vol.30, pp.547-558, 1997. [pdf]
  • F.Dehne and R.Klein, “The big sweep: On the power of the beach line approach for Voronoi diagrams”, Algorithmica, vol.17, pp.19-32, 1997. [pdf]
  • F.Dehne, A.Fabri, and A.Rau-Chaplin, “Scalable parallel computational geometry for coarse grained multicomputers”, Int. Journal of Computational Geometry and Applications, vol.6, no.3, pp.379-400, 1996. [pdf]
  • F.Dehne, B.Flach, J.-R. Sack, and N.Valiveti, “Analog parallel computational geometry”, Parallel Algorithms and Applications, vol.5, pp.1-14, 1995. [pdf]
  • F.Dehne, A.Ferreira, and A.Rau-Chaplin, “Hypercube algorithms for parallel processing of pointer-based quadtrees”, Computer Vision and Image Understanding, vol.62, no.1, pp.1-10, 1995. [pdf]
  • F.Dehne, A.Ferreira, and A.Rau-Chaplin, “A massively parallel knowledge-base server using a hypercube multiprocessor”, Parallel Computing, vol.20, pp.1369-1382, 1994. [pdf]
  • F.Dehne, A.Fabri, M.Nasser, and A.Rau-Chaplin, “Construction of d-dimensional hyperoctrees on a hypercube multiprocessor”, Journal of Parallel and Distributed Computing, vol.23, pp.256-261, 1994. [pdf]
  • M.Atallah, F.Dehne, R.Miller, A.Rau-Chaplin, and J.Tsay, “Multisearch techniques: Parallel data structures on mesh-connected computers”, Journal of Parallel and Distributed Computing, vol.20, pp.1-13, 1994. [pdf]
  • S.Hambrusch and F.Dehne, “Determining maximum k-width-connectivity on meshes”, Computational Geometry: Theory and Applications, vol.3, pp.91-105, 1993. [pdf]
  • F.Dehne, A.Ferreira, and A.Rau-Chaplin, “Parallel fractional cascading on hypercube multiprocessors”, Computational Geometry: Theory and Applications, vol.2, pp.141-167, 1992. [pdf]
  • F.Dehne, R.Miller, and A.Rau-Chaplin, “Optical clustering on a mesh-connected computer”, Int. Journal of Parallel Programming, vol.20, no.6, pp.475-486, 1991. [pdf]
  • F.Dehne and S.Hambrusch, “Parallel algorithms for determining k-width-connectivity in binary images”, Journal of Parallel and Distributed Computing, vol.12, no.1, pp.12-23, 1991. [pdf]
  • F.Dehne and L.Ficocelli, “An efficient computational geometry method for detecting dotted lines in noisy images”, The Computer Journal, vol.33, no.5, pp.424-428, 1990. [pdf]
  • F.Dehne and M.Gastaldo, “A note on the load balancing problem for coarse grained hypercube dictionary machines”, Parallel Computing, vol.16, pp.75-79, 1990. [pdf]
  • F.Dehne, Q.Pham, and I.Stojmenovic, “Optimal visibility algorithms for binary images on the hypercube”, Int. Journal of Parallel Programming, vol.19, no.3, pp.213-224, 1990. [pdf]
  • F.Dehne, A.Ferreira, and A.Rau-Chaplin, “Parallel branch and bound on fine grained hypercube multiprocessors”, Parallel Computing, vol.15, pp.201-209, 1990. [pdf]
  • F.Dehne and A.Rau-Chaplin, “Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry”, Journal of Parallel and Distributed Computing, vol.8, no.4, pp.367-375, 1990. [pdf]
  • F.Dehne, A.Hassenklover, J.Sack, and N.Santoro, “Computational geometry algorithms for the systolic screen”, Algorithmica, vol.6, no.5, pp.734-761, 1991. [pdf]
  • F.Dehne, “Guest editor’s introduction: Special issue on parallel algorithms for geometric problems on digitized pictures”, Algorithmica, vol.6, no.5, pp.621-623, 1991. [pdf]
  • F.Dehne, “Computing the largest empty rectangle on one- and two-dimensional processor arrays”, Journal of Parallel and Distributed Computing, vol.9, no.1, pp.63-68, 1990. [pdf]
  • S.Akl and F.Dehne, “Pipelined search in coarse grained networks”, Int. Journal of Parallel Programming, vol.18, no.5, pp.359-364, 1989. [pdf]
  • F.Dehne, A.Hassenklover, and J.Sack, “Computing the configuration space for a robot on a mesh-of-processors”, Parallel Computing, vol.12, pp.221-231, 1989. [pdf]
  • F.Dehne, “Solving visibility and separability problems on a mesh-of-processors”, The Visual Computer, vol.4, no.6, pp.356-370, 1988. [pdf]
  • F.Dehne and I.Stojmenovic, “A root(n) algorithm for the ECDF. searching problem for arbitrary dimensions on a mesh-of-processors”, Information Processing Letters, vol.28, no.2, pp.67-70, 1988. [pdf]
  • F.Dehne and J.Sack, “Translation separability of sets of polygons”, The Visual Computer, vol.3, no.4, pp.227-235, 1987. [pdf]
  • F.Dehne and H.Noltemeier, “Voronoi trees and clustering problems”, Information Systems, vol.12, no.2, pp.171-175, 1987. [pdf]
  • F.Dehne, “O(root(n)) algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer”, Information Processing Letters, vol.22, no.6, pp.303-306, 1986. [pdf]
  • F.Dehne and H.Noltemeier, “Clustering methods for geometric objects and applications to design problems”, The Visual Computer, vol.2, no.1, pp.31-38, 1986. [pdf]
  • F.Dehne, “Optical clustering”, The Visual Computer, vol.2, no.1, pp.39-43, 1986. [pdf]

Papers In Peer-Reviewed Conference Proceedings

  • M.Genkin, F.Dehne, A.Shahmirza, P.Navarro, S.Zhou, “Autonomic Architecture for Big Data Performance Optimization”, in Proc. 10th Intelligent Systems Conference (IntelliSys), Amsterdam, The Netherlands, 2024. [pdf]
  • M.Genkin, F.Dehne, “Autonomic workload change classification and prediction for big data workloads”, in Proc. IEEE Int. Conference on Big Data (IEEE BigData 2019), Los Angeles, CA, pp.2835-2844, IEEE Comp. Soc. Dig. Library, 2019. [pdf]
  • M.Genkin, F.Dehne, P.Navarro, S.Zhou, “Machine-learning based Spark and Hadoop workload classification using container performance patterns”, in Proc. BenchCouncil International Symposium on Benchmarking, Measuring and Optimizing, Springer LNCS 11459, pp. 118-130, 2019. [pdf]
  • 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]
  • 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, “Parallel querying of  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]