Lovász, László, 1948-
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
Lovász, László
Lovász László magyar matematikus, egyetemi tanár, az MTA tagja, elnöke
Lovász, L., 1948-
Lovász, L. (László), 1948-
VIAF ID: 108138878 (Personal)
Permalink: http://viaf.org/viaf/108138878
ISNI: 0000 0001 2103 7003
Preferred Forms
-
100 1 _ ‡a Lovasz, Laszlo
-
200 _ |
‡a
Lovász
‡b
László
‡f
1948-....
-
100 1 _ ‡a Lovász, L. ‡q (László), ‡d 1948-
-
100 1 _ ‡a Lovász, L., ‡d 1948-
-
100 1 _
‡a
Lovász, László
‡d
1948-
-
100 1 _ ‡a Lovász, László, ‡d 1948-
-
100 1 0
‡a
Lovász, László,
‡d
1948-
-
100 1 _
‡a
Lovász, László,
‡d
1948-....
-
100 0 _
‡a
Lovász László
‡c
magyar matematikus, egyetemi tanár, az MTA tagja, elnöke
-
100 1 _
‡a
Lovász
‡j
László
‡d
1948-
-
100 1 _ ‡a Lovász, László
-
100 1 _ ‡a Lovász, László ‡d (1948- ).
-
100 1 _
‡a
Lovász, László
‡d
1948-
-
100 1 _ ‡a Lovász, László, ‡d 1948-
-
100 1 _ ‡a Lovász, László, ‡d 1948-
-
100 1 _
‡a
Lovász, László,
‡d
1948-
-
100 1 _ ‡a Lovász, László, ‡d 1948-
4xx's: Alternate Name Forms (31)
5xx's: Related Names (4)
- 551 _ _
‡a
Budapest
- 510 2 _
‡a
Eötvös Loránd Tudományegyetem
‡9
g:Budapest
‡e
Affiliation
- 510 2 _
‡a
Eötvös Loránd Tudományegyetem
- 510 2 _
‡a
University of Waterloo. Faculty of Mathematics
Works
| Title | Sources |
|---|---|
| Algebraic methods in graph theory |
|
| Algorithmic aspects of some notions in classical mathematics |
|
| Algorithmic mathematics: an old aspect with a new emphasis |
|
| An Algorithmic theory of numbers, graphs, and convexity |
|
| Algoritmusok |
|
| Brick decompositions and the matching rank of graphs |
|
| Building bridges between mathematics and computer science |
|
| Combinatorial optimization : papers from the DIMACS Special Year |
|
| Combinatorial problems and exercises |
|
| Combinatorica an international journal of the János Bolyai Mathematical Society |
|
| complexity of communication |
|
| Cones of matrices and setfunctions, and 0-1 optimization |
|
| Covering minima and lattice point free convex bodies |
|
| Cycles through specified vertices of a graph |
|
| Discrete mathematics elementary and beyond |
|
| Diszkrét matematika |
|
| Efficient algorithms: an approach by formal logic |
|
| Erdős centennial |
|
| Factoring polynomials with rational coefficients |
|
| Finite and Infinite Sets |
|
| Geometric algorithms and combinatorial optimization |
|
| Graph theory and combinatorial biology |
|
| Greedoids |
|
| Handbook of combinatorics |
|
| Homomorphisms and Ramsey properties of antimatroids |
|
| intersection of matroids and antimatroids |
|
| Kombinatorika |
|
| Kumiawaseron enshu. |
|
| Large networks and graph limits |
|
| Matching theory |
|
| Matematikusok és teremtett világuk beszélgetések |
|
| Mathematical structures underlying greedy algorithms |
|
| More sets, graphs, and numbers : a salute to Vera Sós and András Hajnal |
|
| n78058545 |
|
| On some combinatorial properties of algebraic matroids |
|
| On the graph of large distances |
|
| On the number of complete subgraphs of a graph II |
|
| Paul Erdős and his mathematics |
|
| Polyhedral results for antimatroids |
|
| Polymatroid matching and some applications |
|
| Relaxations of vertex packing |
|
| Restricted permutations and stirling numbers |
|
| Shelling structures, convexity and a happy end |
|
| Some algorithmic problems on lattices |
|
| Some finite basis theorems on graph theory |
|
| A számok új világa |
|
| グラフの不変数 |
|
| グラフの構造 |
|
| 集合論的グラフ理論 |
|
| 入門組合せ論 |
|
| 数え上げの手法 |
|
| 組合せ論演習 |
|
