Author:
Boros Endre,Gurvich Vladimir
Funder
National Science Foundation
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference30 articles.
1. D. Andrade, E. Boros, V. Gurvich, On Graphs Whose Maximal Cliques and Stable Sets Intersect, Rutcor Research Report, RRR-17-2006.
2. Not complementary connected and not CIS d-graphs form weakly monotone families;Andrade;Discrete Math.,2010
3. Listing closed sets of strongly accessible set systems with applications to data mining;Boley;Theoret. Comput. Sci.,2010
4. On effectivity functions of game forms;Boros;Games Econom. Behav.,2010
5. Vertex- and edge-minimal and locally minimal graphs;Boros;Discrete Math.,2009