The following pages link to Maria J. Serna (Q1391311):
Displaying 50 items.
- (Q190502) (redirect page) (← links)
- (Q241761) (redirect page) (← links)
- On the complexity of exchanging (Q264207) (← links)
- Celebrity games (Q313966) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- On the stability of generalized second price auctions with budgets (Q315522) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
- Network formation for asymmetric players and bilateral contracting (Q503452) (← links)
- The complexity of measuring power in generalized opinion leader decision models (Q510582) (← links)
- Dimension and codimension of simple games (Q510973) (← links)
- The complexity of game isomorphism (Q650900) (← links)
- The robustness of stability under link and node failures (Q650924) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- The chromatic and clique numbers of random scaled sector graphs (Q817771) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- High level communication functionalities for wireless sensor networks (Q952445) (← links)
- The distant-2 chromatic number of random proximity and random geometric graphs (Q963353) (← links)
- Communication tree problems (Q995575) (← links)
- Vertex fusion under distance constraints (Q1039434) (← links)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures (Q1679522) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- Satisfaction and power in unanimous majority influence decision models (Q1792097) (← links)
- An efficient deterministic parallel algorithm for two processors precedence constraint scheduling (Q1870558) (← links)
- Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Continuous monitoring in the dynamic sensor field model (Q1929224) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Web apps and imprecise probabilitites (Q2107319) (← links)
- The neighborhood role in the linear threshold rank on social networks (Q2161944) (← links)
- Measuring investment opportunities under uncertainty (Q2297802) (← links)
- Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
- Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)
- An angel-daemon approach to assess the uncertainty in the power of a collectivity to act (Q2401883) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Cooperation through social influence (Q2630248) (← links)
- On weights and quotas for weighted majority voting games (Q2669142) (← links)
- Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs (Q2711615) (← links)
- Approximating Layout Problems on Random Geometric Graphs (Q2731603) (← links)
- Absorption time of the Moran process (Q2818278) (← links)
- On the Complexity of Metric Dimension (Q2912859) (← links)
- (Q2969651) (← links)
- Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty (Q3011982) (← links)
- Paradigms for Fast Parallel Approximability (Q3184627) (← links)
