Sciweavers

23 search results - page 3 / 5
» A characterization of quadrics by intersection numbers
Sort
View
FSTTCS
2007
Springer
14 years 13 days ago
Triangulations of Line Segment Sets in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
Mathieu Brévilliers, Nicolas Chevallier, Do...
ARSCOM
2006
81views more  ARSCOM 2006»
13 years 6 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
DM
2002
107views more  DM 2002»
13 years 6 months ago
Edge clique graphs and some classes of chordal graphs
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
Márcia R. Cerioli, Jayme Luiz Szwarcfiter
ATAL
2007
Springer
14 years 13 days ago
Routing games with an unknown set of active players
In many settings there exists a set of potential participants, but the set of participants who are actually active in the system, and in particular their number, is unknown. This ...
Itai Ashlagi, Dov Monderer, Moshe Tennenholtz
ECCC
2006
145views more  ECCC 2006»
13 years 6 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder