Carlos Seara

Carlos al piano

Holydays summertime 2009 (featuring by Robert Seara)

General Resources

· Address

· Institutional links

· Information for visitors

Teaching

· Courses

Research

· Interests and links

· Personal pages

· Coauthors

· Publications

General resources

Address

Departament de Matemàtica Aplicada II
Universitat Politècnica de Catalunya (UPC)
Edifici Omega, Campus Nord (a map is here)
Jordi Girona, 1
08034 Barcelona
Spain

e-mail: carlos.seara@upc.edu

tel: + 34 93 413 77 06
fax: + 34 93 413 77 01
Secretary: +34 93 413 76 80

Back to the index

Institutional links

Back to the index

Information for visitors

Arrival and departure: A few hints about the airport, the railroad station and how to get from there to the city.
Getting around: Some information on how to get around within the city (bus, subway, city map,...) and outside the city (taking a train, renting a car,...). Includes directions to our Department.
Sightseeing and more: Our particular and subjective suggestions about what to see, where to eat, and more.
Residences for researchers:

Residència d'investigadors RESA Carrer Hospital.
Residència d'Investigadors RESA Torre Girona
Residència RESA Campus del Mar
Residència RESA Ciutadella
Residència RESA Lesspes

Back to the index

Teaching

Courses (2007-2008)

Complements de Matemàtiques 1 (Facultat de Matemàtiques i Estadística)
Àlgebra (Facultat d'Informàtica de Barcelona)
Matemàtica Discreta (Facultat d'Informàtica de Barcelona)
Computational Geometry Seminar (UPC PhD Program on Applied Mathematics)

Research

Interests and links

Main subjects of interest:

Discrete/Combinatorial/Computational Geometry
Convexity and Metric Dimension in Graphs
Structural Complexity

Interesting links

Encuentros de Geometría Computacional

XIV Encuentros de Geometría Computacional (Junio 27-30, 2011, Alcalá de Henares, Madrid, Spain)

European Workshop on Computationa Geometry

28th EuroCG, 2012, Assisi, Perugia, Italy, March 19-21, 2012

Jornadas de Matemática Discreta

VII Jornadas de Matemática Discreta y Algorítmica (Julio 7-9, 2010, Castro Urdiales, Santander, Spain)

VII Encuentro Andaluz de Matemática Discreta, Noviembre 7-8, 2011, Carmona, Sevilla, Spain

Canadian Conference on Computational Geometry

23rd Canadian Conference on Computational Geometry, August 10-12, 2011, University of Toronto, Ontario, Canada

Annual Symposium on Computational Geometry (SoCG)

28th Annual Symposium on Computational Geometry (SoCG 2012), June 16-20, Chapel Hill, NC, (USA)

British Combinatorial Conference

23^rd British Combinatorial Conference, Exeter, England, UK, 3-8 July 2011

European Conference on Combinatorics, Graph Theory and Applications

Eurocomb’11 (29 August- 2 September, 2011, Budapest, Hungary)

Some personal pages

Coauthors

Manuel Abellanas, Carlos Alegría-Galicia, Greg Aloupis, Boris Aronov, Estie Arkin, Franz Aurenhammer, Crevel Bautista-Santiago, Sergey Bereg, Jit Bose, Sergio Cabello, José Cáceres, Jean Cardinal, Sebastien Collette, Jorge Castro, Mercè Claverol, Carmen Cortés, Olivier Devillers, Erik D. Demaine, Martin Demaine, José Miguel Díaz-Báñez, Muriel Dulieu, Ruy Fabila-Monroy, Tzolkin Garduño, Delia Garijo, Clara I. Grima, Vi Hart, Marco A. Heredia, Carmen Hernando, Clemens Huemer, Ferran Hurtado, Tao Jiang, Gyula Kàrolyi, Dolores Lara, Stefan Langerman, Mario A. López, Antoni Lozano, Alberto Márquez, Joe Mitchell, Mercè Mora, Auxiliadora Moreno, Marc Noy, Yurai Nuñez-Rodriguez, Canek Peláez, Iñaki M. Pelayo, Pablo Pérez-Lantero, Herbert Pérez-Roses, Maria Luz Puertas, Adriana Ramírez-Vigueras, Pedro A. Ramos, David Rappaport, Areli Rosas-Navarrete, Maria Saumell, J. Antoni Sellarès, Saurabh Séthia, Steve Skiena, Shakhar Smorodinsky, Perouz Taslakian, Jorge Urrutia, Inmaculada Ventura, David R.Wood .

Back to the index

Publications

Ph. Thesis: On geometric separability, Barcelona 2002, Universitat Politècnica de Catalunya. Advisor: Ferran Hurtado

Articles and Research Reports

A. Lozano, M. Mora, C. Seara. Distinguishing trees in linear time. (Submitted).
E. M. Arkin, D. Garijo, A. Márquez, J. S. B. Mitchell, C. Seara. Separability of point sets by k-level linear classification trees. (Submitted).
C. Bautista-Santiago, M. A. Heredia, C. Huemer, A. Ramírez-Vigueras, C. Seara, J. Urrutia. On the number of edges in geometric graphs without empty triangles. (Submitted).
S. Bereg, J. M. Díaz Báñez, D. Lara, P. Pérez-Lantero, C. Seara, J. Urrutia. On the coarseness of a bichromatic point set. (Submitted).
Greg Aloupis, Jean Cardinal, Sebastien Collette, Erik D. Demaine, Martin Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, and Perouz Taslakian. Non-crossing matching of points with geometric objects. (Submitted).
S. Bereg, S. Cabello, J. M. Díaz Báñez, P. Pérez-Lantero, C. Seara, I. Ventura. The Class Cover Problem with Boxes. Computational Geometry: Theory and Applications. (Accepted).
B. Aronov, D. Garijo, Y. Nuñez-Rodriguez, D. Rappaport, C. Seara, J. Urrutia. Measuring the error of linear separators on linearly inseparable data. (Submitted)
M. Claverol, D. Garijo, C. I. Grima, A. Márquez, C. Seara. Stabbers of line segments in the plane. Computational Geometry: Theory and Applications, Vol. 44, Issue 5, (2011), pp. 303-318.
J. M. Díaz Báñez, M. A. Lopez, M. Mora, C. Seara, I. Ventura. Fitting a two-joint orthogonal chain to a point set. Computational Geometry: Theory and Applications. Volume 44, Issue 3, (2011), pp. 135-147.
Greg Aloupis, Jean Cardinal, Sebastien Collette, Erik D. Demaine, Martin Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, and Perouz Taslakian. Matching points with things. Lecture Notes in Computer Science, Vol. 6034 (2010), pp. 456-467.
P. Bose, M. Mora, C. Seara, S. Sethia. On computing enclosing isosceles triangles and related problems. International Journal of Computational Geometry and Applications. Vol. 21, Issue 1 (2011), pp. 25-45.
C. Huemer, C. Seara. 36 two-colored points with no empty monochromatic convex fourgons. Geombinatorics. Vol. XIX, July 2009
J. Cáceres, D. Garijo, M. L. Puertas, C. Seara. On the determining number and the metric dimension of graphs. Electronic Journal of Combinatorics, Vol. 17(1), (2010), R63.
C. Cortés, J. M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, J. Urrutia, I. Ventura. Bichromatic separability with two boxes: a general approach. Journal of Algorithms, Algorithms in Cognition, Informatics and Logic, Vol. 64, Issues 2-3, 2009, pp. 79-88.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara, D. R. Wood. Extremal graph theory for metric dimension and diameter. Electronic Journal of Combinatorics, Vol. 17 (1), (2010), R30. .
S. Cabello, J. Miguel Díaz-Bañez, C. Seara, J. Antoni Sellarès, J. Urrutia, I. Ventura. Covering point sets with two disjoint disks or squares. Computational Geometry: Theory and Applications, Vol. 40, (2008), pp. 195-206.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara. Some structural, metric and convex properties on the boundary of a graph. Ars Combinatoria (To appear).
S. Cabello, J. Miguel Díaz-Bañez, S. Langerman, C. Seara, I. Ventura. Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research, Vol. 202, Issue 1, (2010), pp. 99-106.
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara, S. Smorodinsky. Small weak epsilon-nets. Computational Geometry: Theory and Applications. Vol. 42 (5), pp. 455-462 (2009). Special Issue on the Canadian Conference on Computational Geometry 2005.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara, D. R. Wood. On the metric dimension of Cartesian product of graphs. SIAM Journal in Discrete Mathematics, 21 (2), (2007), pp. 423-441.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M.L. Puertas, C. Seara. Geodeticity of the contour of chordal graphs. Discrete Applied Mathematics, Vol. 156, (2008), pp. 1132-1142.
S. Bereg, J. M. Díaz Báñez. C. Seara, I. Ventura. On finding widest empty curved corridors. Computational Geometry: Theory and Applications, 38 (2007) pp. 154-169.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara. Some structural, metric and convex properties on the boundary of a graph. Electronic Notes in Discrete Mathematics, Vol. 24 (2006) pp. 203-209.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara, D. R. Wood. Extremal graph theory for metric dimension and diameter. Electronic Notes in Discrete Mathematics, Vol. 29, pp. 339-343, 2007.
E. M. Arkin, F. Hurtado, J. S. B. Mitchell, C. Seara, S. S. Skiena. Some lower bounds on geometric separability problems. International Journal of Computational Geometry and Applications. Vol. 16, No. 1, (2006) pp. 1-26.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. On geodetic sets formed by boundary vertices. Discrete Mathematics, 306 (2006) pp. 188-198.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. Searching for geodetic boundary vertex sets. Electronic Notes in Discrete Mathematics, Vol. 19 (2005) pp. 25-31.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. On the metric dimension of some families of graphs. Electronic Notes in Discrete Mathematics, 22 (2005) pp. 129-133.
F. Hurtado, C. Seara, S. Sethia. Red-blue separability problems in 3D. International Journal of Computational Geometry and Applications, Vol 15, No. 2, (2005) pp. 167-192.
C. Hernando, T. Jiang, M. Mora, I. M. Pelayo, C. Seara. On the Steiner, geodetic and hull number of graphs. Discrete Mathematics, 293 (2005) pp. 139-154.
F. Hurtado, M. Mora, P. A. Ramos, C. Seara. Separability by two lines and by nearly-straight polygonal chains. Discrete Applied Mathematics, 144 (2004) pp. 110-122.
F. Hurtado, C. Seara, S. Sethia. Red-blue separability problems in 3D. Lecture Notes in Computer Science, Vol. 2669 (2003) pp. 766-775.
O. Devillers, F. Hurtado, G. Károlyi, C. Seara. Chromatic variants of the Erdös-Szekeres theorem on points in convex position. Computational Geometry: Theory and Applications, Vol. 26 (2003) pp. 193-208.
O. Devillers, F. Hurtado, C. Seara. Chromatic variants of the Erdös-Szekeres theorem on points in convex position. Institut Nacional de Recherche en Informatique et en Automatique, INRIA-Sophia Antipolis (France), Repport de Recherché num. 4352 (2002) pp. 1-16.
F. Hurtado, M. Noy, P. A. Ramos, C. Seara. Separating objects in the plane by wedges and strips. Discrete Applied Mathematics, Vol. 109 (2000) pp. 109-138.
J. Castro, C. Seara. Complexity classes between Theta_k^P and Delta_k^P. Theoretical Informatics and Applications (RAIRO), Vol. 30 (1996) pp. 101-121.
C. Seara. Paralelismo en Geometría Computacional. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya. Report de Recerca Ma2-IT-94-0012 (1994) pp. 1-62.
J. Castro, C. Seara. The Theta-operator and the Low Hierarchy. Fourth Barcelona-Ulm Workshop on Probabilistic Complexity Classes and Nonuniform Computational Models (1993) pp. 10-18.
J. Castro, C. Seara. The P_{log^{i}} and AC^{i-1} operators on the Polynomial Time Hierarchy. Departament de Llenguatges i Sistemes Informàtics, Universitat Politécnica de Catalunya. Report de Recerca LSI-93-44-R (1993) pp.1-12.
J. Castro, C. Seara. Characterizations of some complexity classes between Theta_2^P and Delta_2^P. Lecture Notes in Computer Science (Springer-Verlag), Vol. 557 (1992) pp. 305-317.

Proceedings of International Conferences and Workshops

Antoni Lozano, Mercè Mora, Carlos Seara. Distinguishing trees in linear time. 7^th Slovenian International Conference on Graph Theory. Bled (Slovenia), June 19-25, 2011.
Carlos Alegría-Galicia, Tzolkin Garduño, Areli Rosas-Navarrete, Carlos Seara, and Jorge Urrutia. Rectilinear convex hull with minimum area. XIV Spanish Meeting on Computational Geometry. Alcalá de Henares (Spain), June 27-30, 2011.
Canek Peláez, Adriana Ramírez-Vigueras, Carlos Seara, and Jorge Urrutia. Weak separators, vector dominance, and the dual space. XIV Spanish Meeting on Computational Geometry. Alcalá de Henares (Spain), June 27-30, 2011.
Sergey Bereg, José-Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Carlos Seara and Jorge Urrutia. On the coarseness of bichromatic point sets. China-Japan Joint Conference on Computational Geometry, Graphs and Applications (CGGA 2010).
Greg Aloupis, Jean Cardinal, Sebastien Collette, Erik D. Demaine, Martin Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, and Perouz Taslakian. Matching points with things. The 9th Latin American Theoretical Informatics Symposium, LATIN 2010, Oaxaca (México), 2010 , Vol. 6034 , pp. 456-467.
M. Claverol, D. Garijo, C. I. Grima, A. Márquez, C. Seara. Apuñalando segmentos en el plano. Coloquio Víctor Neumann-Lara de Teoría de Gráficas, Combinatoria y sus Aplicaciones, Querétaro (México), 2010.
Esther M. Arkin, Delia Garijo, Alberto Márquez, Joseph S. B. Mitchell, and Carlos Seara. Separability of point sets by k-level linear classification trees. 26th European Workshop on Computational Geometry. Dortmund (Germany), 2010.
Sergey Bereg, Sergio Cabello, José-Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, and Inmaculada Ventura. The class cover problem with boxes. 26th European Workshop on Computational Geometry. Dortmund (Germany), 2010.
Boris Aronov, Delia Garijo, Yurai Nuñez-Rodriguez, David Rappaport, Carlos Seara, Jorge Urrutia. Measuring the error of linear separators on linearly inseparable data. 7th Japan Conference on Computational Geometry and Graphs, Kanazawa, (Japan), 2009.
Greg Aloupis, Jean Cardinal, Sebastien Collette, Erik D. Demaine, Martin Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian. Matching points with things. 7th Japan Conference on Computational Geometry and Graphs, Kanazawa, (Japan), 2009.
M. Claverol, D. Garijo, C. I. Grima, A. Márquez, C. Seara. Stabbers of line segments in the plane. 25th European Workshop on Computational Geometry. Brussels (Belgium), 2009.
J. M. Díaz Báñez, M. A. Lopez, C. Seara, I. Ventura. Fitting a point set by small monotone orthogonal chains. 25th European Workshop on Computational Geometry. Brussels (Belgium), 2009.
J. Cáceres, D. Garijo, M. L. Puertas, C. Seara. Determining number versus metric dimension of graphs. Ottawa-Carleton Graph Theory Workshop. Carleton University, Ottawa, Canada, 2008
C. Hernando, M. Mora, I. M. Pelayo, C. Seara, D. R. Wood. Extremal graph theory for metric dimension and diameter. European Conference on Combinatorics, Graph Theory and Applications, EUROCOMB’07. Sevilla (Spain), 2007.
C. Cortés, J. M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, J. Urrutia, I. Ventura. Bichromatic separability with two boxes. Kyoto International Conference on Computational Geometry and Graph Theory, KyotoCGGT2007. Kyoto (Japan), 2007.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara. Some structural, metric and convex properties on the boundary of a graph. Fifth Cracow Conference on Graph Theory. Ustron (Poland), 2006.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara, D. R. Wood. On the metric dimension of some products of graphs. SIAM Conference on Discrete Mathematics, Victoria (Canada), 2006.
S. Bereg, J. M. Díaz Báñez. C. Seara, I. Ventura. Algoritmos para la búsqueda de corredores curvados vacíos de máxima anchura.Vigesimo primer coloquio Victor Neuman-Lara de Teoría de las Gráficas, Combinatoria y sus aplicaciones. Universidad Autónoma de Guerrero, (Mexico) 2006.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. On the metric dimension of some families of graphs. 7th Internacional Colloquium on Graph Theorey, ICGT'05. Hyères (France), 2005.
S. Cabello, J. M. Díaz Báñez, S. Langerman, C. Seara, I. Ventura. Reverse facility location problems. 17th Canadian Conference on Computational Geometry, Windsor (Canada), 2005.
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara, S. Smorodinsky. Small weak epsilon-nets. 17th Canadian Conference on Computational Geometry. Windsor (Canada), 2005.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. On monophonic sets in graphs. 20th British Combinatorial Conference. Durham (England), 2005.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara, D. R. Wood. On the metric dimension of graph products. 20th British Combinatorial Conference. Durham (England), 2005.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. Searching for geodetic boundary vertex sets. Second Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO'05). Rio de Janeiro (Brazil), 2005.
J. M. Díaz Báñez, C. Seara, J. A. Sellarès, J. Urrutia, I. Ventura. Covering point sets with two convex objects. 21th European Workshop on Computational Geometry. Eindhoven (Holland), 2005.
J. M. Díaz-Báñez, F. Hurtado, D. Rappaport, C. Seara, I. Ventura .Locating obnoxious facilities with minimum interaction. Tenth International Symposium on Locational Decisions. Sevilla (Spain), 2005.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara. Geodesic convexity and chordal graphs. Graph Theory 2004, a conference in Memory of Claude Berge. Paris (France), 2004.
P. Bose, C. Seara, S. Sethia. On computing enclosing isosceles triangles and related problems. 16th Canadian Conference on Computational Geometry. Montreal (Canada), 2004.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara. On geodesic and monophonic convexity. 20th European Workshop on Computational Geometry. Sevilla (Spain), 2004.
J. M. Díaz-Báñez, C. Seara, I. Ventura. The siphon problem. 20th European Workshop on Computational Geometry. Sevilla (Spain), 2004.
C. Hernando, T. Jiang, M. Mora, I. M. Pelayo, C. Seara. On the Steiner set problem in graphs. 19th British Combinatorial Conference. Bangor (Wales), 2003.
F. Hurtado, C. Seara, S. Sethia. Red-blue separability problems in 3D. Third Internacional Worshop on Computational Geometry and Applications. Montreal (Canada), 2003.
F. Hurtado, C. Seara, S. Sethia. Red-blue separability problems in 3D. 19th European Workshop on Computational Geometry. Bonn (Germany), 2003.
I. M. Pelayo, M. Mora, C. Hernando, C. Seara. Convexity in graphs: Steiner sets, hull sets and geodesic sets. 985th American Mathematical Society Meeting. Indiana University Bloomington, Indiana, (USA), 2003.
O. Devillers, F. Hurtado, C. Seara. Chromatic variants of the Erdös-Szekeres theorem on points in convex position.18th European Workshop on Computational Geometry. Warsaw (Poland), 2002.
E. M. Arkin, F. Hurtado, J. S. B. Mitchell, C. Seara, S. S. Skiena. Some lower bounds on geometric separability problems. 11th Fall Workshop on Computational Geometry. Polytechnic Univ. Brooklyn, New York (USA), 2001.
O. Devillers, F. Hurtado, M. Mora, C. Seara. Separating several point sets in the plane.13th Canadian Conference on Computational Geometry. Waterloo, (Canada), 2001.
E. M. Arkin, F. Hurtado, J. S. B. Mitchell, C. Seara, S. S. Skiena. Some separability problems in the plane. 16th European Workshop on Computational Geometry. Eilat (Israel), 2000.
F. Hurtado, M. Mora, P. A. Ramos, C. Seara. Two problems on separability with lines and polygonals. 15th European Workshop on Computational Geometry. Nice (France), 1999.
F. Hurtado, M. Noy, P. A. Ramos, C. Seara. Separating objects in the plane with wedges and strips. 10th Canadian Conference on Computational Geometry. Montreal (Canada), 1998.
F. Hurtado, M. Noy, P. A. Ramos, C. Seara. Separating objects in the plane with wedges and strips. 14th European Workshop on Computational Geometry. Barcelona (Spain), 1998.
J. Castro, C. Seara. The Theta-operator and the Low Hierarchy. Fourth Barcelona-Ulm Workshop on Probabilistic Complexity Classes and Nonuniform Computational Models. Barcelona (Spain), 1993.
J. Castro, C. Seara. Characterizations of some complexity classes between Theta_2^P and Delta_2^P. 9th Annual Symposium on Theoretical Aspects on Computer Science (STACS’92). Cachan (France), 1992.

Proceedings of Spanish Conferences and Workshops

C. Seara. Dominación y órdenes parciales. VII Jornadas Andaluzas de Matemática Discreta, Carmona, Sevilla (Spain), 2011.
J. M. Díaz-Báñez, M. A. López, M. Mora, C. Seara, and I. Ventura. Fitting a two-joint orthogonal chain to a point set. Workshop on Locational Analysis and Related Problems, Sevilla (Spain), 2010.
M. Claverol, D. Garijo, C. I. Grima, A. Márquez, C. Seara. Stabbers of line segments in the plane. XIII Encuentros de Geometría Computacional. Zaragoza (Spain), 2009.
S. Bereg, J. M. Díaz Báñez, D. Lara, P. Pérez, C. Seara, J. Urrutia. Bichromatic discrepancy via convex partitions. XIII Encuentros de Geometría Computacional. Zaragoza (Spain), 2009.
Boris Aronov, Delia Garijo, Yurai Nuñez-Rodriguez, David Rappaport, Carlos Seara, Jorge Urrutia. Measuring the error of linear separators on linearly inseparable data. XIII Encuentros de Geometría Computacional. Zaragoza (Spain), 2009.
J. Cáceres, D. Garijo, M. L. Puertas, C. Seara. On determining number and metric dimension of graphs. VI Jornadas de Matemática Discreta y Algorítmica. Lleida (Spain), 2008
J. M. Díaz-Báñez, M. A. López, H. Pérez-Roses, C. Seara, I. Ventura. Fitting by monotone orthogonal chains. XII Encuentros de Geometría Computacional. Valladolid (Spain), 2007.
C. Cortés, J. M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, J. Urrutia, I. Ventura. Bichromatic separability with two boxes: a general approach. XII Encuentros de Geometría Computacional. Valladolid (Spain), 2007.
D. Garijo, A. Márquez, J. S. B. Mitchell, C. Seara. Separación y clasificación de puntos rojos y azules. XII Encuentros de Geometría Computacional. Valladolid (Spain), 2007.
J. Cáceres, C. Hernando, M. Mora, A. Moreno, I. M. Pelayo, M. L. Puertas, C. Seara. Dimensión métrica de grafos infinitos. V Encuentro Andaluz de Matemática Discreta. La Línea de la Concepción, Cadiz (Spain), 2007.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara, D. R. Wood. On the metric dimension of Cartesian product of graphs. V Jornadas de Matemática Discreta y Algorítmica. Soria (Spain), 2006.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara, D. R. Wood. Grafos de orden máximo y mínimo con diámetro y dimensión métrica fijados. V Jornadas de Matemática Discreta y Algorítmica. Soria (Spain), 2006.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. El digrafo excéntrico de un grafo intervalo. XI Encuentros en Geometría Computacional. Santander (Spain), 2005.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. Reconstrucción de un grafo a partir de la clausura geodética. XI Encuentros en Geometría Computacional. Santander (Spain), 2005.
J. M. Díaz Báñez, C. Seara, J. A. Sellarès, J. Urrutia, I. Ventura. Covering point sets with two convex objects. XI Encuentros en Geometría Computacional. Santander (Spain), 2005.
S. Cabello, J. M. Díaz Báñez, S. Langerman, C. Seara, I. Ventura. Reverse facilyty location problems. XI Encuentros en Geometría Computacional. Santander (Spain), 2005.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. Conjuntos geodéticos formados por vértices fronterizos de un grafo. IV Jornadas de Matemática Discreta y Algorítmica. Madrid (Spain), 2004.
J. Cáceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara. Estudio del contorno en grafos cordales. IV Jornadas de Matemática Discreta y Algorítmica. Madrid (Spain), 2004.
C. Hernando, M. Mora, I. M. Pelayo, C. Seara. On monophonic sets in graphs. III Encuentro Andaluz de Matemáticas Discretas. Almería (Spain), 2003.
F. Hurtado, C. Seara, S. Sethia. Red-blue separability problems in 3D. X Encuentros en Geometría Computacional. Sevilla (Spain), 2003.
J. M. Díaz-Báñez, C. Seara, I. Ventura. The siphon problem. X Encuentros en Geometría Computacional. Sevilla (Spain), 2003.
M. Abellanas, M. Claverol, F. Hurtado, C. Seara. (alpha-k)-Sets en el plano. III Jornadas de Matemática Discreta y Algorítmica. Sevilla (Spain), 2002.
O. Devillers, F. Hurtado, M. Mora, C. Seara. Separating several point sets in the plane. IX Encuentros de Geometría Computacional. Girona (Spain), 2001.
E. M. Arkin, F. Hurtado, J. S. B. Mitchell, C. Seara, S. S. Skiena. Some lower bounds on geometric separability problems. II Jornadas de Matemática Discreta y Algorítmica. Ciutat de Palma (Spain), 2000.
F. Hurtado, M. Mora, P. A. Ramos, C. Seara. Separación de objetos en el plano por doble cuña y por Theta-poligonal. VIII Encuentros de Geometría Computacional. Castelló (Spain), 1999.
F. Hurtado, M. Noy, C. Seara. Separación de puntos mediante cuñas y bandas. VII Encuentros de Geometría Computacional. Madrid (Spain), 1997.

Organizer Committee Member

International Workshop on Metric and Convex Graph Theory, Barcelona (Spain), Juny (2006).
18th ACM Symposium on Computational Geometry, Barcelona (Spain), Juny (2002).
International Workshop on Equitable Subdivisions, Barcelona (Spain), Juny (2001).
11th Conference on Formal Power Series and Algebraic Combinatorics, Barcelona (Spain), Juny (1999).
Curso de Introducción a CGAL (Computational Geometry Algorithms Library), Barcelona (Spain), April (1999).
14th European Workshop on Computational Geometry, Barcelona (Spain), March (1998).
Jornadas Franco-Españolas de Geometría Algorítmica, Barcelona (Spain), September (1997).
VI Encuentros de Geometría Computacional, Barcelona (Spain), July (1995).
Fourth Barcelona-Ulm Workshop on Probabilistic Complexity Classes and Nonuniform Computational Models, Barcelona (Spain), September (1993).
Structure in Complexity Theory, Barcelona (Spain), July (1990).

Programme Committee Member

Invited speaker

VII Encuentro Andaluz de Matemática Discreta, Carmona, Sevilla (Spain), November 7-8, 2011.

Books

Mercè Mora, Carlos Seara. Àlgebra 1 (in Catalan). Diplomatura d'Estadística. Facultat de Matemàtiques i Estadística, Universitat Politècnica de Catalunya.

Mercè Mora, Carlos Seara. Àlgebra 2 (in Catalan). Diplomatura d'Estadística. Facultat de Matemàtiques i Estadística, Universitat Politècnica de Catalunya.

Music

Carlos Seara and David Orden in the Concert of the British Combinatorial Conference, Bangor (Wales) 2003