Sciweavers

ENDM
2006
91views more  ENDM 2006»
13 years 11 months ago
There are exactly five biplanes with k=11
A biplane is a 2-(k(k - 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k...
Patric R. J. Östergård, Petteri Kaski
ENDM
2006
68views more  ENDM 2006»
13 years 11 months ago
On Modular Decomposition Concepts: the case for Homogeneous Relations
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy,...
ENDM
2006
53views more  ENDM 2006»
13 years 11 months ago
A completely dynamic algorithm for split graphs
Federico Mancini, Pinar Heggernes
ENDM
2006
50views more  ENDM 2006»
13 years 11 months ago
Generalized clique family inequalities for claw-free graphs
Arnaud Pêcher, Annegret Wagler
ENDM
2006
65views more  ENDM 2006»
13 years 11 months ago
Hamiltonian Chains in Hypergraphs
Gyula Y. Katona
ENDM
2006
96views more  ENDM 2006»
13 years 11 months ago
Exploring the complexity boundary between coloring and list-coloring
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
Flavia Bonomo, Guillermo Durán, Javier Mare...
ENDM
2006
77views more  ENDM 2006»
13 years 11 months ago
A Two-stage Model for a Day-ahead Paratransit Planning Problem
We consider a dynamic planning problem for paratransit transportation. The focus is on a decision to take one day ahead: which requests to serve with own vehicles, and which reque...
Maria L. A. G. Cremers, Willem K. Klein Haneveld, ...
ENDM
2006
58views more  ENDM 2006»
13 years 11 months ago
Two disjoint negative cycles in a signed graph
Winfried Hochstättler, Robert Nickel, Britta ...
ENDM
2006
70views more  ENDM 2006»
13 years 11 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich
ENDM
2006
69views more  ENDM 2006»
13 years 11 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...