Sciweavers

DCG
1998
66views more  DCG 1998»
14 years 4 days ago
The Volume as a Metric Invariant of Polyhedra
It is proved that in R3 the volume of any polyhedron is a root of some polynomial with coefficients depending only on the combinatorial structure and the metric of the polyhedron....
Idzhad Kh. Sabitov
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
14 years 5 days ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
DCG
2002
81views more  DCG 2002»
14 years 8 days ago
Separoids, Their Categories and a Hadwiger-Type Theorem for Transversals
In this paper we study the topology of transversals to a family of convex sets as a subset of a Grassmanian manifold. This topology seems to be ruled by a combinatorial structure w...
Jorge L. Arocha, Javier Bracho, Luis Montejano, D....
EJC
2008
14 years 16 days ago
Embeddability of arrangements of pseudocircles into the sphere
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure ...
Ronald Ortner
ALT
2010
Springer
14 years 20 days ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles
CPAIOR
2010
Springer
14 years 5 months ago
Solving Connected Subgraph Problems in Wildlife Conservation
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Bistra N. Dilkina, Carla P. Gomes
FOCS
2002
IEEE
14 years 5 months ago
The Partition Technique for Overlays of Envelopes
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
Vladlen Koltun, Micha Sharir