William S. Evans

Kassian Köck

Stephen G. Kobourov

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Fractional Bamboo Trimming and Distributed Windows Scheduling.

[BibT_eX]

[DOI]

Arash Beikmohammadi

Seyed Ali Tabatabaee

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

Minimizing the Size of the Uncertainty Regions for Centers of Moving Entities.

[BibT_eX]

[DOI]

Seyed Ali Tabatabaee

Proceedings of the LATIN 2024: Theoretical Informatics, 2024

2023

On path-greedy geometric spanners.

[BibT_eX]

[DOI]

Lucca Morais de Arruda Siaudzionis

Comput. Geom., 2023

Morphing Planar Graph Drawings Through 3D.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

A Frequency-Competitive Query Strategy for Maintaining Low Collision Potential Among Moving Entities.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023

Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Reachability of turn sequences.

[BibT_eX]

[DOI]

CoRR, 2022

Minimum rectilinear polygons for given angle sequences.

[BibT_eX]

[DOI]

Comput. Geom., 2022

2021

Designing Game-Based Rehabilitation Experiences for People with Aphasia.

[BibT_eX]

[DOI]

Proc. ACM Hum. Comput. Interact., 2021

Angle Covers: Algorithms and Complexity.

[BibT_eX]

[DOI]

Ellen Gethner

Jack Spalding-Jamieson

Alexander Wolff

J. Graph Algorithms Appl., 2021

On Area-Universal Quadrangulations.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2021

Simultaneous visibility representations of undirected pairs of graphs.

[BibT_eX]

[DOI]

Ben Chugg

Kelvin Wong

Comput. Geom., 2021

2019

On problems related to crossing families.

[BibT_eX]

[DOI]

Noushin Saeedi

CoRR, 2019

Minimizing Interference Potential Among Moving Entities.

[BibT_eX]

[DOI]

Daniel Busto

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Representing Graphs and Hypergraphs by Touching Polygons in 3D.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

2018

New results on edge partitions of 1-plane graphs.

[BibT_eX]

[DOI]

Stephen K. Wismath

Theor. Comput. Sci., 2018

Covering points with convex sets of minimum size.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Table cartogram.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Visibility representations of boxes in 2.5 dimensions.

[BibT_eX]

[DOI]

Sue Whitesides

Stephen K. Wismath

Comput. Geom., 2018

Ortho-polygon Visibility Representations of Embedded Graphs.

[BibT_eX]

[DOI]

Stephen K. Wismath

Algorithmica, 2018

2016

Simultaneous visibility representations of plane st-graphs using L-shapes.

[BibT_eX]

[DOI]

Giuseppe Liotta

Theor. Comput. Sci., 2016

Recognizing and drawing IC-planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Minimizing Co-location Potential of Moving Entities.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Alternating paths and cycles of minimum length.

[BibT_eX]

[DOI]

Comput. Geom., 2016

Covering Points with Convex Sets of Minimum Size.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

Recognizing a DOG is Hard, But Not When It is Thin and Unit.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

On characterizing terrain visibility graphs.

[BibT_eX]

[DOI]

Noushin Saeedi

J. Comput. Geom., 2015

Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs.

[BibT_eX]

[DOI]

Jackson Toeniskoetter

Torsten Ueckerdt

CoRR, 2015

Contact Representations of Graphs in 3D.

[BibT_eX]

[DOI]

Jackson Toeniskoetter

Torsten Ueckerdt

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

2014

Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2014

2013

Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

Approximate proximity drawings.

[BibT_eX]

[DOI]

Comput. Geom., 2013

On point-sets that support planar graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Table Cartograms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

Competitive query strategies for minimising the ply of the potential locations of moving points.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Computational Geometry 2013, 2013

On k-Guarding Polygons.

[BibT_eX]

[DOI]

Daniel Busto

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Universal Point Subsets for Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

On Representing Graphs by Touching Cuboids.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 20th International Symposium, 2012

2011

The Possible Hull of Imprecise Points.

[BibT_eX]

[DOI]

Jeff Sember

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010

On Graphs Supported by Line Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

k-star-shaped polygons.

[BibT_eX]

[DOI]

Jeff Sember

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Multi-guard covers for polygonal regions.

[BibT_eX]

[DOI]

Zohreh Jabbari

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Clone detection via structural abstraction.

[BibT_eX]

[DOI]

Fei Ma

Softw. Qual. J., 2009

2008

Guaranteed Voronoi Diagrams of Uncertain Sites.

[BibT_eX]

Jeff Sember

Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007

Bar k-Visibility Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2007

Pursuit-Evasion Voronoi Diagrams in ell_1.

[BibT_eX]

[DOI]

Warren Cheung

Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

2006

Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ.

[BibT_eX]

[DOI]

Jürgen Wolff von Gudenberg

ACM Trans. Algorithms, 2006

On the Spanning Ratio of Gabriel Graphs and beta-Skeletons.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Similarity in Programs.

[BibT_eX]

[DOI]

Proceedings of the Duplication, Redundancy, and Similarity in Software, 23.07., 2006

06301 Working Session Summary: Presentation and Visualization of Redundant Code.

[BibT_eX]

[DOI]

Proceedings of the Duplication, Redundancy, and Similarity in Software, 23.07., 2006

Program Compression.

[BibT_eX]

[DOI]

Proceedings of the Duplication, Redundancy, and Similarity in Software, 23.07., 2006

2005

Computing the Set of all the Distant Horizons of a Terrain.

[BibT_eX]

[DOI]

Daniel Archambault

Int. J. Comput. Geom. Appl., 2005

Bar <i>k</i>-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004

Restructuring ordered binary trees.

[BibT_eX]

[DOI]

J. Algorithms, 2004

Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Voilà: Delivering Messages Across Partitioned Ad-Hoc Networks.

[BibT_eX]

[DOI]

Ritesh Shah

Norman C. Hutchinson

Proceedings of the 29th Annual IEEE Conference on Local Computer Networks (LCN 2004), 2004

Optimistic shortest paths on uncertain terrains.

[BibT_eX]

[DOI]

Chris Gray

Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003

On the maximum tolerable noise of k-input gates for reliable computation by formulas.

[BibT_eX]

[DOI]

Leonard J. Schulman

IEEE Trans. Inf. Theory, 2003

Grammar-based compression of interpreted code.

[BibT_eX]

[DOI]

Commun. ACM, 2003

Cold code decompression at runtime.

[BibT_eX]

[DOI]

Saumya K. Debray

Commun. ACM, 2003

Predicated Instructions for Code Compaction.

[BibT_eX]

[DOI]

Warren Cheung

Jeremy Moses

Proceedings of the Software and Compilers for Embedded Systems, 7th International Workshop, 2003

Triangle Guarding.

[BibT_eX]

[DOI]

Jocelyn Smith

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Diamonds are Not a Minimum Weight Triangulation's Best Friend.

[BibT_eX]

[DOI]

Prosenjit Bose

Luc Devroye

Int. J. Comput. Geom. Appl., 2002

Profile-Guided Code Compression.

[BibT_eX]

[DOI]

Saumya K. Debray

Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2002

2001

Right-Triangulated Irregular Networks.

[BibT_eX]

[DOI]

G. Townsend

Algorithmica, 2001

Bytecode Compression via Profiled Grammar Rewriting.

[BibT_eX]

[DOI]

Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2001

2000

Compiler techniques for code compaction.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2000

Efficiently Supported Temporal Granularities.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2000

1999

Signal propagation and noisy circuits.

[BibT_eX]

[DOI]

Leonard J. Schulman

IEEE Trans. Inf. Theory, 1999

1998

On the Maximum Tolerable Noise for Reliable Computation by Formulas.

[BibT_eX]

[DOI]

Nicholas Pippenger

IEEE Trans. Inf. Theory, 1998

Average-Case Lower Bounds for Noisy Boolean Decision Trees.

[BibT_eX]

[DOI]

Nicholas Pippenger

SIAM J. Comput., 1998

Compression via Guided Parsing.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

Recovering lines with fixed linear probes.

[BibT_eX]

[DOI]

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1997

Code Compression.

[BibT_eX]

[DOI]

Jens Ernst

Steven Lucco

Todd A. Proebsting

Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), 1997

A Glossary of Time Granularity Concepts.

[BibT_eX]

[DOI]

Proceedings of the Temporal Databases: Research and Practice. (the book grow out of a Dagstuhl Seminar, 1997

1996

Lower Bounds for Noisy Boolean Decision Trees.

[BibT_eX]

[DOI]

Nicholas Pippenger

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Approximating Shortest Paths in Arrangements of Lines.

[BibT_eX]

[DOI]

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1994

Checking the Correctness of Memories.

[BibT_eX]

[DOI]

Algorithmica, 1994

1993

Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas

[BibT_eX]

[DOI]

Leonard J. Schulman

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Choosing a Reliable Hypothesis.

[BibT_eX]

[DOI]