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 3 (1998-1999)
Précédent
Suivant
Sommaire du
Fascicule no. 1
NP-Completeness Results for Minimum Planar Spanners
Brandes, Ulrik
;
Handke, Dagmar
An Involution Principle-Free Bijective Proof of Stanley's Hook-Content Formula
Krattenthaler, Christian
Sommaire du
Fascicule no. 2
The Number of Sides of a Parallelogram
Falbel, Elisha
;
Koseleff, Pierre-Vincent
Quicksort algorithm again revisited
Knessl, Charles
;
Szpankowski, Wojciech
The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order
Göbel, Manfred
Sommaire du
Fascicule no. 3
Partially persistent search trees with transcript operations
Larsen, Kim S.
Local Normal Forms for First-Order Logic with Applications to Games and Automata
Schwentick, Thomas
;
Barthelmann, Klaus
Applying a uniform marked morphism to a word
Frid, Anna
On the Structure of Valiant's Complexity Classes
Bürgisser, Peter
Sommaire du
Fascicule no. 4
A note on domino treewidth
Bodlaender, Hans L.
Permutations Containing and Avoiding
$\textit{123}$
and
$\textit{132}$
Patterns
Robertson, Aaron
Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks
Li, Keqin
Classes of graphs with restricted interval models
Proskurowski, Andrzej
;
Telle, Jan Arne
A characterization for all interval doubling schemes of the lattice of permutations
Caspard, Nathalie
Accelerated series for universal constants, by the WZ method
Wilf, Herbert S.
Polytypic Functions Over Nested Datatypes
Hinze, Ralf