William S. Evans

122 papers A* 11A 12B 15C 1Misc 1Journal 60Unranked 22

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. Theory Comput. Syst. William S. Evans, David G. Kirkpatrick
2025	—	`conf`	Perpetual Scheduling with Explorable Uncertainty. CIAC (2) William S. Evans, Seyed Ali Tabatabaee
2025	J	`jnl`	Visualization of bipartite graphs in limited window size. Acta Informatica Alon Efrat, William S. Evans, Kassian Köck, Stephen G. Kobourov, Jacob Miller
2024	B	`conf`	Fractional Bamboo Trimming and Distributed Windows Scheduling. SOFSEM Arash Beikmohammadi, William S. Evans, Seyed Ali Tabatabaee
2024	J	`jnl`	Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. Algorithms William S. Evans, David G. Kirkpatrick
2024	—	`conf`	Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities. LATIN (1) William S. Evans, Seyed Ali Tabatabaee
2024	B	`conf`	Visualization of Bipartite Graphs in Limited Window Size. SOFSEM William S. Evans, Kassian Köck, Stephen G. Kobourov
2023	B	`conf`	A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities. WAOA William S. Evans, David G. Kirkpatrick
2023	B	`conf`	Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. FCT William S. Evans, David G. Kirkpatrick
2023	J	`jnl`	Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities. CoRR William S. Evans, Seyed Ali Tabatabaee
2023	B	`conf`	Morphing Planar Graph Drawings Through 3D. SOFSEM Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff
2023	J	`jnl`	Morphing Planar Graph Drawings Through 3D. Comput. Geom. Topol. Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff
2023	J	`jnl`	On path-greedy geometric spanners. Comput. Geom. William S. Evans, Lucca Morais de Arruda Siaudzionis
2022	J	`jnl`	Frequency-Competitive Query Strategies to Maintain Low Congestion Potential Among Moving Entities. CoRR William S. Evans, David G. Kirkpatrick
2022	J	`jnl`	Minimum rectilinear polygons for given angle sequences. Comput. Geom. William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2022	J	`jnl`	Morphing Planar Graph Drawings Through 3D. CoRR Kevin Buchin, William S. Evans, Fabrizio Frati, Irina Kostitsyna, Maarten Löffler, Tim Ophelders, Alexander Wolff
2022	J	`jnl`	Reachability of turn sequences. CoRR William S. Evans, Noushin Saeedi, Chan-Su Shin, Hyun Tark
2022	B	`conf`	The Polygon Burning Problem. WALCOM William S. Evans, Rebecca Lin
2021	J	`jnl`	Angle Covers: Algorithms and Complexity. J. Graph Algorithms Appl. William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
2021	J	`jnl`	Designing Game-Based Rehabilitation Experiences for People with Aphasia. Proc. ACM Hum. Comput. Interact. 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
2021	J	`jnl`	On Area-Universal Quadrangulations. J. Graph Algorithms Appl. William S. Evans, Stefan Felsner, Linda Kleist, Stephen G. Kobourov
2021	J	`jnl`	Simultaneous visibility representations of undirected pairs of graphs. Comput. Geom. Ben Chugg, William S. Evans, Kelvin Wong
2021	J	`jnl`	The Polygon Burning Problem. CoRR William S. Evans, Rebecca Lin
2020	B	`conf`	Angle Covers: Algorithms and Complexity. WALCOM William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
2020	—	`conf`	Simultaneous Visibility Representations of Undirected Pairs of Graphs. CCCG Ben Chugg, William S. Evans, Kelvin Wong
2020	J	`jnl`	Simultaneous Visibility Representations of Undirected Pairs of Graphs. CoRR Ben Chugg, William S. Evans, Kelvin Wong
2019	J	`jnl`	Angle Covers: Algorithms and Complexity. CoRR William S. Evans, Ellen Gethner, Jack Spalding-Jamieson, Alexander Wolff
2019	A*	`conf`	Minimizing Interference Potential Among Moving Entities. SODA Daniel Busto, William S. Evans, David G. Kirkpatrick
2019	J	`jnl`	On problems related to crossing families. CoRR William S. Evans, Noushin Saeedi
2019	A	`conf`	Representing Graphs and Hypergraphs by Touching Polygons in 3D. GD William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2019	J	`jnl`	Representing Graphs and Hypergraphs by Touching Polygons in 3D. CoRR William S. Evans, Pawel Rzazewski, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2018	J	`jnl`	Covering points with convex sets of minimum size. Theor. Comput. Sci. Sang Won Bae, Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin
2018	J	`jnl`	New results on edge partitions of 1-plane graphs. Theor. Comput. Sci. Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2018	J	`jnl`	Ortho-polygon Visibility Representations of Embedded Graphs. Algorithmica Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2018	J	`jnl`	Table cartogram. Comput. Geom. William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek
2018	J	`jnl`	Visibility representations of boxes in 2.5 dimensions. Comput. Geom. Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2017	J	`jnl`	Column planarity and partially-simultaneous geometric embedding. J. Graph Algorithms Appl. Luis Barba, William S. Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell, Bettina Speckmann
2017	J	`jnl`	New Results on Edge Partitions of 1-plane Graphs. CoRR Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016	J	`jnl`	Alternating paths and cycles of minimum length. Comput. Geom. William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2016	B	`conf`	Covering Points with Convex Sets of Minimum Size. WALCOM Hwan-Gue Cho, William S. Evans, Noushin Saeedi, Chan-Su Shin
2016	J	`jnl`	Minimizing Co-location Potential of Moving Entities. SIAM J. Comput. William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals
2016	J	`jnl`	Minimum Rectilinear Polygons for Given Angle Sequences. CoRR William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2016	A	`conf`	Ortho-Polygon Visibility Representations of Embedded Graphs. GD Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016	J	`jnl`	Ortho-polygon Visibility Representations of Embedded Graphs. CoRR Emilio Di Giacomo, Walter Didimo, William S. Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Stephen K. Wismath
2016	Misc	`conf`	Recognizing a DOG is Hard, But Not When It is Thin and Unit. FUN William S. Evans, Mereke van Garderen, Maarten Löffler, Valentin Polishchuk
2016	J	`jnl`	Recognizing and drawing IC-planar graphs. Theor. Comput. Sci. Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2016	J	`jnl`	SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs. J. Graph Theory Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson
2016	J	`jnl`	Simultaneous visibility representations of plane st-graphs using L-shapes. Theor. Comput. Sci. William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
2016	A	`conf`	Visibility Representations of Boxes in 2.5 Dimensions. GD Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2016	J	`jnl`	Visibility Representations of Boxes in 2.5 Dimensions. CoRR Alessio Arleo, Carla Binucci, Emilio Di Giacomo, William S. Evans, Luca Grilli, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani, Sue Whitesides, Stephen K. Wismath
2015	A	`conf`	Alternating Paths and Cycles of Minimum Length. GD William S. Evans, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath
2015	B	`conf`	Contact Representations of Graphs in 3D. WADS Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt
2015	—	`conf`	Minimum Rectilinear Polygons for Given Angle Sequences. JCDCGG William S. Evans, Krzysztof Fleszar, Philipp Kindermann, Noushin Saeedi, Chan-Su Shin, Alexander Wolff
2015	J	`jnl`	On characterizing terrain visibility graphs. J. Comput. Geom. William S. Evans, Noushin Saeedi
2015	J	`jnl`	Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs. CoRR Md. Jawaherul Alam, William S. Evans, Stephen G. Kobourov, Sergey Pupyrev, Jackson Toeniskoetter, Torsten Ueckerdt
2015	A	`conf`	Recognizing and Drawing IC-Planar Graphs. GD Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2015	J	`jnl`	Recognizing and Drawing IC-planar Graphs. CoRR Franz J. Brandenburg, Walter Didimo, William S. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani
2015	B	`conf`	Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. WG William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
2015	J	`jnl`	Simultaneous Visibility Representations of Plane st-graphs Using L-shapes. CoRR William S. Evans, Giuseppe Liotta, Fabrizio Montecchiani
2014	J	`jnl`	Bar 1-Visibility Graphs vs. other Nearly Planar Graphs. J. Graph Algorithms Appl. William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath
2014	A	`conf`	Column Planarity and Partial Simultaneous Geometric Embedding. GD William S. Evans, Vincent Kusters, Maria Saumell, Bettina Speckmann
2013	J	`jnl`	Approximate proximity drawings. Comput. Geom. William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2013	J	`jnl`	Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs. CoRR William S. Evans, Michael Kaufmann, William J. Lenhart, Giuseppe Liotta, Tamara Mchedlidze, Stephen K. Wismath
2013	A*	`conf`	Competitive query strategies for minimising the ply of the potential locations of moving points. SoCG William S. Evans, David G. Kirkpatrick, Maarten Löffler, Frank Staals
2013	—	`conf`	On k-Guarding Polygons. CCCG Daniel Busto, William S. Evans, David G. Kirkpatrick
2013	J	`jnl`	On point-sets that support planar graphs. Comput. Geom. Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
2013	B	`conf`	SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. ISAAC Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson
2013	J	`jnl`	SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. CoRR Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson
2013	A	`conf`	Table Cartograms. ESA William S. Evans, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Debajyoti Mondal, Rahnuma Islam Nishat, Kevin Verbeek
2012	A	`conf`	On Representing Graphs by Touching Cuboids. GD David Bremner, William S. Evans, Fabrizio Frati, Laurie J. Heyer, Stephen G. Kobourov, William J. Lenhart, Giuseppe Liotta, David Rappaport, Sue Whitesides
2012	B	`conf`	Universal Point Subsets for Planar Graphs. ISAAC Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto
2011	A	`conf`	Approximate Proximity Drawings. GD William S. Evans, Emden R. Gansner, Michael Kaufmann, Giuseppe Liotta, Henk Meijer, Andreas Spillner
2011	A	`conf`	On Point-Sets That Support Planar Graphs. GD Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath
2011	—	`conf`	The Possible Hull of Imprecise Points. CCCG Jeff Sember, William S. Evans
2010	—	`conf`	Multi-guard covers for polygonal regions. CCCG Zohreh Jabbari, William S. Evans, David G. Kirkpatrick
2010	A	`conf`	On Graphs Supported by Line Sets. GD Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath
2010	—	`conf`	k-star-shaped polygons. CCCG Jeff Sember, William S. Evans
2009	J	`jnl`	Clone detection via structural abstraction. Softw. Qual. J. William S. Evans, Christopher W. Fraser, Fei Ma
2008	—	`conf`	Clone Detection via Structural Abstraction. Structure-Based Compression of Complex Massive Data William S. Evans, Christopher W. Fraser, Fei Ma
2008	—	`conf`	Guaranteed Voronoi Diagrams of Uncertain Sites. CCCG Jeff Sember, William S. Evans
2007	J	`jnl`	Bar k-Visibility Graphs. J. Graph Algorithms Appl. Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter
2007	—	`conf`	Clone Detection via Structural Abstraction. WCRE William S. Evans, Christopher W. Fraser, Fei Ma
2007	—	`conf`	Pursuit-Evasion Voronoi Diagrams in ell_1. ISVD Warren Cheung, William S. Evans
2006	—	`conf`	06301 Working Session Summary: Presentation and Visualization of Redundant Code. Duplication, Redundancy, and Similarity in Software Andrew Walenstein, James R. Cordy, William S. Evans, Ahmed E. Hassan, Toshihiro Kamiya, Cory Kapser, Ettore Merlo
2006	J	`jnl`	On the Spanning Ratio of Gabriel Graphs and beta-Skeletons. SIAM J. Discret. Math. Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick
2006	J	`jnl`	Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ. ACM Trans. Algorithms William S. Evans, David G. Kirkpatrick
2006	—	`conf`	Program Compression. Duplication, Redundancy, and Similarity in Software William S. Evans
2006	—	`conf`	Similarity in Programs. Duplication, Redundancy, and Similarity in Software Andrew Walenstein, Mohammad El-Ramly, James R. Cordy, William S. Evans, Kiarash Mahdavi, Markus Pizka, Ganesan Ramalingam, Jürgen Wolff von Gudenberg
2005	A	`conf`	Bar GD Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter
2005	J	`jnl`	Computing the Set of all the Distant Horizons of a Terrain. Int. J. Comput. Geom. Appl. Daniel Archambault, William S. Evans, David G. Kirkpatrick
2004	—	`conf`	Computing the set of all distant horizons of a terrain. CCCG William S. Evans, Daniel Archambault, David G. Kirkpatrick
2004	A*	`conf`	Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. SODA William S. Evans, David G. Kirkpatrick
2004	—	`conf`	Optimistic shortest paths on uncertain terrains. CCCG Chris Gray, William S. Evans
2004	J	`jnl`	Restructuring ordered binary trees. J. Algorithms William S. Evans, David G. Kirkpatrick
2004	B	`conf`	Voilà: Delivering Messages Across Partitioned Ad-Hoc Networks. LCN Ritesh Shah, Norman C. Hutchinson, William S. Evans
2003	J	`jnl`	Cold code decompression at runtime. Commun. ACM Saumya K. Debray, William S. Evans
2003	J	`jnl`	Grammar-based compression of interpreted code. Commun. ACM William S. Evans, Christopher W. Fraser
2003	J	`jnl`	On the maximum tolerable noise of k-input gates for reliable computation by formulas. IEEE Trans. Inf. Theory William S. Evans, Leonard J. Schulman
2003	C	`conf`	Predicated Instructions for Code Compaction. SCOPES Warren Cheung, William S. Evans, Jeremy Moses
2003	—	`conf`	Triangle Guarding. CCCG Jocelyn Smith, William S. Evans
2002	J	`jnl`	Diamonds are Not a Minimum Weight Triangulation's Best Friend. Int. J. Comput. Geom. Appl. Prosenjit Bose, Luc Devroye, William S. Evans
2002	B	`conf`	On the Spanning Ratio of Gabriel Graphs and beta-skeletons. LATIN Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick
2002	A*	`conf`	Profile-Guided Code Compression. PLDI Saumya K. Debray, William S. Evans
2001	A*	`conf`	Bytecode Compression via Profiled Grammar Rewriting. PLDI William S. Evans, Christopher W. Fraser
2001	J	`jnl`	Right-Triangulated Irregular Networks. Algorithmica William S. Evans, David G. Kirkpatrick, G. Townsend
2000	J	`jnl`	Compiler techniques for code compaction. ACM Trans. Program. Lang. Syst. Saumya K. Debray, William S. Evans, Robert Muth, Bjorn De Sutter
2000	J	`jnl`	Efficiently Supported Temporal Granularities. IEEE Trans. Knowl. Data Eng. Curtis E. Dyreson, William S. Evans, Hong Lin, Richard T. Snodgrass
2000	A*	`conf`	Restructuring ordered binary trees. SODA William S. Evans, David G. Kirkpatrick
1999	J	`jnl`	Signal propagation and noisy circuits. IEEE Trans. Inf. Theory William S. Evans, Leonard J. Schulman
1998	J	`jnl`	Average-Case Lower Bounds for Noisy Boolean Decision Trees. SIAM J. Comput. William S. Evans, Nicholas Pippenger
1998	B	`conf`	Compression via Guided Parsing. Data Compression Conference William S. Evans
1998	J	`jnl`	On the Maximum Tolerable Noise for Reliable Computation by Formulas. IEEE Trans. Inf. Theory William S. Evans, Nicholas Pippenger
1998	—	`conf`	Recovering lines with fixed linear probes. CCCG Mark de Berg, Prosenjit Bose, David Bremner, William S. Evans, Lata Narayanan
1997	—	`conf`	A Glossary of Time Granularity Concepts. Temporal Databases, Dagstuhl Claudio Bettini, Curtis E. Dyreson, William S. Evans, Richard T. Snodgrass, Xiaoyang Sean Wang
1997	A*	`conf`	Code Compression. PLDI Jens Ernst, William S. Evans, Christopher W. Fraser, Steven Lucco, Todd A. Proebsting
1996	—	`conf`	Approximating Shortest Paths in Arrangements of Lines. CCCG Prosenjit Bose, William S. Evans, David G. Kirkpatrick, Michael McAllister, Jack Snoeyink
1996	—	`conf`	Diamonds Are Not a Minimum Weight Triangulation's Best Friend. CCCG Prosenjit Bose, Luc Devroye, William S. Evans
1996	A*	`conf`	Lower Bounds for Noisy Boolean Decision Trees. STOC William S. Evans, Nicholas Pippenger
1994	J	`jnl`	Checking the Correctness of Memories. Algorithmica Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
1993	A*	`conf`	Choosing a Reliable Hypothesis. COLT William S. Evans, Sridhar Rajagopalan, Umesh V. Vazirani
1993	A*	`conf`	Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas FOCS William S. Evans, Leonard J. Schulman
1991	A*	`conf`	Checking the Correctness of Memories FOCS Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor