Matias Korman

Orcid: 0000-0002-4880-1101

According to our database1, Matias Korman authored at least 107 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
PSPACE-Hard 2D Super Mario Games: Thirteen Doors.
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.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon.
SIAM J. Discret. Math., December, 2023

Graphs with large total angular resolution.
Theor. Comput. Sci., 2023

Reconfiguration of connected graph partitions.
J. Graph Theory, 2023

2022
Reconfiguration of connected graph partitions via recombination.
Theor. Comput. Sci., 2022

Weight balancing on boundaries.
J. Comput. Geom., 2022

Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays.
Discret. Comput. Geom., 2022

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
Discret. Comput. Geom., 2022

Reconfiguration of Non-crossing Spanning Trees.
CoRR, 2022

Efficient segment folding is hard.
Comput. Geom., 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.
Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Hardness of Token Swapping on Trees.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Constrained routing between non-visible vertices.
Theor. Comput. Sci., 2021

Rectilinear link diameter and radius in a rectilinear polygonal domain.
Comput. Geom., 2021

Snipperclips: Cutting tools into desired polygons using themselves.
Comput. Geom., 2021

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

Robot Development and Path Planning for Indoor Ultraviolet Light Disinfection.
Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Characterizing Universal Reconfigurability of Modular Pivoting Robots.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Symmetric assembly puzzles are hard, beyond a few pieces.
Comput. Geom., 2020

Balanced line separators of unit disk graphs.
Comput. Geom., 2020

Routing in polygonal domains.
Comput. Geom., 2020

Routing in Histograms.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

New Results in Sona Drawing: Hardness and TSP Separation.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019
Group evolution patterns in running races.
Inf. Sci., 2019

Reconfiguration of Connected Graph Partitions.
CoRR, 2019

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

Computing the geodesic centers of a polygonal domain.
Comput. Geom., 2019

Packing plane spanning graphs with short edges in complete geometric graphs.
Comput. Geom., 2019

Faster algorithms for growing prioritized disks and rectangles.
Comput. Geom., 2019

Dynamic Graph Coloring.
Algorithmica, 2019

Circumscribing Polygons and Polygonizations for Disjoint Line Segments.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Ecient Segment Folding is Hard.
Proceedings of the 31st Canadian Conference on Computational Geometry, 2019

2018
Gap-planar graphs.
Theor. Comput. Sci., 2018

Computational Geometry Column 67.
SIGACT News, 2018

High Dimensional Consistent Digital Segments.
SIAM J. Discret. Math., 2018

Routing on the visibility graph.
J. Comput. Geom., 2018

Improved time-space trade-offs for computing Voronoi diagrams.
J. Comput. Geom., 2018

Line segment covering of cells in arrangements.
Inf. Process. Lett., 2018

Geometric Algorithms with Limited Workspace: A Survey.
CoRR, 2018

Time-space trade-offs for triangulations and Voronoi diagrams.
Comput. Geom., 2018

On the complexity of barrier resilience for fat regions and bounded ply.
Comput. Geom., 2018

The dual diameter of triangulations.
Comput. Geom., 2018

Colored spanning graphs for set visualization.
Comput. Geom., 2018

Experimental Study of Compressed Stack Algorithms in Limited Memory Environments.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Convex Hulls in Polygonal Domains.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Negative Instance for the Edge Patrolling Beacon Problem.
Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

2017
Hanabi is NP-hard, even for cheaters who look at their cards.
Theor. Comput. Sci., 2017

On interference among moving sensors and related problems.
J. Comput. Geom., 2017

Time-space trade-offs for triangulating a simple polygon.
J. Comput. Geom., 2017

Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017

Computing the L<sub>1</sub> Geodesic Diameter and Center of a Polygonal Domain.
Discret. Comput. Geom., 2017

Routing in Polygons with Holes.
CoRR, 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.
CoRR, 2017

Stabbing segments with rectilinear objects.
Appl. Math. Comput., 2017

Snipperclips: Cutting Tools into Desired Polygons using Themselves.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Memory-Constrained Algorithms.
Encyclopedia of Algorithms, 2016

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
Discret. Comput. Geom., 2016

The 1-Center and 1-Highway problem revisited.
Ann. Oper. Res., 2016

Computing the L1 Geodesic Diameter and Center of a Polygonal Domain.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Hanabi is NP-complete, Even for Cheaters who Look at Their Cards.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Cannibal Animal Games: a new variant of Tic-Tac-Toe.
J. Inf. Process., 2015

Geometric Biplane Graphs II: Graph Augmentation.
Graphs Comb., 2015

Geometric Biplane Graphs I: Maximal Graphs.
Graphs Comb., 2015

Balanced partitions of 3-colored geometric sets in the plane.
Discret. Appl. Math., 2015

On Kinetic Range Spaces and their Applications.
CoRR, 2015

New results on stabbing segments with a polygon.
Comput. Geom., 2015

Computing the L1 geodesic diameter and center of a simple polygon in linear time.
Comput. Geom., 2015

Reprint of: Theta-3 is connected.
Comput. Geom., 2015

Space-Time Trade-offs for Stack-Based Algorithms.
Algorithmica, 2015

2014
Geodesic-Preserving Polygon Simplification.
Int. J. Comput. Geom. Appl., 2014

Locating a single facility and a high-speed line.
Eur. J. Oper. Res., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discret. Math. Theor. Comput. Sci., 2014

Computing a visibility polygon using few variables.
Comput. Geom., 2014

Reprint of: Memory-constrained algorithms for simple polygons.
Comput. Geom., 2014

Theta-3 is connected.
Comput. Geom., 2014

Geodesic Order Types.
Algorithmica, 2014

Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Helly Numbers of Polyominoes.
Graphs Comb., 2013

The 1-median and 1-highway problem.
Eur. J. Oper. Res., 2013

Coloring and Guarding Arrangements.
Discret. Math. Theor. Comput. Sci., 2013

The Geodesic Diameter of Polygonal Domains.
Discret. Comput. Geom., 2013

Computing the L<sub>1</sub> Geodesic Diameter and Center of a Simple Polygon in Linear Time.
CoRR, 2013

Coloring planar homothets and three-dimensional hypergraphs.
Comput. Geom., 2013

Some properties of k-Delaunay and k-Gabriel graphs.
Comput. Geom., 2013

Memory-constrained algorithms for simple polygons.
Comput. Geom., 2013

Establishing strong connectivity using optimal radius half-disk antennas.
Comput. Geom., 2013

Colored Spanning Graphs for Set Visualization.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

On the Complexity of Barrier Resilience for Fat Regions.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Minimizing interference in ad hoc networks with bounded communication radius.
Inf. Process. Lett., 2012

Algorithms for computing the maximum weight region decomposable into elementary shapes.
Comput. Vis. Image Underst., 2012

2011
Colorful Strips.
Graphs Comb., 2011

Yet another paper on minimizing interference on ad-hoc networks
CoRR, 2011

Covering points by disjoint boxes with outliers.
Comput. Geom., 2011

The 1-Center and 1-Highway Problem.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Locating a Service Facility and a Rapid Transit Line.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux.
Discret. Math. Algorithms Appl., 2010

Effect of Corner Information in Simultaneous Placement of <i>K</i> Rectangles and Tableaux.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Some properties of higher order delaunay and gabriel graphs.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Consistent Digital Rays.
Discret. Comput. Geom., 2009

All Farthest Neighbors in the Presence of Highways and Obstacles.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Square and Rectangle Covering with Outliers.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008
Optimal Insertion of a Segment Highway in a City Metric.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008


  Loading...