- Paths of Trains with Two-Wheeled Cars Luis Montejano
- Illuminating Triangles and Quadrilaterals with Vertex Floodlights
- Simple Alternating Path Problem JIN AKIYAMA
- Min-energy Broadcast in Fixed-trajectory Mobile Ad-hoc J.M. Diaz-Ba~nez
- Partial Orders and Euclidean Geometry JORGE URRUTIA
- A note on minimally 3-connected graphs Victor Neumann-Lara1
- Graham Triangulations and Triangulations With a Center Are Hamiltonean
- Compass Routing on Geometric Networks Evangelos Kranakis, School of Computer Science,
- CROOKED DIAGRAMS WITH FEW SLOPES J. Czyzowicz, A. Pelc
- Poligonales heterocromaticas monotonas de minima longitud J. M. Diaz-Ba~nez
- Computing Largest Circles Separating Two Sets of Segments JeanDaniel Boissonnat \Lambda Jurek Czyzowicz yz Olivier Devillers \Lambda Jorge Urrutia x
- Separation of convex sets Jurek Czyzowicz
- LIGHT SOURCES, OBSTRUCTIONS AND SPHERICAL ORDERS Stephan Foldes1,
- TwoFloodlight Illumination of Convex Polygons
- 1 Routing with guaranteed delivery in geometric and wireless networks
- Jin Akiyama A Friend and His Mathematics
- ISOMORPHIC TRIANGULATIONS WITH MINIMAL NUMBER OF
- THE NUMBER OF GEOMETRIC BISTELLAR NEIGHBORS
- ON THE NUMBER OF DIRECTIONS IN VISIBILITY REPRESENTATIONS OF
- Illumination with Orthogonal Floodlights ? (Extended Abstract)
- SEPARATING CONVEX SETS ON THE PLANE Jurek Czyzowicz1, Eduardo Rivera-Campo2, Jorge Urrutia3 and Joseph Zaks4
- On spanning trees and cycles of multicolored point sets with few intersections
- Domino Tilings of Orthogonal Polygons Gyorgy Csizmadia Jurek Czyzowiczxy
- On polygons enclosing point sets II F. Hurtado1
- Diagonal flips in labelled planar triangulations Zhicheng Gao
- THE FLOODLIGHT PROBLEM \Lambda Prosenjit Bose 1 Leonidas Guibas 2 Anna Lubiw 3
- On Modem Illumination Problems R. Fabila-Monroy*
- Bichromatic Discrepancy via Convex Partitions J.M. Diaz-Ba~nez
- Measuring the error of linear separators on linearly inseparable Boris Aronov
- L-corredor k-cromatico C. Bautista-Santiago
- Bichromatic separability with two boxes: a general approach J. M. Diaz-Ba~nez
- Augmenting the Connectivity of Geometric Graphs M. Abellanas1
- Universal Measuring Boxes with Triangular Bases Jin Akiyama
- A note on harmonic subgraphs in labelled geometric graphs G. Salazar
- Hamiltonian Tetrahedralizations with Steiner Points Francisco Escalona
- Local Solutions for Global Problems in Wireless Networks May 1, 2006
- On convex quadrangulations of point sets on the V.M. Heredia1
- Games on Triangulations Oswin Aichholzer1
- On the chromatic number of some geometric type Kneser graphs
- Flat 2-foldings of Convex Polygons Jin Akiyama
- On a Triangle with the Maximum Area in a Planar Point Set
- "! #$&%'(0) 10 243 5($576 8910 @ACB$DE FGHI($P QRI57 STUVE(0) ( WXP`Ya10b5 cdegfhiDpR
- Simultaneous edge flipping in triangulations J. Galtier1
- Coloraciones, tetraedralizaciones, y tetraedros vacios en coloraciones de
- Problemas de cobertura circular1 J. Urrutia y P. Valencia
- Some Open Problems Jorge Urrutia
- Sequentially Divisible Dissections of Simple Jin AKIYAMA
- Efficient Regular Polygon Dissections Evangelos Kranakis13
- Radial Perfect Partitions of Convex Sets in the J. Akiyama1
- Some Problems in Distributed Computational (Extended Abstract)
- Perfect Divisions of a Cake Jin Akiyama, Gisaku Nakamura, Research Institute of Education
- Flipping Edges in Triangulations of Point Sets, Polygons and Maximal Planar Graphs
- A Combinatorial Property of Convex Sets M. Abellanas, G. Hernandez Universidad Politcnica de Madrid, SPAIN
- Sixth proof of the Orthogonal Art Gallery Theorem
- Scheduling Tasks with Communication Delays on Parallel Processors
- Iluminando Pol'gonos con Reflectores Jorge Urrutia
- Guarding Rectangular Art Galleries J. Czyzowicz1, E. Rivera-Campo2, N. Santoro3,
- GALLERIES AND LIGHT MATCHINGS: FAT COOPERATIVE GUARDS
- REPRESENTING ORDERS ON THE PLANE BY TRANSLATING POINTS Richard Nowakowski
- Guarding Convex Sets Jurek Czyzowicz1, Eduardo Rivera-Campo2, Jorge Urrutia 3 and Joseph Zaks4
- A Combinatorial Result on Points and Circles on the Plane V. Neumann-Lara*
- Algunos Problemas Abiertos Jorge Urrutia*
- Parallel edge ipping Ferran Hurtado Marc Noyy
- 1 Introduction straightline embedding
- Covering Point Sets with Two Disjoint Disks or Squares Sergio Cabello
- Flipping Edges on Triangulations F. Hurtado, M. Noy
- STAGEGRAPH REPRESENTATIONS Evangelos Kranakis \Lambday
- On the number of internal and external visibility edges of polygons
- Maximal Number of Edges in Geometric Graphs without Convex Polygons
- Local Edge Colouring of Yao-like Subgraphs of Unit Disk Graphs
- A Containment Result on Points and Circles
- Spanning trees of multicoloured point sets with few intersections
- IMPLICIT ROUTING AND SHORTEST PATH INFORMATION
- Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs
- Bichromatic Quadrangulations with Steiner Points Victor Alvarez1
- MAXIMAL LENGTH COMMON NONINTERSECTING PATHS
- Covering point sets with two convex objects J. Miguel Diaz-Ba~nez
- MOTION PLANNING, TWO-DIRECTIONAL POINT REPRESENTATIONS, AND ORDERED SETS
- THE COMMUNICATIONS COMPLEXITY HIERARCHY IN DISTRIBUTED COMPUTING
- IMMOBILIZING A SHAPE Jurek Czyzowicz1, Ivan Stojmenovic2, and Jorge Urrutia2
- Optimal Floodlight Illumination of Stages Jurek Czyzowicz, Dpartement d'Informatique, Universit du Qubec Hull, Hull, Qubec
- A Combinatorial Result About Points and Balls in Euclidean Space I. Barani, J. H. Schmerl, S. J. Sidney, J. Urrutia
- Covering the Convex Quadrilaterals of Point Sets Toshinori Sakai1
- Circle Orders, N-gon Orders Crossing Number of Partial Orders.
- Finding Shortest Maximal Increasing Subsequences Domination in Permutation Graphs.
- On measuring areas of polygons J. Czyzowicz, Department of Computer Science,
- jorge@csi.uottawa.ca Jorge Urrutia
- Illumination of Polygons with Vertex Lights
- Vigilancia en Galerias de Arte Curvilineas Javier Cano-Vila*
- Separating Collections of Points in Euclidean Spaces Ralph P. Boland1 and Jorge Urrutia2
- A Note on Balanced Colourings for Lattice Points
- K-Guarding Polygons on The Plane Patrice Belleville School of Computer Science, University of British Columbia, Vancouver, BC
- LATTICES CONTAINED IN PLANAR ORDERS ARE PLANAR Richard Nowakowski1,
- Computing Maximal Islands C. Bautista-Santiago
- Representing Orders on the Plane by Translating Convex Figures
- On the Chromatic Numbers of Some Flip Graphs Ruy Fabila-Monroy
- Tres Problemas de Iluminacion y Visibilidad Jorge Urrutia *
- ILLUMINATING RECTANGLES AND TRIANGLES IN Jurek Czyzowicz1
- Equal Area Polygons in Convex Bodies Toshinori Sakai1
