Sciweavers

ENDM
2008
75views more  ENDM 2008»
13 years 11 months ago
Baxter permutations and plane bipolar orientations
We present a simple bijection between Baxter permutations of size n and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutati...
Nicolas Bonichon, Mireille Bousquet-Mélou, ...
ENDM
2008
57views more  ENDM 2008»
13 years 11 months ago
Six-Critical Graphs on the Klein Bottle
Abstract Nathan Chenette Ken-ichi Kawarabayashi Daniel Kr
Nathan Chenette, Luke Postle, Noah Streib, Robin T...
ENDM
2008
127views more  ENDM 2008»
13 years 11 months ago
Compatible Geometric Matchings
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our f...
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu,...
ENDM
2008
62views more  ENDM 2008»
13 years 11 months ago
... : The Way of the Bow
Frédéric Demangeon, Patrice Ossona d...
ENDM
2008
93views more  ENDM 2008»
13 years 11 months ago
On Universal Graphs of Minor Closed Families
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
Arnaud Labourel
ENDM
2008
61views more  ENDM 2008»
13 years 11 months ago
Diameter and Curvature: Intriguing Analogies
We highlight intriguing analogies between the diameter of a polytope and the largest possible total curvature of the associated central path. We prove continuous analogues of the ...
Antoine Deza, Tamás Terlaky, Feng Xie, Yuri...
ENDM
2008
120views more  ENDM 2008»
13 years 11 months ago
Connectivity check in 3-connected planar graphs with obstacles
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
ENDM
2008
51views more  ENDM 2008»
13 years 11 months ago
A Polynomial Bound for Untangling Geometric Planar Graphs
Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat...
ENDM
2008
87views more  ENDM 2008»
13 years 11 months ago
Computing Canonical Polygonal Schemata with Generalized Maps
This paper shows that a well-known algorithm proposed to compute the canonical polygonal schema of a surface can be transferred onto a 2-dimensional generalized map. We show that ...
Guillaume Damiand, Sylvie Alayrangues
ENDM
2008
93views more  ENDM 2008»
13 years 11 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...