{"id":46,"date":"2023-08-24T00:01:48","date_gmt":"2023-08-24T04:01:48","guid":{"rendered":"https:\/\/carleton.ca\/dehne\/?page_id=46"},"modified":"2025-10-26T14:05:52","modified_gmt":"2025-10-26T18:05:52","slug":"publications","status":"publish","type":"page","link":"https:\/\/carleton.ca\/dehne\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<p style=\"text-align: center;\"><a href=\"https:\/\/scholar.google.ca\/citations?hl=en&amp;user=nHJDhwoAAAAJ#\" target=\"_blank\" rel=\"noopener noreferrer\"><img decoding=\"async\" loading=\"lazy\" class=\"size-medium wp-image-303 aligncenter\" src=\"https:\/\/carleton.ca\/dehne\/wp-content\/uploads\/google-scholar-button-240x53.png\" alt=\"\" width=\"240\" height=\"53\" srcset=\"https:\/\/carleton.ca\/dehne\/wp-content\/uploads\/google-scholar-button-240x53.png 240w, https:\/\/carleton.ca\/dehne\/wp-content\/uploads\/google-scholar-button-400x88.png 400w, https:\/\/carleton.ca\/dehne\/wp-content\/uploads\/google-scholar-button-160x35.png 160w, https:\/\/carleton.ca\/dehne\/wp-content\/uploads\/google-scholar-button-360x80.png 360w, https:\/\/carleton.ca\/dehne\/wp-content\/uploads\/google-scholar-button.png 588w\" sizes=\"(max-width: 240px) 100vw, 240px\" \/>Citiation List<\/a><\/p>\n<hr \/>\n<h3>Papers In <span class=\"C9DxTc \">Peer-Reviewed<\/span> Journals<\/h3>\n<p><small class=\"zfr3Q TMjjoe CDt4Ke \" dir=\"ltr\" role=\"presentation\"><span class=\"C9DxTc \"><span style=\"text-decoration: underline;\">Note<\/span>: For Biochemistry, Genomics and Bioinformatics journals, the main senior authors are always at the end of the author list.<\/span><\/small><\/p>\n<ul>\n<li aria-level=\"1\">K.Broderick, M.T.Moutaoufik, T.Saccon, R.Malty, S.Amin, S.Phanse, T.P.Joseph, M.Zilocchi, A.Hosseinnia, Z.Istace, M.Hajikarimlou, S.Abrar, JFisher, R.Brassard, R.Perera, A.Kumar, H.Aoki, M.Rahmatbakhsh, M.Jessulat, D.Kobasa, F.Dehne, B.Prasad, A.Gagarinova, M.J.Lemieux, A.Cochrane, W.A.Houry, K.A.Aly, A.Golshani, M.Babu, \u201cHuman protein interaction networks of ancestral and variant SARS-CoV-2 in organ-specific cells and bodily fluids\u201d, Nature Communications, 16, 5784, 2025. [<a href=\"https:\/\/drive.google.com\/file\/d\/1Eux6n_BnM1RWc5zuEAdfXc1ducLur81B\/view?usp=sharing\">pdf<\/a>|<a href=\"https:\/\/doi.org\/10.1038\/s41467-025-60949-1\">doi<\/a>]<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\">T.Kazmirchuk, C.Bradbury-Jost, T.Withey, T.Gessese, T.Azad, B.Samanfar, F.Dehne, A.Golshani, \u201cPeptides of a Feather: How Computation Is Taking Peptide Therapeutics under Its Wing\u201d, Genes, Vol. 14, pp. 1194, 2023. [<a href=\"https:\/\/drive.google.com\/file\/d\/19IMxo_sFJk0ZX8TdvJJEj2P4ZR_2OgKL\/view?usp=sharing\">pdf<\/a>|<a href=\"https:\/\/dx.doi.org\/10.3390\/genes14061194\">doi<\/a>]<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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, \u201cA computational approach to rapidly design peptides that detect SARS-CoV-2 surface protein S\u201d, NAR Genomics and Bioinformatics, Vol.4, No.3, 2022. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1OPkgWKtrJo5a1-vspJmRsok0Ln945GbY\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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, &#8220;Actin-Related Protein 6 (Arp6) influences double-strand break repair in yeast&#8221;, Applied Microbiology, Vol.1(2), 2021, pp.225-238. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1aYRZy-Ympgf-BT_8QlXrRoEkVnFzzA9g\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">|<\/span><a href=\"https:\/\/dx.doi.org\/10.3390\/applmicrobiol1020017\"><span style=\"font-weight: 400;\">doi<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">K.Dick, B.Samanfar, B.Barnes, E.Cober, B.Mimee, L.H.Tan, S.J.Molnar, K.Biggar, A.Golshani, F.Dehne, JR. Green, &#8220;PIPE4: Fast PPI predictor for comprehensive inter- and cross-species interactomes&#8221;, Nature Scientific Reports (www.Nature.com\/srep), Vol. 10, Art. 1390, 2020. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dvcYdV_nRLmR1wxcpk-Ie-uOW-KPFGbA\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">J.F.de Alencar Vasconcellos, E.N.C\u00e1ceres, H.Mongelli, S.W.Song, F.Dehne, J.L.Szwarcfiter, &#8220;New BSP\/CGM algorithms for spanning trees&#8221;, International Journal of High Performance Computing Applications, Vol. 33, No. 3, 2019. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1XG7T6cMUIpQgLOL2PE2EllsgBtiSDt3x\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">N.Grigg, A.Schoenrock, K.Dick, J.R.Green, A.Golshani, A.Wong, F.Dehne, E.C.Tsai, K.K.Biggar, &#8220;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&#8221;, Computers In Biology And Medicine, Vol. 104, pp.220-226, 2019. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_3bh424Fn3JZKc-6lkixSerxACxb-eGs\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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, &#8220;In silico engineering of synthetic binding proteins from random amino acid sequences&#8221;, iScience, Vol. 11, pp.375-387, 2018. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_I81ET8Qw1Z_8wcbxLVgs1QiFI6uWsJ4\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">J.F. de Alencar Vasconcellos, E.N.C\u00e1ceres, H.Mongelli, S.W.Song, F.Dehne, J.L.Szwarcfiter, &#8220;New BSP\/CGM algorithms for spanning trees&#8221;, The International Journal of High Performance Computing Applications, 1-18, 2018. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Yy0ryhJUrapcVCOETkcLi5Q1Naqc-RW8\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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, &#8220;Uncharacterized ORF HUR1 influences the efficiency of non-homologous end-joining repair in Saccharomyces cerevisiae&#8221;, Gene, Vol. 639, pp.128-136, 2018. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZAjEGML9QNykU9njuCEONSIUoHITjkdZ\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, D.E.Robillard, A.Rau-Chaplin, N.Burke, &#8220;VOLAP: A scalable distributed real-time OLAP system for high velocity data&#8221;, IEEE Transactions on Parallel and Distributed Systems, Vol. 29 (1), pp.226-239, 2018. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1esah5bQCINeBpOzJ_Vz7ZNyh_hu1do5m\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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, &#8220;Uncharacterized ORF HUR1 influences the efficiency of non-homologous end-joining repair in Saccharomyces cerevisiae&#8221;, Gene, Vol. 639, pp.128-136, 2018. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1aOBPQhLzFJXsUcQwg8pAKGqHWidWtWAm\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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, &#8220;Designing anti-Zika virus peptides derived from predicted human-Zika virus protein-protein interactions&#8221;, Computational Biology and Chemistry, Vol. 71, pp. 180-187, 2017 . [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VIq41PyodEVhi-U42e_D3LZqetFCMDWZ\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A. Schoenrock, D. Burnside, H. Moteshareie, S. Pitre, M. Hooshyar, J.R. Green, A. Golshani, F. Dehne, A. Wong, &#8220;Evolution of protein-protein interaction networks in yeast&#8221;, PLoS ONE Vol.12, No.3, e0171920, 2017. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cnE_4eLSfCE2GwCCF2djTA6CGLRddaS-\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">B. Samanfar, S.J. Molnar, M. Charette, A. Schoenrock, F. Dehne, A. Golshani, F. Belzile, E.R. Cober, &#8220;Mapping and identification of a potential candidate gene for a novel maturity locus, E10, in soybean&#8221;, Theoretical and Applied Genetics, 130:377, 2016. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1f-ZY9_lOYW_rQGks5G2lmSCf9iQ_iLBF\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">D.E. Robillard, P.T. Mpangase, S. Hazelhurst, F. Dehne, &#8220;SpeeDB: Fast structural protein searches&#8221;, Bioinformatics, Vol. 31, No. 18, pp. 3027-3034, 2015. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VZVGJItUqQPKUd45Bd9u70Dm8Hntl1Oj\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F. Dehne, Q. Kong, A. Rau-Chaplin, H. Zaboli, R. Zhou, &#8220;Scalable real-time OLAP on cloud architectures&#8221;, Journal of Parallel and Distributed Computing (JPDC), Vol. 79-80, pp. 31-41, 2015. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1g8T5YaXpaV0hn-7MZucYIr1yXffIfgHv\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Zaboli, &#8220;Parallel real-time OLAP on multi-core processors&#8221;, Int. J. Data Warehousing and Mining (IJDWM), Vol. 11, No.1, pp. 22-44, 2015. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WqTC2xIIX085AxHXdGYgPGR2_wbOi0LF\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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*, &#8220;Efficient prediction of human protein-protein interactions at a global scale&#8221;, BMC Bioinformatics 15:383, 2014. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1gKfJmoqxJ6p5ghCEuEoUcmUddxMRUTyi\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">O.Baltzer, F.Dehne, A.Rau-Chaplin, &#8220;OLAP for moving object data&#8221;, Int. J. Intelligent Information and Database Systems, Vol. 7, No. 1, pp. 79-111, 2013. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1TbMNrse0h5zmTasxnlYvrw3n--E5a7SR\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Zaboli, &#8220;Parallel construction of data cubes on multi-core multi-disk platforms&#8221;, Parallel Processing Letters, Vol. 23, No.1, pp. 1350002 (20 pages), 2013. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bzOt5ta-hIfGiVKSxXc5Hr8PpKKdbg1I\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">S.Pitre, M.Hooshyar, A.Schoenrock, B.Samanfar, M.Jessulat, J.R.Green, F.Dehne, A.Golshani, &#8220;Short co-occurring polypeptide regions can predict global protein interaction maps\u201d, Nature Scientific Reports (www.Nature.com\/srep), vol.2, art.239, 2012. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1XLeD4J7q81xXbmvhFprMas1Fy6170EAI\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Zaboli, &#8220;Deterministic sample sort for GPUs&#8221;, Parallel Processing Letters, vol. 22, no.3, pp. 1250008, 2012. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_vQDuf5V39RMs6yVRSRqMoNepL5Hgndt\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.T.Omran, J.-R.Sack, &#8220;Shortest paths in time-dependent FIFO networks&#8221;, Algorithmica, vol.62, no.1-2, pp.416-435, 2012. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Yi2DAckmr1Lm1Qa_Tr-kQCYLYFolB1pQ\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Amos-Binks*, C.Patulea*, S.Pitre, A.Schoenrock, Y.Gui, J.R.Green, A.Golshani, F.Dehne*, &#8220;Binding site prediction for protein-protein interactions and novel motif discovery using re-occurring polypeptide sequences&#8221;, BMC Bioinformatics, 12:225, 2011 (Note: flagged by the publisher as &#8216;highly accessed&#8217;). [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZpOFEDjO70rxqQbDz551G8q7j4vr8FmK\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">M.Jessula, S.Pitre, Y.Gui, M.Hooshyar, K.Omidi, B.Samanfar , H.Tan , M.Alamgir, J.Green, F.Dehne, A.Golshani, \u201cRecent advances in protein-protein interaction prediction: experimental and computational methods\u201d, Expert Opin Drug Discov, vol.6, no.9, pp.921-935, 2011. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WIW5ftvF_8mo03fklDhek0JeqcJAl8H6\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">X.Luo*, M.McKeague*, S.Pitre, M.Dumontier, J.Green, A.Golshani, M.C.DeRosa*, F.Dehne*, &#8220;Computational approaches towards the design of pools for the in vitro selection of complex aptamers&#8221;, RNA, vol.12, no.16, pp.2252-2262, 2010. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dhqyMKPtTPkd_fEAf2jEZUKBcfdq0OUE\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, G.Hickey, A.Rau-Chaplin, and M.Byrne, &#8220;Parallel catastrophe modelling on a Cell B.E.&#8221;, Int. Journal of Parallel, Emergent and Distributed Systems (formerly Parallel Algorithms and Applications), vol.25, no.5, pp.401-410, 2010. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VACIdwGfEbZo3ZufoFW4jZSvt4CoAaPX\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">C.E. R.Alves, E.N.C\u00e1ceres, F.Dehne, and S.W.Song, &#8220;Some communication issues on scalable parallel computing&#8221;, 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. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ba0waHFrTcAIGFWxpAldoaRDvbqggg13\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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, &#8220;Bridging the gap between systems biology and medicine&#8221;, Genome Medicine, vol.1, no.9, pp.88 ff., 2009. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1V1O_QECjV-E1hBmc8030Dy4cU1ZWE-X8\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Rcube: Parallel multi-dimensional rolap indexing&#8221;, Refereed survey article, Strategic Advancements in Utilizing Data Mining and Warehousing Technologies: New Concepts and Developments, IGI Global, 2009. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dC1-t7pfOQJcCPsqNuzM6XoXJpDgNLna\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Lawrence, and A.Rau-Chaplin, &#8220;Cooperative caching for grid-enabled OLAP&#8221;, Int. Journal of Grid and Utility Computing, vol.1, no.2, pp.169-181, 2009. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dr7YMs7aBbxY8ilUdwi7TnD4KiUqu7ET\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">S.Pitre*, C.North*, M.Alamgir, M.Jessulat, A.Chan, X.Luo, J.R. Green, M.Dumontier, F.Dehne*, and A.Golshani*, &#8220;Global investigation of protein\u2013protein interactions in yeast saccharomyces cerevisiae using re-occurring short polypeptide sequences&#8221;, Nucleic Acids Research, vol.36, pp.4286-4294, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fm8_dsu7LOVcOMNV55wkpWzFrvF82ua-\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">B.Bhattacharyya and F.Dehne, &#8220;Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees&#8221;, Information Processing Letters, vol.108, pp.293-297, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1UvL_TvrmnyMn9qRhgxXgP7Z6czPPmcq5\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;PnP: Sequential, external memory, and parallel iceberg cube computation&#8221;, Distributed and Parallel Databases, vol.23, no.2, pp.99-126, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WnGqiGI451ElB2_V1wUPekBcKWd7Vw0w\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan, F.Dehne, P.Bose, and M.Latzel, &#8220;Coarse grained parallel algorithms for graph matching&#8221;, Parallel Computing, vol.34, p.47\u201362, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1XzXulk1W3zGSMmhZwnOjSRH-x6qh9snD\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">G.Hickey, F.Dehne, A.Rau-Chaplin, and C.Blouin, &#8220;SPR distance computation for unrooted trees&#8221;, Evolutionary Bioinformatics, vol.4, pp.17-27, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cIC6KPXHOf5wm4KABghRj8BivSVFMtXw\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">S.Pitre, M.Alamgir, J.Green, M.Dumontier, F.Dehne, and A.Golshani, &#8220;Computational methods for predicting protein-protein interactions&#8221;, Refereed survey article, Advances in Biochemical Engineering\/Biotechnology, H. Seitz (Ed.), Springer-Verlag, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1b-JcODSjeeO1jvqHAGMmjqWA1_V-m6vb\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;RCUBE: Parallel multi-dimensional rolap indexing&#8221;, Journal of Data Warehousing and Mining, vol.4, no.3, pp.1-14, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1V_503_2bzQvpfEBrDkiCa3ouSvYr6TW4\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and B.Liang, &#8220;Compressing data cubes in parallel OLAP systems&#8221;, Data Science Journal, vol.6, pp.S184-S197, 2007. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1gV6-GYKntAKS13G9AD6itMgTTccfKFjf\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">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*, &#8220;PIPE: a protein-protein interaction prediction engine based on the re-occurring short polypeptide sequences between known interacting protein pairs&#8221;, BMC Bioinformatics, vol.7, p.365 (15 pages), 2006, (Note: flagged by the publisher as &#8216;highly accessed&#8217; and cited e.g. in Nature Chemical Biology 3:83-84, 2007). [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Ui5W-83pPzvRoK12wZOravB_1v1MQ78S\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Fellows, M.Langston, F.Rosamond, and K.Stevens, &#8220;An o(2^O(k) n^3 ) FPT algorithm for the undirected feedback vertex set problem&#8221;, Theory of Computing Systems, vol.41, no.3, pp.479 &#8211; 492, 2007. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WGGqioJqvFBwxmS2puyBQxu99UgSYE1M\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;The cgmCUBE project: Optimizing parallel data cube generation for ROLAP&#8221;, Distributed and Parallel Databases, vol.19, no.1, pp.29-62, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dZk9ZybpJ9wQoBwPtQKCBHryqPz4M6mm\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Guest editor&#8217;s introduction: Special issue on coarse grained parallel algorithms for scientific applications&#8221;, Algorithmica, vol.45, no.3, pp.263-267, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1d4aaRmyTbm8Pz5agjXzEGc08F9ylEivw\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, R.Klein, and R.Seidel, &#8220;Maximizing a Voronoi region: the convex case&#8221;, Int. Journal of Computational Geometry and Applications, vol.15, no.5, pp.463-475, 2005. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1auvVhiysniS60aVOl9-tqa0D2PWObzff\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Improved data partitioning for building large ROLAP data cubes in parallel&#8221;, Journal of Data Warehousing and Mining, vol.2, no.1, pp.1-26, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1d_muAQrlMbpq2xhWnbY-Oz9WwFzgLbo0\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan, F.Dehne, and R.Taylor, &#8220;Implementing and testing cgm graph algorithms on pc clusters and shared memory machines&#8221;, Int. Journal of High Performance Computing Applications, vol.19, no.1, pp.81-97, 2005. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Yu3aCgrGz2ygiVWXWMhpAGEq-0hgEBKC\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Parallel ROLAP data cube construction on shared-nothing multiprocessors&#8221;, Distributed and Parallel Databases, vol.15, pp.219-236, 2004. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bPmppXGvMGGv3f2dHAavr2OoXYG1vgWj\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, W.Dittrich, and D.Hutchinson, &#8220;Efficient external memory algorithms by simulating coarse-grained parallel algorithms&#8221;, Algorithmica, vol.36, pp.97-122, 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fmVV78GyN9nbaaSw48syOlB6eLWZl5rY\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">J.Cheetham, F.Dehne, A.Rau-Chaplin, U.Stege, and P.Taillon, &#8220;Solving large FPT problems on coarse grained parallel machines&#8221;, Journal of Computer and System Sciences, vol.67, no.4, pp.691-706, 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dohYmd54PHfpFaRfRAkfMpwW6TfmhS15\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, W.Dittrich, D.Hutchinson, and A.Maheshwari, &#8220;Bulk synchronous parallel algorithms for the external memory model&#8221;, Theory of Computing Systems, vol.35, no.6, pp.567-598, 2002. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Vdc51AuPK6RgnTkOAR4ymINWqCn1JAj7\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, S.Hambrusch, and A.Rau-Chaplin, &#8220;Parallelizing the data cube&#8221;, Distributed and Parallel Databases, vol.11, no.2, pp.181-201, 2002. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fCkVvYE2J_o-jytxC1ZUvGvORitj0rmb\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, E.Caceres, S.Song, and A.Roncato, &#8220;Efficient parallel graph algorithms for coarse grained multicomputers and BSP&#8221;, Algorithmica, vol.33, no.2, pp.183-200, 2002. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1XQMhq1H_IVYJPV9lwNAvE2ZawQVwsbEk\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan and F.Dehne, &#8220;A note on coarse grained parallel integer sorting&#8221;, Parallel Processing Letters, vol.9, no.4, pp.533-538, 1999. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Xekxva39Vxfm_d4MTY2IUaJ_sSsMWwsz\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Guest editor&#8217;s introduction: Special issue on coarse grained parallel algorithms&#8221;, Algorithmica, vol.24, no.3\/4, pp.173-176, 1999. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Z2Y9K5QJQaSUKivkn_0vRRE-DLynwL_G\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan, F.Dehne, and A.Rau-Chaplin, &#8220;Coarse grained parallel geometric search&#8221;, Journal of Parallel and Distributed Computing, vol.57, no.2, pp.224-236, 1999. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1YAURJ4xHCbHUEceWHT7WKM8TBWk0MoZl\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and S.Song, &#8220;Randomized parallel list ranking for distributed memory multiprocessors&#8221;, Int. Journal of Parallel Programming, vol.25, no.1, pp.1-16, 1997. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZHXhHUaD4arola9axe1VOzG_cm8rXRqT\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and K.Guimaraes, &#8220;Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem&#8221;, Information Processing Letters, vol.64, pp.107-114, 1997. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VcK5-oZfoMqpfXJZbTkrWnUqlAF3esMt\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, X.Deng, P.Dymond, A.Fabri, and A.Kokhar, &#8220;A randomized parallel 3d convex hull algorithm for coarse grained multicomputers&#8221;, Theory of Computing Systems, vol.30, pp.547-558, 1997. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VrqHrVJlNq8SM6GMTxWHSVmSA0Hguppe\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and R.Klein, &#8220;The big sweep: On the power of the beach line approach for Voronoi diagrams&#8221;, Algorithmica, vol.17, pp.19-32, 1997. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dG0LOI6-Yi8_uBlvhRoV6_-X-g_7Lp7X\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Fabri, and A.Rau-Chaplin, &#8220;Scalable parallel computational geometry for coarse grained multicomputers&#8221;, Int. Journal of Computational Geometry and Applications, vol.6, no.3, pp.379-400, 1996. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Zi73SzPzUdVGr04tjVO8ETCFhqOQMp5O\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, B.Flach, J.-R. Sack, and N.Valiveti, &#8220;Analog parallel computational geometry&#8221;, Parallel Algorithms and Applications, vol.5, pp.1-14, 1995. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ceq7g3sVS1kcciXirntoFYlbGnwVJ9hs\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;Hypercube algorithms for parallel processing of pointer-based quadtrees&#8221;, Computer Vision and Image Understanding, vol.62, no.1, pp.1-10, 1995. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1eVCwnt1ETT_3ohblLFLnOMy_6fippGLg\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;A massively parallel knowledge-base server using a hypercube multiprocessor&#8221;, Parallel Computing, vol.20, pp.1369-1382, 1994. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1YjGokvtzAiX640YILcc1mkZgMsnpsAzd\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Fabri, M.Nasser, and A.Rau-Chaplin, &#8220;Construction of d-dimensional hyperoctrees on a hypercube multiprocessor&#8221;, Journal of Parallel and Distributed Computing, vol.23, pp.256-261, 1994. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WAtc5znC2Y72A8cXKp7pizoFyy8SSzBG\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">M.Atallah, F.Dehne, R.Miller, A.Rau-Chaplin, and J.Tsay, &#8220;Multisearch techniques: Parallel data structures on mesh-connected computers&#8221;, Journal of Parallel and Distributed Computing, vol.20, pp.1-13, 1994. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fh2ahA7N-Py6Ss1fCejRTXuBMm7Iz9Ps\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">S.Hambrusch and F.Dehne, &#8220;Determining maximum k-width-connectivity on meshes&#8221;, Computational Geometry: Theory and Applications, vol.3, pp.91-105, 1993. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cvNMiK-DkOzmGR150ujnnPiDnt0UNZ2C\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;Parallel fractional cascading on hypercube multiprocessors&#8221;, Computational Geometry: Theory and Applications, vol.2, pp.141-167, 1992. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1gEPn0whY5s44KnnWO4o74O0bj4LAnKcn\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, R.Miller, and A.Rau-Chaplin, &#8220;Optical clustering on a mesh-connected computer&#8221;, Int. Journal of Parallel Programming, vol.20, no.6, pp.475-486, 1991. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VdnB61p5LrKtFVFxwxJJonJMxN1YpAWW\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and S.Hambrusch, &#8220;Parallel algorithms for determining k-width-connectivity in binary images&#8221;, Journal of Parallel and Distributed Computing, vol.12, no.1, pp.12-23, 1991. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Vhi7DRErlbC-oGv_ARYUIC8tyC7E3_Xm\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and L.Ficocelli, &#8220;An efficient computational geometry method for detecting dotted lines in noisy images&#8221;, The Computer Journal, vol.33, no.5, pp.424-428, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fzlcARtFDBYiEcRNgOz0MiPMI0x7J_xE\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and M.Gastaldo, &#8220;A note on the load balancing problem for coarse grained hypercube dictionary machines&#8221;, Parallel Computing, vol.16, pp.75-79, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1aXqtCOTzHGvGgqhFFd9Ba_0tuGo8Et25\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, Q.Pham, and I.Stojmenovic, &#8220;Optimal visibility algorithms for binary images on the hypercube&#8221;, Int. Journal of Parallel Programming, vol.19, no.3, pp.213-224, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZBfmoUxEMgGlam35m96Zs6oqUdNzCXTb\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;Parallel branch and bound on fine grained hypercube multiprocessors&#8221;, Parallel Computing, vol.15, pp.201-209, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VtM7isRFeCB-yA8keZcB6wB5O6beNO5F\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and A.Rau-Chaplin, &#8220;Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry&#8221;, Journal of Parallel and Distributed Computing, vol.8, no.4, pp.367-375, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bq1L6I2CT1PR3DEnfhIXJlfvqe4654AR\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Hassenklover, J.Sack, and N.Santoro, &#8220;Computational geometry algorithms for the systolic screen&#8221;, Algorithmica, vol.6, no.5, pp.734-761, 1991. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1YOB1jm18Uo7kCF4pxB6RRkm_P5kxcHPB\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Guest editor&#8217;s introduction: Special issue on parallel algorithms for geometric problems on digitized pictures&#8221;, Algorithmica, vol.6, no.5, pp.621-623, 1991. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Xlms2JPoQOz5CQv3N6ceiPz2IvieB7wV\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Computing the largest empty rectangle on one- and two-dimensional processor arrays&#8221;, Journal of Parallel and Distributed Computing, vol.9, no.1, pp.63-68, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1W7INWDTWfo7DMUtZyZQ5clYuh1CqDGgC\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">S.Akl and F.Dehne, &#8220;Pipelined search in coarse grained networks&#8221;, Int. Journal of Parallel Programming, vol.18, no.5, pp.359-364, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZIKD3i6c-V_0STztz77cIrCKJtAzf5KM\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Hassenklover, and J.Sack, &#8220;Computing the configuration space for a robot on a mesh-of-processors&#8221;, Parallel Computing, vol.12, pp.221-231, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cZyhooTZjn7PdaR0fi7mWWDroKH-dnR6\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Solving visibility and separability problems on a mesh-of-processors&#8221;, The Visual Computer, vol.4, no.6, pp.356-370, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bi9siV9Mz-ybVk4PbB2XCDv7bCHfPc_2\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and I.Stojmenovic, &#8220;A root(n) algorithm for the ECDF. searching problem for arbitrary dimensions on a mesh-of-processors&#8221;, Information Processing Letters, vol.28, no.2, pp.67-70, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZlrPJCboN_yPtDeu391KL81oJyohcTcT\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and J.Sack, &#8220;Translation separability of sets of polygons&#8221;, The Visual Computer, vol.3, no.4, pp.227-235, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1XEuuJQqRbNW54YD2lAQzOhWFKaR8W0aH\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Noltemeier, &#8220;Voronoi trees and clustering problems&#8221;, Information Systems, vol.12, no.2, pp.171-175, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VI-DG4H55nYuvh_WFjaJckHLh9UziMK1\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;O(root(n)) algorithms for the maximal elements and ECDF searching problem on a mesh-connected parallel computer&#8221;, Information Processing Letters, vol.22, no.6, pp.303-306, 1986. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fg4OX4LPJ5ZDS-UVJZfO7g4MtuXiFZKN\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Noltemeier, &#8220;Clustering methods for geometric objects and applications to design problems&#8221;, The Visual Computer, vol.2, no.1, pp.31-38, 1986. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WUt8zLe6nugOnGTY43Di_LD3BTG40Sti\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Optical clustering&#8221;, The Visual Computer, vol.2, no.1, pp.39-43, 1986. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1epcMhYU9Oav2hdwT_TkVyhcYWo4bRJzx\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<\/ul>\n<hr \/>\n<h3>Papers In Peer-Reviewed Conference Proceedings<\/h3>\n<ul>\n<li aria-level=\"1\">M.Genkin, F.Dehne, A.Shahmirza, P.Navarro, S.Zhou, &#8220;Autonomic Architecture for Big Data Performance Optimization&#8221;, in Proc. 10th Intelligent Systems Conference (IntelliSys), Amsterdam, Springer Lecture Notes in Networks and Systems, vol 1068, 2024. [<a href=\"https:\/\/drive.google.com\/file\/d\/1fdxuG6SqRh_HRP19fVivgM-qWQa1JxRM\/view?usp=sharing\" target=\"_blank\" rel=\"noopener\">pdf<\/a>]<\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">M.Genkin, F.Dehne, &#8220;Autonomic workload change classification and prediction for big data workloads&#8221;, in Proc. IEEE Int. Conference on Big Data (IEEE BigData 2019), Los Angeles, CA, pp.2835-2844, IEEE Comp. Soc. Dig. Library, 2019. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dDMu_YQNOgvPhedDjyrraTAv51XPYkcL\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">M.Genkin, F.Dehne, P.Navarro, S.Zhou, &#8220;Machine-learning based Spark and Hadoop workload classification using container performance patterns&#8221;, in Proc. BenchCouncil International Symposium on Benchmarking, Measuring and Optimizing, Springer LNCS 11459, pp. 118-130, 2019. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ecQ3BEpwLSvNV53uWZBeTDsl2pGFcACX\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">K.Dick, F.Dehne, A.Golshani, J.R.Green, &#8220;Positome: A method for improving protein-protein interaction quality and prediction accuracy&#8221;, 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. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1g-ufbxRbRtZYbJNH3VQahNp-sk66FrRr\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">N.Burke, F.Dehne, A.Rau-Chaplin, D.Robillard, &#8220;Quantifying eventual consistency for aggregate queries&#8221;, in Proc. 18th Int. Database Applications &amp; Engineering Symposium (IDEAS 2017), Bristol, UK, pp.274-282, ACM Dig. Library, 2017. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bF4WMQRxJZH8BF2vrQFTp-lHN6LzAccW\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">M.Genkin, F.Dehne, M.Pospelova, Y.Chen, P.Navarro, &#8220;Automatic, on-line tuning of YARN container memory and CPU parameters&#8221;, in Proc. 18th IEEE Conf. on High Perf. Comp. &amp; Comm. (HPCC 2016), pp. 317-324, IEEE Comp. Soc. Dig. Library, 2016. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1f-kNlKFz5MfOvHLEf5WgLDKxyMNnsAKc\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, D.Robillard, A.Rau-Chaplin, N.Burke, &#8220;VOLAP: A scalable distributed system for real-time OLAP with high velocity data&#8221;, in Proc. IEEE Cluster Conference 2016, pp. 354-363, IEEE Comp. Soc. Dig. Library, 2016. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dtHBJjFPzElaEAXvlXiwNWU56PEkqUbE\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">D.Robillard, F.Dehne, A.Rau-Chaplin, N.Burke, &#8220;The Hilbert PDC-tree: A high-velocity structure for many-dimensional data&#8221;, in Proc. 20th Int. Database Engineering &amp; Applications Symposium (IDEAS\u201916), pp. 164-172, ACM Dig. Library, 2016. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZzDj0PZiw5FTGJPAfHyrPaxqYf29cMye\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Schoenrock\u00b0, D.Burnside\u00b0, H.Moteshareie, J.Green, A.Wong, A.Golshani\u00b0, F.Dehne\u00b0, &#8220;Engineering inhibitory proteins with InSiPS: The in-silico protein synthesizer&#8221;, in Proc. Supercomputing (SC&#8217;15), pp. 25-36, ACM Dig. Library, 2015. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1eLvcfkmWNZyf1WI0AKr1Wpjmh5cbQz-i\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, Q.Kong, A.Rau-Chaplin, H.Zaboli, and R.Zhou, &#8220;A distributed tree data structure for real-time OLAP on cloud architectures&#8221;, in Proc. IEEE Int. Conference on Big Data (IEEE BigData 2013), pp.499-505, IEEE Comp. Soc. Dig. Library, 2013. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1aNT3pl7UmJhg5D0aPslQIxf6Wb90WRJr\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Zaboli, &#8220;Parallel real-time OLAP on multi-core processors&#8221;, in Proc. 12th IEEE\/ACM Int. Symp. on Cluster, Cloud and Grid Computing (CCGrid 2012), pp. 588-594, IEEE Comp. Soc. Dig. Library, 2012. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZO3kuy6iZgwUF-eL2d_O3pcNwlDoozPO\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Zaboli, &#8220;Parallel data cubes on multi-core processors with multiple disks&#8221;, in Proc. CASCON 2011, pp. 99-106, ACM Dig. Library, 2011. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1aOBXmOKfr0abwejTDRhtpQms7ZrByQ3G\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">X.Luo, F.Dehne, P.Liang, &#8220;Identification of transposon insertion polymorphisms by computational comparative analysis of next generation personal genome data&#8221;, in Proc. Int. Conf. on Applied Mathematics, Modeling and Computational Science, AIP Conf. Proc., vol. 1368, pp. 163-166, 2011. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1eVwOdEVDI6yz5JrtFoUT2gweVXXgaJVz\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Schoenrock, F.Dehne, J.R.Green, A.Golshani, S.Pitre, \u201cMP-PIPE: A massively parallel protein-protein interaction prediction engine\u201d, in Proc. Int. Conf. on Supercomputing (ICS &#8217;11), pp.327-337, ACM Dig. Library, 2011. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1d93q99u3NCQAC7vbMrqCPIGriNK-GjF1\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M. T.Omran, J.Sack, \u201cShortest paths in time-dependent FIFO networks using edge load forecasts\u201d, in Proc. 2nd Int. Workshop on Computational Transportation Science at ACM GIS 2009, pp. 1-6, ACM Dig. Library, 2009. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_vZp73mlFkRcCi8oriUchOblTYSRt-3u\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, G.Hickey, A.Rau-Chaplin, M.Byrne, &#8220;Parallel catastrophe modelling on a cell processor&#8221;, in Proc. CASCON 2009, pp. 24-31, ACM Dig. Library, 2009. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WzMSKW-sHL9ORHWPwTXaaYYZXS9FAMRK\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">O.Baltzer, F.Dehne, S.Hambrusch, A.Rau-Chaplin, &#8220;OLAP for trajectories&#8221;, in Proc. 19th Int. Conf. on Database and Expert Systems Applications (DEXA), pp.340-347, Springer LNCS 5181, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VBfgFfUFWJAzQNOKVXsMl6Mt7tENGqPL\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">R.Derakhshan, B.Stantic, O.Korn, F.Dehne, &#8220;Parallel simulated annealing for materialized view selection in data warehousing environments&#8221;, in Proc. 8th Int. Conf. on Algorithms and Architectures for Parallel Processing (ICA3PP), pp.121-132, Springer LNCS 5022, 2008. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bHAN2jyBZdXOT719Zr9cvettlzhccHCK\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Efficient computation of view subsets&#8221;, in Proc. ACM Int. Workshop on Data Warehousing and OLAP (DOLAP), pp.65-72, ACM Dig. Library, 2007. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1UwdsJgSXxPMBbKCFPKJGH0XzLX91c1Ws\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Lawrence, and A.Rau-Chaplin, &#8220;Cooperative caching for grid based data warehouses&#8221;, in Proc. IEEE\/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), pp.31-38, IEEE Comp. Soc. Dig. Library, 2007. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1b3o_kuBIU7kaxS5aepaREEHVCoJP1THs\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">M.Lawrence, F.Dehne, and A.Rau-Chaplin, &#8220;Implementing OLAP query fragment aggregation and recombination for the OLAP enabled grid&#8221;, in Proc. International Parallel and Distributed Processing Symp. (IPDPS), High-Performance Grid Computing Workshop, pp.1-8, IEEE Comp. Soc. Dig. Library, 2007. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZPOghpTvhWOspdWTSW_G3VwKMP3ZuF_G\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;FPT at work: Using fixed parameter tractability to solve larger instances of hard problems&#8221;, in Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC), Invited Lecture (abstract only), p.278, Springer LNCS 4169, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_OxYwe5saLzJPAkeqN-LLV7PJiNggYM3\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Langston, X.Luo, S.Pitre, P.Shaw, and Y.Zhang, &#8220;The cluster editing problem: Implementations and experiments&#8221;, in Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC), pp.13-24, Springer LNCS 4169, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1W-5OJLno6kQFkWAXqzVcHNGFSXZCCt_A\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Maheshwari, and R.Taylor, &#8220;A coarse grained parallel algorithm for Hausdorff Voronoi diagrams&#8221;, in Proc. 35th Int. Conf. on Parallel Processing (ICPP), pp.497-504, IEEE Comp. Soc. Dig. Library, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZYrcWhaZPFnqDpymESr0OXr4WluzvQgS\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Fellows, H.Fernau, E.Prieto, and F.Rosamond, &#8220;Nonblocker: Parameterized algorithmics for minimum dominating set&#8221;, in Proc. 32nd Int. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM), pp.237-245, Springer LNCS, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cW0yVSyKxY404hcy6zHFXx13FzJcoCqG\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf]<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Y.Chen, F.Dehne, T.Eavis, D.Green, A.Rau-Chaplin, and E.Sithirasenan, &#8220;cgmOLAP: Efficient parallel generation and querying of terabyte size ROLAP data cubes&#8221;, in Proc. 22nd Int. Conf. on Data Engineering (ICDE), pp.164-164, IEEE Comp. Soc. Dig. Library, 2006. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1e0mqgix4Y_prCBNaE3_vUoZ6sUPHcjHT\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Parallel querying of\u00a0 ROLAP cubes in the presence of hierarchies&#8221;, in Proc. 17th ACM Int. Workshop on Data Warehousing and OLAP (DOLAP), pp.89-96, ACM Dig. Library, 2005. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZVhZx5tq__ojqAC1wy-7haG8N-1bW20F\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Fellows, M.Langston, F.Rosamond, and K.Stevens, &#8220;An o(2^O(k) n^3 ) FPT algorithm for the undirected feedback vertex set problem&#8221;, in Proc. 11th Int. Computing and Combinatorics Conf. (COCOON), pp.859-869, Springer LNCS 3595, 2005. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1a2vl8dUqBTVlvkumOd2ExTUNcgX3ZKTA\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;PnP: Parallel and external memory iceberg cube computation&#8221;, in Proc. 21st Int. Conf. on Data Engineering (ICDE), pp.576-577, IEEE Comp. Soc. Dig. Library, 2005. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VOW5xv2p_rlc_apDZGBElrxg6xkdj5Yd\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Fellows, F.Rosamond, and P.Shaw, &#8220;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&#8221;, in Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC), pp.271-280, Springer LNCS 3126, 2004. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1caQv1rPm_2-djl5Ve5FOp0Cng13EXV17\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Building large ROLAP data cubes in parallel&#8221;, in Proc. Int. Database Engineering and Applications Symp. (IDEAS), pp.367-377, IEEE Comp. Soc. Dig. Library, 2004. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1X4cwzSJjv1Iqc2-Jz2KAJWLf--zvryWm\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">E.Caceres, F.Dehne, H.Mongelli, S.Song, and J.Szwarcfiter, &#8220;A coarse-grained parallel algorithm for spanning tree and connected components&#8221;, in Proc. Euro-Par, pp.828-831, Springer LNCS 3149, 2004. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1X4YnEwn3LO1edHUknygMcTieLj_g0Wkj\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Top-down computation of partial ROLAP data cubes&#8221;, in Proc. 37th Annual Hawaii Int. Conf. On System Sciences (HICSS), p.80223c, IEEE Comp. Soc. Dig. Library, 2004. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1UnzuRTZImnQo7pqoz7DXlzd3Rz5S-Xe7\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, M.Fellows, and F.Rosamond, &#8220;An FPT algorithm for set splitting&#8221;, in Proc. 29th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.180-191, Springer LNCS 2880, 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dz08qaPpPGGXRtkgZKd3ku0lVgv6XW87\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan and F.Dehne, &#8220;CGMgraph\/CGMlib: Implementing and testing CGM graph algorithms on PC clusters&#8221;, in Proc. 10th EuroPVM\/MPI, pp.117-125, Springer LNCS 2840, 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1filAl-P7lZYpP4qq2Y0jpPQFbhvGQhoY\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">J.Cheetham, F.Dehne, S.Pitre, A.Rau-Chaplin, and P.Taillon, &#8220;Parallel CLUSTAL W for PC clusters&#8221;, in Proc. Int. Conf. on Computational Science and its Applications (ICCSA), pp.300-309, Springer LNCS 2668 (Part II), 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bDzIflx6Iwh9qENgsvBtjy2z6eEpbKNQ\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">C.Alves, E.Caceres, F.Dehne, and S.Song, &#8220;A parallel wavefront algorithm for efficient biological sequence comparison&#8221;, in Proc. Int. Conf. on Computational Science and its Applications (ICCSA), pp.249-258, Springer LNCS 2668 (Part II), 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZPm9YnlvuPNsGMD9lPcBa7gjxGpzCOFo\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">Y.Chen, F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Parallel ROLAP data cube construction on shared-nothing multiprocessors&#8221;, in Proc. Int. Parallel and Distributed Processing Symp. (IPDPS), p.70b ff. (10 pages), IEEE Comp. Soc. Digital Library, 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1V9m_ek82mqCWxa1csHwFGfyoXUV_hHXh\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Parallel multi-dimensional ROLAP indexing&#8221;, in Proc. IEEE\/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), pp.86-93, IEEE Comp. Soc. Dig. Library, 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1c4NVij_v_ecMAYqdZAWpIqMWI5CenOXD\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">J.Cheetham, F.Dehne, A.Rau-Chaplin, U.Stege, and P.Taillon, &#8220;A parallel FPT application for clusters&#8221;, in Proc. IEEE\/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), IEEE Comp. Soc. Dig. Library, 2003. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1YmCu7L5fSbfCD4BfcqpUr16BXv6R6Vsa\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">C.Alves, E.Caceres, F.Dehne, and S.Song, &#8220;A CGM\/BSP parallel similarity algorithm&#8221;, in Proc. Brazilian Workshop on Bioinformatics, pp.1-8, 2002. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Ts0sDCZYC3aIWlZgtAM64pijcwQAVg1E\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, R.Klein, and R.Seidel, &#8220;Maximizing a Voronoi region: The convex case&#8221;, in Proc. 13th Annual Int. Symp. on Algorithms and Computation (ISAAC), pp.624-634, Springer LNCS 2518, 2002. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1V_v3y_57Kw9YEaUcbV-d5HSMwUeprY1d\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">C.Alves, E.Caceres, F.Dehne, and S.Song, &#8220;Parallel dynamic programming for solving the string editing problem on a CGM\/BSP&#8221;, in Proc. 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.275-281, ACM Dig. Library, 2002. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1aD3SFvuFCGowd5iOK_NokzHzbP6AQfU0\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, S.Mardegan, A.Pietracaprina, and G.Prencipe, &#8220;Distribution sweeping on clustered machines with hierarchical memories&#8221;, in Proc. Int. Parallel and Distributed Processing Symp. (IPDPS), p.0031b ff. (6 pages), IEEE Comp. Soc. Dig. Library, 2002. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZRJShyqz-bb2TNvobEOpqBYHsU7JIDxi\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Computing partial data cubes for parallel data warehousing applications&#8221;, in Proc. EuroPVM\/MPI, pp.319-326, Springer LNCS 2131, 2001. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dZdGh6HXLDBl-IDnUUqFJ90hYkzV3Q5L\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;Coarse grained parallel on-line analytical processing (OLAP) for data mining&#8221;, in Proc. Int. Conf. on Computational Science (ICCS), pp.589-598, Springer LNCS 2074 (Part II), 2001. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Wa0daW_u17XBZwrVWQ0Smy2ZG3yC6UJn\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, and A.Rau-Chaplin, &#8220;A cluster architecture for parallel data warehousing&#8221;, in Proc. IEEE\/ACM Int. Symp. on Cluster Computing and the Grid (CCGrid), pp.161-169, IEEE Comp. Soc. Dig. Library, 2001. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1acblF5eXmCN86LXSKwFFdypBRlKVzino\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, T.Eavis, S.Hambrusch, and A.Rau-Chaplin, &#8220;Parallelizing the data cube&#8221;, in Proc. Int. Conf. on Database Theory (ICDT), pp.129-143, Springer LNCS 1973, 2001. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1f5d8PMskfKT-5Fsup-vMDhNCdLiIIKFR\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, C.Langis, and G.Roth, &#8220;Mesh simplification in parallel&#8221;, in Proc. Int. Conf. on Algorithms and Architectures for Parallel Processing (ICA3PP), pp.281-290, 2000. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1eHzgcAsgWjtNh7mzsOMVM2qxBlDd1kah\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan and F.Dehne, &#8220;A coarse grained parallel algorithm for maximum weight matching in trees&#8221;, in Proc. 12th Int. Conf. Parallel and Distributed Computing and Systems (PDCS), pp.134-138, 2000. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1X0iyuz5pszoTORtbJR6mnrXPzsNDQsUL\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">E.Caceres, A.Chan, F.Dehne, and G.Prencipe, &#8220;Coarse grained parallel algorithms for detecting convex bipartite graphs&#8221;, in Proc. 26th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.83-94, Springer LNCS 1928, 2000. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_igSQPf2GMMubN9xGHs5ZaQQpiIWeFuK\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">E.Caceres, A.Chan, F.Dehne, and S.Song, &#8220;Coarse grained parallel graph planarity testing&#8221;, in Proc. Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), pp.1589-1595, 2000. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1f_VRoGIWnQFIcXALqutwrK1K4IBmnnmh\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan and F.Dehne, &#8220;A note on coarse grained parallel integer sorting&#8221;, in Proc. 13th Annual Int. Symp. on High Performance Computers (HPCS), pp.261-267, 1999. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1e9PrQNu6YWgO6HHPWCHLV3tTUnXRO8LC\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">P.Bose, A.Chan, F.Dehne, and M.Latzel, &#8220;Coarse grained parallel maximum matching in convex bipartite graphs&#8221;, in Proc. 13th Int. Parallel Processing Symp. (IPPS), pp.125-129, IEEE Comp. Soc. Dig. Library, 1999. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1czqlnjxPqekT-b2Pons8Fw7ZoxoFz1Li\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, D.Hutchinson, and A.Maheshwari, &#8220;Reducing I\/O complexity by simulating coarse grained parallel algorithms&#8221;, in Proc. 13th Int. Parallel Processing Symp. (IPPS), pp.14-20, IEEE Comp. Soc. Dig. Library, 1999. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fwlEgK9zgXTGz2d-Y3RDFvk5-0DRfyOb\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, W.Dittrich, D.Hutchinson, and A.Maheshwari, &#8220;Parallel virtual memory&#8221;, in Proc. 10th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.889-890, ACM Dig. Library, 1999. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WaSerrXWdXoiyoNyXvPl5v4SkB4exsXj\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">V.Alexandrov, F.Dehne, A.Rau-Chaplin, and K.Taft, &#8220;Coarse grained parallel Monte Carlo algorithms for solving SLAE using PVM&#8221;, in Proc. 5th European PVM\/MPI Users Group Meeting, pp.323-330, Springer LNCS 1497, 1998. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1YCDVo_UC_p4qwqb1nTBICuOh34WIPQv1\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and S.Goetz, &#8220;Practical parallel algorithms for minimum spanning trees&#8221;, in Proc. 17th IEEE Symp. on Reliable Distributed Systems, pp.366-371, 1998. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_jt-rSSHW6N1oZfDaUXKYbYjz1T4UiRP\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">E.Caceres, F.Dehne, A.Ferreira, P.Flocchini, I.Rieping, A.Roncato, N.Santoro, and S.Song, &#8220;Efficient parallel graph algorithms for coarse grained multicomputers and BSP&#8221;, in Proc. 24th Int. Colloquium on Automata, Languages and Programming (ICALP), pp.390-400, Springer LNCS 1256, 1997. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1a6tAIKOKJs1I_izFr2NzIL12tMuyS-Op\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">A.Chan, F.Dehne, and A.Rau-Chaplin, &#8220;Coarse grained parallel next element search&#8221;, in Proc. 11th Int. Parallel Processing Symp. (IPPS), pp.320-325, IEEE Comp. Soc. Dig. Library, 1997. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1dEnwcVW9YFHgjYDmf4XK25du5WaKjNb-\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, W.Dittrich, and D.Hutchinson, &#8220;Efficient external memory algorithms by simulating coarse grained parallel algorithms&#8221;, in Proc. 9th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.106-115, ACM Dig. Library, 1997. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WIi4qlLScwk-6_7X6amVcBayhs8wKa-x\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and S.Song, &#8220;Randomized parallel list ranking for distributed memory multiprocessors&#8221;, in Proc. Asian Computer Science Conf. (ASIAN), pp.1-10, Springer LNCS 1179, 1996. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1V0nWUgW29dKn8xaKM-DdR-uLbVznX3MW\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and K.Guimaraes, &#8220;Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem&#8221;, in Proc. 5th Italian Conf. on Theoretical Computer Science, pp.192-200, World Scientific, 1996. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cHBqGtu7P_T1ACIjfJOaDotREvBb4p3a\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, X.Deng, P.Dymond, A.Fabri, and A.Kokhar, &#8220;A randomized parallel 3d convex hull algorithm for coarse grained multicomputers&#8221;, in Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.27-33, ACM Dig. Library, 1995. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1eRalzjt5-Su8CDQFvO86_HiBPE5l0sP_\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, C.Kenyon, and A.Fabri, &#8220;Scalable and architecture independent parallel geometric algorithms with high probability optimal time&#8221;, in Proc. IEEE Symp. on Parallel and Distributed Processing (SPDP), pp.586-593, IEEE Comp. Soc. Press, 1994. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1Tc1yywKRl11EUCG1cO5SS62x2KUIijty\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and R.Klein, &#8220;The big sweep: On the power of the beach line approach for voronoi diagrams&#8221;, in Proc. 19th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), pp.296-305, Springer LNCS 841, 1994. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1XK1tRGaIjaTLwd_TuNZtSQ4-X61n-vZ1\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Scalable parallel computational geometry&#8221;, in Proc. Canada-France Conf. on Parallel and Distributed Computing, pp.115-119, Springer LNCS 805, 1994. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_QuSBYMw1A2J7qXHTJyMh_Zjbz4wN8yA\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and R.Lins, &#8220;Distributed cyclic reference counting&#8221;, in Proc. Canada-France Conf. on Parallel and Distributed Computing, pp.95-100, Springer LNCS 805, 1994. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1d7plIbRrm9vxgTX2j15Nbq_-cdkLHuFh\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Fabri, and A.Rau-Chaplin, &#8220;Scalable parallel computational geometry for coarse grained multicomputers&#8221;, in Proc. ACM Symp. on Computational Geometry (SoCG), pp.298-307, ACM Dig. Library, 1993. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1gYBtxCbMjzuU4LBMIuF3bGyudngmvnEa\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Fabri, M.Nasser, and A.Rau-Chaplin, &#8220;Construction of d-dimensional hyperoctrees on a hypercube multiprocessor&#8221;, in Proc. 30th Annual Allerton Conf. on Communication, Control, and Computing, pp.373-381, 1992. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1f3GvoHC_rdl_H0ZCzoEl5O-9vjAW5e0O\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">S.Hambrusch and F.Dehne, &#8220;Determining maximum k-width connectivity on meshes&#8221;, in Proc. 6th Int. Parallel Processing Symp. (IPPS), pp.234-241, IEEE Comp. Soc. Press, 1992. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fvSq6sH4ZxphSwvIeyEF47xY27J8IlDC\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and A.Rau-Chaplin, &#8220;Parallel algorithms for color image quantization on hypercubes and meshes&#8221;, in Proc. Workshop on Algorithms and Parallel VLSI Architectures, pp.91-96, North Holland, 1991. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1YjjF8MMAVJAkMgevuyRPxuk0M4CZDB-I\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">M.Atallah, F.Dehne, R.Miller, A.Rau-Chaplin, and J.Tsay, &#8220;Multisearch techniques for implementing data structures on a mesh-connected computer&#8221;, in Proc. ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp.204-214, ACM Dig. Library, 1991. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VLxXnYUEC85aF9qEe696Reyj3DrMxgIx\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;Parallel processing of pointer based quadtrees&#8221;, in Proc. Int. Conf. on Parallel Processing (ICPP), pp.255-262, IEEE Comp. Soc. Press, 1991. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fFuh49__oxaOLd6jgG00R-qV3mwRaaJE\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and S.Hambrusch, &#8220;Parallel algorithms for determining k-width-connectivity in binary images&#8221;, in Proc. IEEE Symp. on Parallel and Distributed Processing (SPDP), pp.488-496, IEEE Comp. Soc. Press, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VOriX2riuIt5yFJ3Q2fAQ4zXqZzD37L_\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;A massively parallel knowledge-base server using a hypercube multiprocessor&#8221;, in Proc. IEEE Int. Conf. on Tools for Artificial Intelligence, pp.660-666, IEEE Comp. Soc. Press, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1bJzxMe5lkjKV2j2lNVklyWJdV7QdR2uh\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;Parallel AI algorithms for fine-grained hypercube multiprocessors&#8221;, in Proc. Int. Workshop on Parallel Processing by Cellular Automata and Arrays (PARCELLA), pp.51-65, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cvncLn3FlaOaQ8fpJmRASh4dH1-Aa69K\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and M.Gastaldo, &#8220;A note on the load balancing problem for coarse grained hypercube dictionary machines&#8221;, in Proc. Joint Conf. on Vector and Parallel Processing (VAPP IV-COMPAR), pp.417-422, Springer LNCS 457, 1990. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1U-zHzc4oKICz2BR5PFxHFp5H61Dy7LkW\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;Parallel branch and bound on a fine grained hypercube multiprocessor&#8221;, in Proc. IEEE Int. Conf. on Tools for Artificial Intelligence, pp.616-622, IEEE Comp. Soc. Press, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1crpZjxbSqtsYPTncLwZGjdcAWnCp4qQa\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Ferreira, and A.Rau-Chaplin, &#8220;Parallel fractional cascading on a hypercube multiprocessor&#8221;, in Proc. Allerton Conf. on Communication, Control and Computing, pp.1084-1093, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fC4m9MSb2lhKSZVQzsNG9hkYPunvho_T\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Hassenklover, and J.Sack, &#8220;Computing the configuration space for a robot on a mesh-of-processors&#8221;, in Proc. Int. Conf. on Parallel Processing (ICPP), pp.40-47, IEEE Comp. Soc. Press, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZfsdeLlXtv1fhCsoLfhEZM3c_Vfv7pXY\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and A.Rau-Chaplin, &#8220;Implementing data structures on a hypercube multiprocessor and applications in parallel computational geometry&#8221;, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.316-329, Springer LNCS 411, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1gHy-jm0kcaE1kak1Xa91ec5Lw5t-xX-2\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and L.Ficocelli, &#8220;An efficient computational geometry method for detecting dotted lines in noisy images&#8221;, in Proc. Vision Interface, pp.88-93, Canadian Information Processing Society, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ZCMYdUCCo3Dh2wgWx-2JsnkHLUq7Q4Gm\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Computing digitized Voronoi diagrams on a systolic screen and applications to clustering&#8221;, in Proc. Int. Symp. on Optimal Algorithms, pp.14-24, Springer LNCS 401, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1TguNl7AhjV0ItTw2AECao8KFPOAPMQBD\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and N.Santoro, &#8220;An improved new embedding for VLSI dictionary machines on meshes&#8221;, in Proc. Int. Symp. on Computer Applications in Design, Simulation and Analysis, pp.113-116, 1989. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1TrlHltlvZYoc7I-Y7WX-BRs-wMdMh-la\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, Q.Pham, and I.Stojmenovic, &#8220;Optimal visibility algorithms for binary images on the hypercube&#8221;, in Proc. Allerton Conf. on Communication, Control and Computing, pp.1035-1036, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1di600Ri-CuelrOuOU479HlWNKB38YJNN\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">S.Akl and F.Dehne, &#8220;The complexity of parallel search on coarse grained networks&#8221;, in Proc. Workshop on Parallel and Distributed Algorithms, pp.127-136, North Holland, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VOpPaEhxzxp0tnDFnZ_fLuci-aVPYCpT\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and N.Santoro, &#8220;An optimal VLSI dictionary machine for hypercube architectures&#8221;, in Proc. Workshop on Parallel and Distributed Algorithms, pp.137-144, North Holland, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1giSWIvVIQQG9t3GgAcP5Q1-oSBOIRzxy\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and J.Sack, &#8220;A survey of parallel computational geometry algorithms&#8221;, in Proc. Int. Workshop on Parallel Processing by Cellular Automata and Arrays (PARCELLA), pp.73-88, Springer LNCS 342, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cqX1-wPykAmbEwAfoPjp_aslxFZze-Nz\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and Q.Pham, &#8220;Visibility algorithms for binary images on the hypercube and the perfect shuffle computer&#8221;, in Proc. IFIP WG 10.3 Working Conf. on Parallel Processing, pp.117-124, North-Holland, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ecLfO_jF4TjtJkp6hBUZ59Htb2V3Husa\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, J.Sack, and I.Stojmenovic, &#8220;A note on determining the 3-dimensional convex hull of a set of points on a mesh of processors&#8221;, in Proc. Scandinavian Workshop on Algorithm Theory (SWAT), pp.154-162, Springer LNCS 318, 1988. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1aDCCq2k2dySPJzVqwmI0QMXulleuF6NR\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and I.Stojmenovic, &#8220;An optimal parallel solution to the ECDF searching problem for higher dimensions on a mesh-of-processors&#8221;, in Proc. Allerton Conf. on Communication, Control and Computing, pp.660-661, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1UlWcm2aUcAW1MOz7PsTtYh_n8AXJKgT7\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and N.Santoro, &#8220;Optimal VLSI dictionary machines on meshes&#8221;, in Proc. Int. Conf. on Parallel Processing (ICPP), pp.832-840, IEEE Comp. Soc. Press, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1__jSRLdWCTihgwKSq3wxQiF_6hKdYUeD\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and R.Klein, &#8220;A sweepcircle algorithm for Voronoi diagrams&#8221;, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.59-70, Springer LNCS 314, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1f6b7HTLsIjZrBgzi2EygTO9nfqZU-zK_\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, A.Hassenklover, J.Sack, and N.Santoro, &#8220;Parallel visibility on a mesh-connected parallel computer&#8221;, in Proc. Int. Conf. on Parallel Processing and Applications, pp.173-180, North Holland, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fBtpaE4Vm-xC2wBxHDetZgQYBI6p_zk5\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, J.Sack, and N.Santoro, &#8220;Computing on a systolic screen: hulls, contours and applications&#8221;, in Proc. Conf. on Parallel Architectures and Languages Europe, pp.121-133, Springer LNCS 258, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1c_JsZ2LgWBmGr57nCVYYMnchMhQSqvBz\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Computational geometry and VLSI&#8221;, in Proc. IEEE Int. Conf. on Computer Systems and Software Engineering (CompEuro), pp.870-875, IEEE Comp. Soc. Press, 1987. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1_fxtwmPK6bSUwTmo7ysEI0tBYzmzjU7z\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and J.Sack, &#8220;Separabilty of sets of polygons&#8221;, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.237-251, Springer LNCS 246, 1986. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WfPYhIt6kCac6UVuzEvI-OaqYVW742bP\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;A one dimensional systolic array for the largest empty rectangle problem&#8221;, in Proc. Allerton Conf. on Communication, Control and Computing, pp.518-524, 1985. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1VoUlGN8YdtpSET7bhRjqcj2TsQQ5QMFM\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;Solving geometric problems on mesh-connected and one-dimensional processor arrays&#8221;, in Proc. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.43-59, Trauner, Linz, 1985. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1ec9ZNl4zaUREk0l_5kGtornyiowKxVbc\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Noltemeier, &#8220;A computational geometry approach to clustering problems&#8221;, in Proc. 1st ACM Symp. on Computational Geometry (SoCG), pp.245-250, ACM Dig. Library, 1985. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1WaOzLjjcUPY2FHXdfUthe9DuvvyUJkcj\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne and H.Noltemeier, &#8220;Clustering geometric objects and applications to layout problems&#8221;, in Proc. Computer Graphics Tokyo, pp.35-40, Springer, 1985. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1cM_bV0FMCuIsRb6L7YChNgsz6SjWJUOR\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<li style=\"font-weight: 400;\" aria-level=\"1\"><span style=\"font-weight: 400;\">F.Dehne, &#8220;An o(n^4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching in the Euclidean plane&#8221;, in Proc. Int. Colloquium on Automata, Languages and Programming (ICALP), pp.160-172, Springer LNCS 154, 1983. [<\/span><a href=\"https:\/\/drive.google.com\/file\/d\/1fmJVaRO6UjmQhLAGiZDd7aRv1doZEfeR\/view?usp=sharing\"><span style=\"font-weight: 400;\">pdf<\/span><\/a><span style=\"font-weight: 400;\">]<\/span><\/li>\n<\/ul>\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Citiation List 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. K.Broderick, M.T.Moutaoufik, T.Saccon, R.Malty, S.Amin, S.Phanse, T.P.Joseph, M.Zilocchi, A.Hosseinnia, Z.Istace, M.Hajikarimlou, S.Abrar, JFisher, R.Brassard, R.Perera, A.Kumar, H.Aoki, M.Rahmatbakhsh, M.Jessulat, D.Kobasa, F.Dehne, B.Prasad, A.Gagarinova, M.J.Lemieux, A.Cochrane, W.A.Houry, K.A.Aly, A.Golshani, M.Babu, [&hellip;]<\/p>\n","protected":false},"author":6,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_mi_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":"","_links_to":"","_links_to_target":""},"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v21.2 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Publications - Professor Frank Dehne<\/title>\n<meta name=\"description\" content=\"Citiation List Papers In Peer-Reviewed Journals Note: For Biochemistry, Genomics and Bioinformatics journals, the main senior authors are always at the\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/carleton.ca\/dehne\/publications\/\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"24 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/carleton.ca\/dehne\/publications\/\",\"url\":\"https:\/\/carleton.ca\/dehne\/publications\/\",\"name\":\"Publications - Professor Frank Dehne\",\"isPartOf\":{\"@id\":\"https:\/\/carleton.ca\/dehne\/#website\"},\"datePublished\":\"2023-08-24T04:01:48+00:00\",\"dateModified\":\"2025-10-26T18:05:52+00:00\",\"description\":\"Citiation List Papers In Peer-Reviewed Journals Note: For Biochemistry, Genomics and Bioinformatics journals, the main senior authors are always at the\",\"breadcrumb\":{\"@id\":\"https:\/\/carleton.ca\/dehne\/publications\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/carleton.ca\/dehne\/publications\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/carleton.ca\/dehne\/publications\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/carleton.ca\/dehne\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Publications\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/carleton.ca\/dehne\/#website\",\"url\":\"https:\/\/carleton.ca\/dehne\/\",\"name\":\"Professor Frank Dehne\",\"description\":\"Carleton University\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/carleton.ca\/dehne\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Publications - Professor Frank Dehne","description":"Citiation List Papers In Peer-Reviewed Journals Note: For Biochemistry, Genomics and Bioinformatics journals, the main senior authors are always at the","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/carleton.ca\/dehne\/publications\/","twitter_misc":{"Est. reading time":"24 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/carleton.ca\/dehne\/publications\/","url":"https:\/\/carleton.ca\/dehne\/publications\/","name":"Publications - Professor Frank Dehne","isPartOf":{"@id":"https:\/\/carleton.ca\/dehne\/#website"},"datePublished":"2023-08-24T04:01:48+00:00","dateModified":"2025-10-26T18:05:52+00:00","description":"Citiation List Papers In Peer-Reviewed Journals Note: For Biochemistry, Genomics and Bioinformatics journals, the main senior authors are always at the","breadcrumb":{"@id":"https:\/\/carleton.ca\/dehne\/publications\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/carleton.ca\/dehne\/publications\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/carleton.ca\/dehne\/publications\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/carleton.ca\/dehne\/"},{"@type":"ListItem","position":2,"name":"Publications"}]},{"@type":"WebSite","@id":"https:\/\/carleton.ca\/dehne\/#website","url":"https:\/\/carleton.ca\/dehne\/","name":"Professor Frank Dehne","description":"Carleton University","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/carleton.ca\/dehne\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"}]}},"acf":{"banner_image_type":"hosted","banner_button":"no","banner_hosted_image":"aerial","banner_opacity":"default"},"_links":{"self":[{"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/pages\/46"}],"collection":[{"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/comments?post=46"}],"version-history":[{"count":4,"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/pages\/46\/revisions"}],"predecessor-version":[{"id":410,"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/pages\/46\/revisions\/410"}],"wp:attachment":[{"href":"https:\/\/carleton.ca\/dehne\/wp-json\/wp\/v2\/media?parent=46"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}