NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (42)

cs.CG2017

Balanced partitions of 3-colored geometric sets in the plane

Sergey Bereg, Matias Korman, Rodrigo I. Silveira +6

cs.CC2017

On the Complexity of Barrier Resilience for Fat Regions

Matias Korman, Maarten Löffler, Rodrigo I. Silveira +1

cs.DS2017

Experimental Study of Compressed Stack Algorithms in Limited Memory Environments

Jean-François Baffier, Yago Diez, Matias Korman

cs.DM2017

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

Jean-Francois Baffier, Man-Kwun Chiu, Yago Diez +5

cs.CG2013

Computing a visibility polygon using few variables

Luis Barba, Matias Korman, Stefan Langerman +1

cs.CG2017

Helly Numbers of Polyominoes

Jean Cardinal, Hiro Ito, Matias Korman +1

cs.CC2014

New results on stabbing segments with a polygon

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +3

cs.CG2015

Computing the Geodesic Centers of a Polygonal Domain

Sang Won Bae, Matias Korman, Yoshio Okamoto

cs.CG2013

Geodesic-Preserving Polygon Simplification

Oswin Aichholzer, Thomas Hackl, Matias Korman +2

cs.DS2018

Dynamic Graph Coloring

Luis Barba, Jean Cardinal, Matias Korman +4

cs.CG2017

Geodesic Order Types

Oswin Aichholzer, Matias Korman, Alexander Pilz +1

cs.CG2017

On interference among moving sensors and related problems

Jean-Lou De Carufel, Matya Katz, Matias Korman +3

cs.CG2014

Theta-3 is connected

Oswin Aichholzer, Sang Won Bae, Luis Barba +5

cs.CG2015

The Dual Diameter of Triangulations

Matias Korman, Stefan Langerman, Wolfgang Mulzer +3

cs.CG2016

High Dimensional Consistent Digital Segments

Man-Kwun Chiu, Matias Korman

cs.CG2017

Time-Space Trade-off Algorithms for Triangulating a Simple Polygon

Boris Aronov, Matias Korman, Simon Pratt +2

cs.CG2012

Coloring and Guarding Arrangements

Prosenjit Bose, Jean Cardinal, Sébastien Collette +4

cs.CG2012

The 1-Center and 1-Highway problem

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1

cs.CG2017

Geometric Biplane Graphs I: Maximal Graphs

Alfredo García, Ferran Hurtado, Matias Korman +5

cs.CG2018

Improved Time-Space Trade-offs for Computing Voronoi Diagrams

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer +4

cs.CG2018

Geometric Algorithms with Limited Workspace: A Survey

Bahareh Banyassady, Matias Korman, Wolfgang Mulzer

cs.CG2012

Memory-Constrained Algorithms for Simple Polygons

Tetsuo Asano, Kevin Buchin, Maike Buchin +4

cs.CG2019

Routing in Histograms

Man-Kwun Chiu, Jonas Cleve, Katharina Klost +5

cs.CG2010

Covering Points by Disjoint Boxes with Outliers

Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine +5

cs.CG2019

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces

Erik D. Demaine, Matias Korman, Jason S. Ku +6

cs.CG2012

Coloring Planar Homothets and Three-Dimensional Hypergraphs

Jean Cardinal, Matias Korman

cs.CG2016

Colored Spanning Graphs for Set Visualization

Ferran Hurtado, Matias Korman, Marc van Kreveld +6

cs.CG2017

Line Segment Covering of Cells in Arrangements

Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen

cs.CG2015

A linear-time algorithm for the geodesic center of a simple polygon

Hee-Kap Ahn, Luis Barba, Prosenjit Bose +3

cs.CG2015

Computing the $L_1$ Geodesic Diameter and Center of a Simple Polygon in Linear Time

Sang Won Bae, Matias Korman, Yoshio Okamoto +1

cs.CG2019

Packing Short Plane Spanning Graphs in Complete Geometric Graphs

Oswin Aichholzer, Thomas Hackl, Matias Korman +5

cs.CG2019

Gap-planar Graphs

Sang Won Bae, Jean-Francois Baffier, Jinhee Chun +8

cs.CG2019

Routing on the Visibility Graph

Prosenjit Bose, Matias Korman, André van Renssen +1

cs.CG2017

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs

Oswin Aichholzer, Thomas Hackl, Matias Korman +5

cs.CG2017

Stabbing segments with rectilinear objects

Mercè Claverol, Delia Garijo, Matias Korman +2

cs.CG2017

Geometric Biplane Graphs II: Graph Augmentation

Alfredo García, Ferran Hurtado, Matias Korman +5

cs.CG2012

The Geodesic Diameter of Polygonal Domains

Sang Won Bae, Matias Korman, Yoshio Okamoto

cs.CG2012

Locating a single facility and a high-speed line

José Miguel Díaz-Báñez, Matias Korman, Pablo Pérez-Lantero +1

cs.GT2013

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

Jean Cardinal, Sébastien Collette, Hiro Ito +4

cs.CG2016

Computing the $L_1$ Geodesic Diameter and Center of a Polygonal Domain

Sang Won Bae, Matias Korman, Joseph S. B. Mitchell +3

cs.CG2014

Space-Time Trade-offs for Stack-Based Algorithms

Luis Barba, Matias Korman, Stefan Langerman +2

cs.CG2012

Minimizing interference in ad-hoc networks with bounded communication radius

Matias Korman