Name
Papers
Collaborators
RON HOLZMAN
48
44
Citations 
PageRank 
Referers 
287
43.78
407
Referees 
References 
215
169
Search Limit
100407
Title
Citations
PageRank
Year
On convex holes in d-dimensional point sets.00.342022
RAINBOW ODD CYCLES00.342021
Rainbow triangles and the Caccetta‐Häggkvist conjecture00.342019
Simultaneous Linear Discrepancy for Unions of Intervals00.342019
Rainbow Fractional Matchings.00.342019
On 2-colored graphs and partitions of boxes.00.342018
Representations of Political Power Structures by Strategically Stable Game Forms: A Survey.10.412017
Edge-Covers in d-Interval Hypergraphs00.342017
Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier.00.342017
Cooperative Colorings and Independent Systems of Representatives00.342015
Strong equilibrium in network congestion games: increasing versus decreasing costs.70.652015
Matching of like rank and the size of the core in the marriage problem50.612014
On the Independence Numbers of the Cubes of Odd Cycles.20.482013
Aggregation of binary evaluations with abstentions221.662010
Aggregation of non-binary evaluations224.242010
Aggregation of binary evaluations120.722010
Sharing the Cost of a Capacity Network110.662010
Maximum Independent Sets in Certain Powers of Odd Cycles10.362009
Aggregation of binary evaluations for truth-functional agendas91.112009
Projecting difference sets on the positive orthant00.342008
Independence---domination duality00.342008
Bargaining Sets of Majority Voting Games10.412007
Bundling Equilibrium in Combinatorial auctions476.942004
Linear Versus Hereditary Discrepancy.20.462004
Characterization of ex post equilibrium in the VCG combinatorial auctions133.502004
Network structure and strong equilibrium in route selection games261.682003
The core and the bargaining set in glove-market games.30.602003
On a list coloring conjecture of Reed70.662002
Fractional Planks00.342002
On partitions of discrete boxes70.892002
The comparability of the classicial and the Mas-Colell bargaining sets71.002001
Six Lonely Runners70.862001
The majority action on infinite graphs: strings and puppets70.562000
Fractional kernals in digraphs131.311998
Load Balancing in Quorum Systems192.171997
On a Theorem of Lovász on Covers in tau-Partite Hypergraphs30.701996
On k-saturated graphs with restrictions on the degrees10.371996
Cancellative pairs of families of sets.70.811995
Load Balancing in Quorum Systems (Extended Abstract)30.571995
Packing lines in a hypercube70.821993
How to Guess Two Letters Correctly.00.341992
How to guess two letters correctly00.341992
Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality00.341992
Sign vectors and unit vectors00.341992
An Axiomatic Approach to Location on Networks91.501990
Representations of families of triples over GF(2)20.511990
To vote or not to vote: what is the quota?20.511989
Some Bounds for the Banzhaf Index and Other Semivalues20.661988