Carlos Seara

According to our database1, Carlos Seara authored at least 65 papers between 1992 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Capturing points with a rotating polygon (and a 3D extension).
CoRR, 2018

Generalized kernels of polygons under rotation.
CoRR, 2018

On Hamiltonian alternating cycles and paths.
Comput. Geom., 2018

On the 𝒪β of a planar point set.
Comput. Geom., 2018

Stabbing Circles for Sets of Segments in the Plane.
Algorithmica, 2018

Maximum Box Problem on Stochastic Points.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Characteristic polynomials of production matrices for geometric graphs.
Electronic Notes in Discrete Mathematics, 2017

Rectilinear and O-convex hull with minimum area.
CoRR, 2017

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

Stabbing segments with rectilinear objects.
CoRR, 2017

$K_{1, 3}$-covering red and blue points in the plane.
CoRR, 2017

Stabbing segments with rectilinear objects.
Applied Mathematics and Computation, 2017

2016
Production matrices for geometric graphs.
Electronic Notes in Discrete Mathematics, 2016

On Hamiltonian alternating cycles and paths.
CoRR, 2016

Stabbing Circles for Sets of Segments in the Plane.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Balanced partitions of 3-colored geometric sets in the plane.
Discrete Applied Mathematics, 2015

Rectilinear convex hull with minimum area.
CoRR, 2015

On the $O_β$-hull of a planar point set.
CoRR, 2015

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

Stabbing Segments with Rectilinear Objects.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2013
On the Number of Edges in Geometric Graphs Without Empty Triangles.
Graphs and Combinatorics, 2013

On the coarseness of bicolored point sets.
Comput. Geom., 2013

Non-crossing matchings of points with geometric objects.
Comput. Geom., 2013

Some structural, metric and convex properties of the boundary of a graph.
Ars Comb., 2013

New Results on Stabbing Segments with a Polygon.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012
Separability of Point Sets by k-Level Linear Classification Trees.
Int. J. Comput. Geometry Appl., 2012

Minimizing the error of linear separators on linearly inseparable data.
Discrete Applied Mathematics, 2012

New results on stabbing segments with a polygon
CoRR, 2012

The class cover problem with boxes.
Comput. Geom., 2012

Distinguishing Trees in Linear Time.
Electr. J. Comb., 2012

2011
On Computing Enclosing Isosceles Triangles and Related Problems.
Int. J. Comput. Geometry Appl., 2011

Fitting a two-joint orthogonal chain to a point set.
Comput. Geom., 2011

Stabbers of line segments in the plane.
Comput. Geom., 2011

Rectilinear Convex Hull with Minimum Area.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
Facility location problems in the plane based on reverse nearest neighbor queries.
European Journal of Operational Research, 2010

Extremal Graph Theory for Metric Dimension and Diameter.
Electr. J. Comb., 2010

On the Determining Number and the Metric Dimension of Graphs.
Electr. J. Comb., 2010


2009
Bichromatic separability with two boxes: A general approach.
J. Algorithms, 2009

Small weak epsilon-nets.
Comput. Geom., 2009

2008
Geodeticity of the contour of chordal graphs.
Discrete Applied Mathematics, 2008

Covering point sets with two disjoint disks or squares.
Comput. Geom., 2008

2007
On the Metric Dimension of Cartesian Products of Graphs.
SIAM J. Discrete Math., 2007

Extremal Graph Theory for Metric Dimension and Diameter.
Electronic Notes in Discrete Mathematics, 2007

On finding widest empty curved corridors.
Comput. Geom., 2007

2006
Some Lower Bounds on Geometric Separability Problems.
Int. J. Comput. Geometry Appl., 2006

Some structural, metric and convex properties on the boundary of a graph.
Electronic Notes in Discrete Mathematics, 2006

On geodetic sets formed by boundary vertices.
Discrete Mathematics, 2006

2005
Red-blue separability problems in 3D.
Int. J. Comput. Geometry Appl., 2005

On the metric dimension of some families of graphs.
Electronic Notes in Discrete Mathematics, 2005

Searching for geodetic boundary vertex sets.
Electronic Notes in Discrete Mathematics, 2005

On the Steiner, geodetic and hull numbers of graphs.
Discrete Mathematics, 2005

Covering point sets with two convex objects.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Reverse facility location problems.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Small weak epsilon nets.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Separability by two lines and by nearly straight polygonal chains.
Discrete Applied Mathematics, 2004

On computing enclosing isosceles triangles and related problems.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Chromatic variants of the Erdsos-CSzekeres theorem on points in convex position.
Comput. Geom., 2003

Red-Blue Separability Problems in 3D.
Proceedings of the Computational Science and Its Applications, 2003

2001
Separating objects in the plane by wedges and strips.
Discrete Applied Mathematics, 2001

Separating several point sets in the plane.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Some Separability Problems in the Plane.
EuroCG, 2000

1998
Separating objects in the plane with wedges and strips.
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1996
Complexity Classes Between ThetaPk and DeltaPk .
ITA, 1996

1992
Characterizations of Some Complexity Classes Between Theta^p_2 and Delta^p_2.
Proceedings of the STACS 92, 1992


  Loading...