Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Syslo, Maciej M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On some new types of greedy chains and greedy linear extensions of partially ordered sets
Maciej M. Syslo
Discrete Applied Mathematics
60
, 1995, pp. 349-358
Maximal outerplanar graphs with perfect face-independent vertex covers
Pawel Winter
,
Maciej M. Syslo
Discrete Applied Mathematics
54
, 1994, pp. 267-280
Efficient computations in tree-like graphs
Andrzej Proskurowski
,
Maciej M. Syslo
Computing Supplementum
7
, 1990, pp. 1-15
Bounds to the page number of partially ordered sets
Maciej M. Syslo
Lecture Notes in Computer Science
411
, 1989, pp. 181-195
An algorithmic characterization of total digraphs
Miroslawa SkowroĊska
,
Maciej M. Syslo
,
Cristina Zamfirescu
Journal of Algorithms
7
, 1986, pp. 120-133