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
Hilfe
Suche: Author="Peng, Yuejian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The feasible matching problem
Yuejian Peng
,
Papa A. Sissokho
Graphs and Combinatorics
29
(3), 2013, pp. 695-704
A Motzkin-Straus type result for 3-uniform hypergraphs
Yuejian Peng
,
Cheng Zhao
Graphs and Combinatorics
29
(3), 2013, pp. 681-694
On substructure densities of hypergraphs
Yuejian Peng
Graphs and Combinatorics
25
(4), 2009, pp. 583-600
On jumping densities of hypergraphs
Yuejian Peng
Graphs and Combinatorics
25
(5), 2009, pp. 759-766
A note on the structure of Turán densities of hypergraphs
Yuejian Peng
Graphs and Combinatorics
24
(2), 2008, pp. 113-125
A note on the jumping constant conjecture of Erdŏs
Peter Frankl
,
Yuejian Peng
,
Vojtech Rödl
,
John Talbot
Journal of Combinatorial Theory Series B
97
(2), 2007, pp. 204-216
Non-jumping numbers for 4-uniform hypergraphs
Yuejian Peng
Graphs and Combinatorics
23
(1), 2007, pp. 97-110