7.5k citations
- X. He2 profiles46 · h 52
- M. Csanád2 profiles36 · h 76
- T. Csörgő2 profiles33 · h 42
- B. Cole2 profiles29 · h 52
- R. Lacey4 profiles29 · h 65
- S. Sato8 profiles29 · h 51
- V. Pantuev2 profiles29 · h 54
- A. Malakhov8 profiles28 · h 115
- A. Ster5 profiles28 · h 42
- D. d’Enterria2 profiles28 · h 127
- J. Alexander5 profiles28 · h 100
- M. Issah3 profiles28 · h 63
- Hungarian Academy of SciencesHU88 papers
- Institute for Particle and Nuclear PhysicsHU48 papers
- Columbia UniversityUS45 papers
- Centre National de la Recherche ScientifiqueFR39 papers
- Konkoly ObservatoryHU37 papers
- Stony Brook UniversityUS35 papers
- Brookhaven National LaboratoryUS33 papers
- Joint Institute for Nuclear ResearchRU31 papers
- CEA Paris-SaclayFR30 papers
- Charles UniversityCZ30 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR30 papers
- Iowa State UniversityUS30 papers
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011★ 1 cited
Lower bounds on the obstacle number of graphs
Padmini Mukkamala, János Pach, Dömötör Pálvölgyi
Given a graph , an {\em obstacle representation} of is a set of points in the plane representing the vertices of , together with a set of connected obstacles such that tw…
math.CO2011
Characterizing partition functions of the vertex model
Jan Draisma, Dion Gijswijt, László Lovász +2
We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of de la Harpe and Jones). We…