Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete mathematics & theoretical computer science
Tome 12 (2010)
no. 1
Précédent
Suivant
Volume 12 (2010) no. 1
Sommaire
Generating involutions, derangements, and relatives by ECO
Vajnovszki, Vincent
On edge-intersection graphs of k-bend paths in grids
Biedl, Therese
;
Stern, Michal
Acyclic colourings of graphs with bounded degree
Borowiecki, Mieczyslaw
;
Fiedorowicz, Anna
;
Jesse-Jozefczyk, Katarzyna
;
Sidorowicz, Elzbieta
An improved bound on the largest induced forests for triangle-free planar graphs
Kowalik, Lukasz
;
Luzar, Borut
;
Skrekovski, Riste
Tight Bounds for Delay-Sensitive Aggregation
Pignolet, Yvonne Anne
;
Schmid, Stefan
;
Wattenhofer, Roger
On a 1, 2 Conjecture
Przybylo, Jakub
;
WoźniaK, Mariusz
Deciding whether the ordering is necessary in a Presburger formula
Choffrut, Christian
;
Frigeri, Achille
On the existence of block-transitive combinatorial designs
Huber, Michael
Symmetric monochromatic subsets in colorings of the Lobachevsky plane
Banakh, Taras
;
Dudko, Artem
;
Repovs, Dusan
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
Aichholzer, Oswin
;
Cabello, Sergio
;
Fabila-Monroy, Ruy
;
Flores-Peñaloza, David
;
Hackl, Thomas
;
Huemer, Clemens
;
Hurtado, Ferran
;
Wood, David R.