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="Lehel, Jen{\H{o}}"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Repeated degrees in random uniform hypergraphs
Paul Balister
,
Béla Bollobás
,
Jenŏ Lehel
,
Michaƚ Morayne
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 145-154
Tight embeddings of partial quadrilateral packings
Zoltán Füredi
,
Jenŏ Lehel
Journal of Combinatorial Theory Series A
117
(4), 2010, pp. 466-474
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
András Gyárfás
,
Jenŏ Lehel
,
Gábor N. Sárközy
,
R.H. Schelp
Journal of Combinatorial Theory Series B
98
(2), 2008, pp. 342-358
Maximum directed cuts in acyclic digraphs
Noga Alon
,
Béla Bollobás
,
András Gyárfás
,
Jenŏ Lehel
,
Alex Scott
Journal of Graph Theory
55
(1), 2007, pp. 1-13
Finding a monochromatic subgraph or a rainbow path
András Gyárfás
,
Jenŏ Lehel
,
Richard H. Schelp
Journal of Graph Theory
54
(1), 2007, pp. 1-12
Mono-multi bipartite Ramsey numbers, designs, and matrices
Paul N. Balister
,
András Gyárfás
,
Jenŏ Lehel
,
Richard H. Schelp
Journal of Combinatorial Theory Series A
113
(1), 2006, pp. 101-112
The bar visibility number of a graph
Yi-Wu Chang
,
Joan P. Hutchinson
,
Michael S. Jacobson
,
Jenŏ Lehel
,
Douglas B. West
SIAM Journal on Discrete Mathematics
18
(3), 2004-2005, pp. 462-471
Heavy transversals and indecomposable hypergraphs
André E. Kézdy
,
Jenŏ Lehel
,
Robert C. Powers
Combinatorica
23
(2), 2003, pp. 303-310
Patch colorings and rigid colorings of the rational
n
-space
Grzegorz Kubicki
,
Jenŏ Lehel
,
Michaƚ Morayne
Journal of Combinatorial Theory Series B
84
(1), 2002, pp. 45-53
Tough enough chordal graphs are Hamiltonian
Guantao Chen
,
Michael S. Jacobson
,
André E. Kézdy
,
Jenŏ Lehel
Networks
31
(1), 1998, pp. 29-38
Recognizing triangle-free graphs with induced path-cycle double covers is
NP
-complete
Michael S. Jacobson
,
André E. Kézdy
,
Jenŏ Lehel
Networks
31
(1), 1998, pp. 1-10
Recognizing intersection graphs of linear uniform hypergraphs
Michael S. Jacobson
,
André E. Kézdy
,
Jenŏ Lehel
Graphs and Combinatorics
13
, 1997, pp. 359-367
Networks communicating for each pairing of terminals
László Csaba
,
Ralph J. Faudree
,
András Gyárfás
,
Jenŏ Lehel
,
Richard H. Schelp
Networks
22
(7), 1992, pp. 615-626