Matias Korman

Christopher Meierfrankenfeld

Frederick Stock

CoRR, July, 2025

2024

PSPACE-Hard 2D Super Mario Games: Thirteen Doors.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

A Universal In-Place Reconfiguration Algorithm for Sliding Cube-Shaped Robots in a Quadratic Number of Moves.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Reconfiguration of connected graph partitions.

[BibT_eX]

[DOI]

J. Graph Theory, 2023

2022

Weight balancing on boundaries.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2022

Reconfiguration of Non-crossing Spanning Trees.

[BibT_eX]

[DOI]

CoRR, 2022

Efficient segment folding is hard.

[BibT_eX]

[DOI]

Comput. Geom., 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Hardness of Token Swapping on Trees.

[BibT_eX]

[DOI]

Virginia Vassilevska Williams

Nicole Wein

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Snipperclips: Cutting tools into desired polygons using themselves.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Reconfiguration of Connected Graph Partitions via Recombination.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Routing in Histograms.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

New Results in Sona Drawing: Hardness and TSP Separation.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Group evolution patterns in running races.

[BibT_eX]

[DOI]

Inf. Sci., 2019

Reconfiguration of Connected Graph Partitions.

[BibT_eX]

[DOI]

Hugo A. Akitaya

Matthew D. Jones

Christopher Meierfrankenfeld

CoRR, 2019

Special Issue on the 34th European Workshop on Computational Geometry, Guest Editors' Foreword.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Comput. Geom., 2019

Packing plane spanning graphs with short edges in complete geometric graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2019

Graphs with Large Total Angular Resolution.

[BibT_eX]

[DOI]

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

Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

Ecient Segment Folding is Hard.

[BibT_eX]

Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018

Computational Geometry Column 67.

[BibT_eX]

[DOI]

Bahareh Banyassady

Wolfgang Mulzer

SIGACT News, 2018

Geometric Algorithms with Limited Workspace: A Survey.

[BibT_eX]

[DOI]

Bahareh Banyassady

Wolfgang Mulzer

CoRR, 2018

On the complexity of barrier resilience for fat regions and bounded ply.

[BibT_eX]

[DOI]

Comput. Geom., 2018

The dual diameter of triangulations.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Colored spanning graphs for set visualization.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Experimental Study of Compressed Stack Algorithms in Limited Memory Environments.

[BibT_eX]

[DOI]

Yago Diez

Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Convex Hulls in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Negative Instance for the Edge Patrolling Beacon Problem.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Rectilinear Link Diameter and Radius in a Rectilinear Polygonal Domain.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Hanabi is NP-hard, even for cheaters who look at their cards.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Haitao Wang

Discret. Comput. Geom., 2017

Routing in Polygons with Holes.

[BibT_eX]

[DOI]

CoRR, 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.

[BibT_eX]

[DOI]

CoRR, 2017

Balanced Line Separators of Unit Disk Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Dynamic Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Improved Time-Space Trade-Offs for Computing Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Routing on the Visibility Graph.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Routing in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Faster Algorithms for Growing Prioritized Disks and Rectangles.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Gap-Planar Graphs.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Ignaz Rutter

Csaba D. Tóth

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

High Dimensional Consistent Digital Segments.

[BibT_eX]

[DOI]

Man-Kwun Chiu

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Constrained Routing Between Non-Visible Vertices.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Snipperclips: Cutting Tools into Desired Polygons using Themselves.

[BibT_eX]

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Memory-Constrained Algorithms.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

The 1-Center and 1-Highway problem revisited.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

Time-Space Trade-offs for Triangulating a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Valentin Polishchuk

Haitao Wang

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.

[BibT_eX]

[DOI]

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

On Interference Among Moving Sensors and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Cannibal Animal Games: a new variant of Tic-Tac-Toe.

[BibT_eX]

[DOI]

J. Inf. Process., 2015

Geometric Biplane Graphs II: Graph Augmentation.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.

[BibT_eX]

[DOI]

Alfredo García Olaverri

Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

On Kinetic Range Spaces and their Applications.

[BibT_eX]

[DOI]

CoRR, 2015

Computing the L1 geodesic diameter and center of a simple polygon in linear time.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Reprint of: Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Time-Space Trade-offs for Triangulations and Voronoi Diagrams.

[BibT_eX]

[DOI]

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

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces.

[BibT_eX]

[DOI]

Erik D. Demaine

Jason S. Ku

Joseph S. B. Mitchell

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Stabbing Segments with Rectilinear Objects.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

Line Segment Covering of Cells in Arrangements.

[BibT_eX]

[DOI]

Sheung-Hung Poon

Marcel Roeloffzen

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Locating a single facility and a high-speed line.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2014

Reprint of: Memory-constrained algorithms for simple polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Weight Balancing on Boundaries and Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Computing the Geodesic Centers of a Polygonal Domain.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

The 1-median and 1-highway problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

Coloring and Guarding Arrangements.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Computing the L1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.

[BibT_eX]

[DOI]

CoRR, 2013

Some properties of k-Delaunay and k-Gabriel graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Memory-constrained algorithms for simple polygons.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Space-Time Trade-offs for Stack-Based Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Geodesic-Preserving Polygon Simplification.

[BibT_eX]

[DOI]

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

Colored Spanning Graphs for Set Visualization.

[BibT_eX]

[DOI]

Vera Sacristán Adinolfi

Rodrigo I. Silveira

Bettina Speckmann

Proceedings of the Graph Drawing - 21st International Symposium, 2013

New Results on Stabbing Segments with a Polygon.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

[BibT_eX]

[DOI]

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

Theta-3 is connected.

[BibT_eX]

[DOI]

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

On the Complexity of Barrier Resilience for Fat Regions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Sensor Systems, 2013

2012

Algorithms for computing the maximum weight region decomposable into elementary shapes.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2012

Coloring Planar Homothets and Three-Dimensional Hypergraphs.

[BibT_eX]

[DOI]

Jean Cardinal

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Geodesic Order Types.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011

Yet another paper on minimizing interference on ad-hoc networks

[BibT_eX]

[DOI]

CoRR, 2011

Covering points by disjoint boxes with outliers.

[BibT_eX]

[DOI]

Comput. Geom., 2011

The 1-Center and 1-Highway Problem.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Locating a Service Facility and a Rapid Transit Line.

[BibT_eX]

[DOI]

Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Computing the Visibility Polygon Using Few Variables.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

Helly Numbers of Polyominoes.

[BibT_eX]

[DOI]

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

Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas.

[BibT_eX]

[DOI]

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

2010

Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2010

Colorful Strips.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

The Geodesic Diameter of Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Some properties of higher order delaunay and gabriel graphs.

[BibT_eX]

[DOI]

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

2009

All Farthest Neighbors in the Presence of Highways and Obstacles.

[BibT_eX]

[DOI]

Takeshi Tokuyama

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Square and Rectangle Covering with Outliers.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008

Consistent digital rays.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

Optimal Insertion of a Segment Highway in a City Metric.

[BibT_eX]

[DOI]