• Barbic, Jernej*; Miller, Gary; Quadratic Running Time Example for Ruppert’s Refinement Algorithm

• Li, Shimin*; Alogrithms for Connectivity Maintenance and Barrier Coverage on a Closed Cycle

• Barequet, Gill*; Nagel, Zohar; Counting Polyominoes by Area and Perimeter

• Homsombut, Ponpailin*; Kamata, Tonan; Uehara, Ryuhei; Undecidability of Symmetric Shape Puzzles

• Gezalyan, Auguste; Mount, David; Goodrich, Michael; Sridhar, Vinesh*; Improved Algorithms for Voronoi Diagrams, Delaunay Triangulations, and Support Hulls in Polygonal Hilbert Geometries

• Biedl, Therese*; Unbent collections of non-planar s-grid drawings

• Barequet, Gill*; D\v{z}uklevski, Aleksa; Feldman, Tom; Stable Polyominoes and Polycubes

• Baumann, Alexander ; Biedl, Therese*; Elashmawi, Mahmoud; Fink, Simon Dominik; Saumell, Maria; Schulz, André; On Reconstructing a Convex Polygon from Partial Information

• Fox, James; Damian, Mirela*; Pinch-Free Orientations of Polyomino Grid Graphs

• McCoy, Bradley*; Zhu, Binhai; Optimistic Imprecise Shortest Watchtower in 1.5D and 2.5D

• Hossain, Md Billal; Raichel, Benjamin*; Red-Blue k-Center Clustering with Distance Constraints Revisited

• Cho, Jiun*; Wagner, Hubert; Counting Configurations in Cubical Geometry

• Bae, Sang Won; Chung, Chaeyoon; Dobbins, Michael Gene; Mulzer, Wolfgang*; Willert, Max; Wong, Sampson; On the Complexity of Counting Empty Triangles

• Chiu, Alvin; Eppstein, David; Goodrich, Michael; LIU, SONGYU*; Layer-Respecting Linear Graph Layouts

• Sato, Masaru*; Kamata, Tonan; Ryuhei, Uehara; Analysis of the Complexity Classes of the 3-Dimensional Silhouette Puzzle

• O'Rourke, Joseph*; Overlapping Unfoldings of Cones and Convex Polyhedra

• Tuggle, Randal*; Snoeyink, Jack; NP-Hardness of Non-Crossing Hamiltonian Path and Cycle in Non-Planar Graphs

• Aktener, Ege; Freitag, James; Reyzin, Lev*; Stable Spanning Trees with Sparse Steiner Components

• Chubet, Oliver; Kudaraya, Anvi; Kukkapalli, Niyathi; Sheehy, Donald*; The Product Range Search Problem in Doubling Metrics

• Eppstein, David*; Tangent Spheres and Integer Distances

• Higashikawa, Yuya; Iida, Kosei*; Shiota, Takumi; A Reverse Search Algorithm for Computing Minimum-Weight Plane Laman Graphs

• Carmi, Paz; HOROVITZ, NIR*; Yashuk, Yonatan; Geometric Spanners via the Descending Greedy Filter

• Chambers, Erin Wolf; Hasan, Ray; Hosseini Sereshgi, Erfan; Munch, Elizabeth; Percival, Sarah*; Rodman, William; Wang, Elena Xinyi; Wenk, Carola; Comparing Distances for Embedded Graphs

• Loffler, Maarten; Raichel, Benjamin*; Preprocessing Disks for Convex Hulls, Revisited

• Brötzner, Anna; Huynh, Kien C.; Schmidt, Christiane; Stock, Frederick*; The Chromatic Dispersive Art Gallery Problem in Polyominoes

• Bahoo, Yeganeh; Saeedi, Sajad; Sherman, Roni*; An Exact Generalized k-Cell Decomposition

• Hadi Niya, Nazanin*; Abedian, Mohammad Mahdi; Ghodsi, Mohammad; Mulzer, Wolfgang; Edge-Sliding Cameras in the Art Gallery: Guarding Orthogonal Polygons

• Kwon, Seongmin; Jung, MookKwon; Ahn, Hee-Kap*; Freeze-Tag Problems on Binary Trees and Interval Graphs

• Kryven, Myroslav*; Durocher, Stephane; Le, Nam; On Vertex Deletion to k-Planarity in 2-Layer Layouts with Fixed Vertex Orders

• Kamaludeen, Ahmad*; Bahoo, Yeganeh; Kundu, Somnath; Guaranteed Escape for a Bouncing Robot in Pipe Chains

• Durocher, Stephane*; Newbury, Fraser; Zhu, Leqi; A New Lower Bound on 3-point Weak ϵ-nets

• Avila-Jimenez, Alberto; Santos, Pablo; Tomai, Evan; Wylie, Tim*; Global Motion Control in Full Tilt with Burnout

• Tuggle, Randal*; Snoeyink, Jack; Spatial Separation and Non-crossing $k$-chromatic Hamiltonian Paths and Cycles

• Huroyan, Vahan*; Zaman, Rahat; Kobourov, Stephen; 3DMPE: 3D Multi-Perspective Embedding

• Group, MIT Folding; Akitaya, Hugo; Brunner, Josh; Demaine, Erik; Lynch, Jayson; Solotko, Saskia; Stock, Frederick*; Optimizing Solutions to the Fold and Punch Problem

• Krishnan, Jyothi; Misra, Neeldhara*; Ranade, Shounak; Umarjee, Siddhesh; On Generalized Goats and Tigers

• Brunner,  Josh; Chung, Lily; Damian, Mirela*; Demaine, Erik ; Hendrickson, Della; Grid Sona Drawings for 2-Scaled Point Sets

• Barish, Robert*; Shibuya, Tetsuo; Partitioning the boundary of an art gallery with visibility polygons

• Eppstein, David; Hadizadeh, Zahra*; Minimum-Weight Steiner Triangulation of Convex Polygons Requires Interior Steiner Points

• Abu Affash, Karim*; Carmi, Paz; Mitchell, Joseph ; Dominating Set in Bipartite Circle Graphs

• Tardibuono, Michael*; Zhang, Hanyu; Diomidova, Jenny; Kryger, Landon; Jacobus, Nicole; Parker, Matthew; Uehara, Ryuhei; D. Demaine, Erik; Polyomino Nets Covering Three Different Boxes of Area 106 and Related Results

• Das, Sandip*; Roy, Basudeb; Swami, Sarvottamananda; Single-round Voronoi Games based on Minkowski functionals

• Yashuk, Yonatan*; Horovitz, Nir; Carmi, Paz; Demand-Aware Geometric Spanners

• Higashikawa, Yuya; Namura, Sora*; Shiota, Takumi; An XP Algorithm for Euclidean Minimum-Weight Plane Laman Graphs

• Kiatchaipipat, Nattapol*; Ruangwises, Suthee; NP-Completeness Proofs of Puzzles using the T-Metacell Framework

• Ono, Hirotaka*; NP-hardness of the $L(2,1)$-labeling problem on unit disk graphs

• Qian, Helen; Williams, Aaron*; A Hamilton Path in the $s$-Associahedron

• Sun, Richard*; Window Queries over Non-Crossing Line Segments via Fractional Cascading on DAG Structures

• Das, Arun Kumar*; Das, Sandip; Das, Sweta; Karra, Sangeetha; Minimum Charging Station Placement for a Traveling Salesman

• Bereg, Sergey*; On Totally-Concave Polycubes

Note: Authors with asterisks symbol (*) beside their name are the primary contact author for their corresponding paper.