shadow_tr

Faculty

Carola WenkCarola Wenk
Associate Professor

Email: cwenk@tulane.edu
Phone: (504) 865-5805
Fax: (504) 865-5786
Office: 303F Stanley Thomas Hall
Postal: Tulane University, New Orleans, LA 70118
Website: Personal Website

About Professor Wenk

Carola Wenk is an Associate Professor of Computer Science at Tulane University. She also holds an adjunct appointment in the Mathematics department. Her research area is in algorithms and computational geometry, with a focus on shape matching algorithms and interdisciplinary applications. Dr. Wenk has won research, teaching, and service awards, including an NSF CAREER award. Previously, she has headed an NIH-funded computational core facility for computational biology. Her research interests include a wide range of application areas including, but not limited to, geospatial data analysis, intelligent transportation systems, geographic information science, computational biology, and medical informatics.

Research Interests

My research interests are Algorithms and Data Structures, in particular Computational Geometry and Shape Matching, as well as Discrete Mathematics and applied areas such as Computational Biology and Intelligent Transportation Systems.s

Teaching


Publications

Refereed Journal Articles

[J1]    "Microwave & Magnetic (M2) Proteomics of the EAE Animal Model of Multiple Sclerosis", (I. Raphael, S. Mahesula, K. Kalsaria, V. Kotagiri, A.B. Purkar, M. Anjanappa, D. Shah, V. Pericherla, Y.L.A. Jadhav, M. Vaynberg, D. Noriega, N.H. Grimaldo, C. Wenk, J. Gelfond, T.G. Forsthuber, W.E. Haskins), accepted to Electrophoresis, 2012.

[J2]    "Approximating the Frechet Distance for Realistic Curves in Near Linear Time" [pdf], (A. Driemel, S. Har-Peled, C. Wenk), Discrete & Computational Geometry 48(1): 94-127, 2012.

[J3]     "Median Trajectories", (K. Buchin, M. Buchin, M. van Kreveld, M. Loffler, R.I. Silveira, C. Wenk, L. Wiratma), Algorithmica, Online First: May 2012.

[J4]     "Link Distance and Shortest Path Problems in the Plane", (A.F. Cook IV and C. Wenk), Computational Geometry: Theory and Applications 44(8): 442-455, 2011.

[J5]     ``Geodesic Fréchet Distance Inside a Simple Polygon'' (A.F. Cook IV and C. Wenk), ACM Transactions on Algorithms: 7(1), 19 pages, 2010.

[J6]     ``Computing the Fréchet Distance Between Simple Polygons'' (K. Buchin, M. Buchin, and C. Wenk), Computational Geometry: Theory and Applications (CGTA) 41: 2-20, Elsevier, 2008.

[J7]     ``NeuronMorphometrics: A Tool for Semi-Automated Processing of Cultured Neuronal Cell Images'' [abstract] (M. Narro, F. Yang, R. Kraft, C. Wenk, A. Efrat, L. Restifo), Brain Research 1138:57-75, Elsevier, 2007.

[J8]     ``Drawing with Fat Edges'' (C.A. Duncan, A. Efrat, S.G. Kobourov, and C. Wenk), International Journal of Foundations of Computer Science (IJFCS), special issue on Graph Drawing, 17(5): 1143-1163, World Scientific, 2006.

[J9]     ``Matching Polyhedral Terrains Using Overlays of Envelopes'' (V. Koltun and C. Wenk), Algorithmica 41(3): 159-183, Springer, 2005.

[J10]     ``Covering with Ellipses'' (A. Efrat, F. Hoffmann, C. Knauer, K. Kriegel, G. Rote, and C. Wenk), Algorithmica (special issue on shape algorithmics) 38(2):145-160, Springer, 2004.

[J11]     ``Comparison of Distance Measures for Planar Curves'' (H. Alt, C. Knauer, and C. Wenk), Algorithmica (special issue on shape algorithmics) 38(2):45-58, Springer, 2004.

[J12]     ``Matching Planar Maps'' (H. Alt, A. Efrat, G. Rote, and C. Wenk), Journal of Algorithms 49: 262-283, Elsevier, 2003.<

[J13]     ``Computing the Hausdorff Distance of Geometric Patterns and Shapes'' (H. Alt, P. Braß, M. Godau, C. Knauer, and C. Wenk), Discrete and Computational Geometry - The Goodman-Pollack-Festschrift, 65-76, Springer, 2003.

[J14]     ``Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology'' (C. Wenk), Journal of Discrete Algorithms 1(5-6):367-385, Elsevier, 2003.

[J15]     ``Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels'' (A. Efrat, F. Hoffmann, K. Kriegel, C. Schultz, and C. Wenk), Journal of Computational Biology; special issue dedicated to RECOMB 2001, 9(2): 299-316, Mary Ann Liebert publishers, 2002.

[J16]     ``An Alternative Approach to Deal with Geometric Uncertainties in Computer Analysis of Two-Dimensional Electrophoresis Gels'' (K. Kriegel, I. Seefeldt, F. Hoffmann, C. Schultz, C. Wenk, V. Regitz-Zagrosek, H. Oswald, and E. Fleck), Electrophoresis 21:2637-2640, Wiley, 2000.

[J17]     ``On the Number of Cylinders Touching a Ball'' (P. Braß and C. Wenk), Geometriae Dedicata 81:281-284, Springer, 2000.

[J18]     ``New Algorithmic Approaches to Protein Spot Detection and Pattern Matching in Two-Dimensional Electrophoresis Gel Databases'' (K.-P. Pleißner, F. Hoffmann, K. Kriegel, C. Wenk, S. Wegner, A. Sahlströhm, H. Oswald, H. Alt, and E. Fleck), Electrophoresis 20:755-765, Wiley, 1999.

[J19]     ``An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Spots'' (F. Hoffmann, K. Kriegel, and C. Wenk), Discrete Applied Mathematics 93: 75-88, Elsevier, 1999.

Refereed Conference Publications

[C1]     "Constructing Street Networks from GPS Trajectories", (M. Ahmed and C. Wenk), European Symposium on Algorithms (ESA): 60-71, Ljubljana, Slovenia, 2012.

[C2]     "Partial Matching between Surfaces Using Fréchet Distance" (J. Sherette and C. Wenk), Scandinavian Symposium and Workshops on Algorithm Theory (SWAT): 13-23, Helsinki, Finland, 2012.

[C3]     "Computing the Frechet Distance between Folded Polygons" (A.F. Cook IV, A. Driemel, S. Har-Peled, J. Sherette, C. Wenk), Algorithms and Data Structures Symposium (WADS): 267-278, Brooklyn, New York, 2011.

[C4]     "Approximate Map Matching with respect to the Frechet Distance", (D. Chen, A. Driemel, L. Guibas, A. Nguyen, C. Wenk), Proc. Workshop on Algorithm Engineering and Experiments (ALENEX): 75-83, San Francisco, California, 2011.

[C5]     "Median Trajectories", (K. Buchin, M. Buchin, M. van Kreveld, M. Loffler, R.I. Silveira, C. Wenk, L. Wiratma), Proc. 18th Annual European Symposium on Algorithms (ESA): 463-474, Liverpool, UK, 2010.

[C6]     "Approximating the Frechet Distance for Realistic Curves in Near Linear Time", (A. Driemel, S. Har-Peled, C.Wenk), Proc. 20th ACM Symposium on Computational Geometry (SoCG'10): 365-374, 2010.

[C7]     ``Visiting a Sequence of Points with a Bevel-Tip Needle'', (S. Bitner, Y. K. Cheung, A. F. Cook IV, O. Daescu, A. Kurdia, C. Wenk), Proc. 9th Latin American Theoretical Informatics Symposium: 492-502, Oaxaca, Mexico, 2010.

[C8]     ``A New Perspective on Efficient and Dependable Vehicle Routing'', (D. Pfoser, A. Efentakis, A. Voisard, C. Wenk), Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS): 388-391, Seattle, Washington, 2009.

[C9]     ``Shortest Path Problems on a Polyhedral Surface'', (A. F. Cook IV, C. Wenk), Algorithms and Data Structures Symposium: 156-167, Banff, Alberta, Canada, 2009. Best Paper Award.

[C10]     ``Link Distance and Shortest Path Problems in the Plane'', (A.F. Cook IV, C. Wenk), Proc. Algorithmic Aspects in Information and Management (AAIM): 140-151, San Francisco, California, 2009.

[C11]     ``Geodesic Fréchet Distance Inside a Simple Polygon'' (A.F. Cook IV and C. Wenk), Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS): 193-204, Bordeaux, France, 2008.

[C12]     ``Fréchet Distance for Curves, Revisited'' (B. Aronov, S. Har-Peled, C. Knauer, Y. Wang, and C. Wenk), Proceedings of the 14th Annual European Symposium on Algorithms (ESA): 52-63, LNCS 4168, Zurich, Switzerland, 2006.

[C13]     ``Addressing the Need for Map-Matching Speed: Localizing Global Curve-Matching Algorithms'' (C. Wenk, R. Salas and D. Pfoser), Proc. 18th International Conference on Scientific and Statistical Database Management (SSDBM): 379-388, Vienna, Austria, 2006.

[C14]     ``Computing the Fréchet Distance Between Simple Polygons in Polynomial Time'' (K. Buchin, M. Buchin, and C. Wenk), Proc. 22nd ACM Symp. on Computational Geometry (SoCG): 80-87, Sedona, Arizona, 2006.

[C15]     ``On Map-Matching Vehicle Tracking Data'' (S. Brakatsoulas, D. Pfoser, R. Salas, and C. Wenk), Proc. 31st Conference on Very Large Data Bases (VLDB): 853-864, Trondheim, Norway, 2005.

[C16]     ``Matching Polyhedral Terrains Using Overlays of Envelopes'' (V. Koltun and C. Wenk), Algorithm Theory - SWAT 2004: 114-126, LNCS 3111, Humlebaek, Denmark, 2004.

[C17]     ``Matching Planar Maps'' (H. Alt, A. Efrat, G. Rote, and C. Wenk), Proc. 14th Symp. Discrete Algorithms (SODA): 589-598, Baltimore, USA, 2003.

[C18]     ``Covering Shapes by Ellipses'' (A. Efrat, F. Hoffmann, C. Knauer, K. Kriegel, G. Rote, and C. Wenk), Proc. 13th Symp. Discrete Algorithms (SODA): 453-454, San Francisco, USA, 2002.

[C19]     ``Drawing with Fat Edges'' (C.A. Duncan, A. Efrat, S.G. Kobourov, and C. Wenk), Proc. 9th Int. Symp. Graph Drawing (GD): 162-177, 2001, Vienna, Austria, 2001.

[C20]     ``Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels'' (A. Efrat, F. Hoffmann, K. Kriegel, C. Schultz, and C. Wenk), Proc. 5th Ann. Int. Conf. Computational Molecular Biology (RECOMB): 114-123, Montreal, Canada, 2001.

[C21]     ``Matching Polygonal Curves with Respect to the Fréchet Distance'' (H. Alt, C. Knauer, C. Wenk), Proc. 18th Int. Symp. Theoretical Aspects of Computer Science (STACS): 63-74, Dresden, Germany, 2001.

[C22]     ``Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology'' (C. Wenk), Proc. 10th Ann. Symp. Combinatorial Pattern Matching (CPM):223-242, LNCS 1645, Warwick, Great Britain, 1999.

[C23]     ``Matching 2D patterns of protein spots'' (F. Hoffmann, K. Kriegel, and C. Wenk), Proc. 14th Ann. Symp. Computational Geometry (SoCG): 231-239, Minneapolis, USA, 1998.

Workshop Contributions and Technical Reports

[W1]     "Partial Matching between Surfaces Using Fréchet Distance" (J. Sherette, C. Wenk), 21st Fall Workshop on Computational Geometry (2 pages), City College of New York, Manhattan, NY, 2011.

[W2]     "Constructing Street-Maps from GPS Trajectories" (M. Ahmed, C. Wenk), 21st Fall Workshop on Computational Geometry (2 pages), City College of New York, Manhattan, NY, 2011.

[W3]     "Computing the Fréchet Distance Between Polyhedral Surfaces with Acyclic Dual Graphs" (A.F. Cook IV, J. Sherette, C. Wenk), 19th Fall Workshop on Computational Geometry: 75-76, Tufts University, Medford, MA, 2009.

[W4]     "Visiting Points with a Bevel-Tip Needle", (S. Bitner, Y. K. Cheung, A. F. Cook IV, O. Daescu, A. Kurdia, C. Wenk), 19th Fall Workshop on Computational Geometry: 61-62, Tufts University, Medford, MA, 2009.

[W5]     "Shortest Path Problems on a Polyhedral Surface", (A.F. Cook IV, C. Wenk) UTSA Technical Report CS-TR-2009-001, 2009.

[W6]     "Exploiting Road Network Properties in Efficient Shortest-Path Computation", [pdf] (D. Pfoser, A. Efentakis, A. Voisard, C. Wenk) ICSI Technical Report TR-09-007, International Computer Science Institute, UC Berkeley, 2009.

[W7]     "Shortest Path Problems on a Polyhedral Surface", (A.F. Cook IV, C. Wenk) 25th European Workshop on Computational Geometry (EuroCG'09), Brussels, Belgium, 2009.

[W8]     "Min-Link Shortest Path Maps and Fréchet Distance", [pdf] (A.F. Cook IV, C. Wenk) UTSA Technical Report CS-TR-2008-0011, 2008.

[W9]     "Geodesic Fréchet Distance With Polygonal Obstacles", [pdf] (A.F. Cook IV, C. Wenk) UTSA Technical Report CS-TR-2008-0010, 2008.

[W10]     "Geodesic Fréchet Distance Inside a Simple Polygon" (A.F.Cook, C. Wenk), 17th Fall Workshop on Computational Geometry, 2007, IBM Hawthorne.

[W11]     "Dynamic Routing", (N.Kalinowski, C. Wenk) [pdf] UTSA Technical Report CS-TR-2007-005, 2007.

[W12]     "Geodesic Fréchet and Hausdorff Distance Inside a Simple Polygon" [pdf] (A.F. Cook IV, C. Wenk), UTSA Technical Report CS-TR-2007-004, 2007.

[W13]     "How Difficult is it to Walk the Dog?", (K. Buchin, M. Buchin, C. Knauer, G. Rote, C. Wenk), 23rd European Workshop on Computational Geometry: 170-173, 2007, Graz, Austria.

[W14]     ``Shortest Tour of a Sequence of Segments in L_\infty'' (E. Arkin, A. Efrat, C. Erten, F. Hurtado, J. Mitchell, V. Polishchuk, C. Wenk), to appear in 16th Fall Workshop on Computational Geometry, 2006, Smith College.

[W15]     ``Computing the Fréchet Distance Between Simple Polygons in Polynomial Time'', (K. Buchin, M. Buchin, and C. Wenk), 22nd European Workshop on Computational Geometry, 2006, Delphi, Greece.

[W16]     ``Fréchet Distance Between Simple Polygons'', (K. Buchin, M. Buchin, and C. Wenk), 15th Annual Fall Workshop on Computational Geometry, 2005, Philadelphia, Pennsylvania.

[W17]     ``Matching Planar Maps'', (H. Alt, A. Efrat, Günter Rote, and C.\ Wenk), 12th Annual Fall Workshop on Computational Geometry, 2002, Rutgers, Piscataway, New Jersey.

[W18]     ``Bounding the Fréchet distance by the Hausdorff distance'', (H. Alt, C. Knauer, and C.\ Wenk), 17th European Workshop on Computational Geometry: 166-169, 2001, Berlin, Germany.

[W19]     ``A Geometric Approach to Protein Identification in 2D Electrophoretic Gel Images'' (F. Hoffmann, K. Kriegel, and C.\ Wenk), 15th European Workshop on Computational Geometry: 173-174, 1999, Antibes, France.

[W20]     ``A Simple and Robust Geometric Algorithm for Landmark Registration in Computer Assisted Neurosurgery'', (F. Hoffmann, K. Kriegel, S. Schönherr, and C. Wenk), Technical Report B 99-21, Freie Universität Berlin, Fachbereich Mathematik und Informatik, December 1999.

[W21]     ``New Algorithmic Tools for comparing 2D Patterns of Protein Spots'' (F. Hoffmann, K. Kriegel, and C.\ Wenk), 14th European Workshop on Computational Geometry, 1998, Barcelona, Spain.


Posters, Videos, Software

[P1]     "Constructing Street-Maps from GPS Trajectories" (M. Ahmed, C. Wenk), poster, Grace Hopper Celebration of Women in Computing, 2011.

[P2]     "An Efficient Computing Infrastructure for Computational Systems Biology at the University of Texas at San Antonio" (Z. Wang, J. Bower, K.A. Robbins, F. Santamaria, Y. Wang, C. Wenk), poster, 12th RCMI International Symposium on Health Disparities, 2010.

[P3]     "Building an institutional base for Computational Neuroscience: the CBI at UTSA/UTHSCSA", (Z. Wang, K.A. Robbins, Y. Wang, C. Livi, A.D. Coop, F. Santamaria, C. Wenk, J.M. Bower), poster, 19th Annual Computational Neuroscience Meeting: CNS*2010, San Antonio, TX; BMC Neuroscience 2010, 11(Suppl 1):P67 (20 July 2010).

[P4]     ``A New Perspective on Efficient and Dependable Vehicle Routing'', poster, (D. Pfoser, A. Efentakis, A. Voisard, C. Wenk), 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS), Seattle, Washington, 2009.

[P5]     ``Models for Teardrop Spots in 2-DE Gels'', (S.M. Pivek, S.T. Weintraub, and C. Wenk), poster, 11th RCMI International Symposium on Health Disparities, 2008.

[P6]     ``Finding a Curve in a Map'' [QuickTime] - [Windows Media] - (C. Wenk, H. Alt, A. Efrat, L. Palaniappan, and G. Rote), video, 19th Ann. Symp. Computational Geometry (SoCG), 2003, San Diego, USA.

[P7]     ``Drawing Fat Graphs'' [avi, gzipped video, abstract ps] (A. Efrat, S.G.Kobourov, M. Stepp, and C. Wenk), video, 18th Ann. Symp. Computational Geometry (SoCG), 2002, Barcelona, Spain.

[P8]     CAROL - a tool for spot detection in and matching of two-dimensional electrophoresis gels: http://gelmatching.inf.fu-berlin.de (K. Kriegel, C. Wenk, C. Schultz, F. Hoffmann, and D. Dimitrov). Software. Since 2001 integrated into the gel analysis software PDQUEST by BioRad.

[P9]     ``Identification of Proteins by Point Pattern Matching of Two-Dimensional Gel Electrophoresis Databases'' (H. Alt, F. Hoffmann, K. Kriegel, C. Wenk, E. Fleck, H. Oswald, K.-P. Pleissner, S. Wegener), poster, Jahrestagung der Humangenetischen Gesellschaft, October 1998.

[P10]     ``CAROL - New Algorithmic Tools for Comparing Two-Dimensional Electrophoretic Gel Images'' (H. Alt, F. Hoffmann, K. Kriegel, C. Wenk, and K.-P. Pleissner), poster P21, Electrophorese Forum 1997, Strasbourg.


School of Science and Engineering, 201 Lindy Boggs Center, New Orleans, LA 70118 504-865-5764 sse@tulane.edu