Examples: Prince; Princeton University; Ken Follett; Follett,Ken
1shortlisttitle datasearch history  
results search [or] (ISNI Number (ISN:)) 0000000121037003 | 1 hits
Person
ISNI: 
0000 0001 2103 7003
Name: 
Lovász
Lovász, L.
Lovász, László
ロバース, ラスロウ
Dates: 
1948-
Creation class: 
cre
Language material
Text
txt
Creation role: 
author
contributor
editor
redactor
Related names: 
Bolyai János Matematikai Társulat
Eötvös Loránd Tudományegyetem Affiliation (see also from)
Grötschel, Martin (1948-)
Györi, Ervin (1954- ))
Hajnal, A.
Hajnal, András
Korte, Bernhard (1938-)
Pelikán, József
Plummer, M. D.
Schrijver, Alexander (1948-)
Sos, V. T.
Sós, Vera T.
University of Waterloo. Faculty of Mathematics
Vesztergombi, Katalin
Vsztergombi, K.
Vsztergombi, Katalin
根上, 生也 (1957-)
Titles: 
Algebraic methods in graph theory
Algorithmic aspects of some notions in classical mathematics
Algorithmic mathematics: an old aspect with a new emphasis
algorithmic theory of numbers graphs and convexity, An
Algoritmusok bonyolultsága
Basis graphs of greedoids and two-connectivity
Brick decompositions and the matching rank of graphs
Building bridges between mathematics and computer science
chromatic number of the graph of large distances, The
Combinatorial optimization : papers from the DIMACS Special Year
Combinatorial problems ... 1978:
Combinatorial problems and exercices
Combinatorial problems and exercises.
Combinatorica an international journal of the János Bolyai Mathematical Society
Combinatorics
Communication complexity a survey
complexity of communication, The
Cones of matrices and setfunctions, and 0-1 optimization
Covering minima and lattice point free convex bodies
Cycles through given vertices of a graph
Cycles through specified vertices of a graph
Discrete mathematics elementary and beyond
Diskrete Mathematik
Diszkrét matematika
Efficient algorithms: an approach by formal logic
ellipsoid method and its consequences in combinatorial optimization, The
Erdös centennial : Lászlo Lovász, Imre Z. Ruzsa, Vera T. Sós, eds.
Examples and algorithmic properties of greedoids
Factoring polynomials with rational coefficients
Fete of combinatorics and computer science
Finite and infinite sets
Geedoids
Geometric algorithms and combinatorial optimization
Graph theory and combinatorial biology
Greedoids - a structural framework for the greedy algorithm
Greedoids and linear objective functions
Handbook of combinatorics
Homomorphisms and Ramsey properties of antimatroids
Homotopy properties of greedoids
Horizons of combinatorics
intersection of matroids and antimatroids, The
Kombinatorik
Kombinatorika az általános és a középiskolai matematika szakkörök számára
Kombinatórika az általános és a középiskolai matematikai szakkörök számára
Kombinatorikai problémák és feladatok
Kumiawaseron enshū.
Large networks and graph limits
Matching theory
Matematikusok és teremtett világuk beszélgetések
mathematical notion of complexity, The
Mathematical structures underlying greedy algorithms
matroid matching problem, The
Matroid theory
More sets, graphs and numbers : a salute to Vera Sós and András Hajnal
note on selectors and greedoids, A
Nyūmon kumiawase ron
Nyūmon kumiawaseron
On some combinatorial properties of algebraic matroids
On submodularity in greedoids and a counterexample
On the graph of large distances
On the number of complete subgraphs of a graph II
Polyhedral results for antimatroids
Polymatroid greedoids
Polymatroid matching and some applications
Posets, matroids and greedoids
Relation between subclasses of greedoids
Relaxations of vertex packing
Research trends in combinatorial optimization
Restricted permutations and stirling numbers
Sets, graphs and numbers : a birthday salute to Vera T. Sós and András Hajnal
Shelling structures, convexity and a happy end
Some algorithmic problems on lattices
Some finite basis theorems on graph theory
Structural properties of greedoids
számok új világa, A
Theory of algorithms
入門組合せ論
組合せ論演習.
Notes: 
Sources: 
VIAF BNC BNF DNB LAC LC LNB NDL NKC NSK NSZL NTA NUKAT SUDOC WKP
TEL