Choosing a Reliable Hypothesis. - William S. Evans; Sridhar Rajagopalan; Umesh V. Vazirani (COLT, 1993)

Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas - William S. Evans; Leonard J. Schulman (FOCS, 1993)

Checking the Correctness of Memories. - Manuel Blum 001; William S. Evans; Peter Gemmell; Sampath Kannan; Moni Naor (Algorithmica, 1994)

Approximating Shortest Paths in Arrangements of Lines. - Prosenjit Bose; William S. Evans; David G. Kirkpatrick; Michael McAllister; Jack Snoeyink (CCCG, 1996)

Lower Bounds for Noisy Boolean Decision Trees. - William S. Evans; Nicholas Pippenger (STOC, 1996)

A Glossary of Time Granularity Concepts. - Claudio Bettini; Curtis E. Dyreson; William S. Evans; Richard T. Snodgrass; Xiaoyang Sean Wang (Temporal Databases, Dagstuhl, 1997)

Code Compression. - Jens Ernst; William S. Evans; Christopher W. Fraser; Steven Lucco; Todd A. Proebsting (PLDI, 1997)

Recovering lines with fixed linear probes. - Mark de Berg; Prosenjit Bose; David Bremner; William S. Evans; Lata Narayanan (CCCG, 1998)

Compression via Guided Parsing. - William S. Evans (Data Compression Conference, 1998)

Average-Case Lower Bounds for Noisy Boolean Decision Trees. - William S. Evans; Nicholas Pippenger (SIAM J. Comput., 1998)

On the Maximum Tolerable Noise for Reliable Computation by Formulas. - William S. Evans; Nicholas Pippenger (IEEE Trans. Inf. Theory, 1998)

Signal propagation and noisy circuits. - William S. Evans; Leonard J. Schulman (IEEE Trans. Inf. Theory, 1999)

Efficiently Supported Temporal Granularities. - Curtis E. Dyreson; William S. Evans; Hong Lin; Richard T. Snodgrass (IEEE Trans. Knowl. Data Eng., 2000)

Compiler techniques for code compaction. - Saumya K. Debray; William S. Evans; Robert Muth; Bjorn De Sutter (ACM Trans. Program. Lang. Syst., 2000)

Bytecode Compression via Profiled Grammar Rewriting. - William S. Evans; Christopher W. Fraser (PLDI, 2001)

Right-Triangulated Irregular Networks. - William S. Evans; David G. Kirkpatrick; G. Townsend (Algorithmica, 2001)

Profile-Guided Code Compression. - Saumya K. Debray; William S. Evans (PLDI, 2002)

Diamonds are Not a Minimum Weight Triangulation's Best Friend. - Prosenjit Bose; Luc Devroye; William S. Evans (Int. J. Comput. Geom. Appl., 2002)

Triangle Guarding. - Jocelyn Smith; William S. Evans (CCCG, 2003)

Predicated Instructions for Code Compaction. - Warren Cheung; William S. Evans; Jeremy Moses (SCOPES, 2003)

Cold code decompression at runtime. - Saumya K. Debray; William S. Evans (Commun. ACM, 2003)

Grammar-based compression of interpreted code. - William S. Evans; Christopher W. Fraser (Commun. ACM, 2003)

On the maximum tolerable noise of k-input gates for reliable computation by formulas. - William S. Evans; Leonard J. Schulman (IEEE Trans. Inf. Theory, 2003)

Optimistic shortest paths on uncertain terrains. - Chris Gray; William S. Evans (CCCG, 2004)

Voilà: Delivering Messages Across Partitioned Ad-Hoc Networks. - Ritesh Shah; Norman C. Hutchinson; William S. Evans (LCN, 2004)

Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. - William S. Evans; David G. Kirkpatrick (SODA, 2004)

Restructuring ordered binary trees. - William S. Evans; David G. Kirkpatrick (J. Algorithms, 2004)

Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. - Alice M. Dean; William S. Evans; Ellen Gethner; Joshua D. Laison; Mohammad Ali Safari; William T. Trotter (GD, 2005)

Computing the Set of all the Distant Horizons of a Terrain. - Daniel Archambault; William S. Evans; David G. Kirkpatrick (Int. J. Comput. Geom. Appl., 2005)

Program Compression. - William S. Evans (Duplication, Redundancy, and Similarity in Software, 2006)

06301 Working Session Summary: Presentation and Visualization of Redundant Code. - Andrew Walenstein; James R. Cordy; William S. Evans; Ahmed E. Hassan; Toshihiro Kamiya; Cory Kapser; Ettore Merlo (Duplication, Redundancy, and Similarity in Software, 2006)

Similarity in Programs. - Andrew Walenstein; Mohammad El-Ramly; James R. Cordy; William S. Evans; Kiarash Mahdavi; Markus Pizka; Ganesan Ramalingam; Jürgen Wolff von Gudenberg (Duplication, Redundancy, and Similarity in Software, 2006)

On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. - Prosenjit Bose; Luc Devroye; William S. Evans; David G. Kirkpatrick (SIAM J. Discret. Math., 2006)

Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ. - William S. Evans; David G. Kirkpatrick (ACM Trans. Algorithms, 2006)

Pursuit-Evasion Voronoi Diagrams in ell_1. - Warren Cheung; William S. Evans (ISVD, 2007)

Bar k-Visibility Graphs. - Alice M. Dean; William S. Evans; Ellen Gethner; Joshua D. Laison; Mohammad Ali Safari; William T. Trotter (J. Graph Algorithms Appl., 2007)

Guaranteed Voronoi Diagrams of Uncertain Sites. - Jeff Sember; William S. Evans (CCCG, 2008)

Clone detection via structural abstraction. - William S. Evans; Christopher W. Fraser; Fei Ma (Softw. Qual. J., 2009)

Multi-guard covers for polygonal regions. - Zohreh Jabbari; William S. Evans; David G. Kirkpatrick (CCCG, 2010)

k-star-shaped polygons. - Jeff Sember; William S. Evans (CCCG, 2010)

On Graphs Supported by Line Sets. - Vida Dujmovic; William S. Evans; Stephen G. Kobourov; Giuseppe Liotta; Christophe Weibel; Stephen K. Wismath (GD, 2010)

The Possible Hull of Imprecise Points. - Jeff Sember; William S. Evans (CCCG, 2011)

On Representing Graphs by Touching Cuboids. - David Bremner; William S. Evans; Fabrizio Frati; Laurie J. Heyer; Stephen G. Kobourov; William J. Lenhart; Giuseppe Liotta; David Rappaport; Sue Whitesides (GD, 2012)

Universal Point Subsets for Planar Graphs. - Patrizio Angelini; Carla Binucci; William S. Evans; Ferran Hurtado; Giuseppe Liotta; Tamara Mchedlidze; Henk Meijer; Yoshio Okamoto (ISAAC, 2012)

On k-Guarding Polygons. - Daniel Busto; William S. Evans; David G. Kirkpatrick (CCCG, 2013)

Competitive query strategies for minimising the ply of the potential locations of moving points. - William S. Evans; David G. Kirkpatrick; Maarten Löffler; Frank Staals (SoCG, 2013)

Table Cartograms. - William S. Evans; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov; Debajyoti Mondal; Rahnuma Islam Nishat; Kevin Verbeek (ESA, 2013)

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (ISAAC, 2013)

On point-sets that support planar graphs. - Vida Dujmovic; William S. Evans; Sylvain Lazard; William J. Lenhart; Giuseppe Liotta; David Rappaport; Stephen K. Wismath (Comput. Geom., 2013)

Approximate proximity drawings. - William S. Evans; Emden R. Gansner; Michael Kaufmann 001; Giuseppe Liotta; Henk Meijer; Andreas Spillner 001 (Comput. Geom., 2013)

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Giuseppe Liotta; Tamara Mchedlidze; Stephen K. Wismath (CoRR, 2013)

Column Planarity and Partial Simultaneous Geometric Embedding. - William S. Evans; Vincent Kusters; Maria Saumell; Bettina Speckmann (GD, 2014)

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. - William S. Evans; Michael Kaufmann 001; William J. Lenhart; Tamara Mchedlidze; Stephen K. Wismath (J. Graph Algorithms Appl., 2014)

Contact Representations of Graphs in 3D. - Md. Jawaherul Alam; William S. Evans; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter; Torsten Ueckerdt (WADS, 2015)

Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. - Md. Jawaherul Alam; William S. Evans; Stephen G. Kobourov; Sergey Pupyrev; Jackson Toeniskoetter; Torsten Ueckerdt (CoRR, 2015)

On characterizing terrain visibility graphs. - William S. Evans; Noushin Saeedi (J. Comput. Geom., 2015)

Recognizing a DOG is Hard, But Not When It is Thin and Unit. - William S. Evans; Mereke van Garderen; Maarten Löffler; Valentin Polishchuk (FUN, 2016)

Covering Points with Convex Sets of Minimum Size. - Hwan-Gue Cho; William S. Evans; Noushin Saeedi; Chan-Su Shin (WALCOM, 2016)

Alternating paths and cycles of minimum length. - William S. Evans; Giuseppe Liotta; Henk Meijer; Stephen K. Wismath (Comput. Geom., 2016)

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. - Patrizio Angelini; William S. Evans; Fabrizio Frati; Joachim Gudmundsson (J. Graph Theory, 2016)

Minimizing Co-location Potential of Moving Entities. - William S. Evans; David G. Kirkpatrick; Maarten Löffler; Frank Staals (SIAM J. Comput., 2016)

Recognizing and drawing IC-planar graphs. - Franz J. Brandenburg; Walter Didimo; William S. Evans; Philipp Kindermann; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2016)

Simultaneous visibility representations of plane st-graphs using L-shapes. - William S. Evans; Giuseppe Liotta; Fabrizio Montecchiani (Theor. Comput. Sci., 2016)

Column planarity and partially-simultaneous geometric embedding. - Luis Barba; William S. Evans; Michael Hoffmann 001; Vincent Kusters; Maria Saumell; Bettina Speckmann (J. Graph Algorithms Appl., 2017)

Ortho-polygon Visibility Representations of Embedded Graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Algorithmica, 2018)

Visibility representations of boxes in 2.5 dimensions. - Alessio Arleo; Carla Binucci; Emilio Di Giacomo; William S. Evans; Luca Grilli 001; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Sue Whitesides; Stephen K. Wismath (Comput. Geom., 2018)

Table cartogram. - William S. Evans; Stefan Felsner; Michael Kaufmann 001; Stephen G. Kobourov; Debajyoti Mondal; Rahnuma Islam Nishat; Kevin Verbeek (Comput. Geom., 2018)

Covering points with convex sets of minimum size. - Sang Won Bae 001; Hwan-Gue Cho; William S. Evans; Noushin Saeedi; Chan-Su Shin (Theor. Comput. Sci., 2018)

New results on edge partitions of 1-plane graphs. - Emilio Di Giacomo; Walter Didimo; William S. Evans; Giuseppe Liotta; Henk Meijer; Fabrizio Montecchiani; Stephen K. Wismath (Theor. Comput. Sci., 2018)

Representing Graphs and Hypergraphs by Touching Polygons in 3D. - William S. Evans; Pawel Rzazewski; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (GD, 2019)

Minimizing Interference Potential Among Moving Entities. - Daniel Busto; William S. Evans; David G. Kirkpatrick (SODA, 2019)

On problems related to crossing families. - William S. Evans; Noushin Saeedi (CoRR, 2019)

Simultaneous visibility representations of undirected pairs of graphs. - Ben Chugg; William S. Evans; Kelvin Wong (Comput. Geom., 2021)

On Area-Universal Quadrangulations. - William S. Evans; Stefan Felsner; Linda Kleist; Stephen G. Kobourov (J. Graph Algorithms Appl., 2021)

Angle Covers: Algorithms and Complexity. - William S. Evans; Ellen Gethner; Jack Spalding-Jamieson; Alexander Wolff 001 (J. Graph Algorithms Appl., 2021)

Designing Game-Based Rehabilitation Experiences for People with Aphasia. - Kathryn Hymes; Jessica Hammer; Hakan Seyalioglu; Carol Dow-Richards; Deidra Brown; Trish Hambridge; Jill Ventrice; Meguey Baker; Yeonsoo Julian Kim; Tim Hutchings; William S. Evans (Proc. ACM Hum. Comput. Interact., 2021)

The Polygon Burning Problem. - William S. Evans; Rebecca Lin (WALCOM, 2022)

Minimum rectilinear polygons for given angle sequences. - William S. Evans; Krzysztof Fleszar 001; Philipp Kindermann; Noushin Saeedi; Chan-Su Shin; Alexander Wolff 001 (Comput. Geom., 2022)

Reachability of turn sequences. - William S. Evans; Noushin Saeedi; Chan-Su Shin; Hyun Tark (CoRR, 2022)

Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. - William S. Evans; David G. Kirkpatrick (CoRR, 2022)

A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. - William S. Evans; David G. Kirkpatrick (WAOA, 2023)

Morphing Planar Graph Drawings Through 3D. - Kevin Buchin; William S. Evans; Fabrizio Frati; Irina Kostitsyna; Maarten Löffler; Tim Ophelders; Alexander Wolff 001 (Comput. Geom. Topol., 2023)

On path-greedy geometric spanners. - William S. Evans; Lucca Morais de Arruda Siaudzionis (Comput. Geom., 2023)

Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities. - William S. Evans; Seyed Ali Tabatabaee (LATIN (1), 2024)

Fractional Bamboo Trimming and Distributed Windows Scheduling. - Arash Beikmohammadi; William S. Evans; Seyed Ali Tabatabaee (SOFSEM, 2024)

Visualization of Bipartite Graphs in Limited Window Size. - William S. Evans; Kassian Köck; Stephen G. Kobourov (SOFSEM, 2024)

Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. - William S. Evans; David G. Kirkpatrick (Algorithms, 2024)

Perpetual Scheduling with Explorable Uncertainty. - William S. Evans; Seyed Ali Tabatabaee (CIAC (2), 2025)

Visualization of bipartite graphs in limited window size. - Alon Efrat; William S. Evans; Kassian Köck; Stephen G. Kobourov; Jacob Miller 001 (Acta Informatica, 2025)